Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex and ball

2023/11/30 by Bialas-Ciez, L., Kenne, D. J., Sommariva, A. +1 · 1 citation
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2311.18656

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.

Cited by

• ORTHOCUB: integral and differential cubature rules by orthogonal moments

Related

• Chebyshev admissible meshes and Lebesgue constants of complex polynomial projections
• Lebesgue constants for polyhedral sets and polynomial interpolation on\n Lissajous-Chebyshev nodes
• CPOLYMESH: Matlab and Python codes for complex polynomial approximation by Chebyshev admissible meshes
• Optimal Lebesgue constants for least squares polynomial approximation on the (hyper)sphere
• Optimal Point Sets for Total Degree Polynomial Interpolation in Moderate\n Dimensions