Two Efficient Inexact Algorithms for a Class of Large Sparse Complex Linear Systems
- 118 Downloads
Recently Salkuyeh et al. (Int J Comput Math 92:802–815, 2015) studied the generalized SOR (GSOR) iterative method for a class of complex symmetric linear system of equations. In this paper, we present an inexact variant of the GSOR method in which the conjugate gradient and the preconditioned conjugate gradient methods are regarded as its inner iteration processes at each step of the GSOR outer iteration. Moreover, we construct a new method called shifted GSOR iteration method which is obtained from combination of a shift-splitting iteration scheme and the GSOR iteration method. The convergence analysis of the proposed methods are presented. Some numerical experiments are given to show the performance of the methods and are compared with those of the inexact MHSS method.
Mathematics Subject Classification65F10 93C10
KeywordsComplex symmetric systems real equivalent form inexact algorithm shift splitting GSOR method
Unable to display preview. Download preview PDF.
- 14.Dijk, W.V., Toyama, F.M.: Accurate numerical solutions of the time-dependent Schrdinger equation. Phys. Rev. E 75 (2007)Google Scholar
- 16.Frommer, A., Lippert, T., Medeke, B., Schilling, K. (eds.): Numerical challenges in lattice quantum chromodynamics. In: Lecture Notes in Computational Science and Engineering, vol. 15, pp. 66–83 (2000)Google Scholar
- 21.Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)Google Scholar