Computing the complete CS decomposition
From MaRDI portal
Publication:1014355
Abstract: An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is equivalent to two simultaneous singular value decompositions. The algorithm presented here computes the complete 2-by-2 CSD, which requires the simultaneous diagonalization of all four blocks of a unitary matrix partitioned into a 2-by-2 block structure. The algorithm appears to be the only fully specified algorithm available. The computation occurs in two phases. In the first phase, the unitary matrix is reduced to bidiagonal block form, as described by Sutton and Edelman. In the second phase, the blocks are simultaneously diagonalized using techniques from bidiagonal SVD algorithms of Golub, Kahan, and Demmel. The algorithm has a number of desirable numerical features.
Recommendations
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Accelerating the SVD block-Jacobi method
- Accurate Singular Values of Bidiagonal Matrices
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computing the CS and the generalized singular value decompositions
- Computing the CS decomposition of a partitioned orthonormal matrix
- Computing the Generalized Singular Value Decomposition
- Computing the Generalized Singular Value Decomposition
- History and generality of the CS decomposition
- LAPACK Users' Guide
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Singular value decomposition and least squares solutions
- Some Perspectives on the Eigenvalue Problem
- Some new bounds on perturbation of subspaces
- The Rotation of Eigenvectors by a Perturbation. III
- The beta-Jacobi matrix model, the CS decomposition, and generalized singular value problems
- Towards a Generalized Singular Value Decomposition
Cited in
(15)- A CS decomposition for orthogonal matrices with application to eigenvalue computation
- Computing the CS and the generalized singular value decompositions
- Quantum games: a review of the history, current state, and interpretation
- Synthesis of quantum circuits based on supervised learning and correlations
- Unitary matrix decompositions for optimal and modular linear optics architectures
- Simultaneous multidiagonalization for the CS decomposition
- Quantum circuits synthesis using Householder transformations
- An algebraic quantum circuit compression algorithm for Hamiltonian simulation
- A canonical CS representation of a pair of subspaces
- A note on factoring unitary matrices
- A backward stable algorithm for computing the CS decomposition via the polar decomposition
- \(Qcompiler\): quantum compilation with the CSD method
- Stable computation of the CS decomposition: Simultaneous bidiagonalization
- History and generality of the CS decomposition
- Large deviations and a new sum rule for spectral matrix measures of the Jacobi ensemble
This page was built for publication: Computing the complete CS decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014355)
