A two-level ILU preconditioner for electromagnetic applications

详细信息    查看全文

• 作者：J. Cerdá ; n ^{jcerdan@imm.upv.es" class="auth_mail" title="E-mail the corresponding author} ; J. Marí ; n ; ^{jmarinma@imm.upv.es" class="auth_mail" title="E-mail the corresponding author} ; J. Mas ^{jmasm@imm.upv.es" class="auth_mail" title="E-mail the corresponding author}
• 关键词：65F10 ; 65F08 ; 65F50 ; 31A10
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2017
• 出版时间：1 January 2017
• 年：2017
• 卷：309
• 期：Complete
• 页码：371-382
• 全文大小：1220 K

文摘

Computational electromagnetics based on the solution of the integral form of Maxwell’s equations with boundary element methods require the solution of large and dense linear systems. For large-scale problems the solution is obtained by using iterative Krylov-type methods provided that a fast method for performing matrix–vector products is available. In addition, for ill-conditioned problems some kind of preconditioning technique must be applied to the linear system in order to accelerate the convergence of the iterative method and improve its performance. For many applications it has been reported that incomplete factorizations often suffer from numerical instability due to the indefiniteness of the coefficient matrix. In this context, approximate inverse preconditioners based on Frobenius-norm minimization have emerged as a robust and highly parallel alternative. In this work we propose a two-level ILU preconditioner for the preconditioned GMRES method. The computation and application of the preconditioner is based on graph partitioning techniques. Numerical experiments are presented for different problems and show that with this technique it is possible to obtain robust ILU preconditioners that perform competitively compared with Frobenius-norm minimization preconditioners.