Name
Abstract | ||
|---|---|---|
We describe the design and implementation of a parallel QR decomposition algorithm for a large sparse matrix A. The algorithm is based on the multifrontal approach and makes use of Householder transformations. The tasks are distributed among processors according to an assembly tree which is built from the symbolic factorization of the matrix A(T)A.We first address uniprocessor issues and then discuss the multiprocessor implementation of the method. We consider the parallelization of both the factorization phase and the solve phase. We use relaxation of the sparsity structure of both the original matrix and the frontal matrices to improve the performance. We show that, in this case, the use of Level 3 BLAS can lead to very significant gains in performance. We use the eight processor Alliant FX/80 at CERFACS to illustrate our discussion. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1002/(SICI)1099-1506(199607/08)3:4<275::AID-NLA83>3.0.CO;2-7 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS |
Keywords | Field | DocType |
sparse QR factorization, multifrontal method, parallelism | Uniprocessor system,Mathematical optimization,Matrix (mathematics),Parallel computing,Multiprocessing,Theoretical computer science,Incomplete LU factorization,Factorization,Sparse matrix,Mathematics,QR decomposition | Journal |
Volume | Issue | ISSN |
3 | 4 | 1070-5325 |
Citations | PageRank | References |
18 | 1.65 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. R. Amestoy | 1 | 75 | 18.98 |
| I. S. Duff | 2 | 1575 | 530.95 |
| C. Puglisi | 3 | 18 | 1.65 |