![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this paper, a class of parallel blockwise matrix multisplitting block relaxation methods, including the blockwise matrix multisplitting block symmetric accelerated overrelaxation method, the blockwise matrix multisplitting block unsymmetric and symmetric successive overrelaxation methods and the blockwise matrix multisplitting block unsymmetric and symmetric Gauss-Seidel methods, etc., is established for the large sparse block system of linear equations, and its convergence theory is set up thorouthly when the coefficient matrix is a block H-matrix. Also, the new methods are further extended by relaxing different block elements of the iterations with different relaxation parameters and, therefore, general frameworks of parallel blockwise matrix multisplitting block relaxation methods for solving the block system of linear equations are naturally obtained.
* Part of this work was reported on The Third China-Japan Joint Seminar on Numerical Mathematics Held in Dalian during August 26-30, 1996.
* Part of this work was reported on The Third China-Japan Joint Seminar on Numerical Mathematics Held in Dalian during August 26-30, 1996.
Notes
* Part of this work was reported on The Third China-Japan Joint Seminar on Numerical Mathematics Held in Dalian during August 26-30, 1996.