Predictive algorithms in dynamical sampling for burst-like forcing terms
From MaRDI portal
Publication:6042616
Abstract: In this paper, we consider the problem of recovery of a burst-like forcing term in an initial value problem (IVP) in the framework of dynamical sampling. We introduce an idea of using two particular classes of samplers that allow one to predict the solution of the IVP over a time interval without a burst. This leads to two different algorithms that stably and accurately approximate the burst-like forcing term even in the presence of a measurement acquisition error and a large background source.
Recommendations
Cites work
- A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
- A Sampling Framework for Solving Physics-Driven Inverse Source Problems
- Dynamical sampling with additive random noise
- Dynamical sampling: time-space trade-off
- Estimating Localized Sources of Diffusion Fields Using Spatiotemporal Sensor Measurements
- Exact reconstruction of signals in evolutionary systems via spatiotemporal trade-off
- Frames induced by the action of continuous powers of an operator
- Harmonic analysis of causal operators and their spectral properties
- Iterative actions of normal operators
- One-Parameter Semigroups for Linear Evolution Equations
- Source localization by spatially distributed electronic noses for advection and diffusion
- Super-resolution from noisy data
- Towards a Mathematical Theory of Super‐resolution
- Vector-valued Laplace transforms and Cauchy problems
Cited in
(4)
This page was built for publication: Predictive algorithms in dynamical sampling for burst-like forcing terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042616)