Computing the complete CS decomposition
An algorithm for computing the complete CS decomposition of a partitioned unitary matrix is developed. Although the existence of the CS decomposition (CSD) has been recognized since 1977, prior algorithms compute only a reduced version. This reduced version, which might be called a 2-by-1 CSD, is equivalent to two simultaneous singular value decompositions. The algorithm presented in this article 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, Reinsch, and Demmel. The algorithm has a number of desirable numerical features.
KeywordsCS decomposition Generalized singular value decomposition
Mathematics Subject Classifications (2000)65F15 15A23 15A18
Unable to display preview. Download preview PDF.
- 1.Anderson, E., Bai, Z., Bischof, C., Blackford, L.S., Demmel, J., Dongarra, J.J., Du Croz, J., Hammarling, S., Greenbaum, A., McKenney, A., Sorensen, D.: LAPACK Users’ guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1999)Google Scholar
- 2.Bai, Z.: The CSD, GSVD, their applications and computations. Preprint Series 958. Institute for Mathematics and its Applications, University of Minnesota (1992, April)Google Scholar
- 12.Jordan, C.: Essai sur la géométrie à n dimensions. Bull. Soc. Math. Fr. 3, 103–174 (1875)Google Scholar
- 18.Sutton, B.D.: The stochastic operator approach to random matrix theory, Ph.D. thesis. Massachusetts Institute of Technology, Cambridge, MA (2005)Google Scholar