A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors

This paper presents a parallel sparse Cholesky factorization algorithm for shared-memory MIMD multiprocessors. The algorithm is particularly well suited for vector supercomputers with multiple processors, such as the Cray Y-MP. The new algorithm is a straightforward parallelization of the left-looki...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on scientific computing Vol. 14; no. 4; pp. 761 - 769
Main Authors:	Ng, Esmond, Peyton, Barry W.
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.07.1993
Subjects:	Algorithms Exact sciences and technology Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Sparsity Supercomputers Supercomputer Parallel algorithm Linear system Cholesky method Sparse matrix MIMD computer Factorization Shared memory
ISSN:	1064-8275, 1095-7197
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!