A note on minimal essential sets (original) (raw)

Obtaining symbolic network functions of large circuits-an algebraic approach

Proceedings of ISCAS'95 - International Symposium on Circuits and Systems, 1995

In this paper we describe an algebraic method for obtaining the symbolic network functions of large circuits. The method is based on the generalised Laplace theorem and a new technique for block decomposition of the node admittance matrix. Our approach has the advantages of hierarchical decomposition and requires only simple manipulation of the node admittance matrix. We use the modified genetic algorithm to efficiently solve the problem of decomposition of large sparse matrices.

EE-304 Electrical Network Theory [Class Note #3- Tie-Set Matrix] - 2020

Electrical Network Topology, Electrical Network Graph Theory, Tie-Set, Fundamental Loop, Fundamental Circuit, f-loop, f-circuit, Tie-Set Matrix, Loop Matrix, Circuit Matrix, f-Loop Matrix, f-Circuit Matrix

Graphs, networks, incidence matrices

When we use linear algebra to understand physical systems, we often find more structure in the matrices and vectors than appears in the examples we make up in class. There are many applications of linear algebra; for example, chemists might use row reduction to get a clearer picture of what elements go into a complicated reaction. In this lecture we explore the linear algebra associated with electrical networks.