ISSN:
0945-3245
Keywords:
AMS(MOS):65F30
;
CR: G1.3
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary If the columns of a matrix are orthonormal and it is partitioned into a 2-by-1 block matrix, then the singular value decompositions of the blocks are related. This is the essence of the “CS decomposition”. The computation of these related SVD's requires some care. Stewart has given an algorithm that uses the LINPACK SVD algorithm together with a Jacobitype “clean-up” operation on a cross-product matrix. Our technique is equally stable and fast but avoids the cross product matrix. The simplicity of our technique makes it more amenable to parallel computation on systolic-type computer architectures. These developments are of interest because a good way to compute the generalized singular value decomposition of a matrix pair (A, B) is to compute the CS decomposition of a certain orthogonal column matrix related toA andB.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01389653
Permalink
