The Lagrange-mesh method is an approximate variational method taking the form of
equations on a grid thanks to the use of a Gauss-quadrature approximation. The variational …

This is a revised edition of a book which appeared close to two decades ago. Someone
scrutinizing how the field has evolved in these two decades will make two interesting …

Polynomially filtered exact diagonalization method (POLFED) for large sparse matrices is
introduced. The algorithm finds an optimal basis of a subspace spanned by eigenvectors …

We study Anderson localization in disordered tight-binding models on hyperbolic lattices.
Such lattices are geometries intermediate between ordinary two-dimensional crystalline …

The Anderson transition in random graphs has raised great interest, partly out of the hope
that its analogy with the many-body localization (MBL) transition might lead to a better …

We describe a new multifractal finite-size scaling (MFSS) procedure and its application to
the Anderson localization-delocalization transition. MFSS permits the simultaneous …

This article describes the PRIMME software package for solving large, sparse Hermitian
standard eigenvalue problems. The difficulty and importance of these problems have …

We propose efficient preconditioning algorithms for an eigenvalue problem arising in
quantum physics, namely, the computation of a few interior eigenvalues and their associated …

Great progress has been made in recent years towards understanding the properties of
disordered electronic systems. In part, this is made possible by recent advances in quantum …

We study the Anderson transition on a generic model of random graphs with a tunable
branching parameter 1< K< 2, through large scale numerical simulations and finite-size …