A generalized interpolation algorithm
HTML articles powered by AMS MathViewer
- by A. C. R. Newbery PDF
- Math. Comp. 25 (1971), 549-552 Request permission
Abstract:
An interpolation algorithm is derived, which will construct an $(n + 1)$-point interpolant based on any sequence of interpolatory functions that can be defined by a three-term linear recursion. By suitable parameter choice, a single algorithm can be made to interpolate in terms of the classical polynomial sequences or in terms of trigonometric or hyperbolic series etc. An analysis of truncation error is included.References
- A. C. R. Newbery, Interpolation by algebraic and trigonometric polynomials, Math. Comp. 20 (1966), 597–599. MR 203905, DOI 10.1090/S0025-5718-1966-0203905-8
- F. B. Hildebrand, Introduction to numerical analysis, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1956. MR 0075670 J. Hart et al., Computer Approximations, Wiley, New York, 1968.
Additional Information
- © Copyright 1971 American Mathematical Society
- Journal: Math. Comp. 25 (1971), 549-552
- MSC: Primary 65D05
- DOI: https://doi.org/10.1090/S0025-5718-1971-0312681-1
- MathSciNet review: 0312681