Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements
Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements
复制标题
使用边缘单元求解 3D 静磁问题的高效预处理迭代线性求解器
DOI:
10.4208/aamm.oa-2018-0207
复制
发表时间:
2020-04-01
影响因子:
1.4
通讯作者:
Zhao, Ran
中科院分区:
文献类型:
--
作者:
Gu, Xianming;Zhao, Yanpu;Zhao, Ran
For numerical computation of three-dimensional (3-D) large-scale magnetostatic problems, iterative solver is preferable since a huge amount of memory is needed in case of using sparse direct solvers. In this paper, a recently proposed Coulombgauged magnetic vector potential (MVP) formulation for magnetostatic problems is adopted for finite element discretization using edge elements, where the resultant linear system is symmetric but ill-conditioned. To solve such linear systems efficiently, we exploit iterative Krylov subspace solvers by constructing three novel block preconditioners, which are derived from conventional block Jacobi, Gauss-Seidel and constraint preconditioners. Spectral properties and practical implementation details of the proposed preconditioners are also discussed. Then, numerical examples of practical simulations are presented to illustrate the efficiency and accuracy of the proposed methods. AMS subject classifications: 65F08, 65N30, 78A30