2017/05/06 by Davod Khojasteh Salkuyeh, Salkuyeh, Davod Khojasteh, Tahereh Salimi Siahkolaei +1
Computer Science · Physics and Astronomy · Engineering · #Matrix Theory and Algorithms #Electromagnetic Scattering and Analysis #Numerical methods in engineering
paper · pdf · doi:10.48550/arxiv.1705.02464
We introduce a two-parameter version of the two-step scale-splitting\niteration method, called TTSCSP, for solving a broad class of complex symmetric\nsystem of linear equations. We present some conditions for the convergence of\nthe method. An upper bound for the spectral radius of the method is presented\nand optimal parameters which minimize this bound are given. Inexact version of\nthe TTSCSP iteration method (ITTSCSP) is also presented. Some numerical\nexperiments are reported to verify the effectiveness of the TTSCSP iteration\nmethod and the numerical results are compared with those of the TSCSP, the SCSP\nand the PMHSS iteration methods. Numerical comparison of the ITTSCSP method\nwith the inexact version of TSCSP, SCSP and PMHSS are presented. We also\ncompare the numerical results of the BiCGSTAB method in conjunction with the\nTTSCSP and the ILU preconditioners.\n