New Parallel (Rank-Revealing) QR Factorization Algorithms

Authors:
Rudnei Dias da Cunha;Dulcenéia Becker;James Carlton Patterson
Affiliations:
-;-;-
Venue:
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Year:
2002

Citing 7
Cited 2

On general row merging schemes for sparse given transformations

SIAM Journal on Scientific and Statistical Computing
Parallel solution of triangular systems on distributed-memory multiprocessors

SIAM Journal on Scientific and Statistical Computing
A new method for solving triangular systems on distributed-memory message-passing multiprocessors

SIAM Journal on Scientific and Statistical Computing
Sparse Multifrontal Rank Revealing QR Factorization

SIAM Journal on Matrix Analysis and Applications
Computing rank-revealing QR factorizations of dense matrices

ACM Transactions on Mathematical Software (TOMS)
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Applying recursion to serial and parallel QR factorization leads to better performance

IBM Journal of Research and Development

Communication-optimal Parallel and Sequential QR and LU Factorizations

SIAM Journal on Scientific Computing
Hierarchical QR factorization algorithms for multi-core clusters

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm to compute the QR factorization of a matrix Am脳n intended for use when m 驴 n. The algorithm uses a reduction strategy to perform the factorization which in turn allows a good degree of parallelism. It is then integrated into a parallel implementation of the QR factorization with column pivoting algorithm due to Golub and Van Loan, which allows the determination of the rank of A. The algorithms were coded in FORTRAN 90 using the MPI library. Results are presented for several different problem sizes on an IBM 9076 SP/2 parallel computer.