Multifrontal parallel distributed symmetric and unsymmetric solvers

We consider the solution of both symmetric and unsymmetric systems of sparse linear equations. A new parallel distributed memory multifrontal approach is described. To handle numerical pivoting efficiently, a parallel asynchronous algorithm with dynamic scheduling of the computing tasks has been dev...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer methods in applied mechanics and engineering Jg. 184; H. 2; S. 501 - 520
Hauptverfasser: Amestoy, P.R., Duff, I.S., L'Excellent, J.-Y.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.01.2000
Elsevier
Schlagworte:
Computer Science
Distributed memory architecture
Distributed, Parallel, and Cluster Computing
MPI
Multifrontal direct methods
Sparse matrices
Distributed memory architecture
Multifrontal direct methods
Sparse matrices
MPI
ISSN:0045-7825, 1879-2138
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the solution of both symmetric and unsymmetric systems of sparse linear equations. A new parallel distributed memory multifrontal approach is described. To handle numerical pivoting efficiently, a parallel asynchronous algorithm with dynamic scheduling of the computing tasks has been developed. We discuss some of the main algorithmic choices and compare both implementation issues and the performance of the LDL T and LU factorizations. Performance analysis on an IBM SP2 shows the efficiency and the potential of the method. The test problems used are from the Rutherford–Boeing collection and from the PARASOL end users.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0045-7825
1879-2138
DOI:10.1016/S0045-7825(99)00242-X