Computing the generalized singular value decomposition
Journal Article
·
· SIAM J. Sci. Stat. Comput.; (United States)
An algorithm is described for computing the generalized singular value decomposition of A(m x n) and B(p x n). Unitary matrices U, V and Q are developed so that U/sup H/AQ and V/sup H/BQ have as many nonzero parallel rows as possible, and these correspond to the common row space of the two matrices. The algorithm consists of an iterative sequence of cycles where each cycle is made up of the serial application of 2 x 2 generalized singular valve decompositions. Convergence appears to be at least quadratic. With the correct choice of ordering the algorithm can be implemented using systolic array processors (Gentleman, personal communication). The algorithm can also be used to compute any CS decomposition of a unitary matrix.
- Research Organization:
- Computer Science, McGill Univ., Montreal, Quebec, H3A 2K6
- OSTI ID:
- 5065049
- Journal Information:
- SIAM J. Sci. Stat. Comput.; (United States), Journal Name: SIAM J. Sci. Stat. Comput.; (United States) Vol. 7:4; ISSN SIJCD
- Country of Publication:
- United States
- Language:
- English
Similar Records
A multiprocessor scheme for the singular value decomposition
A parallel method for computing the generalized singular value decomposition
Finite-precision arithmetic in singular-value decomposition architectures
Conference
·
Sat Aug 01 00:00:00 EDT 1987
·
OSTI ID:5576354
A parallel method for computing the generalized singular value decomposition
Journal Article
·
Thu Aug 01 00:00:00 EDT 1985
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6777896
Finite-precision arithmetic in singular-value decomposition architectures
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6818788