## Vol 27, No 1 (2019)

**Year:**2019**Articles:**6**URL:**http://journals.rudn.ru/miph/issue/view/1243**DOI:**https://doi.org/10.22363/2658-4670-2019-27-1

###### Abstract

In this paper, we consider a single server queueing model M |M |1|N with two types of calls: incoming calls and outgoing calls, where incoming calls arrive at the server according to a Poisson process. Upon arrival, an incoming call immediately occupies the server if it is idle or joins an orbit if the server is busy. From the orbit, an incoming call retries to occupy the server and behaves the same as a fresh incoming call. The server makes an outgoing calls after an exponentially distributed idle time. It can be interpreted as that outgoing calls arrive at the server according to a Poisson process. There are N types of outgoing calls whose durations follow N distinct exponential distributions. Our contribution is to derive the asymptotics of the number of incoming calls in retrial queue under the conditions of high rates of making outgoing calls and low rates of service time of each type of outgoing calls. Based on the obtained asymptotics, we have built the approximations of the probability distribution of the number of incoming calls in the system.

**Discrete and Continuous Models and Applied Computational Science**. 2019;27(1):5-20

###### Abstract

In this article we present a parallel algorithm for simulation of the heat conduction process inside the so-called pulse cryogenic cell. This simulation is important for designing the device for portion injection of working gases into ionization chamber of ion source. The simulation is based on the numerical solving of the quasilinear heat equation with periodic source in a multilayered cylindrical domain. For numerical solution the Alternating Direction Implicit (ADI) method is used. Due to the non-linearity of the heat equation the simple-iteration method has been applied. In order to ensure convergence of the iteration process, the adaptive time-step has been implemented. The parallelization of the calculation has been realized with shared memory application programming interface OpenMP and the performance of the parallel algorithm is in agreement with the case studies in literature.

**Discrete and Continuous Models and Applied Computational Science**. 2019;27(1):21-32

###### Abstract

Runge-Kutta schemes play a very important role in solving ordinary differential equations numerically. At first we want to present the Sage routine for calculation of Butcher matrix, we call it an rk package. We tested our Sage routine in several numerical experiments with standard and symplectic schemes and verified our result by corporation with results of the calculations made by hand.Second, in Sage there are the excellent tools for investigation of algebraic sets, based on Gröbner basis technique. As we all known, the choice of parameters in Runge- Kutta scheme is free. By the help of these tools we study the algebraic properties of the manifolds in affine space, coordinates of whose are Butcher coefficients in Runge-Kutta scheme. Results are given both for explicit Runge-Kutta scheme and implicit Runge-Kutta scheme by using our rk package. Examples are carried out to justify our results. All calculation are executed in the computer algebra system Sage.

**Discrete and Continuous Models and Applied Computational Science**. 2019;27(1):33-41

###### Abstract

Partial differential equations of the first order, arising in applied problems of optics and optoelectronics, often contain coefficients that are not defined by a single analytical expression in the entire considered domain. For example, the eikonal equation contains the refractive index, which is described by various expressions depending on the optical properties of the media that fill the domain under consideration. This type of equations cannot be analysed by standard tools built into modern computer algebra systems, including Maple.The paper deals with the adaptation of the classical Cauchy method of integrating partial differential equations of the first order to the case when the coefficients of the equation are given by various analytical expressions in the subdomains G1, . . . , Gk , into which the considered domain is divided. In this case, it is assumed that these subdomains are specified by inequalities. This integration method is implemented as a Python program using the SymPy library. The characteristics are calculatednumerically using the Runge-Kutta method, but taking into account the change in the expressions for the coefficients of the equation when passing from one subdomain to another. The main functions of the program are described, including those that can be used to illustrate the Cauchy method. The verification was carried out by comparison with the results obtained in the Maple computer algebra system.

**Discrete and Continuous Models and Applied Computational Science**. 2019;27(1):42-48

###### Abstract

This paper describes the created mathematical model that allows you to explore the dynamics of cavitation bubbles under the influence of a single negative pressure pulse. The time dependence and coordinates of the parameters of the carrier phase, the temperature and pressure of the vapor phase, the concentration and size of the bubbles are determined numerically. It is concluded that the model created gives a good agreement between the calculated and experimental data.

**Discrete and Continuous Models and Applied Computational Science**. 2019;27(1):49-59

###### Abstract

This article addresses the issues of volume integral equation method application to magnetic system calculations. The main advantage of this approach is that in this case finding the solution of equations is reduced to the area filled with ferromagnetic. The difficulty of applying the method is connected with kernel singularity of integral equations. For this reason in collocation method only piecewise constant approximation of unknown variables is used within the limits of fragmentation elements inside the famous package GFUN3D. As an alternative approach the points of observation can be replaced by integration over fragmentation element, which allows to use approximation of unknown variables of a higher order.In the presented work the main aspects of applying this approach to magnetic systems modelling are discussed on the example of linear approximation of unknown variables: discretisation of initial equations, decomposition of the calculation area to elements, calculation of discretised system matrix elements, solving the resulting nonlinear equation system. In the framework of finite element method the calculation area is divided into a set of tetrahedrons. At the beginning the initial area is approximated by a combination of macro-blocks with a previously constructed two-dimensional mesh at their borders. After that for each macro-block separately the procedure of tetrahedron mesh construction is performed. While calculating matrix elements sixfold integrals over two tetrahedra are reduced to a combination of fourfold integrals over triangles, which are calculated using cubature formulas. Reduction of singular integrals to the combination of the regular integrals is proposed with the methods based on the concept of homogeneous functions. Simple iteration methods are used to solve non-linear discretized systems, allowing to avoid reversing large-scale matrixes. The results of the modelling are compared with the calculations obtained using other methods.

**Discrete and Continuous Models and Applied Computational Science**. 2019;27(1):60-69