The Convergence Rates of Chebyshev Interpolation

Souad Abumaryam (1)
(1) Mathematics Department, School of Science, Sirte University, Sirte, Libya

Abstract

In this paper we will investigate the convergence of Chebyshev interpolation in terms of Chebyshev polynomials. In particular, if the function f (x) extends to an analytic function in a region bounded by an ellipse, then we may obtain an upper bound on the error of interpolation using zeros and extrema of Chebyshev polynomials.

Full text article

Generated from XML file

References

[1]-Berrut J., Trefethen L., Barycentric Lagrange Interpolation., SIAM Review, (2004).

[2]-Mason J., Handsscomb D., Chebyshev polynomials, CRC Press ,(2003).

[3]-Rivlin, T. J., The Chebyshev polynomials., A Wiley-Inter science, (1974).

[4]-Trefethen L., Approximation Theory and Approximation Practice., University of Oxford, (2012).

[5]-Trefethen L., Six myths of polynomial interpolation and quadrature, Maths. Today 47, (2011).

Authors

Souad Abumaryam
Abumaryam, S. (2018). The Convergence Rates of Chebyshev Interpolation. Journal of Pure & Applied Sciences , 17(1), 60-63. https://doi.org/10.51984/jopas.v17i1.65

Article Details

How to Cite

Abumaryam, S. (2018). The Convergence Rates of Chebyshev Interpolation. Journal of Pure & Applied Sciences , 17(1), 60-63. https://doi.org/10.51984/jopas.v17i1.65

Similar Articles

You may also start an advanced similarity search for this article.

No Related Submission Found