Computing a quantity of interest from observational data
From MaRDI portal
Publication:2631950
This research work is devoted to the study of the general optimal recovery problems together with the recovery of the corresponding quantities of interest. Various types of optimal algorithms, pertinent examples and applications are included under significant references.
Recommendations
Cites work
- A mathematical introduction to compressive sensing
- 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
- Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
- Compressed sensing and best \(k\)-term approximation
- Continuity and convexity of projections and barycentric coordinates in convex polyhedra
- Convergence rates for greedy algorithms in reduced basis methods
- Data assimilation and sampling in Banach spaces
- Data Assimilation in Reduced Modeling
- Extension of compact operators
- Fehlerfortpflanzung bei Interpolation
- scientific article; zbMATH DE number 4144656 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 727440 (Why is no real title available?)
- scientific article; zbMATH DE number 2020167 (Why is no real title available?)
- scientific article; zbMATH DE number 1881986 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Linear vs. nonlinear algorithms for linear problems
- 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
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
- The Growth of Polynomials Bounded at Equally Spaced Points
- The optimal recovery of smooth functions
Cited in
(14)- Data assimilation and sampling in Banach spaces
- Instances of computational optimal recovery: refined approximability models
- On the quadrature exactness in hyperinterpolation
- Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization
- Symmetry exploits for Bayesian cubature methods
- Approximability models and optimal system identification
- Optimal algorithms for computing average temperatures
- Exactness of quadrature formulas
- Instances of computational optimal recovery: dealing with observation errors
- Chebyshev centres, Jung constants, and their applications
- Full recovery from point values: an optimal algorithm for Chebyshev approximability prior
- Uncertainty quantification for goal-oriented inverse problems via variational encoder-decoder networks
- Optimal prediction of vector-valued functions from point samples
- An optimal quadrature formula exact to the exponential function by the phi function method
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)
