In this paper, two efficient approaches will be discussed that support linear network analysis: supernode analysis (SNA) and reduced loop analysis (RLA). By means of some selected example networks, these methods will be demonstrated and, thus, it will be shown that calculations can be dramatically simplified. In this way, all network situations can be handled. There are obvious advantages to SNA as it combines the MNA and the straightforward manual processing of the network. A very efficient solution strategy is obtained without source shifting and other common, less directed methods being used. SNA/RLA and symbolic algebra fit extremely well together. Thus an algorithm that supports the symbolic calculation of networks by means of supernodes which has been conceptualized and implemented in the analog design expert system EASY will be presented in detail. Above the educational aspect, it should be noted that the computer can now take a systematic approach to MNA and network analysis in general.
1. There exist some extreme situations in which these additional equations are needed to express controlling currents.2. Generalized cut-sets are not necessarily minimal cut-sets [2]. This means that the removal of a generalized cut-set may split the network graph into more than only two components.
3. Remark: This notation means that the current is in the frequency domain, commonly known as a phasor.
4. This intuitive explanation will be confirmed in Section 7.
5. These compactions are exactly the same as those applied by the CMNA implemented in ISAAC [7, 8, 11]. In fact, the CMNA is isomorphic to the SNA.
6. Not subject of this paper.