• Corpus ID: 237385236

# Predictive algorithms in dynamical sampling for burst-like forcing terms

@article{Aldroubi2021PredictiveAI,
title={Predictive algorithms in dynamical sampling for burst-like forcing terms},
author={Akram Aldroubi and Longxiu Huang and Keri Kornelson and Ilya A. Krishtal},
journal={ArXiv},
year={2021},
volume={abs/2109.00623}
}
• Published 1 September 2021
• Environmental Science
• ArXiv
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.

## References

SHOWING 1-10 OF 15 REFERENCES
Dynamical sampling with additive random noise
• Mathematics
• 2018
The performance of the basic dynamical sampling algorithms in the finite dimensional case is analyzed and the algorithm for recovering the driving operators is validated via a real symmetric convolution.
Super-Resolution from Noisy Data
• Computer Science
ArXiv
• 2012
It is shown that as long as the sources are separated by 2/flo, solving a simple convex program produces a stable estimate in the sense that the approximation error between the higher-resolution reconstruction and the truth is proportional to the noise level times the square of the super-resolution factor (SRF) fhi/flo.
Sparse Sampling of Signal Innovations
• Computer Science
IEEE Signal Processing Magazine
• 2008
It is shown that sampling at the rate of innovation is possible, in some sense applying Occam's razor to the sampling of sparse signals, which should lead to further research in sparse sampling, as well as new applications.
A Sampling Framework for Solving Physics-Driven Inverse Source Problems
• Mathematics
IEEE Transactions on Signal Processing
• 2017
This work demonstrates that the unknown field sources can be recovered from a sequence of generalized measurements by using multidimensional frequency estimation techniques, and develops practical, noise robust, sensor network strategies for solving the inverse source problem.
Sampling the Flow of a Bandlimited Function
• Mathematics
• 2020
We analyze the problem of reconstruction of a bandlimited function $f$ from the space-time samples of its states $f_t=\phi_t\ast f$ resulting from the convolution with a kernel $\phi_t$. It is
Estimating Localized Sources of Diffusion Fields Using Spatiotemporal Sensor Measurements
• Mathematics
IEEE Transactions on Signal Processing
• 2015
A novel and robust reconstruction method is developed by properly extending exact inversion formulas, for both source distributions, through the use of Green's second theorem and a family of sensing functions to compute generalized field samples.
Towards a Mathematical Theory of Super‐resolution
• Mathematics
ArXiv
• 2012
In the discrete setting, some theoretical results are developed explaining how the accuracy of the super-resolved signal is expected to degrade when both the noise level and the {\em super-resolution factor} vary.
Exact Reconstruction of Signals in Evolutionary Systems Via Spatiotemporal Trade-off
• Mathematics
• 2015
We consider the problem of spatiotemporal sampling in which an initial state $$f$$f of an evolution process $$f_t=A_tf$$ft=Atf is to be recovered from a combined set of coarse spatial samples from
A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
• Mathematics
• 2013
We derive a new generalization of Prony?s method to reconstruct M-sparse expansions of (generalized) eigenfunctions of linear operators from only suitable values in a deterministic way. The proposed