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

DOI10.1137/S1064827598332217MaRDI QIDQ4702356zbMATH OpenOpenAlexFDO

Authors Ulrich Elsner, Volker Mehrmann, Frank Milde, R. A. Römer, M. Schreiber

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

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)

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.

Recommendations

• On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
• On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
• Computing interior eigenvalues of large matrices
• scientific article; zbMATH DE number 2069268
• Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method

Cited in

(11)

• A numerical and symbolical approximation of the nonlinear Anderson model
• The spectra of large Toeplitz band matrices with a randomly perturbed entry
• Eigensystem multiscale analysis for Anderson localization in energy intervals
• A new approach for determining the time step when propagating with the Lanczos algorithm
• On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
• scientific article; zbMATH DE number 737032 (Why is no real title available?)
• Principal eigenvector localization and centrality in networks: revisited
• Two-grid methods for Hermitian positive definite linear systems connected with an order relation
• Spectral approximation of banded Laurent matrices with localized random perturbations
• O(N) algorithms for disordered systems
• On Large-Scale Diagonalization Techniques for the Anderson Model of Localization

Describes a project that uses

Uses Software

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

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)