All issues

We consider the approaches to the construction of methods for solving four-dimensional programming problems for calculating directions for multiple minimizations of smooth functions on a set of a given set of linear equalities. The approach consists of two stages.

At the first stage, the problem of quadratic programming is transformed by a numerically stable direct multiplicative algorithm into an equivalent problem of designing the origin of coordinates on a linear manifold, which defines a new mathematical formulation of the dual quadratic problem. For this, a numerically stable direct multiplicative method for solving systems of linear equations is proposed, taking into account the sparsity of matrices presented in packaged form. The advantage of this approach is to calculate the modified Cholesky factors to construct a substantially positive definite matrix of the system of equations and its solution in 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 in the position of the next processed row of the matrix, which allows the use of static data storage formats.

At the second stage, the necessary and sufficient optimality conditions in the form of Kuhn–Tucker determine the calculation of the direction of descent — the solution of the dual quadratic problem is reduced to solving a system of linear equations with symmetric positive definite matrix for calculating of Lagrange's coefficients multipliers and to substituting the solution into the formula for calculating the direction of descent.

It is proved that the proposed approach to the calculation of the direction of descent by numerically stable direct multiplicative methods at one iteration requires a cubic law less computation than one iteration compared to the well-known dual method of Gill and Murray. Besides, the proposed method allows the organization of the computational process from any starting point that the user chooses as the initial approximation of the solution.

Variants of the problem of designing the origin of coordinates on a linear manifold, a convex polyhedron and a vertex of a convex polyhedron are presented. Also the relationship and implementation of methods for solving these problems are described.

Computer-aided assembly planning of complex products is an important area of modern information technology. The sequence of assembly and decomposition of the product into assembly units largely depend on the mechanical structure of a technical system (machine, mechanical device, etc.). In most modern research, the mechanical structure of products is modeled using a graph of connections and its various modifications. The coordination of parts during assembly can be achieved by implementing several connections at the same time. This generates a $k$-ary basing relation on a set of product parts, which cannot be correctly described by graph means. A hypergraph model of the mechanical structure of a product is proposed. Modern discrete manufacturing uses sequential coherent assembly operations. The mathematical description of such operations is the normal contraction of edges of the hypergraph model. The sequence of contractions that transform the hypergraph into a point is a description of the assembly plan. Hypergraphs for which such a transformation exists are called $s$-hypergraphs. $S$-hypergraphs are correct mathematical models of the mechanical structures of any assembled products. A theorem on necessary conditions for the contractibility of $s$-hypergraphs is given. It is shown that the necessary conditions are not sufficient. An example of a noncontractible hypergraph for which the necessary conditions are satisfied is given. This means that the design of a complex technical system may contain hidden structural errors that make assembly of the product impossible. Therefore, finding sufficient conditions for contractibility is an important task. Two theorems on sufficient conditions for contractibility are proved. They provide a theoretical basis for developing an efficient computational procedure for finding all $s$-subgraphs of an $s$-hypergraph. An $s$-subgraph is a model of any part of a product that can be assembled independently. These are, first of all, assembly units of various levels of hierarchy. The set of all $s$-subgraphs of an $s$-hypergraph, ordered by inclusion, is a lattice. This model can be used to synthesize all possible sequences of assembly and disassembly of a product and its components. The lattice model of the product allows you to analyze geometric obstacles during assembly using algebraic means.

Pattern formation described by the scalar Fisher–Kolmogorov–Petrovsky–Piscounov equation with nonlocal competition loses and convection linear on coordinates is considered numerically. Initial function localized around a point is shown to transform in a function localized around a ring with symmetrically sited local maxima. The ring radius and number of maxima depend on convection.

As part of the paper, a physical and theoretical analysis of the impact processes of various factors of a highaltitude and high-energy nuclear explosion on the asteroid in extra-atmospheric conditions of open space is done. It is shown that, in accordance with the energy and permeability of the plasma of explosion products, X-ray and gamma-neutron radiation, a layered structure with a different energy density depending on angular coordinates is formed on the surface of the asteroid. The temporal patterns of the energy transformation for each layer is clarified and the roles of various photo- and collision processes are determined. The effect of a high-speed plasma flow is erosive in nature, and the plasma pulse is transmitted to the asteroid. The paper presents that in a thin layer of x-ray absorption, the asteroid substance is heated to high temperatures and as a result of its expansion, a recoil impulse is formed, which is not decisive due to the small mass of the expanding high-temperature plasma. Calculations shows that the main impulse received by an asteroid is associated with the entrainment of a heated layer of a substance formed by a neutron flux (7.5 E 10¹⁴ g E cm/s). It is shown that an asteroid with a radius of ~100 m acquires a velocity of . 100 cm/s. The calculations were performed taking into account the explosion energy spent on the destruction of the amorphous structure of the asteroid material (~1 eV/atom = 3.8 E 10¹⁰ erg/g) and ionization in the region of the high-temperature layer. Based on a similar analysis, an approximation is obtained for estimating the average size of fragments in the event of the possible destruction of the asteroid by shock waves generated inside it under the influence of pressure impulses. A physical experiment was conducted in laboratory conditions, simulating the fragmentation of a stone asteroid and confirming the validity of the obtained dependence on the selected values of certain parameters. As a result of numerical studies of the effects of the explosion, carried out at different distances from the surface of the asteroid, it is shown that taking into account the real geometry of the spallation layer gives the optimal height for the formation of the maximum asteroid momentum by a factor of 1.5 greater than similar estimates according to the simplified model. A two-stage concept of the impact of nuclear explosions on an asteroid using radar guidance tools is proposed. The paper analyzes the possible impact of the emerging ionization interference on the radar tracking of the movement of large fragments of the asteroid in the space-time evolution of all elements of the studied dynamic system.

New key parameters, namely b₀ = tgθ₀, θ₀ — angle of throwing, R_a — top curvature radius and β₀ — dimensionless speed square on the top of low angular trajectory were suggested in classic problem of integrating nonlinear equations of point mass projectile motion with quadratic air drag. Very precise formulae were obtained in a new way for coordinates x(b), y(b) and fly time t(b), b = tgθ where θ is inclination angle. This method is based on Legendre transformation and its precision is automatically improved in wide range of the θ₀ values and drag force parameters α. The precision was monitored by Maple computing product.

The article considers a mathematical model of decomposition of a complex product into assembly units. This is an important engineering problem, which affects the organization of discrete production and its operational management. A review of modern approaches to mathematical modeling and automated computer-aided of decompositions is given. In them, graphs, networks, matrices, etc. serve as mathematical models of structures of technical systems. These models describe the mechanical structure as a binary relation on a set of system elements. The geometrical coordination and integrity of machines and mechanical devices during the manufacturing process is achieved by means of basing. In general, basing can be performed on several elements simultaneously. Therefore, it represents a variable arity relation, which can not be correctly described in terms of binary mathematical structures. A new hypergraph model of mechanical structure of technical system is described. This model allows to give an adequate formalization of assembly operations and processes. Assembly operations which are carried out by two working bodies and consist in realization of mechanical connections are considered. Such operations are called coherent and sequential. This is the prevailing type of operations in modern industrial practice. It is shown that the mathematical description of such operation is normal contraction of an edge of the hypergraph. A sequence of contractions transforming the hypergraph into a point is a mathematical model of the assembly process. Two important theorems on the properties of contractible hypergraphs and their subgraphs proved by the author are presented. The concept of $s$-hypergraphs is introduced. $S$-hypergraphs are the correct mathematical models of mechanical structures of any assembled technical systems. Decomposition of a product into assembly units is defined as cutting of an $s$-hypergraph into $s$-subgraphs. The cutting problem is described in terms of discrete mathematical programming. Mathematical models of structural, topological and technological constraints are obtained. The objective functions are proposed that formalize the optimal choice of design solutions in various situations. The developed mathematical model of product decomposition is flexible and open. It allows for extensions that take into account the characteristics of the product and its production.

New method for calculation of spatial light distribution of differently oriented LEDs is proposed. The main idea is combination of coordinate systems associated with these light sources. Unlike other conventional approaches, this method can be applied to the emitters with light distribution with arbitrary symmetry or without symmetry at all.