کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
502259 | 863696 | 2015 | 13 صفحه PDF | دانلود رایگان |
Frequency domain formulations of computational electromagnetic problems often require the solutions of complex-valued non-Hermitian systems of equations, which are still symmetric. For this kind of problems a whole class of sub-variant solver methods derived from the complex-valued Bi-Conjugate Gradient method is available. This class of methods contains established iterative methods as the Conjugate Orthogonal Conjugate Gradient (COCG) method, Bi-Conjugate Gradient Conjugate Residual (BiCGCR) method and Conjugate AA-Orthogonal Conjugate Residual (COCR) method. The mathematical equivalence of the BiCGCR method and COCR method is shown and preconditioned variants of the various solvers are derived. An efficient kind of two-step preconditioning technique is also proposed. Numerical experiments involving e.g. electro-quasistatic frequency domain simulation are employed to show the difference in the convergence behaviors of these iterative methods and effectiveness of the two-step preconditioning techniques.
Journal: Computer Physics Communications - Volume 191, June 2015, Pages 52–64