线性有源网络的主子图分析法
PRIMARY SUBGRAPH METHOD FOR LINEAR ACTIVE NETWORK ANALYSIS
-
摘要: 本文引入了线性有源网络所伴随的混合图的主子图的概念,并提出分析线性有源网络用的一种新的拓朴方法,称为主子图法。该法是完全树法和有向树法的改革和统一。它解决了符号计算问题和对消项问题。它的符号计算比完全树法的简单得多。它没有对消项,这一点优于有向树法。
-
关键词:
Abstract: In this paper, the concept of the primary subgraph of a composite graph associated with a linear active network is introduced, and a new topological method, called the primary subgraph method, for linear active network analysis is presented. This method is the reform and unification of the complete tree method and directed tree method. It has solved the sign evaluation problem and eancellation term problem. Its sign evaluation is far simpler than the complete tree method. It is superior to the directed tree method since it has no cancellation terms. -
W. Mayeda, Graph Theory, New York: John Wiley and Sons, Inc., 1972, chap. 8.[2]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, chap. 4.[3]W. K. Chen, IEEE Trans. on CT, CT-13(1966), 438.[4]黄汝激,电子科学学刊, 7(1985), 81.[5]黄汝激,电子科学学刊,7(1985), 254.[6]W. K, Chen, IEEE Trans. on CT, CT-19(1972), 241.[7]W. Mayeda, S. L. Hakimi,W.K, chen and N. Deo, ibid., CT-15 (1968 ), 101. -
计量
- 文章访问数: 1803
- HTML全文浏览量: 169
- PDF下载量: 362
- 被引次数: 0
下载:
