On the role of weak Marcinkiewicz-Zygmund constants in polynomial approximation by orthogonal bases
Congpei An, Alvise Sommariva, Marco Vianello
TL;DR
This work analyzes the weak Marcinkiewicz-Zygmund constants for multivariate cubature rules and their influence on polynomial approximation via orthogonal bases. It characterizes $A$ and $B$ as the extremal eigenvalues of the Gram matrix $G=(S(\phi_i\phi_j))$ and uses $\eta=\max\{|1-A|,|1-B|\}$ to assess stability, also proving a negative result for Gaussian rules when $n$ crosses $\lfloor m/2\rfloor$. Through extensive numerical experiments on the interval, square, disk, triangle, and sphere, the authors compare hyperinterpolation, unfettered hyperinterpolation, and least-squares projections across a variety of rules (Gauss-Legendre, Clenshaw-Curtis, Padua, spherical designs, QMC Halton), identifying regimes where $\eta<1$ and conditioning remains tractable. The study highlights practical rule choices (e.g., Clenshaw-Curtis, Padua, certain spherical designs, sufficiently large QMC folds) that enable stable, accurate polynomial approximation with weak MZ constants, and provides open-source Matlab tools to reproduce and extend the results.
Abstract
We compute numerically the $L^2$ Marcinkiewicz-Zygmund constants of cubature rules, with a special attention to their role in polynomial approximation by orthogonal bases. We test some relevant rules on domains such as the interval, the square, the disk, the triangle, the cube and the sphere. The approximation power of the corresponding least squares (LS) projection is compared with standard hyperinterpolation and its recently proposed ``exactness-relaxed'' version. The Matlab codes used for these tests are available in open-source form.
