Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
From MaRDI portal
Publication:2359687
DOI10.1007/s00365-017-9364-8zbMath1371.41004arXiv1610.07315OpenAlexW1958819879MaRDI QIDQ2359687
Giovanni Migliorati, Fabio Nobile, Albert Cohen
Publication date: 22 June 2017
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07315
convergence ratediscrete least squaresmultivariate polynomial approximationbest \(n\)-term approximationdownward closed set
Best approximation, Chebyshev systems (41A50) Multidimensional problems (41A63) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Related Items
Constructing Least-Squares Polynomial Approximations, On the cardinality of lower sets and universal discretization, Polynomial approximation via compressed sensing of high-dimensional functions on lower sets, Multivariate Approximation in Downward Closed Polynomial Spaces, Towards optimal sampling for learning sparse approximation in high dimensions, Multilevel approximation of parametric and stochastic PDES, Uncertainty Quantification for Spectral Fractional Diffusion: Sparsity Analysis of Parametric Solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the stability and accuracy of least squares approximations
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Orthogonal matching pursuit under the restricted isometry property
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
- Interpolation via weighted \(\ell_{1}\) minimization
- Solvability problems of bivariate interpolation I
- A distribution-free theory of nonparametric regression
- Fast computation in adaptive tree approximation
- Multivariate polynomial interpolation on lower sets
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Approximation in learning theory
- Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
- Learning Theory
- Computational Aspects of Polynomial Interpolation in Several Variables
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Approximation of high-dimensional parametric PDEs
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
