Use of cluster computing for the Anderson model of localization Original Research Article

We consider parallelization strategies for the two most frequently used algorithms in numerical investigations of the Anderson model of localization, a paradigmatic model of disordered quantum systems. After a brief review of the physics of Anderson localization, we discuss the application of the Cullum–Willoughby implementation of the Lanczos diagonalization scheme and the transfer-matrix method to massively parallel cluster architectures.