【摘要】 本文提出了正(负)根完全有向树和正(负)根完全有向k树的概念和线性有源网络的正(负)根完全有向树分沂法。这个方法是完全树法与有向树法的统一。它没有符号问题与对消项问题。更多还原

【Abstract】 The concepts of positive (negative) root complete directed trees and positive (ne-gative) root complete directed k-trees and a positive (negative) root complete directed trees analysis method for linear active networks are presented. This method is the unification of complete trees method and directed trees method. It does not involve any sign problem and cancellation terms problem.更多还原