The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers

Abstract

In this paper the Quadrant Interlocking (QI) matrix splitting is shown to yield parallel iterative methods for the solution of linear equations with improved convergence rates for both synchronous and asynchronous versions of the algorithms.

Keywords:

• Iterative methods
• linear equations
• quadrant interlocking splitting
• shared memory computer

C.R. Categories:

• G.1.3
• F.2.1

^*Nottingham Trent University, U.K.

^†Universiti Sains Malaysia.

^*Nottingham Trent University, U.K.

^†Universiti Sains Malaysia.

Notes

^*Nottingham Trent University, U.K.

^†Universiti Sains Malaysia.