All issues

The paper describes a free software for research in the field of holomorphic dynamics based on the computational capabilities of the MATLAB environment. The software allows constructing not only single complex-valued mappings, but also their collectives as linearly connected, on a square or hexagonal lattice. In the first case, analogs of the Julia set (in the form of escaping points with color indication of the escape velocity), Fatou (with chaotic dynamics highlighting), and the Mandelbrot set generated by one of two free parameters are constructed. In the second case, only the dynamics of a cellular automaton with a complex-valued state of the cells and of all the coefficients in the local transition function is considered. The abstract nature of object-oriented programming makes it possible to combine both types of calculations within a single program that describes the iterated dynamics of one object.

The presented software provides a set of options for the field shape, initial conditions, neighborhood template, and boundary cells neighborhood features. The mapping display type can be specified by a regular expression for the MATLAB interpreter. This paper provides some UML diagrams, a short introduction to the user interface, and some examples.

The following cases are considered as example illustrations containing new scientific knowledge:

1) a linear fractional mapping in the form $Az^{n} +B/z^{n} $, for which the cases $n=2$, $4$, $n>1$, are known. In the portrait of the Fatou set, attention is drawn to the characteristic (for the classical quadratic mapping) figures of <>, showing short-period regimes, components of conventionally chaotic dynamics in the sea;

2) for the Mandelbrot set with a non-standard position of the parameter in the exponent $z(t+1)\Leftarrow z(t)^{\mu } $ sketch calculations reveal some jagged structures and point clouds resembling Cantor's dust, which are not Cantor's bouquets that are characteristic for exponential mapping. Further detailing of these objects with complex topology is required.

This article presents the results of an analytical and computer study of the collective dynamic properties of a chain of self-oscillating systems (conditionally — oscillators). It is assumed that the couplings of individual elements of the chain are non-reciprocal, unidirectional. More precisely, it is assumed that each element of the chain is under the influence of the previous one, while the reverse reaction is absent (physically insignificant). This is the main feature of the chain. This system can be interpreted as an active discrete medium with unidirectional transfer, in particular, the transfer of a matter. Such chains can represent mathematical models of real systems having a lattice structure that occur in various fields of natural science and technology: physics, chemistry, biology, radio engineering, economics, etc. They can also represent models of technological and computational processes. Nonlinear self-oscillating systems (conditionally, oscillators) with a wide “spectrum” of potentially possible individual self-oscillations, from periodic to chaotic, were chosen as the “elements” of the lattice. This allows one to explore various dynamic modes of the chain from regular to chaotic, changing the parameters of the elements and not changing the nature of the elements themselves. The joint application of qualitative methods of the theory of dynamical systems and qualitative-numerical methods allows one to obtain a clear picture of all possible dynamic regimes of the chain. The conditions for the existence and stability of spatially-homogeneous dynamic regimes (deterministic and chaotic) of the chain are studied. The analytical results are illustrated by a numerical experiment. The dynamical regimes of the chain are studied under perturbations of parameters at its boundary. The possibility of controlling the dynamic regimes of the chain by turning on the necessary perturbation at the boundary is shown. Various cases of the dynamics of chains comprised of inhomogeneous (different in their parameters) elements are considered. The global chaotic synchronization (of all oscillators in the chain) is studied analytically and numerically.

Modification of the lattice Boltzmann method for computation of viscous incompressible fluid flows is proposed. The method is based on the splitting of differential operator in Navier–Stokes equation and on the idea of instantaneous Maxwellisation of distribution function. The method is based on explicit schemes and didn’t have any problems with parallelization of computations. The stability of the method is demonstrated using von Neumann method in a wide range of input parameter values. The efficiency of the method proposed is demonstrated on the solution of the problem of 2D lid-driven cavity flow.

The study completes a series of the author’s works devoted to the spread of particles population in supercritical catalytic branching random walk (CBRW) on a multidimensional lattice. The CBRW model describes the evolution of a system of particles combining their random movement with branching (reproduction and death) which only occurs at fixed points of the lattice. The set of such catalytic points is assumed to be finite and arbitrary. In the supercritical regime the size of population, initiated by a parent particle, increases exponentially with positive probability. The rate of the spread depends essentially on the distribution tails of the random walk jump. If the jump distribution has “light tails”, the “population front”, formed by the particles most distant from the origin, moves linearly in time and the limiting shape of the front is a convex surface. When the random walk jump has independent coordinates with a semiexponential distribution, the population spreads with a power rate in time and the limiting shape of the front is a star-shape nonconvex surface. So far, for regularly varying tails (“heavy” tails), we have considered the problem of scaled front propagation assuming independence of components of the random walk jump. Now, without this hypothesis, we examine an “isotropic” case, when the rate of decay of the jumps distribution in different directions is given by the same regularly varying function. We specify the probability that, for time going to infinity, the limiting random set formed by appropriately scaled positions of population particles belongs to a set $B$ containing the origin with its neighborhood, in $\mathbb{R}^d$. In contrast to the previous results, the random cloud of particles with normalized positions in the time limit will not concentrate on coordinate axes with probability one.

Nowadays the random search became a widespread and effective tool for solving different complex optimization and adaptation problems. In this work, the problem of an average duration of a random search for one object by another is regarded, depending on various factors on a square field. The problem solution was carried out by holding total experiment with 4 factors and orthogonal plan with 54 lines. Within each line, the initial conditions and the cellular automaton transition rules were simulated and the duration of the search for one object by another was measured. As a result, the regression model of average duration of a random search for an object depending on the four factors considered, specifying the initial positions of two objects, the conditions of their movement and detection is constructed. The most significant factors among the factors considered in the work that determine the average search time are determined. An interpretation is carried out in the problem of random search for an object from the constructed model. The important result of the work is that the qualitative and quantitative influence of initial positions of objects, the size of the lattice and the transition rules on the average duration of search is revealed by means of model obtained. It is shown that the initial neighborhood of objects on the lattice does not guarantee a quick search, if each of them moves. In addition, it is quantitatively estimated how many times the average time of searching for an object can increase or decrease with increasing the speed of the searching object by 1 unit, and also with increasing the field size by 1 unit, with different initial positions of the two objects. The exponential nature of the growth in the number of steps for searching for an object with an increase in the lattice size for other fixed factors is revealed. The conditions for the greatest increase in the average search duration are found: the maximum distance of objects in combination with the immobility of one of them when the field size is changed by 1 unit. (that is, for example, with $4 \times 4$ at $5 \times 5$) can increase the average search duration in $e^{1.69} \approx 5.42$. The task presented in the work may be relevant from the point of view of application both in the landmark for ensuring the security of the state, and, for example, in the theory of mass service.

The work is devoted to the structural analysis of complex technical systems. Mechanical structures are considered, the properties of which affect the behavior of products during assembly, repair and operation. The main source of data on parts and mechanical connections between them is a hypergraph. This model formalizes the multidimensional basing relation. The hypergraph correctly describes the connectivity and mutual coordination of parts, which is achieved during the assembly of the product. When developing complex products in CAD systems, an engineer often makes serious design mistakes: overbasing of parts and non-sequential assembly operations. Effective ways of identifying these structural defects have been proposed. It is shown that the property of independent assembly can be represented as a closure operator whose domain is the boolean of the set of product parts. The images of this operator are connected and coordinated subsets of parts that can be assembled independently. A lattice model is described, which is the state space of the product during assembly, disassembly and decomposition into assembly units. The lattice model serves as a source of various structural information about the project. Numerical estimates of the cardinality of the set of admissible alternatives in the problems of choosing an assembly sequence and decomposition into assembly units are proposed. For many technical operations (for example, control, testing, etc.), it is necessary to mount all the operand parts in one assembly unit. A simple formalization of the technical conditions requiring the inclusion (exclusion) of parts in the assembly unit (from the assembly unit) has been developed. A theorem that gives an mathematical description of product decomposition into assembly units in exact lattice terms is given. A method for numerical evaluation of the robustness of the mechanical structure of a complex technical system is proposed.

This paper covers deployable systems assembled from a set of trapezium plates. The middles lines of the plates represent a plane curve in the original position of the package. It is proved that when the package of thin plates is unwrapped, a surface approximating a shell of nearly any curvature is formed. Kinematics of the continual model is analyzed by the method of Cartan moving hedron, extending the results the authors published earlier. Various applications of rotating shells are shown. Experimental models of deployable latticed systems are demonstrated.

Modification of the lattice Boltzmann method for computation of viscous Newtonian fluid flows is considered. Modified method is based on the splitting of differential operator in Navier–Stokes equation and on the idea of instantaneous Maxwellisation of distribution function. The problems for the system of lattice kinetic equations and for the system of linear diffusion equations are solved while one time step is realized. The efficiency of the method proposed in comparison with the ordinary lattice Boltzmann method is demonstrated on the solution of the problem of planar flow in cavern in wide range of Reynolds number and various grid resolution.

Stability of finite difference schemes of lattice Boltzmann method for modelling of 1D diffusion for cases of D1Q2 and D1Q3 lattices is investigated. Finite difference schemes are constructed for the system of linear Bhatnagar–Gross–Krook (BGK) kinetic equations on single particle distribution functions. Brief review of articles of other authors is realized. With application of multiscale expansion by Chapman–Enskog method it is demonstrated that system of BGK kinetic equations at small Knudsen number is transformated to scalar linear diffusion equation. The solution of linear diffusion equation is obtained as a sum of single particle distribution functions. The method of linear travelling wave propagation is used to show the unconditional asymptotic stability of the solution of Cauchy problem for the system of BGK equations at all values of relaxation time. Stability of the scheme for D1Q2 lattice is demonstrated by the method of differential approximation. Stability condition is written in form of the inequality on values of relaxation time. The possibility of the reduction of stability analysis of the schemes for BGK equations to the analysis of special schemes for diffusion equation for the case of D1Q3 lattice is investigated. Numerical stability investigation is realized by von Neumann method. Absolute values of the eigenvalues of the transition matrix are investigated in parameter space of the schemes. It is demonstrated that in wide range of the parameters changing the values of modulas of eigenvalues are lower than unity, so the scheme is stable with respect to initial conditions.

The system of linear hyperbolic kinetic equations with the relaxation term of Bhatnagar–Gross–Krook type for modelling of linear diffusion processes by the lattice Boltzmann method is considered. The coefficients of the equations depend on the discrete velocities from the pattern in velocity space. The system may be considered as an alternative mathematical model of the linear diffusion process. The cases of widely-used patterns on speed variables are considered. The case of parametric coefficients takes into account. By application of the method of Chapman–Enskog asymptotic expansion it is obtained, that the system may be reduced to the linear diffusion equation. The expression of the diffusion coefficient is obtained. As a result of the analysis of this expression, the existence of numerical diffusion in solutions obtained by application of lattice Boltzmann equations is demonstrated. Stability analysis is based on the investigation of wave modes defined by the solutions of hyperbolic system. In the cases of some one-dimensional patterns stability analysis may be realized analytically. In other cases the algorithm of numerical stability investigation is proposed. As a result of the numerical investigation stability of the solutions is shown for a wide range of input parameters. The sufficiency of the positivity of the relaxation parameter for the stability of solutions is demonstrated. The dispersion of the solutions, which is not realized for a linear diffusion equation, is demonstrated analytically and numerically for a wide range of the parameters. But the dispersive wave modes can be damped as an asymptotically stable solutions and the behavior of the solution is similar to the solution of linear diffusion equation. Numerical schemes, obtained from the proposed systems by various discretization techniques may be considered as a tool for computer modelling of diffusion processes, or as a solver for stationary problems and in applications of the splitting lattice Boltzmann method. Obtained results may be used for the comparison of the theoretical properties of the difference schemes of the lattice Boltzmann method for modelling of linear diffusion.