Computing the CS decomposition of a partitioned orthonormal matrix
From MaRDI portal
Publication:1052798
DOI10.1007/BF01396447zbMath0516.65016MaRDI QIDQ1052798
Publication date: 1982
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132829
Related Items
History and generality of the CS decomposition ⋮ Singular value and generalized singular value decompositions and the solution of linear matrix equations ⋮ The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces ⋮ 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 ⋮ A Generalized CUR Decomposition for Matrix Pairs ⋮ Geometric Inexact Newton Method for Generalized Singular Values of Grassmann Matrix Pair ⋮ Numerical treatment of restricted gauss-markov model1 ⋮ Inverse problems for symmetric matrices with a submatrix constraint ⋮ Randomized generalized singular value decomposition ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Simultaneous multidiagonalization for the CS decomposition ⋮ Fifty Three Matrix Factorizations: A Systematic Approach ⋮ The anti-symmetric solution of the matrix equation \(AXA^{\top} =B\) on a null subspace ⋮ The \((M, N)\)-symmetric Procrustes problem ⋮ On the symmetric solutions of linear matrix equations ⋮ The anti-symmetric ortho-symmetric solution of a linear matrix equation and its optimal approximation ⋮ A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD ⋮ The symmetric solution of the matrix equations \(AX+YA=C, AXA^ t+BYB^ t=C\), and \((A^ tXA, B^ tXB)=(C,D)\) ⋮ Accelerating the SVD block-Jacobi method ⋮ Least-squares solutions to the matrix equations \(AX = B\) and \(XC = D\) ⋮ A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition ⋮ Solving the mixed Sylvester matrix equations by matrix decompositions ⋮ Generalized reflexive solutions of the matrix equation \(AXB=D\) and an associated optimal approximation problem ⋮ An algorithm for computing the spectral structure of a singular linear matrix pencil ⋮ Computing the complete CS decomposition ⋮ Symmetric solutions of linear matrix equations by matrix decompositions ⋮ On relationships between two linear subspaces and two orthogonal projectors ⋮ On a variational formulation of the QSVD and the RSVD ⋮ A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy ⋮ Least-squares solution with the minimum-norm for the matrix equation \(A^T XB + B^T X^T A = D\) and its applications ⋮ Angle decomposition of matrices ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ Computing the CS and the generalized singular value decompositions ⋮ The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem ⋮ The general linear model of the generalized singular value decomposition ⋮ Least-squares solution with the minimum-norm for the matrix equation \((A\times B,G\times H) = (C,D)\)
Uses Software
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
