A balanced decomposition algorithm for parallel solutions of very large sparse systems
Conference
·
OSTI ID:125548
- Santa Clara Univ., CA (United States)
In this paper we present an algorithm for balanced bordered block diagonal (BBD) decompositions of very large symmetric positive definite or diagonally dominant sparse matrices. The algorithm represents a generalization of the method described, and is primarily aimed at parallel solutions of very large sparse systems (> 20,000 equations). A variety of experimental results are provided to illustrate the performance of the algorithm and demonstrate its potential for computing on massively parallel architectures.
- OSTI ID:
- 125548
- Report Number(s):
- CONF-950212--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Block diagonal decompositions for parallel computations of large power systems. Final report
A parallel Gauss-Seidel algorithm for sparse power system matrices
Impact of Reordering on the LU Factorization Performance of Bordered Block-Diagonal Sparse Matrix
Technical Report
·
Mon May 01 00:00:00 EDT 1995
·
OSTI ID:88612
A parallel Gauss-Seidel algorithm for sparse power system matrices
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87622
Impact of Reordering on the LU Factorization Performance of Bordered Block-Diagonal Sparse Matrix
Conference
·
Wed Nov 06 23:00:00 EST 2024
·
OSTI ID:2500374