Abstract
Questions on interpolation of functions with Lagrange polynomials are discussed. The Runge phenomenon is considered, when a sequence of Lagrange polynomials does not converge to an interpolated function uniformly. It is shown that the choice of roots of the Chebyshev polynomials as interpolation nodes provides more precise approximation than the interpolation by equidistant nodes. The Chebyshev polynomials are remarkable in sense that they admit least deviation from zero among all monic polynomials of the same degree. Сalculations and drawing graphs were performed using Maple program.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
