Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

Journal Article · · Parallel Computing
 [1]
  1. Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Here, in this paper, we consider the symbolic factorization step in computing the Cholesky factorization of a sparse symmetric positive definite matrix on distributed-memory multiprocessor systems. By exploiting the supernodal structure in the Cholesky factor, the performance of a previous parallel symbolic factorization algorithm is improved. Empirical tests demonstrate that there can be drastic reduction in the execution time required by the new algorithm on an Intel iPSC/2 hypercube.

Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
USDOE Office of Science (SC)
Grant/Contract Number:
AC05-84OR21400
OSTI ID:
5456424
Report Number(s):
ORNL/TM--11836; ON: DE91014967
Journal Information:
Parallel Computing, Journal Name: Parallel Computing Journal Issue: 2 Vol. 19; ISSN 0167-8191
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English

References (19)

Yale sparse matrix package I: The symmetric codes journal August 1982
Symbolic Cholesky factorization on a local-memory multiprocessor journal July 1987
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor journal June 1988
Communication results for parallel sparse Cholesky factorization on a hypercube journal May 1989
Solution of sparse positive definite systems on a hypercube journal September 1989
The Role of Elimination Trees in Sparse Factorization journal January 1990
Nested Dissection of a Regular Finite Element Mesh journal April 1973
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems journal October 1978
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization journal November 1989
The Evolution of the Minimum Degree Ordering Algorithm journal March 1989
Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy journal September 1991
The Design of a User Interface for a Sparse Matrix Package journal June 1979
A New Implementation of Sparse Gaussian Elimination journal September 1982
The Multifrontal Solution of Indefinite Sparse Symmetric Linear journal September 1983
A compact row storage scheme for Cholesky factors using elimination trees journal June 1986
The influence of relaxed supernode partitions on the multifrontal method journal December 1989
Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers journal December 1987
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors report April 1991
On Finding Supernodes for Sparse Matrix Computations report June 1990

Similar Records

A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
Journal Article · Thu Jul 01 00:00:00 EDT 1993 · SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States) · OSTI ID:7369124

A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Technical Report · Sun Mar 31 23:00:00 EST 1991 · OSTI ID:5896533

Matrix factorization on a hypercube multiprocessor
Conference · Thu Aug 01 00:00:00 EDT 1985 · OSTI ID:5653196