Open Access
2011 The Weaker Convergence of Non-stationary Matrix Multisplitting Methods for Almost Linear Systems
Li-Tao Zhang, Ting-Zhu Huang, Shao-Hua Cheng, Tong-Xiang Gu
Taiwanese J. Math. 15(4): 1423-1436 (2011). DOI: 10.11650/twjm/1500406354

Abstract

In 1999, Arnal et al. [Numerical linear algebra and its applications, 6(1999): 79-92] introduced the non-stationary matrix multisplitting algorithms for almost linear systems and studied the convergence of them. In this paper, we generalize Arnal’s algorithms and study the non-stationary matrix multisplitting multi-parameters methods for almost linear systems. The parameters can be adjusted suitably so that the convergence property of methods can be substantially improved. Furthermore, the convergence results of our new method in this paper are weaker than those of Arnal’s. Finally, numerical examples show that our new convergence results are better and more efficient than Arnal’s.

Citation

Download Citation

Li-Tao Zhang. Ting-Zhu Huang. Shao-Hua Cheng. Tong-Xiang Gu. "The Weaker Convergence of Non-stationary Matrix Multisplitting Methods for Almost Linear Systems." Taiwanese J. Math. 15 (4) 1423 - 1436, 2011. https://doi.org/10.11650/twjm/1500406354

Information

Published: 2011
First available in Project Euclid: 18 July 2017

zbMATH: 1233.65030
MathSciNet: MR2848964
Digital Object Identifier: 10.11650/twjm/1500406354

Subjects:
Primary: 65F10 , 65F15

Keywords: $H$-matrix , $M$-matrix , almost linear systems , non-stationary matrix multisplitting multi-parameters methods

Rights: Copyright © 2011 The Mathematical Society of the Republic of China

Vol.15 • No. 4 • 2011
Back to Top