Data assimilation and sampling in Banach spaces

DOI10.1007/S10092-017-0216-5MaRDI QIDQ1675437zbMATH OpenOpenAlexFDO

Authors Guergana Petrova, Ronald DeVore, P. Wojtaszczyk

Publication date 27 October 2017

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.06342

zbMATH Keywords

samplingdata assimilationapproximationBanach spacesoptimal recoveryChebyshev radiusreduced modeling

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Sampling theory in information and communication theory (94A20) Normed linear spaces and Banach spaces; Banach lattices (46B99)

Abstract: This paper studies the problem of approximating a function $f$ in a Banach space $X$ from measurements $l_j(f)$, $j=1,dots,m$, where the $l_j$ are linear functionals from $X^{\ast }$. Most results study this problem for classical Banach spaces $X$ such as the $L_p$ spaces, $1lepleinfty$, and for $K$ the unit ball of a smoothness space in $X$. Our interest in this paper is in the model classes $K=K(epsilon,V)$, with $epsilon>0$ and $V$ a finite dimensional subspace of $X$, which consists of all $finX$ such that $dist(f,V{)}_{X}leepsilon$. These model classes, called {it approximation sets}, arise naturally in application domains such as parametric partial differential equations, uncertainty quantification, and signal processing. A general theory for the recovery of approximation sets in a Banach space is given. This theory includes tight a priori bounds on optimal performance, and algorithms for finding near optimal approximations. We show how the recovery problem for approximation sets is connected with well-studied concepts in Banach space theory such as liftings and the angle between spaces. Examples are given that show how this theory can be used to recover several recent results on sampling and data assimilation.

Recommendations

• Optimal reduced model algorithms for data-based state estimation
• Optimal adaptive sampling recovery
• Computing a quantity of interest from observational data
• Nonlinear approximation spaces for inverse problems
• Greedy algorithms for reduced bases in Banach spaces

Cites work

• 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 3708924 (Why is no real title available?)
• scientific article; zbMATH DE number 44588 (Why is no real title available?)
• scientific article; zbMATH DE number 3626044 (Why is no real title available?)
• scientific article; zbMATH DE number 1223845 (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 1881986 (Why is no real title available?)
• scientific article; zbMATH DE number 1404748 (Why is no real title available?)
• scientific article; zbMATH DE number 3314644 (Why is no real title available?)
• scientific article; zbMATH DE number 3364236 (Why is no real title available?)
• A parameterized-background data-weak approach to variational data assimilation: formulation, analysis, and application to acoustics
• A remark on the renormings of nonreflexive spaces and the existence of the Chebyshev center
• A rotund reflexive space having a subspace of codimension two with a discontinuous metric projection
• A stability barrier for reconstructions from Fourier samples
• An Interpolation Problem for Coefficients of H ∞ Functions
• Approximation of high-dimensional parametric PDEs
• Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
• Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
• Convergence rates for greedy algorithms in reduced basis methods
• Data Assimilation in Reduced Modeling
• Dynamic Data Assimilation
• Fehlerfortpflanzung bei Interpolation
• Fixed Point Theory for Lipschitzian-type Mappings with Applications
• Impossibility of fast stable approximation of analytic functions from equispaced samples
• LMI approximations for the radius of the intersection of ellipsoids: Survey.
• Mappings Between Function Spaces
• On the best constants in the Khinchin inequality
• On the moduli of convexity and smoothness
• On the uniform convexity of L^p and l^p
• Restricted Centers in C(Ω)
• Stable extrapolation of analytic functions
• Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
• The best possible net and the best possible cross-section of a set in a normed space
• The dimension of almost spherical sections of convex bodies
• The optimal recovery of smooth functions
• Two results on polynomial interpolation in equally spaced points

Cited in

(16)

• Impact of physical model error on state estimation for neutronics applications
• On the stable sampling rate for binary measurements and wavelet reconstruction
• Optimal learning
• Attaining the Chebyshev bound for optimal learning: a numerical algorithm
• Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
• Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms
• Computing a quantity of interest from observational data
• Weak-type estimates for the metaplectic representation restricted to the shearing and dilation subgroup of \(\mathrm{SL}(2,\mathbb{R})\)
• Linear reconstructions and the analysis of the stable sampling rate
• Inverse problems: a deterministic approach using physics-based reduced models
• Approximability models and optimal system identification
• Convergence analysis of the generalized empirical interpolation method
• On reconstructing functions from binary measurements
• Sampling and reconstruction in distinct subspaces using oblique projections
• Optimal recovery from inaccurate data in Hilbert spaces: regularize, but what of the parameter?
• Homogeneous algorithms and solvable problems on cones

This page was built for publication: Data assimilation and sampling in Banach spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675437)