Analyzing the procedure of processing algorithm, we found out that they only ne ed c omputation of maximum eigen-value and corresponding eigenvector. 将算法过程稍加分析整理,可发现它们仅仅需要计算最大本征值及对应的本征向量。
Each eigenstate of an observable corresponds to an eigenvector of the operator, and the associated eigenvalue corresponds to the value of the observable in that eigenstate. 每个可见特征值符合操作者一特征向量,而相关的特征值符合特征值里的可见值。
An eigenvalue of a graph is main if it has an eigenvector the sum of whose entries is not equal to zero, all trees with exactly two main eigenvalues have been characterized. 图的一个特征值称为主特征值,如果图有一个相应于该特征值的其各分量之和不为零的特征向量.给出了恰有两个主特征值的所有树.