不定矩阵的拓扑计算
TOPOLOGICAL COMPUTATION OF INDEFINITE MATRIX
-
摘要: 本文引入线性系统分析中不定矩阵的拓展伴随有向图。仅求出拓展伴随有向图的全部有向树,便同时得到了不定矩阵的一阶和二阶代数余子式,避免了通常求二阶代数余子式需找有向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. -
计量
- 文章访问数: 1982
- HTML全文浏览量: 130
- PDF下载量: 488
- 被引次数: 0
下载:
