%0 Journal Article
%T COMPLETE DIRECTED TREES ANALYSIS METHOD FOR LINEAR ACTIVE NETWORKS<br>线性有源网络的完全有向树分析法
%A Huang Ruji
%A <br>黄汝激
%J 电子与信息学报
%D 1985
%I 
%X The concepts of positive (negative) root complete directed trees and positive (negative) 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.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=9B8844B6689E6AD1&yid=74E41645C164CD61&vid=DF92D298D3FF1E6E&iid=E158A972A605785F&sid=01622E3E475F966C&eid=4FE459D71E3BF8EB&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=8