Computing a quantity of interest from observational data
DOI10.1007/S00365-018-9433-7zbMATH Open1414.41019OpenAlexW2806479010WikidataQ129739149 ScholiaQ129739149MaRDI QIDQ2631950FDOQ2631950
Simon Foucart, Ronald DeVore, P. 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
Recommendations
Numerical quadrature and cubature formulas (65D32) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Applications of functional analysis in numerical analysis (46N40) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Title not available (Why is that?)
- Sparse and Redundant Representations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compressed sensing and best 𝑘-term approximation
- A mathematical introduction to compressive sensing
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Fehlerfortpflanzung bei Interpolation
- Title not available (Why is that?)
- Convergence Rates for Greedy Algorithms in Reduced Basis Methods
- Title not available (Why is that?)
- Continuity and convexity of projections and barycentric coordinates in convex polyhedra
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- Title not available (Why is that?)
- Extension of compact operators
- On the optimality of linear methods for operator approximation in convex classes of functions
- Title not available (Why is that?)
- The Growth of Polynomials Bounded at Equally Spaced Points
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
- Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
- Best approximation of analytic functions from information about their values at a finite number of points
- Linear vs. nonlinear algorithms for linear problems
- The optimal recovery of smooth functions
- Title not available (Why is that?)
- Data Assimilation in Reduced Modeling
- Data assimilation and sampling in Banach spaces
- Necessary and Sufficient Conditions for Equidistant Quadrature Formula
- Optimal sampling rates for approximating analytic functions from pointwise samples
Cited In (11)
- On the quadrature exactness in hyperinterpolation
- Uncertainty quantification for goal-oriented inverse problems via variational encoder-decoder networks
- Chebyshev centres, Jung constants, and their applications
- Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization
- Full recovery from point values: an optimal algorithm for Chebyshev approximability prior
- Instances of computational optimal recovery: refined approximability models
- Exactness of Quadrature Formulas
- Symmetry exploits for Bayesian cubature methods
- Approximability models and optimal system identification
- Optimal algorithms for computing average temperatures
- Instances of Computational Optimal Recovery: Dealing with Observation Errors
Uses Software
This page was built for publication: Computing a quantity of interest from observational data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631950)
