𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence behaviors of multisplitting methods with relaxed parameters

✍ Scribed by Guang-Hui Cheng; Ting-Zhu Huang; Yan-Fei Jing; Li-Tao Zhang


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
692 KB
Volume
229
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, two multisplitting methods with K + 1 relaxed parameters are established for solving a linear system whose coefficient matrix is a large sparse M-matrix or H-matrix and the corresponding convergence behaviors are studied. Then the implementation of these two methods with ILU factorizations as inner splittings is investigated. Finally, some numerical experiments are presented to illustrate the effectiveness of the preconditioners obtained from our methods when combined with BiCGSTAB.


πŸ“œ SIMILAR VOLUMES


On the convergence of the generalized ma
✍ Zhongzhi, Bai πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 302 KB

## ON THE CONVERGENCE OF THE GENERALIZED MATRIX MULTISPLITTING RELAXED METHODS '2k(R1,\*1, QJ = (D -R ~E , -\*P,)-'[(I -Q1)D + (Q1-R J E ~ + ( a 1 -\*AF, 9LR2, + Q l h + Hk + W,)l (4) 0 2 ) = (D -R2,4 -\*2Hk>-'[(I -Qz)D + (Q, -Rz)p, + (Q, -\*JH,

A class of asynchronous parallel multisp
✍ Zhong-Zhi Bai πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 170 KB

By the principle of using suciently the delayed information and based on the technique of successively accelerated overrelaxation (AOR), we set up a class of asynchronous multisplitting blockwise relaxation methods for solving the large sparse blocked system of linear equations, which comes from the