Divide and conquer the CS decomposition

DOI10.1137/120870785zbMATH Open1273.65057OpenAlexW2058444416MaRDI QIDQ2848619FDOQ2848619

Authors: Brian D. Sutton 

Publication date: 26 September 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120870785

Recommendations

• Stable computation of the CS decomposition: Simultaneous bidiagonalization
• Computing the CS and the generalized singular value decompositions
• A Divide-and-Conquer Algorithm for the Bidiagonal SVD
• Simultaneous multidiagonalization for the CS decomposition
• An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices

zbMATH Keywords

divide-and-conquergeneralized singular value decompositionCS decompositionbidiagonal

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonal matrices (15B10) Orthogonalization in numerical linear algebra (65F25)

Cited In (7)

• A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition
• History and generality of the CS decomposition
• Computing the CS and the generalized singular value decompositions
• Computing the complete CS decomposition
• A Divide-and-Conquer Algorithm for the Bidiagonal SVD
• An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
• Stable computation of the CS decomposition: Simultaneous bidiagonalization

This page was built for publication: Divide and conquer the CS decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848619)