Newton interpolation in fejér and chebyshev points

Bernd Fischer*, Lothar Reichel

*Corresponding author for this work
20 Citations (Scopus)


Let Γ be a Jordan curve in the complex plane, and let Ω be the compact set bounded by Γ. Let f denote a function analytic on Ω. We consider the approximation of f on Ω by a polynomial p of degree less than n that interpolates f in n points on Γ. A convenient way to compute such a polynomial is provided by the Newton interpolation formula. This formula allows the addition of one interpolation point at a time until an interpolation polynomial p is obtained which approximates f sufficiently accurately. We choose the sets of interpolation points to be subsets of sets of Fejér points. The interpolation points are ordered using van der Corput's sequence, which ensures that p converges uniformly and maximally to f on Ω as n increases. We show that p is fairly insensitive to perturbations of f if Γ is smooth and is scaled to have capacity one. If Γ is an interval, then the Fejér points become Chebyshev points. This special case is also considered. A further application of the interpolation scheme is the computation of an analytic continuation of f in the exterior of Γ.

Original languageEnglish
JournalMathematics of Computation
Issue number187
Pages (from-to)265-278
Number of pages14
Publication statusPublished - 01.01.1989


Dive into the research topics of 'Newton interpolation in fejér and chebyshev points'. Together they form a unique fingerprint.

Cite this