@Article{JCM-16-3,
author = {Zhongzhi, Bai and Wang, Deren and Evans, D.J.},
title = {A Class of Asynchronous Matrix Multi-Splitting Multi-Parameter Relaxation Iterations},
journal = {Journal of Computational Mathematics},
year = {1998},
volume = {16},
number = {3},
pages = {221--238},
abstract = {<p style="text-align: justify;">A class of asynchronous matrix multi-splitting multi-parameter relaxation methods, including the asynchronous matrix multisplitting SAOR, SSOR and SGS methods as well as the known asynchronous matrix multisplitting AOR, SOR and GS methods, etc., is proposed for solving the large sparse systems of linear equations by making use of the principle of sufficiently using the delayed information. These new methods can greatly execute the parallel computational efficiency of the MIMD-systems, and are shown to be convergent when the coefficient matrices are $H$-matrices. Moreover, necessary and sufficient conditions ensuring the convergence of these methods are concluded for the case that the coefficient matrices are $L$-matrices.</p>},
issn = {1991-7139},
doi = {https://doi.org/1998-JCM-9155},
url = {https://global-sci.com/article/85687/a-class-of-asynchronous-matrix-multi-splitting-multi-parameter-relaxation-iterations}
}