All issues

The work is devoted to the development of a computational algorithm of the Cartesian grid method for studying the interaction of a shock wave with moving bodies with a piecewise linear boundary. The interest in such problems is connected with direct numerical simulation of two-phase media flows. The effect of the particle shape can be important in the problem of dust layer dispersion behind a passing shock wave. Experimental data on the coefficient of aerodynamic drag of non-spherical particles are practically absent.

Mathematical model is based on the two-dimensional Euler equations, which are solved in a region with varying boundaries. The defining system of equations is integrated using an explicit scheme and the Cartesian grid method. The computational algorithm at the time integration step includes: determining the step value, calculating the dynamics of the body movement (determining the force and moment acting on the body; determining the linear and angular velocities of the body; calculating the new coordinates of the body), calculating the gas parameters. At each time step, all cells are divided into two classes – external (inside the body or intersected by its boundaries) and internal (completely filled with gas). The solution of the Euler equations is constructed only in the internal ones. The main difficulty is the calculation of the numerical flux through the edges common to the internal and external cells intersected by the moving boundaries of the bodies. To calculate this flux, we use a two-wave approximation for solving the Riemann problem and the Steger-Warming scheme. A detailed description of the numerical algorithm is presented.

The efficiency of the algorithm is demonstrated on the problem of lifting a cylinder with a base in the form of a circle, ellipse and rectangle behind a passing shock wave. A circular cylinder test was considered in many papers devoted to the immersed boundary methods development. A qualitative and quantitative analysis of the trajectory of the cylinder center mass is carried out on the basis of comparison with the results of simulations presented in eight other works. For a cylinder with a base in the form of an ellipse and a rectangle, a satisfactory agreement was obtained on the dynamics of its movement and rotation in comparison with the available few literary sources. Grid convergence of the results is investigated for the rectangle. It is shown that the relative error of mass conservation law fulfillment decreases with a linear rate.

Modern methods of complex planning the execution of task packages in multistage systems are characterized by the presence of restrictions on the dimension of the problem being solved, the impossibility of guaranteed obtaining effective solutions for various values of its input parameters, as well as the impossibility of registration the conditions for the formation of sets from the result and the restriction on the interval duration of time of the system operating. The decomposition of the generalized function of the system into a set of hierarchically interconnected subfunctions is implemented to solve the problem of scheduling the execution of task packages with generating sets of results and the restriction on the interval duration of time for the functioning of the system. The use of decomposition made it possible to employ the hierarchical approach for planning the execution of task packages in multistage systems, which provides the determination of decisions by the composition of task groups at the first level of the hierarchy decisions by the composition of task packages groups executed during time intervals of limited duration at the second level and schedules for executing packages at the third level the hierarchy. In order to evaluate decisions on the composition of packages, the results of their execution, obtained during the specified time intervals, are distributed among the packages. The apparatus of the theory of hierarchical games is used to determine complex solutions. A model of a hierarchical game for making decisions by the compositions of packages, groups of packages and schedules of executing packages is built, which is a system of hierarchically interconnected criteria for optimizing decisions. The model registers the condition for the formation of sets from the results of the execution of task packages and restriction on duration of time intervals of its operating. The problem of determining the compositions of task packages and groups of task packages is NP-hard; therefore, its solution requires the use of approximate optimization methods. In order to optimize groups of task packages, the construction of a method for formulating initial solutions by their compositions has been implemented, which are further optimized. Moreover, a algorithm for distributing the results of executing task packages obtained during time intervals of limited duration by sets is formulated. The method of local solutions optimization by composition of packages groups, in accordance with which packages are excluded from groups, the results of which are not included in sets, and packages, that aren’t included in any group, is proposed. The software implementation of the considered method of complex optimization of the compositions of task packages, groups of task packages, and schedules for executing task packages from groups (including the implementation of the method for optimizing the compositions of groups of task packages) has been performed. With its use, studies of the features of the considered planning task are carried out. Conclusion are formulated concerning the dependence of the efficiency of scheduling the execution of task packages in multistage system under the introduced conditions from the input parameters of the problem. The use of the method of local optimization of the compositions of groups of task packages allows to increase the number of formed sets from the results of task execution in packages from groups by 60% in comparison with fixed groups (which do not imply optimization).

The article presents the results of a numerical study of the flow structure in a two-dimensional flat diffuser. A feature of diffusers is that they have a complex anisotropic turbulent flow, which occurs due to recirculation flows. The turbulent RANS models, which are based on the Boussinesq hypothesis, are not able to describe the flow in diffusers with sufficient accuracy. Because the Boussinesq hypothesis is based on isotropic turbulence. Therefore, to calculate anisotropic turbulent flows, models are used that do not use this hypothesis. One of such directions in turbulence modeling is the methods of Reynolds stresses. These methods are complex and require rather large computational resources. In this work, a relatively recently developed two-fluid turbulence model was used to study the flow in a flat diffuser. This model is developed on the basis of a two-fluid approach to the problem of turbulence. In contrast to the Reynolds approach, the two-fluid approach allows one to obtain a closed system of turbulence equations using the dynamics of two fluids. Consequently, if empirical equations are used in RANS models for closure, then in the two-fluid model the equations used are exact equations of dynamics. One of the main advantages of the two-fluid model is that it is capable of describing complex anisotropic turbulent flows. In this work, the obtained numerical results for the profiles of the longitudinal velocity, turbulent stresses in various sections of the channel, as well as the friction coefficient are compared with the known experimental data. To demonstrate the advantages of the used turbulence model, the numerical results of the Reynolds stress method EARSM are also presented. For the numerical implementation of the systems of equations of the two-fluid model, a non-stationary system of equations was used, the solution of which asymptotically approached the stationary solution. For this purpose, a finite-difference scheme was used, where the viscosity terms were approximated by the central difference implicitly, and for the convective terms, an explicit scheme against the flow of the second order of accuracy was used. The results are obtained for the Reynolds number Re = 20 000. It is shown that the two-fluid model, despite the use of a uniform computational grid without thickening near the walls, is capable of giving a more accurate solution than the rather complex Reynolds stress method with a high resolution of computational grids.

The paper is devoted to convex-concave saddle point problems where the objective is a sum of a large number of functions. Such problems attract considerable attention of the mathematical community due to the variety of applications in machine learning, including adversarial learning, adversarial attacks and robust reinforcement learning, to name a few. The individual functions in the sum usually represent losses related to examples from a data set. Additionally, the formulation admits a possibly nonsmooth composite term. Such terms often reflect regularization in machine learning problems. We assume that the dimension of one of the variable groups is relatively small (about a hundred or less), and the other one is large. This case arises, for example, when one considers the dual formulation for a minimization problem with a moderate number of constraints. The proposed approach is based on using Vaidya’s cutting plane method to minimize with respect to the outer block of variables. This optimization algorithm is especially effective when the dimension of the problem is not very large. An inexact oracle for Vaidya’s method is calculated via an approximate solution of the inner maximization problem, which is solved by the accelerated variance reduced algorithm Katyusha. Thus, we leverage the structure of the problem to achieve fast convergence. Separate complexity bounds for gradients of different components with respect to different variables are obtained in the study. The proposed approach is imposing very mild assumptions about the objective. In particular, neither strong convexity nor smoothness is required with respect to the low-dimensional variable group. The number of steps of the proposed algorithm as well as the arithmetic complexity of each step explicitly depend on the dimensionality of the outer variable, hence the assumption that it is relatively small.

A mathematical model is formulated for the coastal slope erosion of sandy channel, which occurs under the action of a passing flood wave. The moving boundaries of the computational domain — the bottom surface and the free surface of the hydrodynamic flow — are determined from the solution of auxiliary differential equations. A change in the hydrodynamic flow section area for a given law of change in the flow rate requires a change in time of the turbulent viscosity averaged over the section. The bottom surface movement is determined from the Exner equation solution together with the equation of the bottom material avalanche movement. The Exner equation is closed by the original analytical model of traction loads movement. The model takes into account transit, gravitational and pressure mechanisms of bottom material movement and does not contain phenomenological parameters.

Based on the finite element method, a discrete analogue of the formulated problem is obtained and an algorithm for its solution is proposed. An algorithm feature is control of the free surface movement influence of the flow and the flow rate on the process of determining the flow turbulent viscosity. Numerical calculations have been carried out, demonstrating qualitative and quantitative influence of these features on the determining process of the flow turbulent viscosity and the channel bank slope erosion.

Data comparison on bank deformations obtained as a result of numerical calculations with known flume experimental data showed their agreement.

A model of combustion of premixed mixture of gases with one global chemical reaction is considered, the model includes equations of the second order for temperature of mixture and concentrations of fuel and oxidizer, and the right-hand sides of these equations contain the reaction rate function. This function depends on five unknown parameters of the global reaction and serves as approximation to multistep reaction mechanism. The model is reduced, after replacement of variables, to one equation of the second order for temperature of mixture that transforms to a first-order equation for temperature derivative depending on temperature that contains a parameter of flame propagation velocity. Thus, for computing the parameter of burning velocity, one has to solve Dirichlet problem for first-order equation, and after that a model dependence of burning velocity on mixture equivalence ratio at specified reaction rate parameters will be obtained. Given the experimental data of dependence of burning velocity on mixture equivalence ratio, the problem of optimal selection of reaction rate parameters is stated, based on minimization of the mean square deviation of model values of burning velocity on experimental ones. The aim of our study is analysis of uniqueness of this problem solution. To this end, we apply computational experiment during which the problem of global search of optima is solved using multistart of gradient descent. The computational experiment clarifies that the inverse problem in this statement is underdetermined, and every time, when running gradient descent from a selected starting point, it converges to a new limit point. The structure of the set of limit points in the five-dimensional space is analyzed, and it is shown that this set can be described with three linear equations. Therefore, it might be incorrect to tabulate all five parameters of reaction rate based on just one match criterion between model and experimental data of flame propagation velocity. The conclusion of our study is that in order to tabulate reaction rate parameters correctly, it is necessary to specify the values of two of them, based on additional optimality criteria.

The aim of research is to develop software system for solving gas dynamic problem in multiply connected integration domains of regular shape by high-performance computing system. Comparison of the various technologies of parallel computing has been done. The program complex is implemented using multithreaded parallel systems to organize both multi-core and massively parallel calculation. The comparison of numerical results with known model problems solutions has been done. Research of performance of different computing platforms has been done.

We consider the two-dimensional mathematical model of wildfire. Numerical solution algorithm based on the method of large particles was developed for this model.

The article deals with the local and double local estimation of the Monte Carlo method for solving the equation of global illumination. The local estimation allows calculating the illumination at any point at the approximation of diffuse reflection, whereas the double local estimation allows calculating directly the luminance at a given point in a given direction. The article presents the mathematical basis of local estimations and the basic stages of the software implementation. The representation of three-dimensional objects in the basis of spherical functions and the possibility of using them in the local estimations are also considered.

We consider two versions of the maximum cross section method for the solutions of the stationary equation of radiative transfer in dimensional inhomogeneous medium. Both are based on the application Monte-Carlo method to the summation of the Neumann series for the solution transport equation. First modification is traditional and second is based on the use of branching Markov chains. We carried out numerical comparison of these algorithms.