1972The Computer JournalRequires access

Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages

H. E. Salzer

Open publisher page 122 citations

Abstract

Besides many applications of the Chebyshev points xnν ≡ cos(νπ/n),ν = 0(1)n, in approximation, interpolation by Chebyshev series, numerical integration and numerical differentiation, there are advantages in their use in the barycentric form of the Lagrange interpolation formula and in checking by divided differences. When n = 2m, we obtain X2m,ν with less than half the number of square roots that are required to find the other Chebyshev points X′2m,ν ≡ cos[(2ν – 1) π/2m+1], ν = 1(1)2m. Also, the barycentric interpolation formula may be applied to the solution of a near-minimax problem so as to avoid extensive calculation of auxiliary polynomials, and in a numerical differentiation procedure that conveniently by-passes direct differentiation of the interpolation polynomial.

About this research paper

What this paper is about

Besides many applications of the Chebyshev points xnν ≡ cos(νπ/n),ν = 0(1)n, in approximation, interpolation by Chebyshev series, numerical integration and numerical differentiation, there are advantages in their use in the barycentric form of the Lagrange interpolation formula and in checking by divided differences. When n = 2m, we obtain X2m,ν with less than half the number of square roots that are required to find the other Chebyshev points X′2m,ν ≡ cos[(2ν – 1) π/2m+1], ν = 1(1)2m. Also, the barycentric interpolation formula may be applied to the solution of a near-minimax problem so as to avoid extensive calculation of auxiliary polynomials, and in a numerical differentiation procedure that conveniently by-passes direct differentiation of the interpolation polynomial.

Why it matters

OpenAlex reports 122 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Besides many applications of the Chebyshev points xnν ≡ cos(νπ/n),ν = 0(1)n, in approximation, interpolation by Chebyshev series, numerical integration and numerical differentiation, there are advantages in their use in the barycentric form of the Lagrange interpolation formula and in checking by divided differences. When n = 2m, we obtain X2m,ν with less than half the number of square roots that are required to find the other Chebyshev points X′2m,ν ≡ cos[(2ν – 1) π/2m+1], ν = 1(1)2m. Also, the barycentric interpolation formula may be applied to the solution of a near-minimax problem so as to avoid extensive calculation of auxiliary polynomials, and in a numerical differentiation procedure that conveniently by-passes direct differentiation of the interpolation polynomial.

Key concepts: Barycentric coordinate system, Lagrange polynomial, Interpolation (computer graphics), Mathematics, Chebyshev nodes, Polynomial interpolation, Chebyshev polynomials, Chebyshev filter

Related papers

Back to paper searchBrowse research topicsOriginal source
Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages — Research Paper | ScholarLens