This article describes comprehensively on elements of cellular automata implementation, which the author reported in past papers(1)(2)(3)(4)(5)(6)(7)(8)(9). First, concept and goal of the research are briefly reviewed in the chapter 2. Then specific algorithmic details of the implementation and their purposes are argued in the succeeding chapter; Essences of SLSF(Single-Layer, Single-Frame) scheme, SLMF(Single-Layer, Multiple-Frame) scheme, MLSF(Multiple-Layer, Single-Frame) scheme and MLMF(Multiple-Layer, Multiple-Frame) are posed. Further, computational results from SLSF and MLMF are compared along with FEM results in the chapter 4. Finally, remaining important algorithmic element, traction-free boundary, is explained briefly.
View full abstract