By Topic

An algebraic multigrid method for solving very large electromagnetic systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Mertens, R. ; Dept. of Electr. Eng., Katholieke Univ., Leuven, Belgium ; De Gersem, H. ; Belmans, R. ; Hameyer, K.
more authors

Although most finite element programs have quite effective iterative solvers such as an incomplete Cholesky (IC) or symmetric successive overrelaxation (SSOR) preconditioned conjugate gradient (CG) method, the solution time may still become unacceptably long for very large systems. Convergence and thus total solution time can be shortened by using better preconditioners such as geometric multigrid methods. Algebraic multigrid methods have the supplementary advantage that no geometric information is needed and can thus be used as black box equation solvers. In the case of a finite element solution of a non-linear magnetostatic problem, the algebraic multigrid method reduces the overall computation time by a factor of 6 compared to a SSOR-CG solver

Published in:

Magnetics, IEEE Transactions on  (Volume:34 ,  Issue: 5 )