線性有源網(wǎng)絡(luò)的完全有向樹分析法
COMPLETE DIRECTED TREES ANALYSIS METHOD FOR LINEAR ACTIVE NETWORKS
-
摘要: 本文提出了正(負)根完全有向樹和正(負)根完全有向k樹的概念和線性有源網(wǎng)絡(luò)的正(負)根完全有向樹分沂法。這個方法是完全樹法與有向樹法的統(tǒng)一。它沒有符號問題與對消項問題。
-
關(guān)鍵詞:
Abstract: 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. -
W. Mayeda, Graph Theory, John Wiley and Sons, Inc., 1972, Ch. 8.[2]S. P. Chan, Introductory Topological Analysis of Electrical Networks, New York: Holt, Rinehart and Winston, 1969, Ch. 8.[3]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, Ch. 4[4]陳樹柏主編,網(wǎng)絡(luò)圖論及其應(yīng)用,科學出版社,1982,第七章.[5]黃汝激,有源網(wǎng)絡(luò)不定導納矩陣一般k階余因式的拓撲表達式,電子科學學刊,2(1985),81.[6]W K. Chen, IEEE Trans. on CT, CT-19 (1972), 241.[7]黃汝激,Chan-Mai,圖定理的改進,北京鋼鐵學院學報,1982年,第2期,第83頁.[8]W .Mayeda, S. L. Hakimi,W.K. Chen and N. Deo, IEEE Trans. on CT, CT-15 (1968), 101. -
計量
- 文章訪問數(shù): 1779
- HTML全文瀏覽量: 164
- PDF下載量: 394
- 被引次數(shù): 0
下載:
