CONVERGENCE ANALYSIS OF THE PARALLEL MULTISPLITTING PSD METHOD

In this paper, we propose the parallel multisplitting PSD method, for solving large nonsingular system of linear equations Ax = b. The conve rgence theorems of these new algorithms are established under the cond ition that the coefficient matrix A of linear system is an H-matrix. S ome results also yield new covergence theorem for PSD method. Finally, a numerical example is given to show the superiority of the new algor ithm.