Iterative algorithms for solution of large sparse systems of linear equations on hypercubes

Date
1988
Authors
Aykanat, Cevdet
Özgüner, F.
Ercal, F.
Sadayappan, P.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
IEEE Transactions on Computers
Print ISSN
0018-9340 (print)
1557-9956 (online)
Electronic ISSN
Publisher
IEEE
Volume
37
Issue
12
Pages
1554 - 1568
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

Finite-element discretization produces linear equations in the form Ax=b, where A is large, sparse, and banded with proper ordering of the variables x. The solution of such equations on distributed-memory message-passing multiprocessors implementing the hypercube topology is addressed. Iterative algorithms based on the conjugate gradient method are developed for hypercubes designed for coarse-grained parallelism. The communication requirements of different schemes for mapping finite-element meshes onto the processors of a hypercube are analyzed with respect to the effect of communication parameters of the architecture. Experimental results for a 16-node Intel 80386-based iPSC/2 hypercube are presented and discussed.

Course
Other identifiers
Book Title
Keywords
Finite element method, Granularity, Hypercube, Linear equations, Parallel algorithms
Citation
Published Version (Please cite this version)