Minimal-storage high-performance Cholesky factorization via blocking and recursion

IBM Journal of Research and Development

Volumn 44, Issue 6, 2000, Pages 823-850

  Gustavson, Fred G ^a   Jonsson, Isak ^b  

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

^b UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; MAPPING;

CHOLESKY FACTORIZATION;

RECURSIVE FUNCTIONS;

EID: 0034312453     PISSN: 00188646     EISSN: None     Source Type: Journal    
DOI: 10.1147/rd.446.0823     Document Type: Article

References (12)

1. B. S. Andersen, F. G. Gustavson, and J. Waśniewski, "A Recursive Formulation of the Cholesky Factorization Operating on a Matrix in Packed Storage Form," Proceedings of the SIAM Conference on Parallel Processing for Scientific Computing, PPSC99, B. Hendrickson, K. A. Yelick, C. H. Bischof, I. S. Duff, A. S. Edelman, G. A. Geist, M. T. Heath, M. A. Heroux, C. Koelbel, R. S. Schreiber, R. F. Sincovec, and M. F. Wheeler, Eds., San Antonio, March 24-27, 1999; Scientific Computing (CD-ROM), Society for Industrial and Applied Mathematics, Philadelphia.
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, third edition, Society for Industrial and Applied Mathematics, Philadelphia, 1999.
3. IBM Corporation, Engineering and Scientific Subroutine Library for AIX, Guide and Reference, third edition, October 1999; Order No. SA 22-7272-02, available through IBM branch offices.
4. Jack J. Dongarra, James R. Bunch, Cleve B. Moler, and G. W. Stewart, LINPACK User's Guide, Society for Industrial and Applied Mathematics, Philadelphia, 1979.
5. Gene H. Golub and Charles Van Loan, Matrix Computations, third edition, Johns Hopkins University Press, Baltimore, 1996.
6. 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," Applied Parallel Computing, PARA'98, B. Kågström, J. Dongarra, E. Elmroth, and J. Waśniewski, Eds., Vol. 1541 of Lecture Notes in Computer Science, pp. 195-206; Springer-Verlag, New York, 1998.
7. R. C. Agarwal, F. G. Gustavson, and M. Zubair, "Improving Performance of Linear Algebra Algorithms for Dense Matrices, Using Algorithmic Prefetch," IBM J. Res. Develop. 38, No. 3, 265-275 (1994).
8. F. G. Gustavson, "Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms," IBM J. Res. Develop. 41, No. 6, 737-755 (1997).
9. A. Henriksson and I. Jonsson, "High-Performance Matrix Multiplication on the IBM SP High Node," Master's Thesis UMNAD 98.235, Department of Computing Science, Umeå University, S-901 87 Umeå, Sweden, June 1998.
10. F. G. Gustavson, W. Liniger, and R. Willoughby, "Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations," J. ACM 17, No. 1, 87-109 (1970).
11. S. Andersson, R. Bell, J. Hague, H. Holthoff, P. Mayes, J. Nakano, D. Shieh, and J. Tuccillo, RS/6000 Scientific and Technical Computing: POWER3 Introduction and Tuning Guide, first edition, IBM Corporation, October 1998; Order No. SG24-5155-00.
12. Document for the Basic Linear Algebra Subprograms (BLAS) Standard, draft edition, Basic Linear Algebra Subprograms (BLAST) Forum, October 1999. Available at http://www.netlib.org/cgi-bin/checkout/blast/blast.pl.