Abstract
The classical interpolation problem is considered of estimating a function of one variable, f(.), given a number of function values f(xi), i=1,2,...,m. If a bound on ‖f(k)(.)‖∞ is given also, k≤m, then bounds on f(ζ) can be found for any ζ. A method of calculating the closest bounds is described, which is shown to be relevant to the problem of finding the interpolation formula whose error is bounded by the smallest possible multiple of ‖f(k)(.)‖∞, when ‖f(k)(.)‖∞ is unknown. This formula is identified and is called the optimal interpolation formula. The corresponding interpolating function is a spline of degree (k-1) with (m-k) knots, so it is very suitable for practical computation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlberg, J.H., Nilson, E.N. and Walsh, J.L. (1967) “The theory of splines and their applications”, Academic Press, New York.
Gaffney, P.W. (1975) “Optimal Interpolation”, D. Phil thesis, University of Oxford.
Hildebrand, F.B. (1956) “Introduction to numerical analysis”, McGraw-Hill Inc., New York.
Karlin, S. and Studden, W.J. (1966) “Tchebycheff systems: with applications in analysis and statistics”, Interscience Publishers, New York.
Micchelli, C.A., Rivlin, T.J. and Winograd, S. (1975) “The optimal recovery of smooth functions”, manuscript. IBM Research Laboratories, Yorktown Heights.
Schoenberg, I.J. (1964) “On interpolation by spline functions and its minimal properties”, from “On Approximation Theory”, eds. P.L. Butzer and J. Korevaar, Birkhaüser Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Gaffney, P.W., Powell, M.J.D. (1976). Optimal interpolation. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0080117
Download citation
DOI: https://doi.org/10.1007/BFb0080117
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07610-0
Online ISBN: 978-3-540-38129-7
eBook Packages: Springer Book Archive