Solution

ID: past-exam-of-the-numerical-linear-algebra-and-approximation-course-of-the-university-of-oxford/2008/3/b/solution

Map to by . Since , the normalization point lies outside that interval. The proposed Chebyshev polynomial ratio has degree and equals one at zero. On the spectral interval its maximum absolute value is
The Chebyshev minimax polynomial with exterior normalization minimizes this maximum among degree-at-most- polynomials with . One may quote the minimax property. Its reason is the alternating extremal values: a strictly better competitor would force their difference to have at least roots in and the additional root at zero outside it, impossible for degree at most .
The paper uses a monic normalization of for , rather than the usual convention. The common factor cancels in the ratio. With and , the hyperbolic-cosine formula gives the error factor . This tends rapidly to zero when the spectral interval is well-conditioned. If , use for exact one-step termination instead of the displayed interval map.

New to topics? Read the docs here!