Optimal Lagrange Interpolation Projectors and Legendre Polynomials

Abstract

Let $K$ be a convex body in ${\mathbb{R}}^n$, and let ${\Pi }_1({\mathbb{R}}^n)$ be the space of polynomials in $n$ variables of degree at most $1$. Given an $(n+1)$-element set $Y\subset K$ in general position, we let $P_Y$ denote the Lagrange interpolation projector $P_Y:C(K)\to {\Pi }_1({\mathbb{R}}^n)$ with nodes in $Y$. In this paper, we study upper and lower bounds for the norm of the optimal Lagrange interpolation projector, i.e., the projector with minimal operator norm where the minimum is taken over all $(n+1)$-element sets of interpolation nodes in $K$. We denote this minimal norm by ${\theta }_n(K)$. Our main result, Theorem 5.2, provides an explicit lower bound for the constant ${\theta }_n(K)$ for an arbitrary convex body $K\subset {\mathbb{R}}^n$ and an arbitrary $n\ge 1$. We prove that ${\theta }_n(K)\ge {\chi }_n^{-1}\left(\mathrm{vol}(K)/\mathrm{simp}(K)\right)$ where ${\chi }_n$ is the Legendre polynomial of degree $n$ and $\mathrm{simp}(K)$ is the maximum volume of a simplex contained in $K$. The proof of this result relies on a geometric characterization of the Legendre polynomials in terms of the volumes of certain convex polyhedra. More specifically, we show that for every $\gamma \ge 1$ the volume of the set $\left\{x=(x_1,...,x_n)\in {\mathbb{R}}^n:\sum |x_j|+\left|1-\sum x_j\right|\le \gamma \right\}$ is equal to ${\chi }_n(\gamma )/n!$. If $K$ is an $n$-dimensional ball, this approach leads us to the equivalence ${\theta }_n(K)\asymp \sqrt{n}$ which is complemented by the exact formula for ${\theta }_n(K)$. If $K$ is an $n$-dimensional cube, we obtain explicit efficient formulae for upper and lower bounds of the constant ${\theta }_n(K)$; moreover, for small $n$, these estimates enable us to compute the exact values of this constant.

arXiv comment26 pages, 1 figure. arXiv admin note: substantial text overlap with arXiv:2402.11611

References in corpus (9)

• Interpolation by Linear Functions on an $n$-Dimensional Ball
• Five-dimensional Perfect Simplices
• Optimal Point Sets for Total Degree Polynomial Interpolation in Moderate Dimensions
• On Some Problems Related to a Simplex and a Ball
• Geometric Estimates in Interpolation by Linear Functions on a Euclidean Ball
• On Properties of a Regular Simplex Inscribed into a Ball
• On applying the maximum volume principle to a basis selection problem in multivariate polynomial interpolation
• The Minimum Norm of a Projector under Linear Interpolation on a Euclidean Ball
• Geometric Estimates in Linear Interpolation on a Cube and a Ball