Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex and ball
Abstract
We show that product Chebyshev polynomial meshes can be used, in a fully discrete way, to evaluate with rigorous error bounds the Lebesgue constant, i.e. the maximum of the Lebesgue function, for a class of polynomial projectors on cube, simplex and ball, including interpolation, hyperinterpolation and weighted least-squares. Several examples are presented and possible generalizations outlined. A numerical software package implementing the method is freely available online.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.