Abstract
A genetic algorithm-based recipe involving minimization of the Rayleigh quotient is proposed for the sequential extraction of eigenvalues and eigenvectors of a real symmetric matrix with and without basis optimization. Important features of the method are analysed, and possible directions of development suggested
Similar content being viewed by others
References
Parlett B N 1981The symmetric eigenvalue problem (Englewood Cliffs, NJ: Prentice Hall)
Wilkinson J H 1965The algebraic eigenvalue problem (Oxford: Clarendon)
Kerner W J 1989J. Comput. Phys. 85 1
Cullum J K and Willonghby R A 1985Lanczos algorithm for large symmetric eigenvalue computations (Boston: Birkhauss)
Davidson E R 1975J. Comput. Phys. 17 87
Fletcher R 1989Practical methods of optimization 2nd edn (Chichester: John-Wiley)
Holland J H 1975Adaptation in natural and artificial systems (Ann Arbor, MI: University of Michigan Press)
Goldberg D E 1989Genetic algorithms in search, optimisation and machine learning (Reading, MA: Addison Wesley)
Nandy S, Chaudhury P and Bhattacharyya S P 2002Int. J. Quantum Chem. 90 188
Lowdin P O 1951J. Chem. Phys. 19 1396
Lowdin P O 1968Int. J. Quantum Chem. 2 167
Killingbeck J P and Jolicard G 2003J. Phys. A36 R105
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nandy, S., Chaudhury, P. & Bhattacharyya, S.P. Diagonalization of a real-symmetric Hamiltonian by genetic algorithm: A recipe based on minimization of Rayleigh quotient. J Chem Sci 116, 285–291 (2004). https://doi.org/10.1007/BF02708279
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02708279