Preconditioned GSOR iterative method for a class of complex symmetric system of linear equations
Davod Hezari, Vahid Edalatpour, Davod Khojasteh Salkuyeh

TL;DR
This paper introduces a preconditioned GSOR iterative method for complex symmetric linear systems, demonstrating improved convergence through spectral radius reduction and optimal parameter selection, validated by numerical experiments.
Contribution
It develops a novel preconditioned GSOR method with theoretical analysis and numerical validation for complex symmetric linear systems.
Findings
Preconditioned GSOR reduces spectral radius compared to standard GSOR.
Optimal iteration parameters are identified for improved convergence.
Numerical experiments confirm theoretical advantages and effectiveness.
Abstract
In this paper, we present a preconditioned variant of the generalized successive overrelaxation (GSOR) iterative method for solving a broad class of complex symmetric linear systems. We study conditions under which the spectral radius of the iteration matrix of the preconditioned GSOR method is smaller than that of the GSOR method and determine the optimal values of iteration parameters. Numerical experiments are given to verify the validity of the presented theoretical results and the effectiveness of the preconditioned GSOR method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Electromagnetic Scattering and Analysis · Advanced Numerical Methods in Computational Mathematics
