Estimating eigenvalue of matrix with particle swarm optimization algorithm
Nie Du-xian
Abstract
Nie Du-xian
Abstract
Based on the Gerschgorin disk theorem and the property of eigenvalue of matrix,the problems of solving eigenvalue are translated into the optimization problem.With particle swarm optimization algorithm and binary search,all eigenvalues of real(complex) matrix are accurately estimated.Compared to the result of the eigenvalues calculated by QR algorithm-based function in Matlab Soft-ware,the absolute errors are less than 10-7.At the same time,the minimum eigenvalue separation estimation problem is solved.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on the Gerschgorin disk theorem and the property of eigenvalue of matrix,the problems of solving eigenvalue are translated into the optimization problem.With particle swarm optimization algorithm and binary search,all eigenvalues of real(complex) matrix are accurately estimated.Compared to the result of the eigenvalues calculated by QR algorithm-based function in Matlab Soft-ware,the absolute errors are less than 10-7.At the same time,the minimum eigenvalue separation estimation problem is solved.
Key concepts: Eigenvalues and eigenvectors, Particle swarm optimization, Matrix (chemical analysis), Algorithm, MATLAB, Computer science, Mathematical optimization, Applied mathematics