摘要
对生成符号网络函数的重要技术问题——冗余项问题进行深入分析。由于广义树方法已从根本上保证不会出现非树组合项 ,要讨论的仅是那些树枝导纳积大小相等符号相反的情况。将这种情况分为两种类型 :第一类冗余项可用一个公式加以解决 ;对于大多数第二类冗余项 ,该方法有自然的消除能力。最后讨论了参考顶点对残留冗余项的影响。
The redundancy item problem which is an important technical problem of generating symbolic network function is discussed. Since the generalized tree-team method guarantees none-tree combination, olny branches with equal admittance product and opposite are addressed. The redundancy items are divided into two classes. A formula is used to deal with the first class. Most redundancy items of the second class can be naturally eliminated. The influence of the remnant redundancy items is also analyzed.
出处
《控制与决策》
EI
CSCD
北大核心
2003年第4期510-512,共3页
Control and Decision
关键词
冗余项
k-树组
广义树
Redundancy item
k -tree teams
Generalized tree-team
