Parallel and fully recursive multifrontal sparse Cholesky

We describe the design, implementation, and performance of a new parallel sparse Cholesky factorization code. The code uses a multifrontal factorization strategy. Operations on small dense submatrices are performed using new dense matrix subroutines that are part of the code, although the code can a...

Full description

Bibliographic Details

Published in:	Future generation computer systems Vol. 20; no. 3; pp. 425 - 440
Main Authors:	Irony, Dror, Shklarski, Gil, Toledo, Sivan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2004
Subjects:	Block layouts Cilk Multifrontal factorizations Parallel Cholesky factorization Recursive factorizations Recursive layouts Sparse Cholesky factorization Parallel Cholesky factorization Recursive factorizations Cilk Block layouts Sparse Cholesky factorization Multifrontal factorizations Recursive layouts
ISSN:	0167-739X, 1872-7115
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!