DocumentCode :
1273926
Title :
An effective method to reduce the computing time of nonlinear time-stepping finite-element magnetic field computation
Author :
Fu, W.N. ; Ho, S.L. ; Li, H.L. ; Wong, H.C.
Author_Institution :
Ansoft Corp., Pittsburgh, PA, USA
Volume :
38
Issue :
2
fYear :
2002
fDate :
3/1/2002 12:00:00 AM
Firstpage :
441
Lastpage :
444
Abstract :
Time-stepping finite-element methods have been widely used to compute the magnetic field of electrical machines. Because the reluctivities of magnetic materials are nonlinear, the finite-element equations have to be solved iteratively. In this paper, an effective method for reducing the computing time of the Newton-Raphson method coupled with the incomplete Cholesky-conjugate gradient algorithm for solving time-stepping finite-element problems is presented. The proposed method is based on a proper prediction of some predefined error tolerances in the iteration processes at each time-stepping finite-element computation. The computational analysis on an induction motor shows that the proposed strategy can reduce the nominal computing time by as much as 50%
Keywords :
Newton-Raphson method; conjugate gradient methods; finite element analysis; induction motors; iterative methods; machine theory; magnetic fields; Newton-Raphson method; computing time; electrical machines; incomplete Cholesky-conjugate gradient algorithm; induction motor; iteration processes; magnetic field computation; nonlinear time-stepping finite-element computation; predefined error tolerances; reluctivities; Couplings; Finite element methods; Induction motors; Iterative algorithms; Iterative methods; Jacobian matrices; Magnetic fields; Magnetic materials; Nonlinear equations; Saturation magnetization;
fLanguage :
English
Journal_Title :
Magnetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9464
Type :
jour
DOI :
10.1109/20.996117
Filename :
996117
Link To Document :
بازگشت