Computing a quantity of interest from observational data
From MaRDI portal
Publication:2631950
DOI10.1007/s00365-018-9433-7zbMath1414.41019OpenAlexW2806479010MaRDI QIDQ2631950
Simon Foucart, Ronald A. DeVore, Przemysław Wojtaszczyk, Guergana Petrova
Publication date: 16 May 2019
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-018-9433-7
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical quadrature and cubature formulas (65D32) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Applications of functional analysis in numerical analysis (46N40)
Related Items
Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization, Optimal algorithms for computing average temperatures, Full recovery from point values: an optimal algorithm for Chebyshev approximability prior, Instances of Computational Optimal Recovery: Dealing with Observation Errors, Instances of computational optimal recovery: refined approximability models, Symmetry exploits for Bayesian cubature methods, Chebyshev centres, Jung constants, and their applications, Approximability models and optimal system identification, On the quadrature exactness in hyperinterpolation, Exactness of Quadrature Formulas
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
- Linear vs. nonlinear algorithms for linear problems
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Best approximation of analytic functions from information about their values at a finite number of points
- The optimal recovery of smooth functions
- Data assimilation and sampling in Banach spaces
- Fehlerfortpflanzung bei Interpolation
- Continuity and convexity of projections and barycentric coordinates in convex polyhedra
- Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem
- Compressed sensing and best 𝑘-term approximation
- Convergence Rates for Greedy Algorithms in Reduced Basis Methods
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- Sparse and Redundant Representations
- The Growth of Polynomials Bounded at Equally Spaced Points
- Data Assimilation in Reduced Modeling
- Extension of compact operators
- Necessary and Sufficient Conditions for Equidistant Quadrature Formula
- On the optimality of linear methods for operator approximation in convex classes of functions
- Optimal sampling rates for approximating analytic functions from pointwise samples
