Sampling chaotic trajectories quickly in parallel

Journal of Statistical Physics

Volumn 109, Issue 3-4, 2002, Pages 863-873

  Machta, J ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Chaotic dynamics; Parallel complexity; Path sampling; Quadratic map

Indexed keywords

EID: 0036388035     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020431119088     Document Type: Article

References (7)

1. H. E. Nusse and J. A. Yorke, Is every approximate trajectory of some process near an exact trajectory of a nearby process? Commun. Math. Phys. 114:363-379 (1988).
2. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, Limits to Parallel Computation: P-completeness Theory (Oxford University Press, 1995).
3. C Dellago, P. G. Bolhuis, F. S. Csajka, and D. Chandler, Transition path sampling and the calculation of rate constants, J. Chem. Phys. 108:1964-1977 (1998).
4. C. G. Langton, Computation at the edge of chaos, Phys. D 42:12-37 (1990).
5. K. Moriarty, J. Machta, and R. Greenlaw, Parallel algorithm and dynamic exponent for diffusion-limited aggregation, Phys. Rev. E 55:6211 (1997).
6. C. Moore and M. Nilsson, The computational complexity of sandpiles, J. Stat. Phys. 96:205-224 (1999).
7. J. Machta and X.-N. Li, Parallel dynamics and computational complexity of the Bak-Sneppen model, Phys. A 300:245-270 (2001).