1 v 1 9 S ep 1 99 6 Optimized parallel algorithm and dynamic exponent for diffusion - limited aggregation
نویسندگان
چکیده
A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the PRAM model of parallel computation according to T ∼ L z , where T is the running time and L the cluster size. It is argued that z = D − D 2 /3, where D is the fractal dimension and D 2 is the second generalized dimension. Simulations of DLA are carried out to measure D 2 and other quantities relevant to the complexity analysis of the parallel algorithm. It is conjectured that the optimized parallel algorithm attains the minimum possible value of the dynamic exponent so that z characterizes the intrinsic history dependence of DLA.
منابع مشابه
D ec 1 99 6 Parallel Algorithm and Dynamic Exponent for Diffusion - limited Aggregation
A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel random-access machine (PRAM) model of parallel computation according to T ∼ L z , where L is the cluster size, T is the running time, and the algorithm uses a number ...
متن کامل3 v 1 9 S ep 1 99 6 Disturbance Propagation in Chaotic Extended Systems with Long - Range Coupling
Propagation of initially localized perturbations is investigated in chaotic coupled map lattices with long-range couplings decaying as a power of the distance. The initial perturbation propagates exponentially fast along the lattice, with a rate given by the ratio of the maximal Lyapunov exponent and the power of the coupling. A complementary description in terms of a suitable comoving Lyapunov...
متن کاملar X iv : h ep - l at / 9 60 90 13 v 1 3 S ep 1 99 6 1
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. We show that this algorithm is a viable alternative to the Hybrid Monte Carlo algorithm.
متن کاملar X iv : h ep - l at / 9 60 81 20 v 1 2 2 A ug 1 99 6 1 Can we do better than Hybrid Monte Carlo in Lattice QCD ?
The Hybrid Monte Carlo algorithm for the simulation of QCD with dynamical staggered fermions is compared with Kramers equation algorithm. We find substantially different autocorrelation times for local and nonlocal observables. The calculations have been performed on the parallel computer CRAY T3D.
متن کاملX iv : h ep - t h / 99 03 11 9 v 1 1 4 M ar 1 99 9 Thouless energy in QCD and effects of diffusion modes on level correlations of Dirac operator
The correlations of the QCD Dirac eigenvalues are studied with use of an extended chiral random matrix model. The inclusion of spatial dependence which the original model lacks enables us to investigate the effects of diffusion modes. We get analytical expressions of level correlation functions with non-universal behavior caused by diffusion modes which is characterized by Thouless energy. Pion...
متن کامل