Abstract
A famous unsolved problem in the theory of polynomial interpolation is that of explicitly determining a set of nodes which is optimal in the sense that it loads to minimal Lebesgue constants. A solution to this problem is presented for the first non‐trivial case of cubic interpolation. This example has proved to be very instructive in numerical analysis courses.
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 callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: 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.
