有源網(wǎng)絡(luò)完全k樹多項式的產(chǎn)生及其在網(wǎng)絡(luò)分析中的應(yīng)用
AN ALGORITHM FOR GENERATING ALL PASSIVE-EDGE COMPLETE k-TREE AND ITS APPLICATION IN THE ANALYSIS OF ACTIVE NETWORKS
-
摘要: 本文算法產(chǎn)生有源網(wǎng)絡(luò)無源樹邊的完全k樹多項式,算法時間復(fù)雜度與列寫無向圖全部樹的改進(jìn)的Minty算法相同。用該算法分析有源網(wǎng)絡(luò)的符號函數(shù)可有效地減少對消冗余項數(shù),同時也避免了對無源完全樹邊的符號鑒別問題。文章討論了算法的合理性,并舉例說明了它在網(wǎng)絡(luò)分析中的應(yīng)用。
-
關(guān)鍵詞:
- 網(wǎng)絡(luò)分析; 有源網(wǎng)絡(luò)拓樸圖; 完全k樹多項式
Abstract: An efficient algorithm for generating all passive-edge complete k-trees in symbolic form for general linear active networks is presented. This algorkhm, which is based on Minty s method, processes the topological graph of an active network directly. It can solve he problem of sign evaluation, and can reduce the number of cancellation terms greatly. Finally, an example is given to show its applicarion in the analysis of linear active networks. -
G.J. Minty, IEEE Trans, on CT, CT-12 (1965)3, 119.[2]房大中,天津大學(xué)學(xué)報,1988年,第4期,第108頁.[3]W. Mayeda.[J].Craph Theory, John Wiley Sons, Inc.1972,:-[4]W. K: Chen, IEEE Trans. on CT, CT-12 (1965)3, 85.[5]全茂達(dá),朱英輝編,符號網(wǎng)絡(luò)函數(shù)與不定導(dǎo)納矩陣,高等教育出版社,1984年.[6]黃汝激,電子學(xué)報,1987年,第5期,第8頁. -
計量
- 文章訪問數(shù): 2167
- HTML全文瀏覽量: 171
- PDF下載量: 368
- 被引次數(shù): 0
下載:
