On the convergence of the parallel multisplitting PSD algorithm

Abstract

O'Leary and White have suggested a parallel multisplitting iteration scheme of solving a nonsingular linear system Ax = b. We present a class of relaxed parallel multisplitting algorithms called the parallel multisplitting PSD (MPSD) algorithm of solving same system. Based on the new algorithm model, we establish another algorithm called the extrapolated MPSD algorithm. If A is an H-matrix, these methods converge under suitable conditions.

Keywords:

• Linear system
• multisplitting
• MPSD algorithm
• convergence

C.R. Categories::

• G.1.3