擬裂子網(wǎng)絡(luò)可解性的拓?fù)錀l件
TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK
-
摘要: 擬裂子網(wǎng)絡(luò)的可解性問(wèn)題,是電網(wǎng)絡(luò)理論的基礎(chǔ)研究課題之一。本文不僅給出了可解性的數(shù)學(xué)表達(dá)式條件,而且給出了等效的拓?fù)錀l件。這對(duì)如何有效地選擇測(cè)試點(diǎn)具有直觀的指導(dǎo)意義。Abstract: The problem for the solvability of pseudo-tearing subnetwark is one of essential investigations of network theory. The results presented would be not only a mathematical conditions, but also a topological conditions for subnetwork solvability. It should guide intuitively to the design of accessible nodes.
-
A. E. Salsms, et al.,IEEE Trans. on CAS, CAS-31(1984)7, 609-621.[2]H. Gupta, et al., A Hierarchical Decomposition Approach for Network Analysis, Proc. IEEE Int, Symp. Circuits and Systems, 1982, pp, 643-646.[3]黃東泉,電子學(xué)報(bào),1984年, 第4期, 第28-34頁(yè).[4]Z. F. Huang, et al., IEEE Trans.on CAS, CAS-30(1983)5, 257-265.[5]黃東泉,西安交通大學(xué)學(xué)報(bào),1982年,第6期, 第65-73頁(yè).[6]T. Qzawa, et al., IEEE Trans. on CAS, CAS-30(1983)7, 432-440. -
計(jì)量
- 文章訪問(wèn)數(shù): 1620
- HTML全文瀏覽量: 97
- PDF下載量: 508
- 被引次數(shù): 0
下載:
