On finding supernodes for sparse matrix computations
- York Univ., Toronto, ON (Canada). Dept. of Computer Science
- Oak Ridge National Lab., TN (USA)
A simple characterization of fundamental supernodes is given in terms of the row subtrees of sparse Cholesky factors in the elimination tree. Using this characterization, we present an efficient algorithm that determines the set of such supernodes in time proportional to the number of nonzeros and equations in the original matrix. Experimental results are included to demonstrate the use of this algorithm in the context of sparse supernodal symbolic factorization. 18 refs., 3 figs., 3 tabs.
- Research Organization:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- DOE/ER
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6756314
- Report Number(s):
- ORNL/TM-11563; ON: DE90013626
- Country of Publication:
- United States
- Language:
- English
Similar Records
A supernodal all-pairs shortest path algorithm
Computing row and column counts for sparse QR and LU factorization
An efficient algorithm to compute row and column counts for sparse Cholesky factorization
Conference
·
Sat Feb 01 00:00:00 EST 2020
·
OSTI ID:6756314
+1 more
Computing row and column counts for sparse QR and LU factorization
Journal Article
·
Mon Jan 01 00:00:00 EST 2001
· BIT Numerical Mathematics
·
OSTI ID:6756314
+1 more
An efficient algorithm to compute row and column counts for sparse Cholesky factorization
Technical Report
·
Tue Sep 01 00:00:00 EDT 1992
·
OSTI ID:6756314