Numerical methods for localization
arXiv:2207.09890 · doi:10.1016/B978-0-323-90800-9.00099-8
Abstract
Anderson localization provides a challenge to numerical approaches due to the inherent randomness, and hence absence of simple symmetries, in its discrete Hamiltonian representation. Numerous algorithmic approaches have been developed or adopted from other fields and have been collected in this encyclopedia entry. In the discussions below, the emphasis is on the numerical algorithms for localization, while the discussion of the physics of localization is referred to in companion entries by Elgart and Oganesyan in this encyclopedia.
invited article contribution for the refreshed "Encyclopedia for Condensed Matter Physics"
References in corpus (11)
- Anderson Transitions
- Localization of interacting fermions at high temperature
- The Kernel Polynomial Method
- Deep Learning the Quantum Phase Transitions in Random Two-Dimensional Electron Systems
- Universality classes of the Anderson Transitions Driven by non-Hermitian Disorder
- Critical behavior at Mott-Anderson transition: a TMT-DMFT perspective
- Effects of Scale-Free Disorder on the Anderson Metal-Insulator Transition
- Strong-disorder renormalization-group study of the one-dimensional tight-binding model
- Critical parameters for the disorder-induced metal-insulator transition in FCC and BCC lattices
- Multifractality of ab initio wave functions in doped semiconductors
- Real-space renormalization-group approach to the integer quantum Hall effect