2007Journal of Shandong Jianzhu UniversityRequires access

Polynomial interpolation approximations of arbitrary continuous functions

Tang Bing-tao

Open publisher page 3 citations

Abstract

The polynomial interpolations,owing to its simplicity in computation, have wide applications in numerical approximation and engineering.However,when the number of interpolating nodes is large,the Lagrange interpolation is numerically unstable.The barycentric lagrange interpolation,using the second kind of Chebyshev points as interpolating nodes,has excellent numerical stability.The paper aims at giving a function f(x) in the interval and finding a polynomial function so that the error ‖f(x)-pn(x)‖∞ approaches to accuracy of machine.In this paper,the interpolating polynomial is numerical computation in the second kind of Chebyshev points by using barycentric Lagrange interpolation.The order of polynomial is obtained by determining the number of interpolating nodes according to the require accuracy.The computer program in MATLAB and some numerical examples are given to demonstrate the effectiveness of the proposed method.

About this research paper

What this paper is about

The polynomial interpolations,owing to its simplicity in computation, have wide applications in numerical approximation and engineering.However,when the number of interpolating nodes is large,the Lagrange interpolation is numerically unstable.The barycentric lagrange interpolation,using the second kind of Chebyshev points as interpolating nodes,has excellent numerical stability.The paper aims at giving a function f(x) in the interval and finding a polynomial function so that the error ‖f(x)-pn(x)‖∞ approaches to accuracy of machine.In this paper,the interpolating polynomial is numerical computation in the second kind of Chebyshev points by using barycentric Lagrange interpolation.The order of polynomial is obtained by determining the number of interpolating nodes according to the require accuracy.The computer program in MATLAB and some numerical examples are given to demonstrate the effectiveness of the proposed method.

Why it matters

OpenAlex reports 3 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

The polynomial interpolations,owing to its simplicity in computation, have wide applications in numerical approximation and engineering.However,when the number of interpolating nodes is large,the Lagrange interpolation is numerically unstable.The barycentric lagrange interpolation,using the second kind of Chebyshev points as interpolating nodes,has excellent numerical stability.The paper aims at giving a function f(x) in the interval and finding a polynomial function so that the error ‖f(x)-pn(x)‖∞ approaches to accuracy of machine.In this paper,the interpolating polynomial is numerical computation in the second kind of Chebyshev points by using barycentric Lagrange interpolation.The order of polynomial is obtained by determining the number of interpolating nodes according to the require accuracy.The computer program in MATLAB and some numerical examples are given to demonstrate the effectiveness of the proposed method.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Polynomial interpolation approximations of arbitrary continuous functions — Research Paper | ScholarLens