High performance cholesky factorization via blocking and recursion that uses minimal storage

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

Volumn 1947, Issue , 2001, Pages 82-91

  Gustavson, Fred ^a   Jonsson, Isak ^b  

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

^b UMEÅ UNIVERSITY   (Sweden)

Author keywords

Cholesky factorization; Level 3 BLAS parallelism; Packed format; Recursive algorithm; Recursive data structure

Indexed keywords

DIGITAL STORAGE; FACTORIZATION;

CHOLESKY FACTORIZATIONS; LEVEL-3 BLAS; PACKED FORMAT; RECURSIVE ALGORITHMS; RECURSIVE DATA STRUCTURES;

ALGORITHMS;

EID: 84956987224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (8)

1. B. Andersen, F. Gustavson, and J. Waśniewski. A recursive formulation of Cholesky factorization of a matrix in packed storage. Technical Report CS-00-441, University of Tennessee, Knoxville, TN, Computer Science Dept., May 2000. Also LAPACK Working Note number 146 (lawn146.ps), and submitted to the ACM Transaction of Mathematical Software.
2. E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK User’s Guide. SIAM, Philadelphia, third edition, 1999.
3. Gene H. Golub and Charles Van Loan. Matrix Computations. Johns Hopkins, third edition, 1996.
4. F.G. Gustavson. Recursion leads to automatic variable blocking for dense linear- algebra algorithms. IBM Journal of Research and Development, 41(6), November 1997.
5. F.G. Gustavson, A. Henriksson, I. Jonsson, B. Kågström, and P. Ling. Recursive Blocked Data Formats and BLAS’s for Dense Linear Algebra Algorithms. In Kågström, J. Dongarra, E. Elmroth, and J. Wasniewski, editors, Applied Parallel Computing, PARA’98, volume 1541 of Lecture Notes in Computer Science, pages 195-206. Springer-Verlag, 1998.
6. F.G. Gustavson, A. Henriksson, I. Jonsson, B. Kågström, and P. Ling. Superscalar GEMM-based Level 3 BLAS - The On-going Evolution of a Portable and High- Performance Library. In B. Kågström, J. Dongarra, E. Elmroth, and J. Wasniewski, editors, Applied Parallel Computing, PARA’98, volume 1541 of Lecture Notes in Computer Science, pages 207-215. Springer-Verlag, 1998.
7. Fred Gustavson and Isak Jonsson. Minimal Storage High Performance Cholesky Factorization via Blocking and Recursion. Submitted to IBM Journal of Research and Development in June 2000.
8. IBM Corporation. Engineering and Scientific Subroutine Library for AIX, Guide and Reference, third edition, October 1999.