All issues

The ring of Gaussian numbers is considered. The estimation of the module of some analogue of Weyl's trigonometrical sum with summation on Gaussian numbers is proved by methods of the analytical number theory. Multiplicative norm of Gaussian numbers is less than some integer.

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.

New family of linearly implicit schemes are presented. This family allows to obtain methods which are equivalent to stiffly accurate implicit Runge–Kutta schemes (such as RadauIIA and LobattoIIIC) on nonautonomous linear problems. Notion of LN-equivalence of schemes is introduced. Order conditions and stability conditions of such methods are obtained with the use of media for computer symbolic calculations. Some examples of new schemes have been constructed. Numerical studying of new method have been done with the use of classical tests for stiff problems.

The method of conversion of surface representation to the voxel data is developed. Voxel data based algorithm of hexahedral mesh generation is proposed.

Microarray datasets are highly dimensional, with a small number of collected samples in comparison to thousands of features. This poses a significant challenge that affects the interpretation, applicability and validation of the analytical results. Matrix factorizations have proven to be a useful method for describing data in terms of a small number of meta-features, which reduces noise, while still capturing the essential features of the data. Three novel and mutually relevant methods are presented in this paper: 1) gradient-based matrix factorization with two adaptive learning rates (in accordance with the number of factor matrices) and their automatic updates; 2) nonparametric criterion for the selection of the number of factors; and 3) nonnegative version of the gradient-based matrix factorization which doesn't require any extra computational costs in difference to the existing methods. We demonstrate effectiveness of the proposed methods to the supervised classification of gene expression data.

The approach to increase efficiency of Gill and Murray's algorithm of Newtonian methods of unconstrained optimization with step adjustment creation is offered, rests on Cholesky’s factorization. It is proved that the strategy of choice of the descent direction also determines the solution of the problem of scaling of steps at descent, and approximation by non-quadratic functions, and integration with a method of a confidential vicinity.

Problem of exploration finite undirected graphs by a collective of agents is considered in this work. Two agents-researchers simultaneously move on graph, they read and change marks of graph elements, transfer the information to the agent-experimenter (it builds explored graph representation). It was constructed an algorithm linear (from amount of the graph’s nodes) time complexity, quadratic space complexity and communication complexity, that is equal to O(n²·log(n)). Two agents (which move on graph) need two different colors (in total three colors) for graph exploration. An algorithm is based on depth-first traversal method.

Relevance of the problem of asteroid and comet impact hazard is considered. The short list of falling of space bodies to the Earth and their flights about it on distances, smaller  distances to the Moon, for the last 100 years is carried out. The question about  development of the federal research program on space protection of our planet and its integration into the international program is raised.

The paper develops a theory of a new so-called two-parametric approach to the random signals' analysis and processing. A mathematical simulation and the task solutions’ comparison have been implemented for the Gauss and Rice statistical models. The applicability of the Rice statistical model is substantiated for the tasks of data and images processing when the signal’s envelope is being analyzed. A technique is developed and theoretically substantiated for solving the task of the noise suppression and initial image reconstruction by means of joint calculation of both statistical parameters — an initial signal’s mean value and noise dispersion — based on the maximum likelihood method within the Rice distribution. The peculiarities of this distribution’s likelihood function and the following from them possibilities of the signal and noise estimation have been analyzed.

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.