The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods
DOI10.1137/S1064827598332217zbMath0945.65038arXivphysics/9802009MaRDI QIDQ4702356
Volker Mehrmann, Rudolf A. Römer, Frank Milde, Michael Schreiber, Ulrich Elsner
Publication date: 24 November 1999
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/physics/9802009
eigenvalue; Poisson equation; Lanczos algorithm; Arnoldi algorithm; shift-and-invert; eigenvector problems; Anderson model of localization; polynomial convergence accelerators; structured large sparse real symmetric indefinite matrices; tridiagonalization method
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
82B44: Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics
Related Items
Uses Software