• 论文 • 上一篇    下一篇

精确求出整矩阵的特征多项式的一种算法

张知难   

  1. 新疆大学
  • 出版日期:1988-01-20 发布日期:1988-01-20

张知难. 精确求出整矩阵的特征多项式的一种算法[J]. 数值计算与计算机应用, 1988, 9(1): 9-14.

AN ALGORITHM FOR OBTAINING THE EXACT CHARACTERISTIC POLYNOMIAL OF INTEGER MATRICES

  1. Zhang Zhi-nan Department of Mathematics, Xinjiang University
  • Online:1988-01-20 Published:1988-01-20
确定图的邻接矩阵的特征多项式及其整因式分解,是图论中一个感兴趣的问题。图的邻接矩阵具有对称性,并且它的元素全为非负整数,但是如何得到它的特征多项式并没有真正得到解决。
In this paper we present an algorithm which can be applied in the exact calculation of thecharacteristic polynomial of integer matrices, or specifically, of the adjacency matrices of gra-phs and the Huckel matrices in the theory of molecular orbitals. This algorithm can easily becarried out by computer.
()

[1] J. W. Wilkinson, The algebraic eigenvalue problem, OXFORD, 1965.
[2] 1966. ~~
[3] A. T. Balaban, Chemical application of graph theory, Academic, 1976.
No related articles found!
阅读次数
全文


摘要