A fast symmetric SVD algorithm for square Hankel matrices
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1974611
- A Lanczos bidiagonalization algorithm for Hankel matrices
- A fast eigenvalue algorithm for Hankel matrices
- A fast SVD for multilevel block Hankel matrices with minimal memory storage
- Singular value decomposition of an infinite block-hankel matrix and its applications
Cites work
- scientific article; zbMATH DE number 49594 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 741104 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3191506 (Why is no real title available?)
- A Divide-and-Conquer Method for the Takagi Factorization
- A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- Independent component analysis, a new concept?
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Orthogonal Eigenvectors and Relative Gaps
- Singular value decompositions of complex symmetric matrices
- Tridiagonalization of a symmetric band matrix
Cited in
(19)- Two modified augmented Lagrange multiplier algorithms for Toeplitz matrix compressive recovery
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- Toeplitz matrix completion via a low-rank approximation algorithm
- A mean value algorithm for Toeplitz matrix completion
- A fast eigenvalue algorithm for Hankel matrices
- A fast rank-reduction algorithm based on block Hankel Hankel block matrix-vector multiplication with applications to seismic signal processing
- A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
- Computation- and space-efficient implementation of SSA
- A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
- Fast Hankel tensor-vector product and its application to exponential data fitting.
- SVD of Hankel matrices in Vandermonde-Cauchy product form
- Comparisons of several algorithms for Toeplitz matrix recovery
- Singular value decomposition of an infinite block-hankel matrix and its applications
- A Lanczos bidiagonalization algorithm for Hankel matrices
- A fast SVD for multilevel block Hankel matrices with minimal memory storage
- scientific article; zbMATH DE number 1974611 (Why is no real title available?)
- An efficient quantum algorithm for spectral estimation
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
This page was built for publication: A fast symmetric SVD algorithm for square Hankel matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465321)
