We present convergence and comparison theorems on parallel iterative multisplitting methods with different weighting schemes. In particular, we show that certain Gauss-Seidel multisplittings cannot converge faster than the usual Gauss-Seidel method. We also give numerical results on a 64 processor local memory computer. These experiments show that the ‘naive’ use of multisplittings can easily produce unsatisfactory results on parallel computers with more than just a few process
展开▼