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%.
Original language | English |
---|---|
Pages (from-to) | 441-444 |
Number of pages | 4 |
Journal | IEEE Transactions on Magnetics |
Volume | 38 |
Issue number | 2 I |
DOIs | |
Publication status | Published - 1 Mar 2002 |
Keywords
- Computation time
- Finite element
- ICCG method
- Newton-Raphson method
- Nonlinear
- Time stepping
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Physics and Astronomy (miscellaneous)