Reliable determination of interpolating polynomials

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1993 English Publisher:Springer Science and Business Media LLCJournal:Numerical Algorithms, volume 5, pages 133-154 (issn: 1017-1398, eissn: 1572-9265,

Copyright policy )

Authors: M. G. Cox;

doi: 10.1007/bf02215677

Reliable determination of interpolating polynomials

- Summary
- Subjects
- Metrics

Abstract

This paper solves an interpolation problem that is to determine a polynomial interpolant to specified data. The data can be taken as a set of points, at each of which a function value and any number of leading derivative values of the function are specified. An algorithm is described that delivers the required polynomial in Chebyshev form. The algorithm is stable in the sense of backward error.

Related Organizations

National Physical Laboratory
United Kingdom

Keywords

Numerical interpolation, polynomial interpolant, Chebyshev form, Interpolation in approximation theory, reliable algorithms

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average