Interpolation and Approximation of Functions
Dragan Obradović, Lakshmi Narayan Mishra, Vishnu Narayan Mishra
Abstract
Dragan Obradović, Lakshmi Narayan Mishra, Vishnu Narayan Mishra
Abstract
Interpolation describes the problem of finding a curve that passes through a given set of real values at real data points, which are sometimes called abscissae or nodes. The theory of interpolation is important as a basis for numerical integration known also as quadrature. Approximation theory on the other hand seeks an approximation such that an error norm is minimized. The Newton interpolation formula has several advantages over the Lagrange formula. The degree of an interpolating polynomial can be increased by adding more points and more terms. The accuracy of an interpolation polynomial depends on how far the point of interest is from the middle of the interpolation points used. The Newton form of the interpolating polynomial can be viewed as one of a class of methods for generating successively higher order interpolation polynomials. The problem with polynomial interpolation is that with increasing degree the polynomial ‘wiggles’ from data point to data point.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Interpolation describes the problem of finding a curve that passes through a given set of real values at real data points, which are sometimes called abscissae or nodes. The theory of interpolation is important as a basis for numerical integration known also as quadrature. Approximation theory on the other hand seeks an approximation such that an error norm is minimized. The Newton interpolation formula has several advantages over the Lagrange formula. The degree of an interpolating polynomial can be increased by adding more points and more terms. The accuracy of an interpolation polynomial depends on how far the point of interest is from the middle of the interpolation points used. The Newton form of the interpolating polynomial can be viewed as one of a class of methods for generating successively higher order interpolation polynomials. The problem with polynomial interpolation is that with increasing degree the polynomial ‘wiggles’ from data point to data point.
Key concepts: Polynomial interpolation, Interpolation (computer graphics), Mathematics, Birkhoff interpolation, Trigonometric interpolation, Spline interpolation, Lagrange polynomial, Bilinear interpolation