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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical Problems in Engineering Jg. 1995; H. 1; S. 41 - 57
Hauptverfasser: D. D. SILJAK, A. I. ZEČEVIĆ
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hindawi Limiteds 01.01.1995
Schlagworte:
sparsity
Linear equations
balanced decompositions
parallel computations
ISSN:1024-123X, 1563-5147
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 x 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
DOI:10.1155/S1024123X95000068