Some topologico‐dynamical properties of linear passive reciprocal networks

The paper considers the complete solvability and the order of complexity of passive RLCT (T = multiwinding ideal transformer) networks. A topological approach based on the determinant polynomial of the matrix of hybrid equations, formed as a set of 1st-order differential and algebraic equations, reveals the structure of the formulation tree and the subnetworks accountable for degeneracies. Topological and algebraic degeneracies are defined. Necessary and sufficient conditions for complete solvability are derived, and two algorithms are given to determine the order of complexity topologically, i.e. without having an explicit state-space representation.