Movable cellular automaton

Last updated
Movable cellular automaton method
MCA friction net.gif
Animation of a movable cellular automaton being used to simulate friction at the interface between two surfaces
Method type
Continuous/DiscreteDiscrete
Analytical/ComputationalComputational
Characteristics
Influenced by cellular automaton, discrete element
Method in computational solid mechanics

The movable cellular automaton (MCA) method is a method in computational solid mechanics based on the discrete concept. It provides advantages both of classical cellular automaton and discrete element methods. One important advantage [1] of the MCA method is that it permits direct simulation of material fracture, including damage generation, crack propagation, fragmentation, and mass mixing. It is difficult to simulate these processes by means of continuum mechanics methods (For example: finite element method, finite difference method, etc.), so some new concepts like peridynamics are required. Discrete element method is very effective to simulate granular materials, but mutual forces among movable cellular automata provides simulating solids behavior. As the cell size of the automaton approaches zero, MCA behavior approaches classical continuum mechanics methods. [2] The MCA method was developed in the group of S.G. Psakhie [3]

Contents

Keystone of the movable cellular automaton method

Object (at left) is described as set of interacted automata (at center). At right is shown velocity field of automata. MCA elements.png
Object (at left) is described as set of interacted automata (at center). At right is shown velocity field of automata.

In framework of the MCA approach an object under modeling is considered as a set of interacting elements/automata. The dynamics of the set of automata are defined by their mutual forces and rules for their relationships. This system exists and operates in time and space. Its evolution in time and space is governed by the equations of motion. The mutual forces and rules for inter-elements relationships are defined by the function of the automaton response. This function has to be specified for each automaton. Due to mobility of automata the following new parameters of cellular automata have to be included into consideration: Ri radius-vector of automaton; Vi velocity of automaton; ωi rotation velocity of automaton; θi rotation vector of automaton; mi mass of automaton; Ji moment of inertia of automaton.

New concept: neighbours

Each automaton has some neighbors MCA neighbors.gif
Each automaton has some neighbors

The new concept of the MCA method is based on the introducing of the state of the pair of automata (relation of interacting pairs of automata) in addition to the conventional one the state of a separate automaton. Note that the introduction of this definition allows to go from the static net concept to the concept of neighbours. As a result of this, the automata have the ability to change their neighbors by switching the states (relationships) of the pairs.

Definition of the parameter of pair state

The introducing of new type of states leads to new parameter to use it as criteria for switching relationships. It is defined as an automaton overlapping parameters hij. So the relationship of the cellular automata is characterised by the value of their overlapping.

MCA sh1.gif MCA sh2.gif

The initial structure is formed by setting up certain relationships among each pair of neighboring elements.

Criterion of switching of the state of pair relationships

At left pair of automata ij is linked. At right pair of automata ij is unlinked. MCA switch.gif
At left pair of automata ij is linked. At right pair of automata ij is unlinked.

In contrast to the classical cellular automaton method in the MCA method not only a single automaton but also a relationship of pair of automata can be switched. According with the bistable automata concept there are two types of the pair states (relationships):

linked– both automata belong to a solid
unlinked– each automaton of the pair belongs to different bodies or parts of damaged body.

So the changing of the state of pair relationships is controlled by relative movements of the automata and the media formed by such pairs can be considered as bistable media.

Equations of MCA motion

The evolution of MCA media is described by the following equations of motion for translation:

Forces between automata ij coming from their neighbors. MCA neighbour in pair.png
Forces between automata ij coming from their neighbors.

Here is the mass of automaton , is central force acting between automata and , is certain coefficient associated with transferring the h parameter from pair ij to pair ik, is the angle between directions ij and ik.

Due to finite size of movable automata the rotation effects have to be taken into account. The equations of motion for rotation can be written as follows:

Here Θij is the angle of relative rotation (it is a switching parameter like hij for translation), qij is the distance from center of automaton i to contact point of automaton j (moment arm), τij is the pair tangential interaction, is certain coefficient associated with transferring the Θ parameter from one pair to other (it is similar to from the equation for translation).

These equations are completely similar to the equations of motion for the manyparticle approach.

Definition of deformation in pair of automata

Rotation of body as whole not caused to deformation in pair of automata Deformation in movable cellular automatation.svg
Rotation of body as whole not caused to deformation in pair of automata

Translation of the pair automata The dimensionless deformation parameter for translation of the i j automata pair can be presented as:

In this case:

where Δt time step, Vnij relative velocity.

Rotation of the pair automata can be calculated by analogy with the last translation relationships.

Modeling of irreversible deformation in the MCA method

Deformation is determine by value of distance from the center of automaton MCA Irreversible Deformation.gif
Deformation is determine by value of distance from the center of automaton
There are two types of the response function of automata MCA response function of automata.gif
There are two types of the response function of automata

The εij parameter is used as a measure of deformation of automaton i under its interaction with automaton j. Where qij is a distance from the center of automaton i to its contact point with automaton j; Ri = di/2 (di is the size of automaton i).

As an example the titanium specimen under cyclic loading (tension compression) is considered. The loading diagram is shown in the next figure:

Scheme of loadingLoading diagram
MCA cyclic schem.gif MCA cyclic diag.gif
(Red marks are the experimental data)

Advantages of MCA method

Due to mobility of each automaton the MCA method allows to take into account directly such actions as:

Using boundary conditions of different types (fixed, elastic, viscous-elastic, etc.) it is possible to imitate different properties of surrounding medium, containing the simulated system. It is possible to model different modes of mechanical loading (tension, compression, shear strain, etc.) by setting up additional conditions at the boundaries.

See also

Related Research Articles

Cellular automaton Discrete model studied in computer science

A cellular automaton is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling.

Markov chain Mathematical system

A Markov chain is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). It is named after the Russian mathematician Andrey Markov.

A discrete element method (DEM), also called a distinct element method, is any of a family of numerical methods for computing the motion and effect of a large number of small particles. Though DEM is very closely related to molecular dynamics, the method is generally distinguished by its inclusion of rotational degrees-of-freedom as well as stateful contact and often complicated geometries. With advances in computing power and numerical algorithms for nearest neighbor sorting, it has become possible to numerically simulate millions of particles on a single processor. Today DEM is becoming widely accepted as an effective method of addressing engineering problems in granular and discontinuous materials, especially in granular flows, powder mechanics, and rock mechanics. DEM has been extended into the Extended Discrete Element Method taking heat transfer, chemical reaction and coupling to CFD and FEM into account.

Automata theory Study of abstract machines and automata

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word automata comes from the Greek word αὐτόματος, which means "self-acting,self-willed,self-moving". An automaton is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM).

A hybrid system is a dynamical system that exhibits both continuous and discrete dynamic behavior – a system that can both flow and jump. Often, the term "hybrid dynamical system" is used, to distinguish over hybrid systems such as those that combine neural nets and fuzzy logic, or electrical and mechanical drivelines. A hybrid system has the benefit of encompassing a larger class of systems within its structure, allowing for more flexibility in modeling dynamic phenomena.

In mathematics, a Markov decision process (MDP) is a discrete-time stochastic control process. It provides a mathematical framework for modeling decision making in situations where outcomes are partly random and partly under the control of a decision maker. MDPs are useful for studying optimization problems solved via dynamic programming. MDPs were known at least as early as the 1950s; a core body of research on Markov decision processes resulted from Ronald Howard's 1960 book, Dynamic Programming and Markov Processes. They are used in many disciplines, including robotics, automatic control, economics and manufacturing. The name of MDPs comes from the Russian mathematician Andrey Markov as they are an extension of Markov chains.

Large eddy simulation

Large eddy simulation (LES) is a mathematical model for turbulence used in computational fluid dynamics. It was initially proposed in 1963 by Joseph Smagorinsky to simulate atmospheric air currents, and first explored by Deardorff (1970). LES is currently applied in a wide variety of engineering applications, including combustion, acoustics, and simulations of the atmospheric boundary layer.

Smoothed-particle hydrodynamics Method of hydrodynamics simulation

Smoothed-particle hydrodynamics (SPH) is a computational method used for simulating the mechanics of continuum media, such as solid mechanics and fluid flows. It was developed by Gingold and Monaghan and Lucy in 1977, initially for astrophysical problems. It has been used in many fields of research, including astrophysics, ballistics, volcanology, and oceanography. It is a meshfree Lagrangian method, and the resolution of the method can easily be adjusted with respect to variables such as density.

In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state machine. The most widely studied shift spaces are the subshifts of finite type.

Canonical quantum gravity

In physics, canonical quantum gravity is an attempt to quantize the canonical formulation of general relativity. It is a Hamiltonian formulation of Einstein's general theory of relativity. The basic theory was outlined by Bryce DeWitt in a seminal 1967 paper, and based on earlier work by Peter G. Bergmann using the so-called canonical quantization techniques for constrained Hamiltonian systems invented by Paul Dirac. Dirac's approach allows the quantization of systems that include gauge symmetries using Hamiltonian techniques in a fixed gauge choice. Newer approaches based in part on the work of DeWitt and Dirac include the Hartle–Hawking state, Regge calculus, the Wheeler–DeWitt equation and loop quantum gravity.

DEVS abbreviating Discrete Event System Specification is a modular and hierarchical formalism for modeling and analyzing general systems that can be discrete event systems which might be described by state transition tables, and continuous state systems which might be described by differential equations, and hybrid continuous state and discrete event systems. DEVS is a timed event system.

The iterative proportional fitting procedure is the operation of finding the fitted matrix which is the closest to an initial matrix but with the row and column totals of a target matrix . The fitted matrix being of the form , where and are diagonal matrices such that has the margins of . Some algorithms can be chosen to perform biproportion. We have also the entropy maximization, information loss minimization or RAS which consists of factoring the matrix rows to match the specified row totals, then factoring its columns to match the specified column totals; each step usually disturbs the previous step’s match, so these steps are repeated in cycles, re-adjusting the rows and columns in turn, until all specified marginal totals are satisfactorily approximated. However, all algorithms give the same solution. In three- or more-dimensional cases, adjustment steps are applied for the marginals of each dimension in turn, the steps likewise repeated in cycles.

In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of ordered unranked trees, as traditionally used for modelling hierarchical structures. Finite-state acceptors for nested words, so-called nested word automata, then give a more expressive generalization of finite automata on words. The linear encodings of languages accepted by finite nested word automata gives the class of visibly pushdown languages. The latter language class lies properly between the regular languages and the deterministic context-free languages. Since their introduction in 2004, these concepts have triggered much research in that area.

In the context of a continuous-time Markov process, the Kolmogorov equations, including Kolmogorov forward equations and Kolmogorov backward equations, are a pair of systems of differential equations that describe the time-evolution of the probability , where and are the final and initial time respectively.

Sergey Psakhie was a Russian physicist, Chairman of the Presidium of the Tomsk Scientific Center of the Siberian Division of the Russian Academy of Sciences. He was the author and co-author of more than two hundred scientific papers, including five monographs.

Norman H. Margolus is a Canadian-American physicist and computer scientist, known for his work on cellular automata and reversible computing. He is a research affiliate with the Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology.

Reversible cellular automaton Cellular automaton in which every configuration has a unique predecessor.

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells, each containing a state drawn from a finite set of states, with a rule for updating all cells simultaneously based on the states of their neighbors, such that the previous state of any cell before an update can be determined uniquely from the updated states of all the cells. The time-reversed dynamics of a reversible cellular automaton can always be described by another cellular automaton rule, possibly on a much larger neighborhood.

Stochastic cellular automata or probabilistic cellular automata (PCA) or random cellular automata or locally interacting Markov chains are an important extension of cellular automaton. Cellular automata are a discrete-time dynamical system of interacting entities, whose state is discrete.

In theoretical computer science, in particular in formal language theory, Kleene's algorithm transforms a given nondeterministic finite automaton (NFA) into a regular expression. Together with other conversion algorithms, it establishes the equivalence of several description formats for regular languages. Alternative presentations of the same method include the "elimination method" attributed to Brzozowski and McCluskey, the algorithm of McNaughton and Yamada, and the use of Arden's lemma.

JCMsuite Simulation software

JCMsuite is a finite element analysis software package for the simulation and analysis of electromagnetic waves, elasticity and heat conduction. It also allows a mutual coupling between its optical, heat conduction and continuum mechanics solvers. The software is mainly applied for the analysis and optimization of nanooptical and microoptical systems. Its applications in research and development projects include dimensional metrology systems, photolithographic systems, photonic crystal fibers, VCSELs, Quantum-Dot emitters, light trapping in solar cells, and plasmonic systems. The design tasks can be embedded into the high-level scripting languages MATLAB and Python, enabling a scripting of design setups in order to define parameter dependent problems or to run parameter scans.

References

  1. Psakhie, S. G.; Horie, Y.; Korostelev, S. Yu.; Smolin, A. Yu.; Dmitriev, A. I.; Shilko, E. V.; Alekseev, S. V. (1995-11-01). "Method of movable cellular automata as a tool for simulation within the framework of mesomechanics". Russian Physics Journal. 38 (11): 1157–1168. doi:10.1007/BF00559396.
  2. Popov, V.L., Psakhie S.G. (2001). "Theoretical principles of modelling elastoplastic media by moveable cellular automata method. I: Homogenous media". Phys. Mesomechanics. 4: 16–25.CS1 maint: multiple names: authors list (link)
  3. Shilko, Evgeny V.; Popov, Valentin L.; Vasiljeva, Olga S.; Ostermeyer, Georg-Peter (2021), Ostermeyer, Georg-Peter; Popov, Valentin L.; Shilko, Evgeny V.; Vasiljeva, Olga S. (eds.), "In Memory of Sergey G. Psakhie", Multiscale Biomechanics and Tribology of Inorganic and Organic Systems: In memory of Professor Sergey Psakhie, Springer Tracts in Mechanical Engineering, Cham: Springer International Publishing, pp. 1–23, doi: 10.1007/978-3-030-60124-9_1 , ISBN   978-3-030-60124-9 , retrieved 2020-12-08

Software