Computing the CS and the generalized singular value decompositions
From MaRDI portal
Publication:799335
DOI10.1007/BF01389653zbMATH Open0548.65020MaRDI QIDQ799335FDOQ799335
Publication date: 1985
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133008
singular value decompositionsorthogonal matrixblock matrixCS decompositionsystolic-type computer architectures
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Rotation of Eigenvectors by a Perturbation. III
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Singular value decomposition and least squares solutions
- Generalizing the Singular Value Decomposition
- Towards a Generalized Singular Value Decomposition
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- Computing the CS decomposition of a partitioned orthonormal matrix
Cited In (31)
- Modifying the generalized singular value decomposition with application in direction-of-arrival finding
- The joint bidiagonalization process with partial reorthogonalization
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Simultaneous multidiagonalization for the CS decomposition
- A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition
- Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: a geometric method
- History and generality of the CS decomposition
- Analytical best approximate Hermitian and generalized skew-Hamiltonian solution of matrix equation \(AXA^{\mathrm{H}}+CYC^{\mathrm{H}}=F\)
- Computing the complete CS decomposition
- Levenberg-Marquardt method with singular scaling and applications
- A new matrix decomposition for signal processing
- A numerical method for computing the Hamiltonian Schur form
- A New Preprocessing Algorithm for the Computation of the Generalized Singular Value Decomposition
- On a variational formulation of the QSVD and the RSVD
- Efficient diagonalization of oversized matrices on a distributed-memory multiprocessor
- Randomized GCUR decompositions
- A canonical CS representation of a pair of subspaces
- Accelerating the SVD block-Jacobi method
- Randomized generalized singular value decomposition
- Verification Algorithms for Generalized Singular Values
- The discrete empirical interpolation method in class identification and data summarization
- On Structure-Preserving Model Reduction for Damped Wave Propagation in Transport Networks
- Fifty Three Matrix Factorizations: A Systematic Approach
- Numerical algorithms for a sideways parabolic problem with variable coefficients
- A Generalized CUR Decomposition for Matrix Pairs
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- A Higher-Order Generalized Singular Value Decomposition for Rank-Deficient Matrices
- Estimator-correlator array processing: Theoretical underpinnings and adaptive implementation
- Geometric Inexact Newton Method for Generalized Singular Values of Grassmann Matrix Pair
- The general linear model of the generalized singular value decomposition
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
Uses Software
This page was built for publication: Computing the CS and the generalized singular value decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799335)