Nonstationary parallel relaxed multisplitting methods Original Research Article

Relaxed nonstationary multisplitting methods are studied for the parallel solution of nonsingular linear systems. Convergence results of the synchronous and asynchronous versions for systems with H-matrices are presented. Computational results of these methods on a shared memory multiprocessor vector computer are reported. These results show that nonstationary methods (synchronous and asynchronous) are better than the standard ones, especially when the matrix of the linear system has a relatively small bandwidth. Moreover, asynchronous versions always behave better than the synchronous ones.