# The HK singular value decomposition of rank deficient matrix triplets

Track 8: Numerical Analysis

First Online:

## Abstract

In this paper we consider a simultaneous reduction of three matrices. The described method is extended from the work presented in [3] to include rank deficient data. It is shown how, via an initial reduction, the problem becomes one of diagonalizing a product of three matrices. We compare three different algorithms for its computation and show why one is preferred over the others.

## Preview

Unable to display preview. Download preview PDF.

## 6 References

- [1]R.P. Brent, F.T. Luk and C. Van Loan, “Computation of the singular value decomposition using mesh-connected processors,”
*J. VLSI Computer Systems*, 1 (1985), pp. 250–260.Google Scholar - [2]L.M. Ewerbring, “A new generalization of the singular value decomposition: algorithms and applications,” Ph.D. dissertation, School of Elec. Eng., Cornell Univ., 1989.Google Scholar
- [3]L.M. Ewerbring and F.T. Luk, “Canonical correlations and generalized SVD: applications and new algorithms,”
*J. Comput. Applied Math.*, 27 (1989), pp. 37–52.MATHMathSciNetCrossRefGoogle Scholar - [4]T.N.E. Greville, “Note on the generalized inverse of a matrix product,”
*SIAM Review*, 8 (1966), pp. 518–521.MATHMathSciNetCrossRefGoogle Scholar - [5]S.J. Hammarling, Personal Communication.Google Scholar
- [6]F.T. Luk, “A triangular processor array for computing singular values,”
*Lin. Alg. Applics.*, 77 (1986), pp. 259–273.MATHCrossRefGoogle Scholar - [7]F.T. Luk and H. Park, “A proof of convergence for two parallel Jacobi SVD algorithms,”
*IEEE Trans. Computers*, 38 (1989), pp. 806–811.MathSciNetCrossRefGoogle Scholar - [8]C.C. Paige, “Computing the generalized singular value decomposition,”
*SIAM J. Sci. Statist. Comput.*, 7 (1986), pp. 1126–1146.MATHMathSciNetCrossRefGoogle Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1991