All issues

A procedure of approximate solving of the radiation transfer problem is presented. The approximated solution is being built successively from the domain border along the direction of radiation propagation. The algorithm was tested for model problem of hot ball radiation.

This work is devoted to development of an algorithm for numerical integration of differential equations potentially-streaming method simulation of non-equilibrium processes. This method was developed by the author in his earlier published works. In this paper, consideration is limited to systems with lumped parameters. Also previously developed method for analyzing the correctness of the author of the approximate solution of the system potentially-streaming equations for systems in lumped parameters. The purpose of this article is to combine this technique with modern numerical methods for integrating systems of ordinary differential equations and the development of methods of numerical integration of systems of equations potentially-streaming method that allows to guarantee the correctness of the approximate solution.

The results of the numerical investigations of pulsating detonation wave propagation using the ENO-schemes with the approximation orders from the first to the fourth inclusively are presented. The results obtained with the use of the schemes of different approximation orders demonstrate that the pattern of detonation wave propagation in acetylene-air mixture corresponds to the analytical estimates both qualitatively and quantitatively. For the hydrogen-air mixture none of the schemes concerned provides the stable detonation wave propagation. The transition from the regular mode to the marginal one with the subsequent detonation breakup is observed.

We obtain asymptotic formula for upper bounds of deviations of Fejer sums on classes of Poisson integrals. Under certain conditions, formula guarantee the solvability of the Kolmogorov–Nikol’skiy problem for Fejer sums and classes of Poisson integrals.

The mathematical model of the magnetic memory cell MRAM with the in-plane anisotropy axis parallel to the edge of a free ferromagnetic layer (longitudinal anisotropy) has been constructed using approximation of uniform magnetization. The model is based on the Landau–Lifshits–Gilbert equation with the injection-current term in the Sloncžewski–Berger form. The set of ordinary differential equations for magnetization dynamics in a three-layered Co/Cu/Cu valve under the control of external magnetic field and spin-polarized current has been derived in the normal coordinate form. It was shown that the set of equations has two main stationary points on the anisotropy axis at any values of field and current. The stationary analysis of them has been performed. The algebraic equations for determination of additional stationary points have been derived. It has been shown that, depending on the field and current magnitude, the set of equations can have altogether two, four, or six stationary points symmetric in pairs relatively the anisotropy axis. The bifurcation diagrams for all the points have been constructed. The classification of the corresponding phase portraits has been performed. The typical trajectories were calculated numerically using Runge–Kutta method. The regions, where stable and unstable limit cycles exist, have been determined. It was found that the unstable limit cycles exist around the main stable equilibrium point on the axis that coincides with the anisotropy one, whereas the stable cycles surround the unstable additional points of equilibrium. The area of their existence was determined numerically. The new types of dynamics, such as accidental switching and non-complete switching, have been found. The threshold values of switching current and field have been obtained analytically. The estimations of switching times have been performed numerically.

Currently, different nonlinear numerical schemes of the spatial approximation are used in numerical simulation of boundary value problems for hyperbolic systems of partial differential equations (e. g. gas dynamics equations, MHD, deformable rigid body, etc.). This is due to the need to improve the order of accuracy and perform simulation of discontinuous solutions that are often occurring in such systems. The need for non-linear schemes is followed from the barrier theorem of S. K. Godunov that states the impossibility of constructing a linear scheme for monotone approximation of such equations with approximation order two or greater. One of the most accurate non-linear type schemes are ENO (essentially non oscillating) and their modifications, including WENO (weighted, essentially non oscillating) scemes. The last received the most widespread, since the same stencil width has a higher order of approximation than the ENO scheme. The benefit of ENO and WENO schemes is the ability to maintain a high-order approximation to the areas of non-monotonic solutions. The main difficulty of the analysis of such schemes comes from the fact that they themselves are nonlinear and are used to approximate the nonlinear equations. In particular, the linear stability condition was obtained earlier only for WENO5 scheme (fifth-order approximation on smooth solutions) and it is a numerical one. In this paper we consider the problem of construction and stability for WENO5, WENO7, WENO9, WENO11, and WENO13 finite volume schemes for the Hopf equation. In the first part of this article we discuss WENO methods in general, and give the explicit expressions for the coefficients of the polynomial weights and linear combinations required to build these schemes. We prove a series of assertions that can make conclusions about the order of approximation depending on the type of local solutions. Stability analysis is carried out on the basis of the principle of frozen coefficients. The cases of a smooth and discontinuous behavior of solutions in the field of linearization with frozen coefficients on the faces of the final volume and spectra of the schemes are analyzed for these cases. We prove the linear stability conditions for a variety of Runge-Kutta methods applied to WENO schemes. As a result, our research provides guidance on choosing the best possible stability parameter, which has the smallest effect on the nonlinear properties of the schemes. The convergence of the schemes is followed from the analysis.

The work submits new release of the FlowVision software designed for automation of engineering calculations in computational fluid dynamics: FlowVision 3.09.05. The FlowVision software is used for solving different industrial problems. Its popularity is based on the capability to solve complex non-tradition problems involving different physical processes. The paradigm of complete automation of labor-intensive and time-taking processes like grid generation makes FlowVision attractive for many engineers. FlowVision is completely developer-independent software. It includes an advanced graphical interface, the system for specifying a computational project as well as the system for flow visualization on planes, on curvilinear surfaces and in volume by means of different methods: plots, color contours, iso-lines, iso-surfaces, vector fields. Besides that, FlowVision provides tools for calculation of integral characteristics on surfaces and in volumetric regions.

The software is based on the finite-volume approach to approximation of the partial differential equations describing fluid motion and accompanying physical processes. It provides explicit and implicit methods for time integration of these equations. The software includes automated generator of unstructured grid with capability of its local dynamic adaptation. The solver involves two-level parallelism which allows calculations on computers with distributed and shared memory (coexisting in the same hardware). FlowVision incorporates a wide spectrum of physical models: different turbulence models, models for mass transfer accounting for chemical reactions and radioactive decay, several combustion models, a dispersed phase model, an electro-hydrodynamic model, an original VOF model for tracking moving interfaces. It should be noted that turbulence can be simulated within URANS, LES, and ILES approaches. FlowVision simulates fluid motion with velocities corresponding to all possible flow regimes: from incompressible to hypersonic. This is achieved by using an original all-speed velocity-pressure split algorithm for integration of the Navier-Stokes equations.

FlowVision enables solving multi-physic problems with use of different modeling tools. For instance, one can simulate multi-phase flows with use of the VOF method, flows past bodies moving across a stationary grid (within Euler approach), flows in rotary machines with use of the technology of sliding grid. Besides that, the software solves fluid-structure interaction problems using the technology of two-way coupling of FlowVision with finite-element codes. Two examples of solving challenging problems in the FlowVision software are demonstrated in the given article. The first one is splashdown of a spacecraft after deceleration by means of jet engines. This problem is characterized by presence of moving bodies and contact surface between the air and the water in the computational domain. The supersonic jets interact with the air-water interphase. The second problem is simulation of the work of a human heart with artificial and natural valves designed on the basis of tomographic investigations with use of a finite-element model of the heart. This problem is characterized by two-way coupling between the “liquid” computational domain and the finite-element model of the hart muscles.

In the article a theory of the implicit iterative line-by-line recurrence method for solving the systems of finite-difference equations which arise as a result of approximation of the two-dimensional elliptic differential equations on a regular grid is stated. On the one hand, the high effectiveness of the method has confirmed in practice. Some complex test problems, as well as several problems of fluid flow and heat transfer of a viscous incompressible liquid, have solved with its use. On the other hand, the theoretical provisions that explain the high convergence rate of the method and its stability are not yet presented in the literature. This fact is the reason for the present investigation. In the paper, the procedure of equivalent and approximate transformations of the initial system of linear algebraic equations (SLAE) is described in detail. The transformations are presented in a matrix-vector form, as well as in the form of the computational formulas of the method. The key points of the transformations are illustrated by schemes of changing of the difference stencils that correspond to the transformed equations. The canonical form of the method is the goal of the transformation procedure. The correctness of the method follows from the canonical form in the case of the solution convergence. The estimation of norms of the matrix operators is carried out on the basis of analysis of structures and element sets of the corresponding matrices. As a result, the convergence of the method is proved for arbitrary initial vectors of the solution of the problem.

The norm of the transition matrix operator is estimated in the special case of weak restrictions on a desired solution. It is shown, that the value of this norm decreases proportionally to the second power (or third degree, it depends on the version of the method) of the grid step of the problem solution area in the case of transition matrix order increases. The necessary condition of the method stability is obtained by means of simple estimates of the vector of an approximate solution. Also, the estimate in order of magnitude of the optimum iterative compensation parameter is given. Theoretical conclusions are illustrated by using the solutions of the test problems. It is shown, that the number of the iterations required to achieve a given accuracy of the solution decreases if a grid size of the solution area increases. It is also demonstrated that if the weak restrictions on solution are violated in the choice of the initial approximation of the solution, then the rate of convergence of the method decreases essentially in full accordance with the deduced theoretical results.

The paper deals with the problems of approximation of periodic functions of high smoothness by arithmetic means of Fourier sums. The simplest and natural example of a linear process of approximation of continuous periodic functions of a real variable is the approximation of these functions by partial sums of the Fourier series. However, the sequences of partial Fourier sums are not uniformly convergent over the entire class of continuous $2\pi$-periodic functions. In connection with this, a significant number of papers is devoted to the study of the approximative properties of other approximation methods, which are generated by certain transformations of the partial sums of Fourier series and allow us to construct sequences of trigonometrical polynomials that would be uniformly convergent for each function $f \in C$. In particular, over the past decades, de la Vallee Poussin sums and Fejer sums have been widely studied. One of the most important directions in this field is the study of the asymptotic behavior of upper bounds of deviations of arithmetic means of Fourier sums on different classes of periodic functions. Methods of investigation of integral representations of deviations of polynomials on the classes of periodic differentiable functions of real variable originated and received its development through the works of S.M. Nikol’sky, S.B. Stechkin, N.P. Korneichuk, V.K. Dzadyk, etc.

The aim of the work systematizes known results related to the approximation of classes of periodic functions of high smoothness by arithmetic means of Fourier sums, and presents new facts obtained for particular cases. In the paper is studied the approximative properties of $r$-repeated de la Vallee Poussin sums on the classes of periodic functions that can be regularly extended into the fixed strip of the complex plane. We obtain asymptotic formulas for upper bounds of the deviations of repeated de la Vallee Poussin sums taken over classes of periodic analytic functions. In certain cases, these formulas give a solution of the corresponding Kolmogorov–Nikolsky problem. We indicate conditions under which the repeated de la Vallee Poussin sums guarantee a better order of approximation than ordinary de la Vallee Poussin sums.

Padé approximation is a useful tool for extracting singularity information from a power series. A linear Padé approximant is a rational function and can provide estimates of pole and zero locations in the complex plane. A quadratic Padé approximant has square root singularities and can, therefore, provide additional information such as estimates of branch point locations. In this paper, we discuss numerical aspects of computing quadratic Padé approximants as well as some applications. Two algorithms for computing the coefficients in the approximant are discussed: a direct method involving the solution of a linear system (well-known in the mathematics community) and a recursive method (well-known in the physics community). We compare the accuracy of these two methods when implemented in floating-point arithmetic and discuss their pros and cons. In addition, we extend Luke’s perturbation analysis of linear Padé approximation to the quadratic case and identify the problem of spurious branch points in the quadratic approximant, which can cause a significant loss of accuracy. A possible remedy for this problem is suggested by noting that these troublesome points can be identified by the recursive method mentioned above. Another complication with the quadratic approximant arises in choosing the appropriate branch. One possibility, which is to base this choice on the linear approximant, is discussed in connection with an example due to Stahl. It is also known that the quadratic method is capable of providing reasonable approximations on secondary sheets of the Riemann surface, a fact we illustrate here by means of an example. Two concluding applications show the superiority of the quadratic approximant over its linear counterpart: one involving a special function (the Lambert $W$-function) and the other a nonlinear PDE (the continuation of a solution of the inviscid Burgers equation into the complex plane).