IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v482y2024ics0096300324004326.html
   My bibliography  Save this article

Grid anisotropy of propagation fronts in cellular automata and its reduction methods

Author

Listed:
  • Ai, Jiali
  • Zhai, Chi
  • Du, Hongyu
  • Dang, Yi
  • Dai, Jindong
  • Sun, Wei

Abstract

Cellular Automata (CA) is a qualitative simulation method widely used in complex systems. However, the anisotropy of the bottom grid is influenced by the sharp boundary, which leads to the problem of grid-induced anisotropy. It not only makes the CA show the anisotropy in the simulation of isotropic propagation, but also produces errors in the simulation of anisotropic propagation. Through a simple binary CA simulation, this paper discusses reasons and processes of grid anisotropy from three aspects: cellular space, neighbor rules and evolution rules, and the error between CA simulation and standard circle propagation is evaluated. Afterwards, five methods for reducing grid anisotropy are introduced and compared in isotropic and anisotropy propagation simulation. For illustration purpose, these methods are considered in the actual system of isotropic and anisotropic propagation, and then the CA model is successfully applied to the classical isotropic propagation, i.e. the chemical wave in B-Z reaction-diffusion system, and classical anisotropic propagation, i.e. the dendritic growth in crystallization system. The results show that the composition shape of neighboring cells affects the isotropic propagation process of CA simulation, and the square grid is one of potential upgrading methods. The weight of neighbors algorithm is more suitable for simulating diffusion processes, and the limited circular neighbourhood algorithm is more suitable for crystal growth process. These results can be a reference for quantitative application of CA in fields of chemical wave propagation and dendrite growth.

Suggested Citation

  • Ai, Jiali & Zhai, Chi & Du, Hongyu & Dang, Yi & Dai, Jindong & Sun, Wei, 2024. "Grid anisotropy of propagation fronts in cellular automata and its reduction methods," Applied Mathematics and Computation, Elsevier, vol. 482(C).
  • Handle: RePEc:eee:apmaco:v:482:y:2024:i:c:s0096300324004326
    DOI: 10.1016/j.amc.2024.128971
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324004326
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2024.128971?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bastien Chopard & Alexandre Dupuis & Alexandre Masselot & Pascal Luthi, 2002. "Cellular Automata And Lattice Boltzmann Techniques: An Approach To Model And Simulate Complex Systems," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 5(02n03), pages 103-246.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Casse, Jérôme & Marckert, Jean-François, 2015. "Markovianity of the invariant distribution of probabilistic cellular automata on the line," Stochastic Processes and their Applications, Elsevier, vol. 125(9), pages 3458-3483.
    2. Lätt, Jonas & Chopard, Bastien & Succi, Sauro & Toschi, Federico, 2006. "Numerical analysis of the averaged flow field in a turbulent lattice Boltzmann simulation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 362(1), pages 6-10.
    3. David, Claire & Sagaut, Pierre, 2016. "Structural stability of Lattice Boltzmann schemes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 1-8.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:482:y:2024:i:c:s0096300324004326. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.