Abstract
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.
Similar content being viewed by others
References
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)
Bai, Z.: The CSD, GSVD, their applications and computations. Preprint Series 958. Institute for Mathematics and its Applications, University of Minnesota (1992, April)
Bai, Z., Demmel, J.: Computing the generalized singular value decomposition. SIAM J. Sci. Comput. 14(6), 1464–1486 (1993)
Davis, C., Kahan, W.M.: Some new bounds on perturbation of subspaces. Bull. Am. Math. Soc. 75, 863–868 (1969)
Davis, C., Kahan, W.M.: The rotation of eigenvectors by a perturbation, III. SIAM J. Numer. Anal. 7, 1–46 (1970)
Demmel, J., Kahan, W.: Accurate singular values of bidiagonal matrices. SIAM J. Sci. Statist. Comput. 11(5), 873–912 (1990)
Edelman, A., Sutton, B.D.: The beta-Jacobi matrix model, the CS decomposition, and generalized singular value problems. Found. Comput. Math. 8(2), 259–285 (2008)
Golub, G., Kahan, W.: Calculating the singular values and pseudo-inverse of a matrix. J. Soc. Ind. Appl. Math., Ser. B Numer. Anal. 2, 205–224 (1965)
Golub, G.H., Reinsch, C.: Handbook series linear algebra: Singular value decomposition and least squares solutions. Numer. Math. 14(5), 403–420 (1970)
Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD (1996)
Hari, V.: Accelerating the SVD block-Jacobi method. Computing 75(1), 27–53 (2005)
Jordan, C.: Essai sur la géométrie à n dimensions. Bull. Soc. Math. Fr. 3, 103–174 (1875)
Paige, C.C.: Computing the generalized singular value decomposition. SIAM J. Sci. Statist. Comput. 7(4), 1126–1146 (1986)
Paige, C.C., Saunders, M.A.: Towards a generalized singular value decomposition. SIAM J. Numer. Anal. 18(3), 398–405 (1981)
Paige, C.C., Wei, M.: History and generality of the CS decomposition. Linear Algebra Appl. 208/209, 303–326 (1994)
Stewart, G.W.: On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM Rev. 19(4), 634–662 (1977)
Stewart, G.W.: Computing the CS decomposition of a partitioned orthonormal matrix. Numer. Math. 40(3), 297–306 (1982)
Sutton, B.D.: The stochastic operator approach to random matrix theory, Ph.D. thesis. Massachusetts Institute of Technology, Cambridge, MA (2005)
Van Loan, C.: Computing the CS and the generalized singular value decompositions. Numer. Math. 46(4), 479–491 (1985)
Watkins, D.S.: Some perspectives on the eigenvalue problem. SIAM Rev. 35(3), 430–471 (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sutton, B.D. Computing the complete CS decomposition. Numer Algor 50, 33–65 (2009). https://doi.org/10.1007/s11075-008-9215-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-008-9215-6