scholarly journals Preconditioned GSOR iterative method for a class of complex symmetric system of linear equations

2015 ◽  
Vol 22 (4) ◽  
pp. 761-776 ◽  
Author(s):  
Davod Hezari ◽  
Vahid Edalatpour ◽  
Davod Khojasteh Salkuyeh
2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Jituan Zhou ◽  
Ruirui Wang ◽  
Qiang Niu

A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newton’s iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.


2015 ◽  
Vol 15 (08) ◽  
Author(s):  
Yuri Berchun ◽  
Pavel Burkov ◽  
Ayyyna Chirkova ◽  
Sayyyna Prokopieva ◽  
Dmitri Rabkin ◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Shi-Liang Wu ◽  
Yu-Jun Liu

Hadjidimos (1978) proposed a classical accelerated overrelaxation (AOR) iterative method to solve the system of linear equations, and discussed its convergence under the conditions that the coefficient matrices are irreducible diagonal dominant,L-matrices, and consistently orders matrices. In this paper, a new version of the AOR method is presented. Some convergence results are derived when the coefficient matrices are irreducible diagonal dominant,H-matrices, symmetric positive definite matrices, andL-matrices. A relational graph for the new AOR method and the original AOR method is presented. Finally, a numerical example is presented to illustrate the efficiency of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document