Abstract

A new way to represent products of Householder matrices is given that makes a typical Householder matrix algorithm rich in matrix-matrix multiplication. This is very desirable in that matrix-matrix multiplication is the operation of choice for an increasing number of important high performance computers. We tested the new representation by using it to compute the QR factorization on the FPS-164/MAX. Preliminary results indicate that it is a very efficient way to organize Householder computations.

MSC codes

  1. 65

Keywords

  1. Householder matrices
  2. QR factorization
  3. vector parallelism

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
G. Dietrich, A new formulation of the hypermatrix Householder- $\mathrm {QR}$ decomposition, Comput. Meth. Appl. Mech. Engrg., 9 (1976), 273–280
2.
J. Dongarra, J. D. Bunch, C. B. Moler, G. W. Stewart, Linpack User's Guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1979
3.
J. Dongarra, S. Eisenstat, Squeezing the most out of an algorithm in CRAY FORTRAN, ACM Trans. Math. Software, 10 (1984), 219–230
4.
J. Dongarra, F. G. Gustavson, A. Karp, Implementing linear algebra algorithms for dense matrices on a vector pipeline machine, SIAM Rev., 26 (1984), 91–112
5.
J. Dongarra, L. Kaufman, S. Hammarling, Squeezing the most out of eigenvalue solvers on high-performance computers, Technical Memorandum, 46, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, 1985
6.
G. H. Golub, C. Van Loan, Matrix computations, Johns Hopkins Series in the Mathematical Sciences, Vol. 3, Johns Hopkins University Press, Baltimore, MD, 1983xvi+476
7.
D. Madura, R. Broussard, D. Strickland, FPS-164 MAX: parallel multiprocessing for linear algebra operation, Proc.1985 Array Processing Conference, New Orleans, 1985, 33–50
8.
H. R. Schwartz, Tridiagonalization of a symmetric band matrix, Numer. Math., 12 (1968), 231–241
9.
B. T. Smith, J. M. Boyle, Y. Ikebe, V. C. Klema, C. B. Moler, Matrix Eigensystem Routines: EISPACK Guide, Springer-Verlag, New York, 1970
10.
G. W. Stewart, Computing the $CS$ decomposition of a partitioned orthonormal matrix, Numer. Math., 40 (1982), 297–306, An algorithm
11.
Charles Van Loan, Computing the CS and the generalized singular value decompositions, Numer. Math., 46 (1985), 479–491

Information & Authors

Information

Published In

cover image SIAM Journal on Scientific and Statistical Computing
SIAM Journal on Scientific and Statistical Computing
Pages: s2 - s13

History

Submitted: 12 December 1985
Accepted: 9 April 1986
Published online: 14 July 2006

MSC codes

  1. 65

Keywords

  1. Householder matrices
  2. QR factorization
  3. vector parallelism

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media