Class of cellular automata for reaction-diffusion systems
نویسندگان
چکیده
منابع مشابه
Cellular Automata for Reaction Diffusion Systems
A class of cellular automata for reaction-diiusion systems is presented. It is based on a local average for the diiusive dynamics, and closely related to nite diierence schemes. The reactive dynamics is implemented as a lookup-table with probabilistic rules. The rules are derived directly and systematically from the given diierential equations, using probabilistic rounding to enforce the discre...
متن کاملThree-dimensional Cellular Automata for Reaction-Diffusion Systems
Cellular automata for reaction-diiusion systems are eecient enough to make the simulation of large three-dimensional systems feasible. The principal construction mechanisms used here are not much diierent from those for two-dimensional cellular automata. Diiusion is realized through a local av-erageing, and all the nonlinear reaction terms are collected in a table-lookup. The special issue in t...
متن کاملProbabilistic cellular automata model for reaction diffusion systems
Class of cellular automata (CA) for modeling reaction diffusion systems has been presented. The construction of the CA is general enough to be applicable to large class of reaction diffusion equation s. Tne automata are based on running average procedure and on probabilistic table look up to implement diffusion reactions. The evolution of probabilistic CA simulates a spatially distributed proce...
متن کاملCellular Automata Simulation of a Bistable Reaction-Diffusion System: Microscopic and Macroscopic Approaches
The Cellular Automata method has been used to simulate the pattern formation of the Schlögl model as a bistable Reaction-Diffusion System. Both microscopic and macroscopic Cellular Automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. The results show the tendency of the system towards the more sta...
متن کاملEvolving localizations in reaction-diffusion cellular automata
We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1994
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.49.1749