Generalized successive overrelaxation iterative method for a class of complex symmetric linear system of equations

2014 ◽  
Vol 92 (4) ◽  
pp. 802-815 ◽  
Author(s):  
Davod Khojasteh Salkuyeh ◽  
Davod Hezari ◽  
Vahid Edalatpour
2014 ◽  
Vol 47 (2) ◽  
Author(s):  
Davod Khojasteh Salkuyeh

AbstractIn this paper, a new two-step iterative method for solving symmetric positive semidefinite linear system of equations is presented. A sufficient condition for the semiconvergence of the method is also given. Some numerical experiments are presented to show the efficiency of the proposed method.


Filomat ◽  
2018 ◽  
Vol 32 (19) ◽  
pp. 6563-6573 ◽  
Author(s):  
Debasisha Mishra

Theory of matrix splittings is a useful tool for finding the solution of a rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit the theory of weak regular splittings for rectangular matrices. Secondly, we propose an alternating iterative method for solving rectangular linear systems by using the Moore-Penrose inverse and discuss its convergence theory, by extending the work of Benzi and Szyld [Numererische Mathematik 76 (1997) 309-321; MR1452511]. Furthermore, a comparison result is obtained which ensures the faster convergence rate of the proposed alternating iterative scheme.


2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
F. Soleymani ◽  
Predrag S. Stanimirović

A method with high convergence rate for finding approximate inverses of nonsingular matrices is suggested and established analytically. An extension of the introduced computational scheme to general square matrices is defined. The extended method could be used for finding the Drazin inverse. The application of the scheme on large sparse test matrices alongside the use in preconditioning of linear system of equations will be presented to clarify the contribution of the paper.


Sign in / Sign up

Export Citation Format

Share Document