Volume 57, Nº 8 (2017)

The problem of approximating the set of all solutions to a system of nonlinear inequalities is studied. A method based on the concept of nonuniform coverings is proposed. It allows one to obtain an interior and exterior approximation of this set with a prescribed accuracy. The efficiency of the method is demonstrated by determining the workspace of a parallel robot.

A strongly convex function of simple structure (for example, separable) is minimized under affine constraints. A dual problem is constructed and solved by applying a fast gradient method. The necessary properties of this method are established relying on which, under rather general conditions, the solution of the primal problem can be recovered with the same accuracy as the dual solution from the sequence generated by this method in the dual space of the problem. Although this approach seems natural, some previously unpublished rather subtle results necessary for its rigorous and complete theoretical substantiation in the required generality are presented.

A singular integral equation with a Cauchy kernel and a logarithmic singularity on its righthand side is considered on a finite interval. An algorithm is proposed for the numerical solution of this equation. The contact elasticity problem of a П-shaped rigid punch indented into a half-plane is solved in the case of a uniform hydrostatic pressure occurring under the punch, which leads to a logarithmic singularity at an endpoint of the integration interval. The numerical solution of this problem shows the efficiency of the proposed approach and suggests that the singularity has to be taken into account in solving the equation.

An electrostatic problem of determining a potential in a domain containing an incoming dielectric corner, which reduces to solving Poisson’s equation in this domain, is considered. A specific feature of the solution of this problem is that it is bounded in a neighborhood of the dielectric corner but its gradient increases without limit. An efficient hybrid algorithm for the numerical solution of the problem, based on the finite element method and taking into account the known asymptotic representation of the solution in the neighborhood of the dielectric corner, is proposed.

A method for direct numerical simulation of three-dimensional unsteady disturbances leading to a laminar–turbulent transition at hypersonic flow speeds is proposed. The simulation relies on solving the full three-dimensional unsteady Navier–Stokes equations. The computational technique is intended for multiprocessor supercomputers and is based on a fully implicit monotone approximation scheme and the Newton–Raphson method for solving systems of nonlinear difference equations. This approach is used to study the development of three-dimensional unstable disturbances in a flat-plate and compression-corner boundary layers in early laminar–turbulent transition stages at the free-stream Mach number M = 5.37. The three-dimensional disturbance field is visualized in order to reveal and discuss features of the instability development at the linear and nonlinear stages. The distribution of the skin friction coefficient is used to detect laminar and transient flow regimes and determine the onset of the laminar–turbulent transition.

We consider the problem of partitioning a finite sequence of Euclidean points into a given number of clusters (subsequences) using the criterion of the minimal sum (over all clusters) of intercluster sums of squared distances from the elements of the clusters to their centers. It is assumed that the center of one of the desired clusters is at the origin, while the center of each of the other clusters is unknown and determined as the mean value over all elements in this cluster. Additionally, the partition obeys two structural constraints on the indices of sequence elements contained in the clusters with unknown centers: (1) the concatenation of the indices of elements in these clusters is an increasing sequence, and (2) the difference between an index and the preceding one is bounded above and below by prescribed constants. It is shown that this problem is strongly NP-hard. A 2-approximation algorithm is constructed that is polynomial-time for a fixed number of clusters.