An efficient algorithm for transient calculation of the electric networks including magnetizing branches (Q410410): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2011/479626 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975744786 / rank
 
Normal rank

Revision as of 23:12, 19 March 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for transient calculation of the electric networks including magnetizing branches
scientific article

    Statements

    An efficient algorithm for transient calculation of the electric networks including magnetizing branches (English)
    0 references
    3 April 2012
    0 references
    Summary: A simplified model of magnetic saturation characteristics is proposed in this paper for transient calculation of the electric networks including magnetizing branches. The model represents the magnetic saturation characteristics by the continuous function instead of the piecewise linear approximation. Based on the proposed model, an efficient transient algorithm is developed. The nonlinear differential equations describing the transient behavior of the magnetizing branches are solved by the semiexplicit Runge-Kutta method, in which noniterative computations are involved. The transient calculation for the remaining linear network is performed in terms of the solution to the magnetizing branches. A comparison is made between calculated and experimental results to confirm the validity of the algorithm.
    0 references
    0 references

    Identifiers