Optimal sampling and Christoffel functions on general domains

DOI10.1007/S00365-021-09558-XarXiv2010.11040MaRDI QIDQ6351885

Matthieu Dolbeault, Albert Cohen

Publication date: 21 October 2020

Abstract: We consider the problem of reconstructing an unknown function $uin{L}^2(D,mu)$ from its evaluations at given sampling points $x^1,dots,x^{m}inD$, where $Dsubsetmathbb{R}^d$ is a general domain and $mu$ a probability measure. The approximation is picked from a linear space $V_n$ of interest where $n=dim(V_n)$. Recent results have revealed that certain weighted least-squares methods achieve near best approximation with a sampling budget $m$ that is proportional to $n$, up to a logarithmic factor $ln(2n/varepsilon)$, where $varepsilon>0$ is a probability of failure. The sampling points should be picked at random according to a well-chosen probability measure $sigma$ whose density is given by the inverse Christoffel function that depends both on $V_n$ and $mu$. While this approach is greatly facilitated when $D$ and $mu$ have tensor product structure, it becomes problematic for domains $D$ with arbitrary geometry since the optimal measure depends on an orthonormal basis of $V_n$ in $L^2(D,mu)$ which is not explicitly given, even for simple polynomial spaces. Therefore sampling according to this measure is not practically feasible. In this paper, we discuss practical sampling strategies, which amount to using a perturbed measure $widetildesigma$ that can be computed in an offline stage, not involving the measurement of $u$. We show that near best approximation is attained by the resulting weighted least-squares method at near-optimal sampling budget and we discuss multilevel approaches that preserve optimality of the cumulated sampling budget when the spaces $V_n$ are iteratively enriched. These strategies rely on the knowledge of a-priori upper bounds on the inverse Christoffel function. We establish such bounds for spaces $V_n$ of multivariate algebraic polynomials, and for general domains $D$.

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximations to statistical distributions (nonasymptotic) (62E17) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Weighted approximation (41A81)

This page was built for publication: Optimal sampling and Christoffel functions on general domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6351885)