학술논문
A parallel multigrid algorithm for percolation clusters
Document Type
Article
Author
Source
Journal of Statistical Physics; April 1991, Vol. 63 Issue: 1-2 p73-88, 16p
Subject
Language
ISSN
00224715; 15729613
Abstract
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.