Mean Convergence Rate of Derivatives by Lagrange Interpolation on Chebyshev Grids | Zendy

Wang Xiulian | Zendy; Ning Jingrui | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Mean Convergence Rate of Derivatives by Lagrange Interpolation on Chebyshev Grids

Author(s) -

Wang Xiulian,

Ning Jingrui

Publication year - 2011

Publication title -

discrete dynamics in nature and society

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.264

H-Index - 39

eISSN - 1607-887X

pISSN - 1026-0226

DOI - 10.1155/2011/503561

Subject(s) - chebyshev nodes , chebyshev polynomials , lagrange polynomial , mathematics , interpolation (computer graphics) , chebyshev filter , rate of convergence , convergence (economics) , approximation error , chebyshev equation , equioscillation theorem , chebyshev iteration , approximation theory , mathematical analysis , orthogonal polynomials , classical orthogonal polynomials , gegenbauer polynomials , computer science , polynomial , animation , computer network , channel (broadcasting) , computer graphics (images) , economics , economic growth

We consider the rate of mean convergence of derivatives by Lagrange interpolation operators based on the Chebyshev nodes. Some estimates of error of the derivatives approximation in terms of the error of best approximation by polynomials are derived. Our results are sharp

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research