PARALLEL QR FACTORIZATION USING THE TORUS-WRAP MAPPING

Authors
HENDRICKSON B
Citation
B. Hendrickson, PARALLEL QR FACTORIZATION USING THE TORUS-WRAP MAPPING, Parallel computing, 19(11), 1993, pp. 1259-1271
Citations number
35
Categorie Soggetti
Computer Sciences","Computer Applications & Cybernetics
Journal title
Parallel computing → ACNP
ISSN journal
01678191
Volume
19
Issue
11
Year of publication
1993
Pages
1259 - 1271
Database
ISI
SICI code
0167-8191(1993)19:11<1259:PQFUTT>2.0.ZU;2-9
Abstract
We present a parallel algorithm for the QR factorization of a dense ma trix without column pivoting on a message passing multiprocessor. The algorithm combines the numerical efficiency of Householder reflections with the excellent communication properties of the torus-wrap mapping . Analytical results indicate that the communication overhead for this algorithm is less than that for other common approaches. Numerical re sults on an nCUBE 2 confirm the efficiency of our technique.