Multivariate approximation in downward closed polynomial spaces
Albert Cohen, Giovanni Migliorati

TL;DR
This paper explores the use of downward closed polynomial spaces for high-dimensional function approximation, highlighting their advantages in reducing the curse of dimensionality and providing new tools for error analysis and adaptive algorithms.
Contribution
It introduces new analytical tools for approximation in downward closed polynomial spaces and develops error bounds and adaptive strategies that can be dimension-independent.
Findings
Error bounds sometimes independent of dimension d
Effective adaptive strategies for polynomial approximation
Advantages of sparse anisotropic polynomial spaces in high dimensions
Abstract
The task of approximating a function of d variables from its evaluations at a given number of points is ubiquitous in numerical analysis and engineering applications. When d is large, this task is challenged by the so-called curse of dimensionality. As a typical example, standard polynomial spaces, such as those of total degree type, are often uneffective to reach a prescribed accuracy unless a prohibitive number of evaluations is invested. In recent years it has been shown that, for certain relevant applications, there are substantial advantages in using certain sparse polynomial spaces having anisotropic features with respect to the different variables. These applications include in particular the numerical approximation of high-dimensional parametric and stochastic partial differential equations. We start by surveying several results in this direction, with an emphasis on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Statistical and numerical algorithms
