Name
Abstract | ||
|---|---|---|
In this paper, the parallel implementation of two algorithms for forming a QR factorization of a matrix is studied. We propose parallel algorithms for the modified Gram-Schmidt and the Householder algorithms on message passing systems in which the matrix is distributed by blocks or rows. The models that predict performance of the algorithms are validated by experimental results on several parallel machines. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/0167-8191(90)90163-4 | PARALLEL COMPUTING |
Keywords | Field | DocType |
message passing systems,qr factorization,gram-schmidt algorithm,householder algorithm | Linear algebra,Parallel algorithm,Matrix (mathematics),Computer science,Parallel computing,Algorithm,Theoretical computer science,Factorization,Householder transformation,Numerical analysis,Message passing,QR decomposition | Journal |
Volume | Issue | ISSN |
16 | 1 | 0167-8191 |
Citations | PageRank | References |
23 | 4.54 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| O'Leary, Dianne P. | 1 | 1064 | 222.93 |
| Peter Whitman | 2 | 37 | 6.96 |