Efficient dynamic models for induction machines
β Scribed by P. Sewell; K. J. Bradley; J. C. Clare; P. W. Wheeler; A. Ferrah; R. Magill
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 329 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0894-3370
No coin nor oath required. For personal study only.
β¦ Synopsis
A computationally e$cient reluctance mesh model suitable for simulating the dynamic performance of practical induction motors is presented. The calculation time is minimized by direct computation of rate of change of #ux, avoiding unnecessary evaluation of time and rotor position dependent inductances. The magnetic, electrical and dynamic models of the machine are coupled so that the simulation determines both steady state and transient behaviour including the e!ects of saturation and high order torque harmonics due to the rotor and stator teeth. The algorithm is developed from rigorous "eld theory. This is combined with and simpli"ed by, practical experience, resulting in a procedure that can e$ciently simulate 3D machines within an iterative design environment without requiring extensive computational resources. Full details of the implementation are presented along with simulations and experimental characterization of a practical induction motor which are found to be in &excellent' agreement.
π SIMILAR VOLUMES
After many years of research, somitogenesis is still one of the major unresolved problems in developmental biology. Recent experimental findings show a novel type of pattern formation in which a signal sweeps along the presomitic mesoderm and narrows simultaneously as a new somite is formed. The sig
This paper considers the dynamic linear programming model for multispecies livestock farming with a feed production subsystem. The problem is to determine the optimal livestock mix with the projected growth rate and corresponding development of feed production in order to obtain the maximum profit
A coarse-grain parallel program typically has one thread (task) per processor, whereas a finegrain program has one thread for each independent unit of work. Although there are several advantages to fine-grain parallelism, conventional wisdom is that coarse-grain parallelism is more efficient. This p
We consider the component testing problem of a system where the main feature is that the component failure rates are not constant parameters, but they change in a dynamic fashion with respect to time. More precisely, each component has a piecewise-constant failure-rate function such that the lifetim