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

Full description

Saved in:

Bibliographic Details
Published in:	Computer methods in applied mechanics and engineering Vol. 184; no. 2; pp. 501 - 520
Main Authors:	Amestoy, P.R., Duff, I.S., L'Excellent, J.-Y.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2000 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	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