Using Improved Genetic Algorithm to Solve Real Eigenvalue of Matrix
Xianghu Liu
Abstract
Xianghu Liu
Abstract
This paper based on the distribution about eigenvalue of matrix,firstly,determinate the approximately distributed region of real matrix eigenvalue,then by using genetic algorithm,with real value encoding and adaptive crossover and mutation probabilities to solve approximate real eigenvalue of matrix.Simulation results show that this algorithm can reach a certain precision,has a certain versatility,and give a rapid method to solve eigenvalue of matrix.
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.
This paper based on the distribution about eigenvalue of matrix,firstly,determinate the approximately distributed region of real matrix eigenvalue,then by using genetic algorithm,with real value encoding and adaptive crossover and mutation probabilities to solve approximate real eigenvalue of matrix.Simulation results show that this algorithm can reach a certain precision,has a certain versatility,and give a rapid method to solve eigenvalue of matrix.
Key concepts: Eigenvalues and eigenvectors, Crossover, Matrix (chemical analysis), Divide-and-conquer eigenvalue algorithm, Eigenvalue algorithm, Algorithm, Generalized eigenvector, Genetic algorithm