Fast ESPRIT algorithms based on partial singular value decompositions
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Lanczos bidiagonalization algorithm for Hankel matrices
- A Stable Numerical Method for Inverting Shape from Moments
- A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
- Accuracy and Stability of Numerical Algorithms
- Algebraic methods for Toeplitz-like matrices and operators
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computation- and space-efficient implementation of SSA
- Exponential data fitting and its applications
- Functions of Matrices
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
- On approximation of functions by exponential sums
- On the problem of parameter estimation in exponential sums
- Parameter estimation for multivariate exponential sums
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Singular spectrum analysis for time series.
- Sparse polynomial interpolation in Chebyshev bases
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Tensor spaces and numerical tensor calculus
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
Cited in
(12)- Vector versions of Prony's algorithm and vector-valued rational approximations
- Prony's method in several variables
- \textsc{mxpfit}: a library for finding optimal multi-exponential approximations
- Accuracy of noisy spike-train reconstruction: a singularity theory point of view
- Accuracy of reconstruction of spike-trains with two near-colliding nodes
- 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
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)
