Abstract
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed
Similar content being viewed by others
References
J H Wilkinson,The algebraic eigenvalue problem (Oxford University Press, London, 1965)
J H Holland,Adaptation in natural and artificial systems (University of Michigan Press, Ann Arbor, MI, 1975)
D E Goldberg,Genetic algorithms in search, optimisation and machine learning (Addison Wesley, Reading, MA, 1989)
S Nandy, P Chaudhury and S P Bhattacharyya,Int. J. Quantum Chem. 90, 188 (2002)
S Nandy, P Chaudhury and S P Bhattacharyya,J. Chem. Sci. 116, 285 (2004)
P O Löwdin,J. Chem. Phys. 19, 1396 (1951)
P O Löwdin,Int. J. Quantum Chem. 2, 167 (1968)
J P Killingbeck and G Jolicard,J. Phys. A36, 12105-R180 (2003)
R K Nesbet,J. Comp. Phys. 43, 311 (1965)
W J Kerner,J. Comput. Phys. 85, 1 (1989)
W Butscher and W E Kammer,J. Comp. Phys. 20, 313 (1976)
J A R Coope and D W Sabo,J. Comp. Phys. 23, 404 (1977)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sharma, R., Nandy, S. & Bhattacharyya, S.P. On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices. Pramana - J Phys 66, 1125–1130 (2006). https://doi.org/10.1007/BF02708466
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02708466
Keywords
- Symmetric eigenvalue problem
- genetic algorithm
- partitioning techniques
- energy-dependent partitioning
- Löwdin’s method