Title :
Efficiency and scalability of two parallel QR factorization algorithms
Author :
Malard, J. ; Paige, C.C.
Author_Institution :
Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada
Abstract :
Both the Householder QR factorization algorithm and the modified Gram-Schmidt algorithm can be written in terms of matrix-matrix operations using the Compact WY representation. Parallelizations of the resulting algorithms are reviewed and analyzed. For this purpose a general framework for analyzing the scalability of parallel algorithms is presented
Keywords :
mathematics computing; matrix algebra; parallel algorithms; Compact WY representation; Householder QR factorization algorithm; matrix-matrix operations; modified Gram-Schmidt algorithm; parallel QR factorization algorithms; parallel algorithms; scalability; Algorithm design and analysis; Computer science; Equations; Floating-point arithmetic; Least squares methods; Parallel algorithms; Scalability;
Conference_Titel :
Scalable High-Performance Computing Conference, 1994., Proceedings of the
Conference_Location :
Knoxville, TN
Print_ISBN :
0-8186-5680-8
DOI :
10.1109/SHPCC.1994.296698
