Computing the CS decomposition of a partitioned orthonormal matrix

DOI10.1007/BF01396447zbMath0516.65016MaRDI QIDQ1052798

G. W. Stewart

Publication date: 1982

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132829

zbMATH Keywords

orthogonal transformations; CS decomposition; diagonalizing; partitioned orthonormal matrix

Mathematics Subject Classification ID

15A23: Factorization of matrices

65F25: Orthogonalization in numerical linear algebra

Related Items

Computing the CS and the generalized singular value decompositions, The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem, Least-squares solution with the minimum-norm for the matrix equation \((A\times B,G\times H) = (C,D)\), The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB = [C, D]\)], Synthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decomposition, Inverse problems for symmetric matrices with a submatrix constraint, On the symmetric solutions of linear matrix equations, The anti-symmetric ortho-symmetric solution of a linear matrix equation and its optimal approximation, Least-squares solutions to the matrix equations \(AX = B\) and \(XC = D\), Generalized reflexive solutions of the matrix equation \(AXB=D\) and an associated optimal approximation problem, Computing the complete CS decomposition, Least-squares solution with the minimum-norm for the matrix equation \(A^T XB + B^T X^T A = D\) and its applications, The general linear model of the generalized singular value decomposition, Singular value and generalized singular value decompositions and the solution of linear matrix equations, The symmetric solution of the matrix equations \(AX+YA=C, AXA^ t+BYB^ t=C\), and \((A^ tXA, B^ tXB)=(C,D)\), An algorithm for computing the spectral structure of a singular linear matrix pencil, Symmetric solutions of linear matrix equations by matrix decompositions, Angle decomposition of matrices, History and generality of the CS decomposition, Methods and algorithms of solving spectral problems for polynomial and rational matrices, On a variational formulation of the QSVD and the RSVD, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, The \((M, N)\)-symmetric Procrustes problem, Accelerating the SVD block-Jacobi method, Numerical treatment of restricted gauss-markov model¹

Uses Software

• EISPACK
• LINPACK

Cites Work

• Unnamed Item
• Matrix eigensystem routines - EISPACK guide. 2nd ed
• Matrix eigensystem routines. EISPACK guide extension
• The Jacobi method for real symmetric matrices
• Towards a Generalized Singular Value Decomposition
• A General Matrix Eigenvalue Algorithm
• Generalizing the Singular Value Decomposition
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
• The Rotation of Eigenvectors by a Perturbation. III