Python利纳格艾格不服从PerronFrobenius理论

Question

更新：

它与scipy.sparse.linalg.eigs method一起工作，但仍然不能与scipy.linalg.eigs一起使用。在

我有一个实的，正的，方阵，我试图找到它的第一个（最大）特征向量。根据Perron-Frobenius定理，最大的特征向量应该有所有的正项，但在我的例子中却没有

def build_adj_matrix(G):
  matrix = np.zeros(shape=(34,34))

  for i in range(0,34):
    for j in range(0,34):
        if j+1 in G.adj[i+1]:
            matrix[i][j] = 1.00001
        else:
            matrix[i][j] = 0.00001

  return matrix

这是我检索特征向量的代码：

^{pr2}$

。。。在

M = build_adj_matrix(G)
evals, evecs = LA.eig(M)
print(evecs)

我的输出是：

   [  3.55489549e-01 +0.00000000e+00j   3.86861181e-01 +0.00000000e+00j
   3.17170097e-01 +0.00000000e+00j   2.77301505e-01 +0.00000000e+00j
   5.54686086e-01 +0.00000000e+00j  -1.97848347e-01 +0.00000000e+00j
  -1.71390654e-01 +0.00000000e+00j  -1.42227261e-02 +0.00000000e+00j
   1.87538203e-03 +0.00000000e+00j  -6.71077427e-02 +0.00000000e+00j
   5.93338345e-02 +0.00000000e+00j   3.80034428e-02 +0.00000000e+00j
  -1.51430299e-01 +0.00000000e+00j  -6.33215778e-02 +0.00000000e+00j
   1.43005327e-01 +0.00000000e+00j  -7.33049336e-02 +0.00000000e+00j
  -1.64571850e-01 +0.00000000e+00j   5.91985880e-02 +0.00000000e+00j
  -1.31441525e-01 +0.00000000e+00j   1.35954155e-01 +0.00000000e+00j
  -2.30981270e-02 +0.00000000e+00j  -1.86533000e-01 +0.00000000e+00j
   7.84949962e-02 +0.00000000e+00j   9.41416444e-06 +0.00000000e+00j
  -1.92116017e-17 +0.00000000e+00j   1.10600656e-16 +0.00000000e+00j
   1.75023609e-17 -1.35088126e-17j   1.75023609e-17 +1.35088126e-17j
   4.75348687e-17 +0.00000000e+00j  -1.99584575e-18 +2.25485520e-17j
  -1.99584575e-18 -2.25485520e-17j  -6.78262748e-18 -8.13743189e-17j
  -6.78262748e-18 +8.13743189e-17j   8.83354389e-17 +0.00000000e+00j]