不定矩陣的拓撲計算
TOPOLOGICAL COMPUTATION OF INDEFINITE MATRIX
-
摘要: 本文引入線性系統(tǒng)分析中不定矩陣的拓展伴隨有向圖。僅求出拓展伴隨有向圖的全部有向樹,便同時得到了不定矩陣的一階和二階代數(shù)余子式,避免了通常求二階代數(shù)余子式需找有向2樹的運算,使不定矩陣的拓撲計算更易于計算機程序化。
-
關鍵詞:
Abstract: A diagraph associated with an indefinite matrix is augmented. Both first-order and second-order cofactors can be obtained by finding all the directed trees in the augmeuted diagraph, and then, the need of computing the directed 2-trees for the second-order cofactors is eliminated. The method proposed here is particularly applicable to computer-programming. -
W.K. Chen, Applied Graph Theory, 2d rev. ed., Amsterdam, North-Holland, 1976, chap. 4.[2]N. Balabanian and T. A. Bickart, Electrical Network Theory, John Wiley and Sons, Inc., 1969,chap. 3.[3]L. O. Chua and P. M. Lin, Computer-Aided Analysis of Electronic Circuits: Algorithms and Computational Techniques, Englewood Cliffs, N. J., Prentice-Hall, 1975, Chap. 14.[4]W. K. Chen, IEEE Trans.on CT, CT-12(1965), 85.[5]W .K. Chen, ibid., CT-13(1966), 440.[6]A. Talbot, ibid., CT-13(1966), 111. -
計量
- 文章訪問數(shù): 2007
- HTML全文瀏覽量: 138
- PDF下載量: 491
- 被引次數(shù): 0
下載:
