A nested decomposition algorithm for parallel computations of very large sparse systems (Q1287222)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nested decomposition algorithm for parallel computations of very large sparse systems |
scientific article |
Statements
A nested decomposition algorithm for parallel computations of very large sparse systems (English)
0 references
2 May 1999
0 references
Summary: We present a generalization of the balanced border block diagonal (BBD) decomposition algorithm, which was developed for the parallel computation of sparse systems of linear equations. The efficiency of the new procedure is substantially higher, and it extends the applicability of the BBD decomposition to extremely large problems. Examples of the decomposition are provided for matrices as large as \(250,000\times 250,000\), and its performance is compared to other sparse decompositions. Applications to the parallel solution of sparse systems are discussed for a variety of engineering problems.
0 references
balanced border block diagonal decomposition algorithm
0 references
parallel computation
0 references
sparse systems
0 references
performance
0 references
