An Efficient Algorithm for Transient Calculation of the Electric Networks Including Magnetizing Branches | Zendy

Xiaoqing Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient Algorithm for Transient Calculation of the Electric Networks Including Magnetizing Branches

Author(s) -

Xiaoqing Zhang

Publication year - 2011

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2011/479626

Subject(s) - transient (computer programming) , computation , piecewise linear function , nonlinear system , saturation (graph theory) , algorithm , piecewise , mathematics , computer science , physics , mathematical analysis , quantum mechanics , combinatorics , operating system

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research