Affiliation:
1. Univ. of Western Ontario, London, Canada
Abstract
Under stated favorable conditions, the Lagrange formula for polynomial interpolation is computationally
exact
at the nodes. This is applied to approximation with Lagrange-type interpolation.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. Uniform approximation with constraints;Chalmers B. L.;Jber. Deutsch Math.-Verein.,1978
2. The influence of machine design on numerical algorithms
3. On uniform approximation with interpolatory constraints
4. Remez algorithm for Chebyshev approximation with interpolation
5. Chebyshev approximation with weights large on nodes;Dunham C.;Stud. Sci. Math. Hung.,1983