1. P. Arbenz. Divide-and-conquer algorithms for the computation of the SVD of bidiagonal matrices. In J. J. Dongarra, I. S. Duff, P. Gaffney, and S. McKee, editors, Vector and Parallel Computing, pages 1–10, Ellis Horwood, Chichester, 1989.
2. Z. Bai. The Direct GSVD Algorithm and its Parallel Implementations. Technical Report CS-TR-1901, University of Maryland, Department of Computer Science, College Park, Maryland 20742, 1987. Ph.D. Thesis.
3. Z. Bai and J. Demmel On a block implementation of Hessenberg multishift QR iteration. Int. J. High Speed Comput., 1: 97–112, 1989.
4. M. Berry and A. Sameh. A multiprocessor scheme for the singular value decomposition. In G. Rodrigue, editor, Parallel Processing for Scientific Computing, pages 67–71, SIAM, Philadelphia, 1989.
5. C. H. Bischof. QR Factorization Algorithms for Coarse-Grained Distributed Systems. Technical Report TR 88–939, Cornell University, Department of Computer Science, Ithaca, New York 14853–7501, 1988. Ph.D. Thesis.