All issues

Investigation of occurrence of diffusion instability in a set of three reaction–diffusion equations is carried out. In the general case the condition for both Turing and wave instabilities are obtained. Qualitative properties of the system, in which the bifurcation of each of the two types can take place, are clarified. In numerical experiments it is shown that if the corresponding conditions are met in the nonlinear model, spatiotemporal patterns are formed, which are predicted by linear analysis.

Traditional classification of real complex networks on biological, technological and social is incomplete, as there is a huge variety of artworks, which structure also can be presented in the form of networks. In this paper the review of researches of the complex networks, modeling some literary, musical and painting works is given. Corresponding networks are offered for naming cognitive networks. The possible directions of studying of such networks are discussed.

In the field of naval architecture the most competent recommendations in verification and validation of the numerical methods were developed within an international workshop on the numerical prediction of ship viscous flow which is held every five years in Gothenburg (Sweden) and Tokyo (Japan) alternately. In the workshop “Gothenburg–2000” three modern hull forms with reliable experimental data were introduced as test cases. The most general case among them is a containership KCS, a ship of moderate specific speed and fullness. The paper focuses on a numerical research of KCS hull flow, which was made according to the formal procedures of the workshop with the help of CEA FlowVision. Findings were compared with experimental data and computational data of other key CEA.

The mathematical model of a three-layered Co/Cu/Co nanopillar for MRAM cell with one fixed and one free layer was investigated in the approximation of uniformly distributed magnetization. The anisotropy axis is perpendicular to the layers (so-called perpendicular anisotropy). Initially the magnetization of the free layer is oriented along the anisotropy axis in the position accepted to be “zero”. Simultaneous magnetic field and spinpolarized current engaging can reorient the magnetization to another position which in this context can be accepted as “one”. The mathematical description of the effect is based on the classical vector Landau–Lifshits equation with the dissipative term in the Gilbert form. In our model we took into account the interactions of the magnetization with an external magnetic field and such effective magnetic fields as an anisotropy and demagnetization ones. The influence of the spin-polarized injection current is taken into account in the form of Sloczewski–Berger term. The model was reduced to the set of three ordinary differential equations with the first integral. It was shown that at any current and field the dynamical system has two main equilibrium states on the axis coincident with anisotropy axis. It was ascertained that in contrast with the longitudinal-anisotropy model, in the model with perpendicular anisotropy there are no other equilibrium states. The stability analysis of the main equilibrium states was performed. The bifurcation diagrams characterizing the magnetization dynamics at different values of the control parameters were built. The classification of the phase portraits on the unit sphere was performed. The features of the dynamics at different values of the parameters were studied and the conditions of the magnetization reorientation were determined. The trajectories of magnetization switching were calculated numerically using the Runge–Kutta method. The parameter values at which limit cycles exist were determined. The threshold values for the switching current were found analytically. The threshold values for the structures with longitudinal and perpendicular anisotropy were compared. It was established that in the structure with the perpendicular anisotropy at zero field the switching current is an order lower than in the structure with the longitudinal one.

Equations of motion in Newtonian and Hamiltonian forms are used for classical molecular dynamics simulation of particle system time evolution. When Newton equations of motion are used for finding of particle coordinates and velocities in $N$-particle system it takes to solve $3N$ ordinary differential equations of second order at every time step. Traditionally numerical schemes of Verlet method are used for solving Newtonian equations of motion of molecular dynamics. A step of integration is necessary to decrease for Verlet numerical schemes steadiness conservation on sufficiently large time intervals. It leads to a significant increase of the volume of calculations. Numerical schemes of Verlet method with Hamiltonian conservation control (the energy of the system) at every time moment are used in the most software packages of molecular dynamics for numerical integration of equations of motion. It can be used two complement each other approaches to decrease of computational time in molecular dynamics calculations. The first of these approaches is based on enhancement and software optimization of existing software packages of molecular dynamics by using of vectorization, parallelization and special processor construction. The second one is based on the elaboration of efficient methods for numerical integration for equations of motion. A procedure for constructing of explicit, implicit and symmetric symplectic numerical schemes with given approximation accuracy in relation to integration step for solving of molecular dynamic equations of motion in Hamiltonian form is proposed in this work. The approach for construction of proposed in this work procedure is based on the following points: Hamiltonian formulation of equations of motion; usage of Taylor expansion of exact solution; usage of generating functions, for geometrical properties of exact solution conservation, in derivation of numerical schemes. Numerical experiments show that obtained in this work symmetric symplectic third-order accuracy scheme conserves basic properties of the exact solution in the approximate solution. It is more stable for approximation step and conserves Hamiltonian of the system with more accuracy at a large integration interval then second order Verlet numerical schemes.

We consider a numerically stable direct multiplicative algorithm of solving linear equations systems, which takes into account the sparseness of matrices presented in a packed form. The advantage of the algorithm is the ability to minimize the filling of the main rows of multipliers without losing the accuracy of the results. Moreover, changes in the position of the next processed row of the matrix are not made, what allows using static data storage formats. Linear system solving by a direct multiplicative algorithm is, like the solving with $LU$-decomposition, just another scheme of the Gaussian elimination method implementation.

In this paper, this algorithm is the basis for solving the following problems:

Problem 1. Setting the descent direction in Newtonian methods of unconditional optimization by integrating one of the known techniques of constructing an essentially positive definite matrix. This approach allows us to weaken or remove additional specific difficulties caused by the need to solve large equation systems with sparse matrices presented in a packed form.

Problem 2. Construction of a new mathematical formulation of the problem of quadratic programming and a new form of specifying necessary and sufficient optimality conditions. They are quite simple and can be used to construct mathematical programming methods, for example, to find the minimum of a quadratic function on a polyhedral set of constraints, based on solving linear equations systems, which dimension is not higher than the number of variables of the objective function.

Problem 3. Construction of a continuous analogue of the problem of minimizing a real quadratic polynomial in Boolean variables and a new form of defining necessary and sufficient conditions of optimality for the development of methods for solving them in polynomial time. As a result, the original problem is reduced to the problem of finding the minimum distance between the origin and the angular point of a convex polyhedron, which is a perturbation of the $n$-dimensional cube and is described by a system of double linear inequalities with an upper triangular matrix of coefficients with units on the main diagonal. Only two faces are subject to investigation, one of which or both contains the vertices closest to the origin. To calculate them, it is sufficient to solve $4n – 4$ linear equations systems and choose among them all the nearest equidistant vertices in polynomial time. The problem of minimizing a quadratic polynomial is $NP$-hard, since an $NP$-hard problem about a vertex covering for an arbitrary graph comes down to it. It follows therefrom that $P = NP$, which is based on the development beyond the limits of integer optimization methods.

A numerically stable direct multiplicative method for solving systems of linear equations that takes into account the sparseness of matrices presented in a packed form is considered. The advantage of the method is the calculation of the Cholesky factors for a positive definite matrix of the system of equations and its solution within the framework of one procedure. And also in the possibility of minimizing the filling of the main rows of multipliers without losing the accuracy of the results, and no changes are made to the position of the next processed row of the matrix, which allows using static data storage formats. The solution of the system of linear equations by a direct multiplicative algorithm is, like the solution with LU-decomposition, just another scheme for implementing the Gaussian elimination method.

The calculation of the Cholesky factors for a positive definite matrix of the system and its solution underlies the construction of a new mathematical formulation of the unconditional problem of quadratic programming and a new form of specifying necessary and sufficient conditions for optimality that are quite simple and are used in this paper to construct a new mathematical formulation for the problem of quadratic programming on a polyhedral set of constraints, which is the problem of finding the minimum distance between the origin ordinate and polyhedral boundary by means of a set of constraints and linear algebra dimensional geometry.

To determine the distance, it is proposed to apply the known exact method based on solving systems of linear equations whose dimension is not higher than the number of variables of the objective function. The distances are determined by the construction of perpendiculars to the faces of a polyhedron of different dimensions. To reduce the number of faces examined, the proposed method involves a special order of sorting the faces. Only the faces containing the vertex closest to the point of the unconditional extremum and visible from this point are subject to investigation. In the case of the presence of several nearest equidistant vertices, we investigate a face containing all these vertices and faces of smaller dimension that have at least two common nearest vertices with the first face.

The well-known evolutionary equation of mathematical physics, which in modern mathematical literature is called the Kuramoto – Sivashinsky equation, is considered. In this paper, this equation is studied in the original edition of the authors, where it was proposed, together with the homogeneous Neumann boundary conditions.

The question of the existence and stability of local attractors formed by spatially inhomogeneous solutions of the boundary value problem under study has been studied. This issue has become particularly relevant recently in connection with the simulation of the formation of nanostructures on the surface of semiconductors under the influence of an ion flux or laser radiation. The question of the existence and stability of second-order equilibrium states has been studied in two different ways. In the first of these, the Galerkin method was used. The second approach is based on using strictly grounded methods of the theory of dynamic systems with infinite-dimensional phase space: the method of integral manifolds, the theory of normal forms, asymptotic methods.

In the work, in general, the approach from the well-known work of D.Armbruster, D.Guckenheimer, F.Holmes is repeated, where the approach based on the application of the Galerkin method is used. The results of this analysis are substantially supplemented and developed. Using the capabilities of modern computers has helped significantly complement the analysis of this task. In particular, to find all the solutions in the fourand five-term Galerkin approximations, which for the studied boundary-value problem should be interpreted as equilibrium states of the second kind. An analysis of their stability in the sense of A. M. Lyapunov’s definition is also given.

In this paper, we compare the results obtained using the Galerkin method with the results of a bifurcation analysis of a boundary value problem based on the use of qualitative analysis methods for infinite-dimensional dynamic systems. Comparison of two variants of results showed some limited possibilities of using the Galerkin method.

An algorithm for solving the conjugation of aerodynamic and ballistic problems, which is based on the method of modeling with the help of a grid system, has been complemented by a numerical mechanism that allows to take into account the relative movement and rotation of bodies relative to their centers of mass. For a given configuration of the bodies a problem of flow is solved by relaxation method. After that the state of the system is recalculated after a short amount of time. With the use of iteration it is possible to trace the dynamics of the system over a large period of time. The algorithm is implemented for research of flight of systems of bodies taking into account their relative position and rotation. The algorithm was tested on the problem of flow around a body with segmental-conical form. A good correlation of the results with experimental studies was shown. The algorithm is used to calculate the problem of the supersonic fight of a rotating body. For bodies of rectangular shape, imitating elongated fragments of a meteoroid, it is shown that for elongated bodies the aerodynamically more stable position is flight with a larger area across the direction of flight. This de facto leads to flight of bodies with the greatest possible aerodynamic resistance due to the maximum midship area. The algorithm is used to calculate the flight apart of two identical bodies of a rectangular shape, taking into account their rotation. Rotation leads to the fact that the bodies fly apart not only under the action of the pushing aerodynamic force but also the additional lateral force due to the acquisition of the angle of attack. The velocity of flight apart of two fragments with elongated shape of a meteoric body increases to three times with the account of rotation in comparison with the case, when it is assumed that the bodies do not rotate. The study was carried out in order to evaluate the influence of various factors on the velocity of fragmentation of the meteoric body after destruction in order to construct possible trajectories of fallen on earth meteorites. A developed algorithm for solving the conjugation of aerodynamic and ballistic problems, taking into account the relative movement and rotation of the bodies, can be used to solve technical problems, for example, to study the dynamics of separation of aircraft stages.

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.