Three versions of a minimal storage Cholesky algorithm using new data structures gives high performance speeds as verified on many computers

Authors:
Jerzy Waśniewski;Fred G. Gustavson
Affiliations:
Informatics & Mathematical Modeling, Technical University of Denmark, Lyngby, Denmark;IBM T.J. Watson Research Center, Yorktown Heights, NY
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 6
Cited 0

An extended set of FORTRAN basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
A recursive formulation of Cholesky factorization of a matrix in packed storage

ACM Transactions on Mathematical Software (TOMS)
A fully portable high performance minimal storage hybrid format Cholesky algorithm

ACM Transactions on Mathematical Software (TOMS)
Rectangular full packed format for LAPACK algorithms timings on several computers

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three versions of a High Performance Minimal Storage Cholesky Algorithm which uses New Data Structures are briefly described. The formats are Recursive Packed (RP), Rectangular Full Packed (RFP), and Block Packed Hybrid Formats. They all exhibited high performance on many computers on which we have done timing studies.