Preconditioned iterative solver on the coarsest level of a multi-grid method for high frequency time harmonic electromagnetic field analyses
- 54 Downloads
- 2 Citations
Abstract
A multi-grid method is one of the most powerful linear solvers for finite element electromagnetic field analysis. However, as the discretized model has recently been enlarged, a solution process for a linear system arising on the coarsest level tends to be problematic in a complete multi-grid solution process. Whereas a linear system on the coarsest level is generally solved by a direct solver, we solve it here by means of an iterative solver to reduce the memory requirements. Since a conventional preconditioning technique is not effective for such a linear system, we introduce preconditioning techniques based on Arnold, Falk, and Winther’s and on Hiptmair’s smoothers. Numerical tests show that the newly installed preconditioning technique greatly improves the convergence rate.
Keywords
Multigrid Method Coarse Level Iterative Solver Direct Solver Spiral InductorPreview
Unable to display preview. Download preview PDF.
References
- 1.Arnold D., Falk R. and Winther R. (2000). Multigird in H(div) and H(curl). Numer. Math. 85: 197–218 MATHCrossRefMathSciNetGoogle Scholar
- 2.Benzi M. and Tuma M. (2003). A robust incomplete factorization preconditioner for positive definite matrices. Numer. Linear Algebra Appl. 10: 385–400 MATHCrossRefMathSciNetGoogle Scholar
- 3.Briggs W., Henson V. and McCormick S. (2000). A Multigrid Tutorial, 2nd edn. SIAM, Philadelphia MATHGoogle Scholar
- 4.Chan T.F., Gallopoulos E., Simoncini V., Szeto T. and Tong C.H. (1994). A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems. SIAM J. Sci. Comput. 15(2): 338–347 MATHCrossRefMathSciNetGoogle Scholar
- 5.Erlangga Y., Oosterlee C. and Vuik C. (2006). A novel multigrid based preconditioner for heterogeneous Helmholtz problems. SIAM J. Sci. Comput. 27(4): 1471–1492 MATHCrossRefMathSciNetGoogle Scholar
- 6.Freund, R.W., Nachtigal, N.M.: A new Krylov-subspace method for symmetric indefinite linear systems. IMACS, pp. 1253–1256 (1994)Google Scholar
- 7.Gopalakrishnan J., Pasciak J. and Demkowicz L. (2004). Analysis of a multigrid algorithm for time harmonic maxwell equations. SIAM J. Numer. Anal. 42(1): 90–108 MATHCrossRefMathSciNetGoogle Scholar
- 8.Hiptmair R. (1998). Multigrid method for Maxwell’s equations. SIAM J. Numer. Anal. 36(1): 204–225 MATHCrossRefMathSciNetGoogle Scholar
- 9.Reitzinger S. and Schoberl J. (2002). An algebraic multigrid method for finite element discretizations with edge elements. Numer. Linear Algebra 9: 223–238 MATHCrossRefMathSciNetGoogle Scholar
- 10.Saad Y. (2002). Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia Google Scholar
- 11.Sleijpen C.L.G. and Fokkema D.R. (1993). BICGSTAB(L) for linear equations involving unsymmetric matrices with complex spectrum. Electron. Trans. Numer. Anal. 1: 11–32 MATHMathSciNetGoogle Scholar
- 12.Sogabe, T., Zhang, S.: A COCR method for solving complex symmetric linear systems. J. Comput. Appl. Math. (to appear)Google Scholar
- 13.van der Vorst H.A. and Melissen J.B.M. (1990). A Petrov-Galerkin type method for solving Ax = b where A is symmetric complex. IEEE Trans. Magn. 26(2): 706–708 CrossRefGoogle Scholar
- 14.Yosui, K., Mori, M., Iwashita, T., Kobayashi, T., Abe, S.: Comparison of multiplicative Schwarz procedure type preconditioners in high frequency time harmonic electromagnetic field analyses, in Book of Abstracts of 8th European Multigrid Conference on Multigrid, Multilevel and Multiscale Methods (2005)Google Scholar
- 15.Zhang S. (1997). GPBi-CG: generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 18(2): 537–551 MATHCrossRefGoogle Scholar