Department of Applied Mathematics, Ayandegan Institute of Higher Education, Tonekabon, Iran
Abstract: (3973 Views)
Systems of linear equations are ubiquitous in science and engineering, and iterative methods are indispensable for the numerical treatment of such systems. When we apprehend what properties of the coefficient matrix account for the rate of convergence, we may multiply the original system by some nonsingular matrix, called a preconditioner, so that the new coefficient matrix possesses better properties. Recently, some scholars presented several preconditioners and based on numerical tests proposed some conjectures for preconditioned iterative methods. In this paper, we prove one conjecture on the preconditioned Gauss–Seidel iterative method for solving linear systems whose coefficient matrix is an M-matrix.
Edalatpanah S A, Najafi S E. Proof of a conjecture of Yuan and Zontini on preconditioned methods for M-matrices. International Journal of Applied Operational Research 2019; 9 (4) :49-54 URL: http://ijorlu.liau.ac.ir/article-1-600-en.html