All issues

Two algorithms of evaluation of the continuous wavelet transform with the Morlet wavelet are presented. The first one is the solution of PDE with transformed signal, which plays a role of the initial value. The second allows to explore the influence of central frequency variation via the diffusion smoothing of the data modulated by the harmonic functions. These approaches are illustrated by the analysis of the chaotic oscillations of the coupled Roessler systems.

The necessary and sufficient terms of solution existence of nonlinear autonomous Noetherian boundary-value problem are found in special critical case. The characteristic feature of the set problems is impossibility of direct application of traditional research schematic representation and construction of solutions of critical boundary-value problems, which was created in works of I.G. Malkin, A.M. Samoilenko, E.A. Grebenikov, Yu.A. Ryabov and A.A. Boichuk. For the solution construction of Noetherian boundary-value problem in special critical case an iterative procedure is recommended, it is constructed according to the scheme of least-squares method. Efficiency of the offered technique is shown on the example of analysis for periodic problems for Hill equation.

Convergence to the solution of the linear system with real quadrate non singular matrix A with real necessary different sign eigen values of two families of simple iteration method: two-parametric and symmetrized one-parametric generated by these A and b is considered. Also these methods are compared when matrix A is a symmetric one. In this case it is proved that the coefficient of the optimal compression of two-parametric family is strongly less than the coefficient of the optimal compression of symmetrized one-parametric family of the simple iteration method.

The problem of the Nash equilibrium in bimatrix game is considered. The search for a solution is associated with a problem of nonlinear programming. Application of the method of feasible directions for the solution of such a problem is investigated.

In the current paper, we study a Galerkin–Petrov method for a parabolic equations of higher order in domain with a moving boundary. Asymptotic estimates for the convergence rate of approximate solutions are obtained.

This article is dedicated to the use of higher degree $S$-splines for solving equations of the elasticity theory. As an example we consider the solution to the equation of bending of a plate on a circle. $S$-spline is a piecewise-polynomial function. Its coefficients are defined by two conditions. The first part of the coefficients are defined by the smoothness of the spline. The rest are determined using the least-squares method. We consider class $C^4$ 7th degree $S$-splines.

We consider a model of stacked long Josephson junctions (LJJ), which consists of alternating superconducting and dielectric layers. The model takes into account the inductive and capacitive coupling between the neighbor junctions. The model is described by a system of nonlinear partial differential equations with respect to the phase differences and the voltage of LJJ, with appropriate initial and boundary conditions. The numerical solution of this system of equations is based on the use of standard three-point finite-difference formulae for discrete approximations in the space coordinate, and the applying the four-step Runge-Kutta method for solving the Cauchy problem obtained. Designed parallel algorithm is implemented by means of the MPI technology (Message Passing Interface). In the paper, the mathematical formulation of the problem is given, numerical scheme and a method of calculation of the current-voltage characteristics of the LJJ system are described. Two variants of parallel implementation are presented. The influence of inductive and capacitive coupling between junctions on the structure of the current-voltage characteristics is demonstrated. The results of methodical calculations with various parameters of length and number of Josephson junctions in the LJJ stack depending on the number of parallel computing nodes, are presented. The calculations have been performed on multiprocessor clusters HybriLIT and CICC of Multi-Functional Information and Computing Complex (Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna). The numerical results are discussed from the viewpoint of the effectiveness of presented approaches of the LJJ system numerical simulation in parallel. It has been shown that one of parallel algorithms provides the 9 times speedup of calculations.

In the science development an important role the scientific schools are played. This schools are the associations of researchers connected by the common problem, the ideas and the methods used for problems solution. Usually Scientific schools are formed around the leader and the uniting idea.

The several sciences schools were created around academician A. S. Kholodov during his scientific and pedagogical activity.

This review tries to present the main scientific directions in which the bright science collectives with the common frames of reference and approaches to researches were created. In the review this common base is marked out. First, this is development of the group of numerical methods for hyperbolic type systems of partial derivatives differential equations solution — grid and characteristic methods. Secondly, the description of different numerical methods in the undetermined coefficients spaces. This approach developed for all types of partial equations and for ordinary differential equations.

On the basis of A. S. Kholodov’s numerical approaches the research teams working in different subject domains are formed. The fields of interests are including mathematical modeling of the plasma dynamics, deformable solid body dynamics, some problems of biology, biophysics, medical physics and biomechanics. The new field of interest includes solving problem on graphs (such as processes of the electric power transportation, modeling of the traffic flows on a road network etc).

There is the attempt in the present review analyzed the activity of scientific schools from the moment of their origin so far, to trace the connection of A. S. Kholodov’s works with his colleagues and followers works. The complete overview of all the scientific schools created around A. S. Kholodov is impossible due to the huge amount and a variety of the scientific results.

The attempt to connect scientific schools activity with the advent of scientific and educational school in Moscow Institute of Physics and Technology also becomes.

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.

The modified two-sweep iteration procedure was proposed, built according to the least-squares method scheme, which determines progressive approximations to the periodic solution of Mathieu’s equation and his own function, considerably superior according to the accuracy earlier well-known results.