Abstract

The main results of this paper are the analysis of the quality of approximation of polynomial interpolation and the computation of the approximate optimal interpolation points in the triangle. We introduce various norms for the interpolation operator. Computational results indicate that for a given polynomial degree, the set that minimizes the mean L 2 norm of the interpolation operator is close to the smallest Lebesgue constant interpolation set. In particular, for the triangle, this set gives the smallest Lebesgue constant currently known.

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 call

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.