Approximation using Lagrange and Hermite Form of Polynomial Interpolation: An Experimental Study
Vandana Chouhan, Shashwati Ray
Abstract
Vandana Chouhan, Shashwati Ray
Abstract
Using interpolation complicated functions can be converted into simple polynomials which are computationally simple, save time and minimize error. In this paper an experimental study is performed to show the importance of nodal scheme on approximation using Lagrange and Hermite form of polynomial interpolation using three functions with different characteristics. Experimental results show that Hermite polynomials with Chebyshev nodes performs better for higher order polynomials as compared with equally spaced nodes as well as lagrange polynomials.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Using interpolation complicated functions can be converted into simple polynomials which are computationally simple, save time and minimize error. In this paper an experimental study is performed to show the importance of nodal scheme on approximation using Lagrange and Hermite form of polynomial interpolation using three functions with different characteristics. Experimental results show that Hermite polynomials with Chebyshev nodes performs better for higher order polynomials as compared with equally spaced nodes as well as lagrange polynomials.
Key concepts: Lagrange polynomial, Hermite interpolation, Polynomial interpolation, Interpolation (computer graphics), Mathematics, Cubic Hermite spline, Chebyshev polynomials, Hermite polynomials