摘要
本文在对“王氏代数”、“k-树组”和“MINTY”这三种求有向树组的典型方法进行分析之后,提出了一种生成有向树组的拓扑方法。这种方法吸收了上述三种方法的优点,即“MINTY”的深度优先,“王氏代数”在经改良后的彻底地消除非树组合类冗余项的能力及“k-树组法”的消除对消类冗余项的能力,且由于方法本身的结构特点,增加了消除由变压器等元件的拓扑结构引起的冗余项的能力,由于引入了广义顶点的概念和能成批的生成有向树,该方法的计算机算法并没有其它算法在引入有向图时的退化现象。
Having analysed the'W-algebra','K-tree terms' and'MINTY', the three typical methods of generating direct tree terms, the paper advances a new topological one. This method incorporates the advantages of the three methods, that is,the depth priority of the'MINTY', the ability to eliminate non-tree combination type redundant terms by the'W-algebra' and the ability to eliminate term cancellations of the'K-tree terms'. It also possesses the ability to eliminate redundant terms caused by the topological constructions of the elements of the transformer. Because of the introduction of the concept about generalized vertex and the ability to generate direct tree terms group by group, the degenerating phenomena shown in other algorithm as the direct graph is introduced will not exist in the computer algorithm of this method.
关键词
有向树组
有源网络
广义树法
symbolic network functions
direct graph
direct tree terms
weight
active network
term cancellations
