Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation (Q847824): Difference between revisions

The paper is devoted to the problem of efficiency of circuit simulation via the differential-algebraic equations (DAEs) which are linear with constant coefficients. The efficiency factor is the index of the obtained DAE. The index of the DAE arising from the modified nodal analysis (the custom technique) is determined uniquely by the circuit structure. Instead, the authors use a broader class of analysis method called the hybrid analysis (HA) proposed by \textit{G. Kron} [Tensor analysis of networks (1939; Zbl 0022.16801; JFM 65.1516.01)] for networks. The HA is based on selecting a partition of elements and a reference tree in the circuit. The selection determines a system of DAEs called the `hybrid equations'. The authors present a combinatorial algorithm for finding a partition and a reference tree which minimize the index of the hybrid equations. The complexity of the algorithm is \(O(n^6)\), where \(n\) is the number of elements in the circuit. In the case when the set of nonzero entries coming from the physical parameters is algebraically independent, the complexity reduces to \(O(n^3)\). Two numerical examples are presented.