A PARALLEL MULTIGRID ALGORITHM FOR PERCOLATION CLUSTERS

被引:20
作者
BROWER, RC
TAMAYO, P
YORK, B
机构
[1] BOSTON UNIV,DEPT PHYS,BOSTON,MA 02215
[2] BOSTON UNIV,DEPT COMP SCI,BOSTON,MA 02215
[3] THINKING MACHINES CORP,CAMBRIDGE,MA 02142
关键词
MULTIGRID; MONTE-CARLO METHOD; PERCOLATION; CLUSTER LABELING; ACCELERATED DYNAMICS;
D O I
10.1007/BF01026593
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
A new parallel cluster-finding algorithm is formulated by using multigrid relaxation methods very similar to those used for differential equation solvers. For percolation clusters, this approach drastically reduces critical slowing down relative to local or scan relaxation methods. Numerical studies of scaling properties with system size are presented in the case of the 2D percolation clusters of the Swendsen-Wang Ising dynamics running on the Connection Machine.
引用
收藏
页码:73 / 88
页数:16
相关论文
共 26 条