Polynomial meshes on algebraic sets

2025/01/18 by Leokadia Białas-Cież, Bialas-Ciez, Leokadia, Agnieszka Kowalska +3
Computer Science · Engineering · Mathematics · #Advanced Differential Equations and Dynamical Systems #Advanced Numerical Analysis Techniques #Complex Variables (math.CV) #Computational Geometry and Mesh Generation #FOS: Mathematics #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.2501.10873

openalex publication_date 2025/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on compact subsets of arbitrary algebraic hypersurfaces in C^N+1. They are preimages by a projection of meshes on compacts in C^N. The meshes constructed in this way are optimal in some cases. Our method can be useful also for certain algebraic sets of codimension greater than one. To illustrate applications of the obtained theorems, we first give a few examples and finally report some numerical results. In particular, we present numerical tests (implemented in Matlab), concerning the use of such optimal polynomial meshes for interpolation and least-squares approximation, as well as for the evaluation of the corresponding Lebesgue constants.

Related

• Generalized local polynomial reproductions
• CPOLYMESH: Matlab and Python codes for complex polynomial approximation by Chebyshev admissible meshes
• Optimal Polynomial Admissible Meshes on Some Classes of Compact Subsets of \R^d
• Chebyshev admissible meshes and Lebesgue constants of complex polynomial projections
• Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex and ball