2017/05/06 by Davod Khojasteh Salkuyeh, Salkuyeh, Davod Khojasteh
Computer Science · Mathematics · Physics and Astronomy · #65F10 #65F50 #Advanced Optimization Algorithms Research #Electromagnetic Scattering and Analysis #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.1705.02468
openalex publication_date 2017/05/06 · openalex created_date 2017/05/19 · openalex updated_date 2026/07/28
Based on the Scale-Splitting (SCSP) iteration method presented by Hezari et al. in (A new iterative method for solving a class of complex symmetric system linear of equations, Numerical Algorithms 73 (2016) 927-955), we present a new two-step iteration method, called TSCSP, for solving the complex symmetric system of linear equations (W+iT)x=b, where W and T are symmetric positive definite and symmetric positive semidefinite matrices, respectively. It is shown that if the matrices W and T are symmetric positive definite, then the method is unconditionally convergent. The optimal value of the parameter, which minimizes the spectral radius of the iteration matrix is also computed. Numerical comparisons of the TSCSP iteration method with the SCSP, the MHSS, the PMHSS and the GSOR methods are given to illustrate the effectiveness of the method.