Sparse pattern selection strategies for robust Frobenius-norm minimization preconditioners in electromagnetism

作     者：Carpentieri, B Duff, IS Giraud, L 

作者机构：CERFACS F-31057 Toulouse France Rutherford Appleton Lab Didcot OX11 0QX Oxon England 

出 版 物：《NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS》 (数值线性代数及其应用)

年 卷 期：2000年第7卷第7-8期

页      面：667-685页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：preconditioning techniques Frobenius-norm minimization method non-zero pattern selection strategies electromagnetic scattering applications 

摘      要：We consider preconditioning strategies for the iterative solution of dense complex symmetric non-Hermitian systems arising in computational electromagnetics. We consider in particular sparse approximate inverse preconditioners that use static non-zero pattern selection. The novelty of our approach comes from using a different non-zero pattern selection procedure for the original matrix from that for the preconditioner and from exploiting geometric or topological information from the underlying meshes instead of using methods based on the magnitude of the entries. The numerical and computational efficiency of the proposed preconditioners are illustrated on a set of model problems arising both from academic and from industrial applications. The results of our numerical experiments suggest that the new strategies are viable approaches for the solution of large-scale electromagnetic problems using preconditioned Krylov methods. In particular, our strategies are applicable when fast multipole techniques are used for the matrix-vector product on parallel distributed memory computers. Copyright (C) 2000 John Wiley & Sons, Ltd.