Mixed interpolation methods with arbitrary nodes
โ Scribed by John P. Coleman
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 693 KB
- Volume
- 92
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
โฆ Synopsis
Previous work on interpolation by linear combinations of the form aC(x)+ bS(x)+ ~-~=~ ~ix i, where C and S are given functions and the coefficients a, b, and {c~i} are determined by the interpolation conditions, was restricted to uniformly spaced interpolation nodes. Here we derive both Newtonian and Lagrangian formulae for the interpolant for arbitrarily chosen distinct nodes. In the Newtonian form the interpolating function is expressed as the sum of the interpolating polynomial based on the given nodes and two correction terms involving an auxiliary function for which a recurrence relation is obtained. Each canonical function for the Lagrangian form may be expressed as a product of the corresponding Lagrange polynomial and a function which depends on divided differences of C(x) and S(x).
๐ SIMILAR VOLUMES
This paper gives powerful necessary conditions for convergence of Lagrange interpolation on an arbitrary system of nodes in L p (d:) with d: belonging to the Szego 's class. This provides a partial answer to Problem XI of P. Tura n [J. Approx. Theory 29 (1980), 33 34]. It is shown that in this case