Fast ESPRIT algorithms based on partial singular value decompositions
DOI10.1016/J.APNUM.2014.10.003zbMATH Open1302.65043OpenAlexW2093009076MaRDI QIDQ477709FDOQ477709
Authors: Daniel Potts, Manfred Tasche 
Publication date: 9 December 2014
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2014.10.003
Recommendations
- Error estimates for the ESPRIT algorithm
- scientific article; zbMATH DE number 782073
- Fast computation of the principal singular vectors of Toeplitz matrices arising in exponential data modelling
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Fast algorithms for direction-of-arrival finding using large ESPRIT arrays
exponential sumcomputational costpartial singular value decompositionrectangular Hankel matrixESPRIT algorithmpartial Lanczos bidiagonalization
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical interpolation (65D05)
Cites Work
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
- Functions of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- On approximation of functions by exponential sums
- Tensor spaces and numerical tensor calculus
- Accuracy and Stability of Numerical Algorithms
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
- Title not available (Why is that?)
- A Stable Numerical Method for Inverting Shape from Moments
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Algebraic methods for Toeplitz-like matrices and operators
- Title not available (Why is that?)
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
- Sparse polynomial interpolation in Chebyshev bases
- Parameter estimation for multivariate exponential sums
- Singular spectrum analysis for time series.
- Exponential data fitting and its applications
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- On the problem of parameter estimation in exponential sums
- Computation- and space-efficient implementation of SSA
- A Lanczos bidiagonalization algorithm for Hankel matrices
Cited In (12)
- Vector versions of Prony's algorithm and vector-valued rational approximations
- \textsc{mxpfit}: a library for finding optimal multi-exponential approximations
- Prony's method in several variables
- Accuracy of reconstruction of spike-trains with two near-colliding nodes
- Accuracy of noisy spike-train reconstruction: a singularity theory point of view
- Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
- Prony's method in several variables: symbolic solutions by universal interpolation
- Error estimates for the ESPRIT algorithm
- ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application
- Spherical Bessel transform via exponential sum approximation of spherical Bessel function
- Dependence of accuracy of ESPRIT estimates on signal eigenvalues: the case of a noisy sum of two real exponentials
Uses Software
This page was built for publication: Fast ESPRIT algorithms based on partial singular value decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477709)
