All issues

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.

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.

Newton and quasi-Newton methods of absolute optimization based on Cholesky factorization with adaptive step and finite difference approximation of the first and the second derivatives. In order to raise effectiveness of the quasi-Newton methods a modified version of Cholesky decomposition of quasi-Newton matrix is suggested. It solves the problem of step scaling while descending, allows approximation by non-quadratic functions, and integration with confidential neighborhood method. An approach to raise Newton methods effectiveness with finite difference approximation of the first and second derivatives is offered. The results of numerical research of algorithm effectiveness are shown.

The study of the Volterra model describing the competition of three types is carried out. The corresponding system of first-order differential equations with a quadratic right-hand side, after a change of variables, reduces to a system with eight parameters. Two of them characterize the growth rates of populations; for the first species, this parameter is taken equal to one. The remaining six coefficients define the species interaction matrix. Previously, in the analytical study of the so-called symmetric model [May, Leonard, 1975] and the asymmetric model [Chi, Wu, Hsu, 1998] with growth factors equal to unity, relations were established for the interaction coefficients, under which the system has a one-parameter family of limit cycles. In this paper, we carried out a numerical-analytical study of the complete system based on a cosymmetric approach, which made it possible to determine the ratios for the parameters that correspond to families of equilibria. Various variants of oneparameter families are obtained and it is shown that they can consist of both stable and unstable equilibria. In the case of an interaction matrix with unit coefficients, a multicosymmetry of the system and a two-parameter family of equilibria are found that exist for any growth coefficients. For various interaction coefficients, the values of growth parameters are found at which periodic regimes are realized. Their belonging to the family of limit cycles is confirmed by the calculation of multipliers. In a wide range of values that violate the relationships under which the existence of cycles is ensured, a slow oscillatory establishment, typical of the destruction of cosymmetry, is obtained. Examples are given where a fixed value of one growth parameter corresponds to two values of another parameter, so that there are different families of periodic regimes. Thus, the variability of scenarios for the development of a three-species system has been established.