The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods

From MaRDI portal



Abstract: We present a comparative study of the application of modern eigenvalue algorithms to an eigenvalue problem arising in quantum physics, namely, the computation of a few interior eigenvalues and their associated eigenvectors for the large, sparse, real, symmetric, and indefinite matrices of the Anderson model of localization. We compare the Lanczos algorithm in the 1987 implementation of Cullum and Willoughby with the implicitly restarted Arnoldi method coupled with polynomial and several shift-and-invert convergence accelerators as well as with a sparse hybrid tridiagonalization method. We demonstrate that for our problem the Lanczos implementation is faster and more memory efficient than the other approaches. This seemingly innocuous problem presents a major challenge for all modern eigenvalue algorithms.


This paper concerns methods for computing a few (5-10) interior eigenvalues and associated eigenvectors of a family of structured large sparse real symmetric indefinite matrices with off-diagonal entries equal to the off-diagonal entries of the 7-point central difference approximation of the three-dimensional Poisson equation on the unit cube with periodic boundary conditions and with suitably chosen random numbers (different for different matrices of the family) as main diagonal entries. It is shown experimentally for the present problem that the Lancos algorithm in the implementation of \textit{J. Cullum} and \textit{R. A. Willoughby} [Lanczos algorithms for large symmetric eigenvalue computations. Vol. 1: Theory; Vol. 2: Programs (1985; Zbl 0574.65028)] is faster and more memory efficient than a sparse hybrid tridiagonalization method as well as the implicitly restarted Arnoldi method coupled with polynomial acceleration and in shift-and-invert mode with several direct and invert solvers.





Describes a project that uses

Uses Software






This page was built for publication: The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702356)