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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer methods in applied mechanics and engineering Ročník 184; číslo 2; s. 501 - 520
Hlavní autoři: Amestoy, P.R., Duff, I.S., L'Excellent, J.-Y.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.01.2000
Elsevier
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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