Properties of the Lebesgue function for Lagrange interpolation on equidistant nodes are investigated. It is proved that the Lebesgue function can be formulated both in terms of a hypergeometric function 2F1 and Jacobi polynomials. Moreover an integral expression of the Lebesgue function is also obtained. Finally, the asymptotic behavior of the Lebesgue constant is studied.

Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable. It deserves to be known as the standard method of polynomial interpolation.

A trivariate Lagrange interpolation method based on C1 cubic splines is described. The splines are defined over a special refinement of the Freudenthal partition of a cube partition. The interpolating splines are uniquely determined by data values, but no derivatives are needed. The interpolation method is local and stable, provides optimal order approximation, and has linear complexity.

In many cases, multivariate interpolation by smooth radial basis functions converges towards polynomial interpolants, when the basis functions are scaled to become “wide”. In particular, examples show that interpolation by scaled Gaussians seems to converge towards the de Boor/Ron “least” polynomial interpolant. The paper starts by providing sufficient criteria for the convergence of radial int...

The Lebesgue constant is a valuable numerical instrument for linear interpolation because it provides a measure of how close the interpolant of a function is to the best polynomial approximant of the function. Moreover, if the interpolant is computed by using the Lagrange basis, then the Lebesgue constant also expresses the conditioning of the interpolation problem. In addition, many publicatio...

Exact reconstruction of a band-limited signal from its non-uniform samples involves the use of Lagrange interpolation, which is impractical to implement as it is computationally difficult. This thesis develops approximate reconstruction methods based on time-warping to obtain reconstruction of band-limited signals from non-uniform samples. A review of non-uniform sampling theorems is presented ...

properties of the hybrid of block-pulse functions and lagrange polynomials based on the legendre-gauss-type points are investigated and utilized to define the composite interpolation operator as an extension of the well-known legendre interpolation operator. the uniqueness and interpolating properties are discussed and the corresponding differentiation matrix is also introduced. the applicabili...

In this paper is presented a parallel algorithm for computing a Lagrange interpolation on a Extended Fibonacci Cube EFC 1(n).The algorithm consists of three phases: initialisation phase, main phase in wich the Lagrange polynomials are computed and final phase in wich the terms of the interpolation formula are added together.

We estimate the distribution function of a Lagrange interpolation polynomial and deduce mean boundedness in Lp; p < 1: 1 The Result There is a vast literature on mean convergence of Lagrange interpolation, see [4{ 8] for recent references. In this note, we use distribution functions to investigate mean convergence. We believe the simplicity of the approach merits attention. Recall that if g : R...