New serial and parallel recursive QR factorization algorithms for SMP systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1541, Issue , 1998, Pages 120-128

  Elmroth, Erik ^a   Gustavson, Fred ^b  

^a UMEÅ UNIVERSITY   (Sweden)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADDITIONAL COSTS; BLOCK ALGORITHM; NODE-BASED; ON DYNAMICS; PARALLEL IMPLEMENTATIONS; QR FACTORIZATIONS; RECURSIVE ALGORITHMS; UNIPROCESSORS;

FACTORIZATION;

EID: 84947936389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0095328     Document Type: Conference Paper

References (10)

1. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Green-baum, S. Hammaxling, S. McKenney, S. Ostrouchov, and D. Sorensen. LAPACK Users’ Guide -Release 2.0. SIAM, Philadelphia, 1994.
2. C. Bischof. Adaptive blocking in the QR factorization. The Journal of Supercomputing, 3:193-208, 1989.
3. C. Bischof and C. Van Loan. The WYrepresentation for products of householder matrices. SIAM J. Scientific and Statistical Computing, 8(1):s2-s13, 1987.
4. A. Chalmers and J. Tidmus. Practical Parallel Processing. International Thomson Computer Press, UK, 1996.
5. K. Dackland, E. Elmroth, and B. Kagstrom. A ring-oriented approach for block matrix factorizations on shared and distributed memory architectures. In R. F. Sin-covec et al, editor, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, pages 330-338, Norfolk, 1993. SIAM Publications.
6. K. Dackland, E. Elmroth, B. Kagstrom, and C. Van Loan. Parallel block matrix factorizations on the shared memory multiprocessor IBM 3090 VF/600J. International Journal of Supercomputer Applications, 6(1):69-97, 1992.
7. J. Dongarra, L. Kaufman, and S. Hammaxling. Squeezing the most out of eigenvalue solvers on high performance computers. Lin. Alg. and its Applic., 77:113-136, 1986.
8. F. Gustavson. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development, 41(6):737-755, 1997.
9. R. Schreiber and C. Van Loan. A storage efficient WY representation for products of householder transformations. SIAM J. Scientific and Statistical Computing, 10(l):53-57, 1989.
10. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM J. Matrix. Anal. Appl., 18(4):1065-1081, 1997.