Paper
1 November 1990 Computing the generalized singular value decomposition on the Connection Machine
Haesun Park, L. Magnus Ewerbring
Author Affiliations +
Abstract
A new algorithm for computing the generalized singular value decomposition that diagonalizes two matrices is introduced. First two existing algorithms are studied one due to Paige and the other to Han and Veselic. The former requires only orthogonal plane transformations resulting in two matrices with parallel rows. The latter employs nonsingular (not necessarily orthogonal) transformations to directly diagonalize the two data matrices. For many applications it is preferable to be given both the diagonal matrices and the txansformation matrices explicitly. Our algorithm has the advantages that the nonsingular transformation is readily available computation of transformations is simple convergence test is efficient in a parallel computing environment and the condition of each nonsingular transformation can be controlled. We present implementation results obtained on a Connection Machine 2 to compare our new algorithm with that of Paige.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Haesun Park and L. Magnus Ewerbring "Computing the generalized singular value decomposition on the Connection Machine", Proc. SPIE 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations, (1 November 1990); https://doi.org/10.1117/12.23495
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Parallel computing

Back to Top