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

DOI10.1137/S1064827598332217zbMath0945.65038arXivphysics/9802009OpenAlexW1973379861MaRDI QIDQ4702356

Frank Milde, Volker Mehrmann, Ulrich Elsner, Michael Schreiber, Rudolf A. Römer

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

zbMATH Keywords

eigenvaluePoisson equationLanczos algorithmArnoldi algorithmshift-and-inverteigenvector problemsAnderson model of localizationpolynomial convergence acceleratorsstructured large sparse real symmetric indefinite matricestridiagonalization method

Mathematics Subject Classification ID

Related Items (5)

Principal eigenvector localization and centrality in networks: revisited ⋮ The spectra of large Toeplitz band matrices with a randomly perturbed entry ⋮ A new approach for determining the time step when propagating with the Lanczos algorithm ⋮ Two-grid methods for Hermitian positive definite linear systems connected with an order relation ⋮ Spectral approximation of banded Laurent matrices with localized random perturbations

Uses Software

• QMRPACK
• Meschach
• ARPACK
• JDQZ
• CGS
• Chaco

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