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
相关论文
共 29 条
[1]   ABSENCE OF DIFFUSION IN CERTAIN RANDOM LATTICES [J].
ANDERSON, PW .
PHYSICAL REVIEW, 1958, 109 (05) :1492-1505
[2]  
Barrett R., 1994, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, V2nd ed.
[3]   THE ANDERSON-MOTT TRANSITION [J].
BELITZ, D ;
KIRKPATRICK, TR .
REVIEWS OF MODERN PHYSICS, 1994, 66 (02) :261-390
[4]  
Biswas P, 2000, PHYS STATUS SOLIDI B, V218, P205, DOI 10.1002/(SICI)1521-3951(200003)218:1<205::AID-PSSB205>3.0.CO
[5]  
2-B
[6]  
CAIN P, 1999, ANN PHYS-LEIPZIG, V8, pS133
[7]  
Cullum J., 1985, LANCZOS ALGORITHMS L, V2
[8]  
Cullum J. K., 1985, LANCZOS ALGORITHMS L, V1
[9]  
Eilmes A, 1998, PHYS STATUS SOLIDI B, V205, P229, DOI 10.1002/(SICI)1521-3951(199801)205:1<229::AID-PSSB229>3.0.CO
[10]  
2-S
123