A fast symmetric SVD algorithm for square Hankel matrices
DOI10.1016/J.LAA.2007.05.027zbMATH Open1130.65056OpenAlexW1969527806MaRDI QIDQ2465321FDOQ2465321
Publication date: 3 January 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.05.027
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
least squaresToeplitz matrixnumerical experimentsHankel matrixorthogonalizationLanczos methodoverdetermined systemsTakagi factorizationpseudoinversestridiagonalizationsymmetric singular value decompositionsymmetric band matricessymmetric tridiagonal Hessenberg matrices
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Independent component analysis, a new concept?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Title not available (Why is that?)
- Singular value decompositions of complex symmetric matrices
- Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
- A Divide-and-Conquer Method for the Takagi Factorization
- A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
- Tridiagonalization of a symmetric band matrix
- Orthogonal Eigenvectors and Relative Gaps
- Title not available (Why is that?)
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
Cited In (16)
- 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
- Fast Hankel tensor–vector product and its application to exponential data fitting
- A mean value algorithm for Toeplitz matrix completion
- A fast eigenvalue algorithm for Hankel matrices
- A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
- A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
- Comparisons of several algorithms for Toeplitz matrix recovery
- Singular value decomposition of an infinite block-hankel matrix and its applications
- An efficient quantum algorithm for spectral estimation
- Title not available (Why is that?)
- A Lanczos bidiagonalization algorithm for Hankel matrices
- A fast SVD for multilevel block Hankel matrices with minimal memory storage
- 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
Uses Software
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)
