D Potts, G Steidl, M Tasche - Modern Sampling Theory: Mathematics and …, 2001 - Springer
In this chapter we consider approximative methods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the …
PJ Baddoo, B Herrmann… - … of the Royal …, 2023 - royalsocietypublishing.org
In this work, we demonstrate how physical principles—such as symmetries, invariances and conservation laws—can be integrated into the dynamic mode decomposition (DMD). DMD is …
Decimeter-Level Localization with a Single WiFi Access Point Page 1 This paper is included in the Proceedings of the 13th USENIX Symposium on Networked Systems Design and …
A number of problems in probability and statistics can be addressed using the multivariate normal (Gaussian) distribution. In the one-dimensional case, computing the probability for a …
It is well known that the trapezoidal rule converges geometrically when applied to analytic functions on periodic intervals or the real line. The mathematics and history of this …
Completely revised text focuses on use of spectral methods to solve boundary value, eigenvalue, and time-dependent problems, but also covers Hermite, Laguerre, rational …
This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform in two and three dimensions. The first digital …
JA Fessler, BP Sutton - IEEE transactions on signal processing, 2003 - ieeexplore.ieee.org
The fast Fourier transform (FFT) is used widely in signal processing for efficient computation of the FT of finite-length signals over a set of uniformly spaced frequency locations …
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of …