Use of cluster computing for the Anderson model of localization

被引：3
|
作者：
Cain, P [1 ]
Milde, F [1 ]
Römer, RA [1 ]
Schreiber, M [1 ]
机构：
[1] Tech Univ, Inst Phys, D-09107 Chemnitz, Germany
来源：
COMPUTER PHYSICS COMMUNICATIONS | 2002年 / 147卷 / 1-2期
关键词：
localization; Lanczos diagonalization; sparse matrices; parallelization;
D O I：
10.1016/S0010-4655(02)00256-4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：246 / 250
页数：5
相关论文
共 50 条
12345