The Anderson model of localization: a challenge for modern eigenvalue methods

Details The Anderson model of localization: a challenge for modern eigenvalue methods The Anderson model of localization: a challenge for modern eigenvalue methods

1998-02-04

arxiv.org/abs/physics/9802009v1

Physics

Computational Physics

16 LaTeX pages with 3 figures included

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Anderson model of localization: a challenge for modern eigenvalue methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Anderson model of localization: a challenge for modern eigenvalue methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Anderson model of localization: a challenge for modern eigenvalue methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214036