Abstract
Classical problem of interpolation and approximation of functions with polynomials is considered here as a special case of spectral representation of functions. We developed this approach earlier for Legendre and Chebyshev orthogonal polynomials. Here we use Newton's fundamental polynomials as basis functions. We demonstrate that the spectral approach has computational advantages over the divided differences method. In a number of problems, Newton and Hermite interpolations are indistinguishable in our approach and computed by the same formulas. Also, computational algorithms that we constructed earlier with the use of orthogonal polynomials are adapted without modifications for use of Newton and Hermite polynomials.
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.
