DSpace Repository

The Convergence of Polynomial Interpolation and Runge Phenomenon

Show simple item record

dc.contributor.author Souad Abumaryam
dc.date.accessioned 2024-12-01T18:15:38Z
dc.date.available 2024-12-01T18:15:38Z
dc.date.issued 2018-01-01
dc.identifier.issn 2518-5454
dc.identifier.uri http://dspace-su.server.ly:8080/xmlui/handle/123456789/1870
dc.description.abstract One of the main questions is whether or not a sequence of polynomials pn(x) that interpolate a continuous function f at n + 1 equally spaced points tends to f in the sup-norm? The answer is "no" in some cases. The main fact is that interpolant polynomials pn(x) of a function f converge at a rate determined by the smoothness of f: the pn(x) converge rapidly to the function f if it is k-times differentiable and converges exponentially if f is analytic. The polynomial interpolation depends on n but it also depends on the way in which the points are distributed. We determine conditions on the function f to ensure the convergence of the polynomials pn(x) to the function f, as the continuity of the function is not enough. The question for analytic functions is answered using potential theory. Convergence and divergence rate of interpolants of analytic functions on the interval are investigated. We also study a generalized Runge phenomenon and find out how the location of the points and poles affect the convergence. en_US
dc.language.iso other en_US
dc.publisher جامعة سرت - Sirte University en_US
dc.relation.ispartofseries المجلد الثامن - العدد الاول - يونيو 2018;77-100
dc.subject Polynomial interpolation en_US
dc.subject Lagrange polynomial en_US
dc.subject Chebyshev polynomial en_US
dc.subject Chebyshev points en_US
dc.title The Convergence of Polynomial Interpolation and Runge Phenomenon en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account