CPOLYMESH: Matlab and Python codes for complex polynomial approximation by Chebyshev admissible meshes

2025/07/16 by Kenne, Dimitri Jordan, Sommariva, Alvise, Vianello, Marco
#65E05) #Approximate Fekete Points #Discrete Leja Points #Lebesgue constant. (MSC2020: 65D05 #Pseudo Leja Points #admissible polynomial meshes #complex polynomial approximation #discrete extremal sets #interpolation #least-squares

paper · doi:10.13135/3103-1935/10829

Abstract

We provide Matlab and Python codes for polynomial approximation on complex compact sets with connected complement, by Chebyshev-like admissible polynomial meshes on boundaries with piecewise (trigonometric) polynomial parametrization. Such meshes have lower cardinality with respect to those previously known. They are used for polynomial least-squares, for the extraction of extremal interpolation sets of Fekete and Leja type, as well as for the computation of the uniform norms (Lebesgue constants) of polynomial projection operators.

Related

• Chebyshev admissible meshes and Lebesgue constants of complex polynomial projections
• Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex and ball
• Polynomial meshes on algebraic sets
• Optimal polynomial meshes and Caratheodory-Tchakaloff submeshes on the sphere
• Lebesgue constants for polyhedral sets and polynomial interpolation on\n Lissajous-Chebyshev nodes