可对角化矩阵特征值分解扰动问题的快速求解方法

针对特征值扰动计算的传统方法收敛速度慢的问题，提出了一种求解特征值扰动问题的快速迭代算法.首先，通过矩阵变换将初始矩阵的特征值扰动问题转化为对角矩阵的特征值扰动问题.然后，提出了一种快速迭代算法求解扰动参数，同时对算法的收敛性进行分析，并将其与基于摄动级数展开法导出的方法进行对比. 再次，采用逐一求解特征值并进行矩阵降阶的策略，有效降低运算量.最后，通过2个算例分别展示算法的计算过程及其在结构模态参数追踪方面的应用效果.

A Fast Computation Method for Eigenvalue Decomposition Perturbation Problems of Diagonalizable Matrix

A fast iterative algorithm for solving the eigenvalue perturbation problem is proposed in this paper for solving the problem of slow convergence of traditional methods for eigenvalue perturbation calculation. Firstly， the eigenvalue perturbation problem of the initial matrix is transformed into the eigenvalue perturbation problem of the diagonal matrix by matrix transformation. Then， a fast iterative algorithm is proposed to solve the perturbation parameter. The convergence of the algorithm is analyzed and compared with the method derived based on the perturbation series expansion method， and the strategy of solving the eigenvalues one by one and reducing the order of the matrix is adopted to effectively reduce the computation cost. Finally， two examples are used to show the calculation process of the algorithm and its application in the tracking of modal parameters of vibration structures.