Fast ESPRIT algorithms based on partial singular value decompositions
type: Item
instance of: scholarly article
title: Fast ESPRIT algorithms based on partial singular value decompositions
zbMATH Open document ID: 1302.65043
author: Daniel Potts
author: Manfred Tasche
published in: Applied Numerical Mathematics
publication date: 2014-12-09T00:00:00Z
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 6378698
zbMATH Keywords: ESPRIT algorithm
zbMATH Keywords: exponential sum
zbMATH Keywords: rectangular Hankel matrix
zbMATH Keywords: partial singular value decomposition
zbMATH Keywords: partial Lanczos bidiagonalization
zbMATH Keywords: computational cost
describes a project that uses: PROPACK
describes a project that uses: TRLan
describes a project that uses: mftoolbox
describes a project that uses: mctoolbox
describes a project that uses: NFFT3
MaRDI profile type: Publication
full work available at URL: j.apnum.2014.10.003
OpenAlex ID: W2093009076
cites work: Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
cites work: On approximation of functions by exponential sums
cites work: Q3361799
cites work: A Lanczos bidiagonalization algorithm for Hankel matrices
cites work: On the problem of parameter estimation in exponential sums
cites work: Symbolic-numeric sparse interpolation of multivariate polynomials
cites work: Calculating the Singular Values and Pseudo-Inverse of a Matrix
cites work: A Stable Numerical Method for Inverting Shape from Moments
cites work: Q5689624
cites work: Singular spectrum analysis for time series.
cites work: Tensor Spaces and Numerical Tensor Calculus
cites work: Algebraic methods for Toeplitz-like matrices and operators
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Functions of Matrices
cites work: Q4902474
cites work: Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
cites work: Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
cites work: Computation- and space-efficient implementation of SSA
cites work: Exponential Data Fitting and its Applications
cites work: A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
cites work: Parameter estimation for multivariate exponential sums
cites work: Parameter estimation for nonincreasing exponential sums by Prony-like methods
cites work: Sparse polynomial interpolation in Chebyshev bases
cites work: Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
cites work: Q4003887
cites work: Thick-restart Lanczos method for large symmetric eigenvalue problems
DOI: 10.1016/J.APNUM.2014.10.003
description: scientific article; zbMATH DE number 6378698