Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30891
Title: Application of multi-stage diagonally-implicit runge-kutta algorithm to transient magnetic field computation using finite element method
Authors: Li, HL
Ho, SL 
Fu, WN 
Issue Date: 2012
Source: IEEE transactions on magnetics, 2012, v. 48, no. 2, 6136652, p. 279-282
Abstract: A multi-stage diagonally-implicit Runge-Kutta (DIRK) algorithm is applied to discretize the time variable in transient magnetic field computation using finite element method (FEM). A formulation, which has the same format as the backward Euler (BE) algorithm for both linear and nonlinear problems, is deduced for simple and ready numerical implementation. The DIRK algorithm is compared with the BE algorithm which is an effective and popular algorithm in FEM. The merits and disadvantages of these two algorithms are highlighted. An ingeniously combined algorithm exploiting the merits of both BE and DIRK is presented and a numerical experiment shows that it can significantly improve the accuracy with no additional computing burden. For nonlinear problems, a DIRK nonlinear iteration strategy is presented and it can be shown that the total computing time of one integration time step can be shortened by about 36% without any accuracy loss in the solutions.
Keywords: Computing time
DIRK algorithm
Finite element method
Nonlinear iteration
Transient magnetic field
Publisher: Institute of Electrical and Electronics Engineers
Journal: IEEE transactions on magnetics 
ISSN: 0018-9464
EISSN: 1941-0069
DOI: 10.1109/TMAG.2011.2175481
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Aug 24, 2020

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Sep 13, 2020

Page view(s)

136
Last Week
0
Last month
Citations as of Sep 14, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.