Multivariate approximation in downward closed polynomial spaces
From MaRDI portal
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 numerical algorithms that are available for the construction of the approximation, in particular through interpolation or discrete least-squares fitting. All such algorithms rely on the assumption that the set of multi-indices associated with the polynomial space is downward closed. In the present paper we introduce some tools for the study of approximation in multivariate spaces under this assumption, and use them in the derivation of error bounds, sometimes independent of the dimension d, and in the development of adaptive strategies.
Recommendations
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Polynomial approximation of anisotropic analytic functions of several variables
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Adaptive polynomial approximation by means of random discrete least squares
Cites work
- N-term Wiener chaos approximation rates for elliptic PDEs with lognormal Gaussian random inputs
- A Christoffel function weighted least squares algorithm for collocation approximations
- Adaptive polynomial approximation by means of random discrete least squares
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Approximation of high-dimensional parametric PDEs
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Computational Aspects of Polynomial Interpolation in Several Variables
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
- Deterministic and stochastic error bounds in numerical analysis
- Dimension-adaptive tensor-product quadrature
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- scientific article; zbMATH DE number 3135364 (Why is no real title available?)
- scientific article; zbMATH DE number 2001584 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Inverse problems: a Bayesian perspective
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- On the Lebesgue constant of Leja sequences for the complex unit disk and of their real projection
- On the Lebesgue constant of Leja sequences for the unit disk and its applications to multivariate interpolation
- On the power of function values for the approximation problem in various settings
- On the stability and accuracy of least squares approximations
- On the stability of polynomial interpolation using hierarchical sampling
- Optimal Monte Carlo methods for \(L^2\)-approximation
- Optimal nonlinear approximation
- Optimal weighted least-squares methods
- Solvability problems of bivariate interpolation I
- Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
- Sparse polynomial approximation of parametric elliptic PDEs. II: Lognormal coefficients.
- Spectral Methods for Uncertainty Quantification
- The power of standard information for multivariate approximation in the randomized setting
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Tractability of multivariate problems. Volume III: Standard information for operators
Cited in
(24)- Pluripotential numerics
- A unifying algebraic framework for discontinuous Galerkin and flux reconstruction methods based on the summation-by-parts property
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Polynomial approximation of anisotropic analytic functions of several variables
- Sparse polynomial approximations for affine parametric saddle point problems
- On the cardinality of lower sets and universal discretization
- Reduced Basis Greedy Selection Using Random Training Sets
- Uncertainty quantification for low-frequency, time-harmonic Maxwell equations with stochastic conductivity models
- Nonlinear methods for model reduction
- Sequential sampling for optimal weighted least squares approximations in hierarchical spaces
- On the convergence of adaptive stochastic collocation for elliptic partial differential equations with affine diffusion
- Adaptive approximation by optimal weighted least-squares methods
- An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains
- Near-optimal approximation methods for elliptic PDEs with lognormal coefficients
- Global Polynomial Level Sets for Numerical Differential Geometry of Smooth Closed Surfaces
- Towards optimal sampling for learning sparse approximation in high dimensions
- A note on the rate of convergence of integration schemes for closed surfaces
- On the representation and learning of monotone triangular transport maps
- High-order integration on regular triangulated manifolds reaches superalgebraic approximation rates through cubical reparametrizations
- Multilevel representations of random fields and sparse approximations of solutions to random PDEs
- Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification
- Local Gevrey regularity and Quasi-Monte Carlo quadrature for PDEs parameterized on non-compact domains
- Physics-informed deep learning and compressive collocation for high-dimensional diffusion-reaction equations: practical existence theory and numerics
This page was built for publication: Multivariate approximation in downward closed polynomial spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611802)
