A nested decomposition algorithm for parallel computations of very large sparse systems
In this paper 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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1995-01-01
|
| Series: | Mathematical Problems in Engineering |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S1024123X95000068 |
| Summary: | In this paper 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×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. |
|---|---|
| ISSN: | 1024-123X 1563-5147 |