Show simple item record

dc.contributor.authorAykanat, C.en_US
dc.contributor.authorÖzgüner, F.en_US
dc.contributor.authorErcal, F.en_US
dc.contributor.authorSadayappan, P.en_US
dc.date.accessioned2019-02-19T10:56:03Z
dc.date.available2019-02-19T10:56:03Z
dc.date.issued1988en_US
dc.identifier.issn0018-9340 (print)
dc.identifier.issn1557-9956 (online)
dc.identifier.urihttp://hdl.handle.net/11693/49593
dc.description.abstractFinite-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.en_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Transactions on Computersen_US
dc.relation.isversionofhttps://ieeexplore.ieee.org/document/9733en_US
dc.subjectFinite element methoden_US
dc.subjectGranularityen_US
dc.subjectHypercubeen_US
dc.subjectLinear equationsen_US
dc.subjectParallel algorithmsen_US
dc.titleIterative algorithms for solution of large sparse systems of linear equations on hypercubesen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage1554en_US
dc.citation.epage1568en_US
dc.citation.volumeNumber37en_US
dc.citation.issueNumber12en_US
dc.identifier.doi10.1109/12.9733en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record