Premium
Improving preconditioned SOR‐type iterative methods for L ‐matrices
Author(s) -
Dehghan Mehdi,
Hajarian Masoud
Publication year - 2011
Publication title -
international journal for numerical methods in biomedical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.741
H-Index - 63
eISSN - 2040-7947
pISSN - 2040-7939
DOI - 10.1002/cnm.1332
Subject(s) - preconditioner , relaxation (psychology) , convergence (economics) , linear system , iterative method , mathematics , successive over relaxation , computer science , mathematical optimization , algorithm , local convergence , mathematical analysis , psychology , social psychology , economics , economic growth
The preconditioned methods are often used to accelerate the convergence of the iterative methods for solving linear system Ax = b . So far, several preconditioners have been presented and used for solving linear system Ax = b under strong assumptions on A . In this paper, we propose two new preconditioner techniques to solve L ‐matrices linear system and analyze their convergence properly. From the comparison theorems, we can conclude that the proposed preconditioner techniques can be applied to accelerate the convergence of the successive over‐relaxation (SOR) iterative method under mild assumptions on A . Several numerical examples are presented to support the theoretical results of this paper. Copyright © 2009 John Wiley & Sons, Ltd.