Fast Multilevel & Always Cancelation-free Method for Large Electric Networks Exact Symbolic Analysis

The paper presents an algorithm of the exact symbolic network function analysis that deals with circuits with any size. The only condition is to decompose the whole circuit into smaller subcircuits. The decomposition is the multi-level hierarchial one. What is more, the calculation for each level can be done only once. One can reuse the partial results any time when the previously determined subcircuit appears in any analyzed structure. A higher level subcircuit needs only a few information about internal structure of a lower level, so the method can be easily implemented in multiprocessor or distributed systems. Although multilevel and compressed structure, symbolical values remain cancelation-free and any path from the root to the terminal vertex 1 represents a single term. Thus, a large-scale and small-scale sensitivities calculation and elimination of less significant terms could be simply and natural.