A New Class of Cellular Automata for Reaction-Diffusion Systems

Abstract

We introduce a new class of cellular automata to model reaction-diffusion systems in a quantitatively correct way. The construction of the CA from the reaction-diffusion equation relies on a moving average procedure to implement diffusion, and a probabilistic table-lookup for the reactive part. The applicability of the new CA is demonstrated using the Ginzburg-Landau equation.

4 pages, RevTeX 3.0 , 3 Figures 214972 bytes tar, compressed, uuencoded

Cited by in corpus (8)

• Lattice Gas Automata for Reactive Systems
• Spatial organization and evolutional period of the epidemic model using cellular automata
• Surface Structure and Catalytic $CO$ Oxidation Oscillations
• Turing-like patterns in an asymmetric dynamic Ising model
• Polynomial Complex Ginzburg-Landau equations in almost periodic spaces
• Cellular Computing and Least Squares for partial differential problems parallel solving
• Protocell Self-Reproduction in a Spatially Extended Metabolism-Vesicle System
• Selective laser etching of displays: Closing the gap between optical simulations and fabrication