THE COMPUTATIONAL-COMPLEXITY OF THE QUADRANT INTERLOCKING (QI) ITERATIVE METHODS ON SHARED-MEMORY PARALLEL COMPUTERS

Authors
EVANS DJ ABDULLAH R
Citation
Dj. Evans et R. Abdullah, THE COMPUTATIONAL-COMPLEXITY OF THE QUADRANT INTERLOCKING (QI) ITERATIVE METHODS ON SHARED-MEMORY PARALLEL COMPUTERS, International journal of computer mathematics, 67(3-4), 1998, pp. 391-410
Citations number
8
Categorie Soggetti
Mathematics,Mathematics
Journal title
International journal of computer mathematics
ISSN journal
00207160 → ACNP
Volume
67
Issue
3-4
Year of publication
1998
Pages
391 - 410
Database
ISI
SICI code
Abstract
In this paper the Quadrant Interlocking (QI) matrix splitting is shown to yield parallel iterative methods for the solution of linear equati ons with improved convergence rates for both synchronous and asynchron ous versions of the algorithms.