Reliable determination of interpolating polynomials

DOI10.1007/BF02215677zbMath0803.65006MaRDI QIDQ1315195

Maurice Cox

Publication date: 2 January 1995

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

reliable algorithmsChebyshev formpolynomial interpolant

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Related Items (1)

Compression of almost-periodic data.

Uses Software

• NAG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
• A practical guide to splines
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• Curve Fitting with a Digital Computer
• High Degree Polynomial Interpolation in Newton Form
• Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
• Newton Interpolation in Fejer and Chebyshev Points
• Recurrence Relations for Computing with Modified Divided Differences
• Practical, Reliable, Rational Interpolation
• An Algorithm for Spline Interpolation
• Stable Methods for Evaluating the Points cos(iπ/n)
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• Curve and Surface Fitting
• Interpolation by Algebraic and Trigonometric Polynomials
• Note on a comparison of evaluation schemes for the interpolating polynomial
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
• Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation
• Solution of Vandermonde systems of equations
• A recurrence scheme for converting from one orthogonal expansion into another
• Aitken-Hermite Interpolation

This page was built for publication: Reliable determination of interpolating polynomials