## On Optimal Polynomial Meshes

- Nov. 17, 2011
- 3:30 p.m.
- LeConte 312

## Abstract

Let $P^d _ n$ be the space of real algebraic polynomials of $d$ variables and degree at most $n$, $K\subset \mathbb R^{d}$ a compact set, $||p|| _ K:=\sup _ {\textbf{x}\in K}|p(\textbf{x})|$ the usual supremum norm on $K, card(Y)$ the cardinality of a finite set $Y$. A family of sets $\textbf{Y}=\{Y _ n\subset K, n\in \mathbb N\}$ is called an \textbf{\emph{admissible mesh }} in $K$ if there exists a constant $c _ 1>0$ depending only on $K$ such that $$||p|| _ K\leq c _ 1||p|| _ {Y _ n},\;\; p\in P^d _ n, n\in \mathbb N, $$ where the cardinality of $Y _ n$ grows at most polynomially. If $card(Y _ n)\leq c _ 2n^d, n\in \mathbb N$ with some $c _ 2>0$ depending only on $K$ then we say that the admissible mesh is \textbf{optimal}. This notion of admissible meshes is related to \textbf{norming sets} which are widely used in the literature. In this talk we shall present some general families of sets possessing admissible meshes which are optimal or near optimal in the sense that the cardinality of sets $Y _ n$ does not grow too fast. In particular, we shall see that graph domains bounded by polynomial graphs, convex polytopes and star like sets with $C^2$ boundary possess optimal admissible meshes. In addition, graph domains with piecewise analytic boundary and any convex sets in $\mathbb R^{2}$ possess \emph{almost} optimal admissible meshes in the sense that the cardinality of admissible meshes is larger than optimal only by a $\log n$ factor.