A simulated annealing based algorithm for eigenvalue problems

Arjunwadkar, Mihir ; Kanhere, D. G. (1991) A simulated annealing based algorithm for eigenvalue problems Computer Physics Communications, 62 (1). pp. 8-15. ISSN 0010-4655

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/001046...

Related URL: http://dx.doi.org/10.1016/0010-4655(91)90116-3


We present a simple, iterative algorithm to find the lowest (few) eigenvalue(s) and eigenvector(s) of a large sparse real Hermitian matrix. The algorithm is an application of the simulated annealing technique implemented via molecular dynamics. We also demonstrate that the slow rate of convergence, characteristic of the late-time behaviour of such annealing based methods, can be considerably improved by using simple gradient minimization schemes. Our studies are based on a large number of real Hermitian matrices of dimensions up to 15876 arising out of our investigations of strongly-correlated systems using the finite-cluster approach. We also investigate the effect of the controlling parameters (time step and fictitious mass) on the convergence and suggest a way to choose these parameters a priori.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:16275
Deposited On:15 Nov 2010 13:56
Last Modified:03 Jun 2011 08:22

Repository Staff Only: item control page