Extended interpolation process

From Encyclopedia of Mathematics
Revision as of 17:05, 7 February 2011 by (talk) (Importing text file)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

An interpolation process constructed from a given interpolation process by imposing additional interpolation conditions.

The method of additional nodes.

The method of additional nodes was introduced by J. Szabados in [a4] to approximate the derivatives of a function by means of the derivative of the Lagrange interpolating polynomial (cf. also Lagrange interpolation formula). For given interpolation nodes , the method consists in considering the interpolation process with respect to the nodes

where , are equidistant nodes between and , respectively between and .

For being the zeros of the Jacobi polynomial (cf. Jacobi polynomials) , , the Lebesgue constants of the Lagrange interpolating polynomials have the behaviour

where . Therefore, only if will have the optimal behaviour . Denoting by the Lebesgue constant of the extended interpolation process, one has


This technique has been extended to more general contexts and has led to the construction of many classes of optimal interpolation processes (see [a1], [a3] and the literature cited therein). These results have given important contributions to numerical quadrature and to collocation methods in the numerical solution of functional equations.

Error estimation.

An efficient method for the practical estimation of the error of an interpolation process with respect to given nodes consists in imposing interpolation conditions at suitable additional nodes . In particular, a natural choice are and nodes which interlace,

Let be the zeros of the orthogonal polynomials with respect to some weight function . The zeros of the orthogonal polynomials with respect to the same weight function have the interlacing property; orthogonal polynomials with respect to other weight functions have also been considered. For necessary and sufficient conditions for the convergence of the extended interpolation process, cf. [a2] and the literature cited therein. The zeros of the associated Stieltjes polynomials lead to the Lagrange–Kronrod formulas, and they maximize the algebraic degree of the corresponding interpolatory quadrature formulas; the latter are the Gauss–Kronrod quadrature formula. For the zeros of the Stieltjes polynomials, the interlacing property does not hold for general , but it is known for several important weight functions including the Legendre weight (see Stieltjes polynomials). Error estimation by extended interpolation is an important tool for the numerical approximation of linear functionals.


[a1] G. Mastroianni, "Uniform convergence of derivatives of Lagrange interpolation" J. Comput. Appl. Math. , 43 : 2 (1992) pp. 37–51
[a2] G. Mastroianni, "Approximation of functions by extended Lagrange interpolation" R.V.M. Zahar (ed.) , Approximation and Computation , Birkhäuser (1995) pp. 409–420
[a3] P.O. Runck, P. Vértesi, "Some good point systems for derivatives of Lagrange interpolatory operators" Acta Math. Hung. , 56 (1990) pp. 337–342
[a4] J. Szabados, "On the convergence of the derivatives of projection operators" Analysis , 7 (1987) pp. 341–357
How to Cite This Entry:
Extended interpolation process. Encyclopedia of Mathematics. URL:
This article was adapted from an original article by Sven EhrichG. Mastroianni (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article