NONSTATIONARY PARALLEL RELAXED MULTISPLITTING METHODS

Relaxed nonstationary multisplitting methods are studied for the paral lel 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 n onstationary methods (synchronous and asynchronous) are better than th e standard ones, especially when the matrix of the linear system has a relatively small bandwidth. Moreover, asynchronous versions always be have better than the synchronous ones.