Symbolic Analysis of Linear Circuits with the Determinant Tree Diagram
Roman Dmytryshyn, Benedykt S. Rodanski · UTS ePRESS (University of Technology Sydney) · 2004
In this paper we propose a new approach to solving a problem of th~large number of arithmetical operations in generation of formulae for symbolic analysis of linear circuits.This new approach -called the Determinant Tree Diagram (DTD) method -is based on generating permutations and is an alternative to the well known Determinant Decision Diagram (DDD) method.DTD can be applied in practice to generation of the symbolic solution of determinant of a sparse matrix (e.g, the MNA matrix) in either the bracket notation or the Reverse Polish Notation.