線性有源網絡的主子圖分析法
PRIMARY SUBGRAPH METHOD FOR LINEAR ACTIVE NETWORK ANALYSIS
-
摘要: 本文引入了線性有源網絡所伴隨的混合圖的主子圖的概念,并提出分析線性有源網絡用的一種新的拓樸方法,稱為主子圖法。該法是完全樹法和有向樹法的改革和統(tǒng)一。它解決了符號計算問題和對消項問題。它的符號計算比完全樹法的簡單得多。它沒有對消項,這一點優(yōu)于有向樹法。
-
關鍵詞:
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. -
計量
- 文章訪問數: 1855
- HTML全文瀏覽量: 179
- PDF下載量: 367
- 被引次數: 0
下載:
