The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem
From MaRDI portal
Publication:801633
DOI10.1007/BF01934915zbMath0552.65038OpenAlexW2039333245MaRDI QIDQ801633
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01934915
numerical examplessingular value decompositionKronecker canonical formmatrix pencilrange nullspace separation
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Computing stable eigendecompositions of matrix pencils, The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms, On worst-case condition numbers of a multiple nonzero finite generalized singular value, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair, A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair, A Higher-Order Generalized Singular Value Decomposition for Rank-Deficient Matrices, A note on simple nonzero finite generalized singular values, New iterative methods for generalized singular-value problems, On choices of formulations of computing the generalized singular value decomposition of a large matrix pair, A Jacobi-Davidson type method for the generalized singular value problem, Eigenvalue computation in the 20th century, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- Computing the CS decomposition of a partitioned orthonormal matrix
- Kronecker's canonical form and the QZ algorithm
- Matrix eigensystem routines. EISPACK guide extension
- Perturbation Analysis for the Generalized Singular Value Problem
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2]
- Towards a Generalized Singular Value Decomposition
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- A General Matrix Eigenvalue Algorithm
- Generalizing the Singular Value Decomposition
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- The Rotation of Eigenvectors by a Perturbation. III
- An Algorithm for Generalized Matrix Eigenvalue Problems