๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel multigrid algorithm for percolation clusters

โœ Scribed by R. C. Brower; Pablo Tamayo; Bryant York

Publisher
Springer
Year
1991
Tongue
English
Weight
708 KB
Volume
63
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallelization of a cluster algorithm
Parallelization of a cluster algorithm
โœ Anthony N. Burkitt; Dieter W. Heermann ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 773 KB
A fast cluster counting algorithm for pe
A fast cluster counting algorithm for percolation on and off lattices
โœ E. Stoll ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 343 KB

A fast counting algorithm is used to enumerate the clusters for determining their statistics, for investigation the percolation behavior of the largest cluster and for calculating the fractai dimensions D. The algorithm is suitable for parallel processing. It can be expanded for off-lattice systems,

Efficient Parallel Nonlinear Multigrid R
Efficient Parallel Nonlinear Multigrid Relaxation Algorithms for Low-Level Vision Applications
โœ E. Memin; F. Heitz; F. Charot ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 824 KB

Multigrid techniques have been shown to significantly improve the convergence rate of the nonlinear relaxation algorithms used in computer vision for the extraction of low-level image features. It is also well known that the computations involved with relaxation algorithms are regular and local, and