Abstract
The computational complexity of several algorithms for polynomial interpolation is quantitatively evaluated. There are four well-known algorithms for obtaining the interpolation polynomial. The first algorithm is to solve simultaneous equations for coefficients of the polynomial (the most basic one). The second is Lagrange's interpolation algorithm (the classical one used widely). The third is Lagrange's algorithm in the barycentric form. The fourth is Newton's interpolation algorithm (using divided differences). Using Newton's interpolation in the method, one can make the Remez exchange method faster, which is useful for the design of linear-phase Chebyshev FIR (finite impulse response) digital filters. >
Sign-in/Register to access full text options 
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.
