Open Access
Exponential data fitting
Victor Pereyra and Godela Scherer
- 16 Jul 2010
27
About: The article was published on 16 Jul 2010. and is currently open access. The article focuses on the topics: Exponentially modified Gaussian distribution & Distribution fitting.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Variable Projection Methods for an Optimized Dynamic Mode Decomposition
Travis Askham,J. Nathan Kutz +1 more
TL;DR: A simple algorithm for computing an optimized version of the dynamic mode decomposition for data which may be collected at unevenly spaced sample times and finds that the resulting decomposition displays less bias in the presence of noise than standard DMD algorithms.
262
Model based processing of signals : a state space approach. Prolog
G. Likourezos,B. D. Rao,K. S. Arun,M. J. Riezenman +3 more
- 01 Jan 1992
TL;DR: It is shown that state space models provide an elegant tool for exposing the structure present in the problem and allows for robust parameterization of the model with respect to finite precision errors.
178
A sparse Prony FFT
Sabine Heider,Stefan Kunis,Daniel Potts,Michael Veit +3 more
- 09 Sep 2013
TL;DR: The application of Prony-like reconstruction methods to the problem of the sparse Fast Fourier transform (sFFT) is described and both important parts of the sFFT, quasi random sampling and filtering techniques, are adapted to PronY-like methods.
37
Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT
TL;DR: For a trigonometric polynomial of large sparsity, a new sparse fast Fourier transform is presented by shifted sampling and using MUSIC resp.
References
•Book
Numerical Methods for Least Squares Problems
Åke Björck
- 01 Apr 1996
TL;DR: Theorems and statistical properties of least squares solutions are explained and basic numerical methods for solving least squares problems are described.
3.6K
•Book
Algorithms for Minimization Without Derivatives
Richard P. Brent
- 01 Jan 1972
TL;DR: In this paper, a monograph describes and analyzes some practical methods for finding approximate zeros and minima of functions, and some of these methods can be used to find approximate minima as well.
The differentiation of pseudoinverses and nonlinear least squares problems whose variables separate.
Gene H. Golub,Victor Pereyra +1 more
TL;DR: Algorithms are presented which make extensive use of well-known reliable linear least squares techniques, and numerical results and comparisons are given.
1.4K
Using the matrix pencil method to estimate the parameters of a sum of complex exponentials
Tapan K. Sarkar,O. Pereira +1 more
TL;DR: The matrix pencil method is described, which is more robust to noise in the sampled data and has a lower variance of the estimates of the parameters of interest than a polynomial-type method, and is also computationally more efficient.