All issues

In this paper, we introduce a new version of Gauss–Newton method for solving a system of nonlinear equations based on ideas of the residual upper bound for a system of nonlinear equations and a quadratic regularization term. The introduced Gauss–Newton method in practice virtually forms the whole parameterized family of the methods solving systems of nonlinear equations and regression problems. The developed family of Gauss–Newton methods completely consists of iterative methods with generalization for cases of non-euclidean normed spaces, including special forms of Levenberg–Marquardt algorithms. The developed methods use the local model based on a parameterized proximal mapping allowing us to use an inexact oracle of «black–box» form with restrictions for the computational precision and computational complexity. We perform an efficiency analysis including global and local convergence for the developed family of methods with an arbitrary oracle in terms of iteration complexity, precision and complexity of both local model and oracle, problem dimensionality. We present global sublinear convergence rates for methods of the proposed family for solving a system of nonlinear equations, consisting of Lipschitz smooth functions. We prove local superlinear convergence under extra natural non-degeneracy assumptions for system of nonlinear functions. We prove both local and global linear convergence for a system of nonlinear equations under Polyak–Lojasiewicz condition for proposed Gauss– Newton methods. Besides theoretical justifications of methods we also consider practical implementation issues. In particular, for conducted experiments we present effective computational schemes for the exact oracle regarding to the dimensionality of a problem. The proposed family of methods unites several existing and frequent in practice Gauss–Newton method modifications, allowing us to construct a flexible and convenient method implementable using standard convex optimization and computational linear algebra techniques.

A model of combustion of premixed mixture of gases with one global chemical reaction is considered, the model includes equations of the second order for temperature of mixture and concentrations of fuel and oxidizer, and the right-hand sides of these equations contain the reaction rate function. This function depends on five unknown parameters of the global reaction and serves as approximation to multistep reaction mechanism. The model is reduced, after replacement of variables, to one equation of the second order for temperature of mixture that transforms to a first-order equation for temperature derivative depending on temperature that contains a parameter of flame propagation velocity. Thus, for computing the parameter of burning velocity, one has to solve Dirichlet problem for first-order equation, and after that a model dependence of burning velocity on mixture equivalence ratio at specified reaction rate parameters will be obtained. Given the experimental data of dependence of burning velocity on mixture equivalence ratio, the problem of optimal selection of reaction rate parameters is stated, based on minimization of the mean square deviation of model values of burning velocity on experimental ones. The aim of our study is analysis of uniqueness of this problem solution. To this end, we apply computational experiment during which the problem of global search of optima is solved using multistart of gradient descent. The computational experiment clarifies that the inverse problem in this statement is underdetermined, and every time, when running gradient descent from a selected starting point, it converges to a new limit point. The structure of the set of limit points in the five-dimensional space is analyzed, and it is shown that this set can be described with three linear equations. Therefore, it might be incorrect to tabulate all five parameters of reaction rate based on just one match criterion between model and experimental data of flame propagation velocity. The conclusion of our study is that in order to tabulate reaction rate parameters correctly, it is necessary to specify the values of two of them, based on additional optimality criteria.

The work is devoted to the problem of creating a model with stationary parameters using historical data under conditions of unknown disturbances. The case is considered when a representative sample of object states can be formed using historical data accumulated only over a significant period of time. It is assumed that unknown disturbances can act in a wide frequency range and may have low-frequency and trend components. In such a situation, including data from different time periods in the sample can lead to inconsistencies and greatly reduce the accuracy of the model. The paper provides an overview of approaches and methods for data harmonization. In this case, the main attention is paid to data sampling. An assessment is made of the applicability of various data sampling options as a tool for reducing the level of uncertainty. We propose a method for identifying a self-leveling object model using data accumulated over a significant period of time under conditions of unknown disturbances with a wide frequency range. The method is focused on creating a model with stationary parameters that does not require periodic reconfiguration to new conditions. The method is based on the combined use of sampling and presentation of data from individual periods of time in the form of increments relative to the initial point in time for the period. This makes it possible to reduce the number of parameters that characterize unknown disturbances with a minimum of assumptions that limit the application of the method. As a result, the dimensionality of the search problem is reduced and the computational costs associated with setting up the model are minimized. It is possible to configure both linear and, in some cases, nonlinear models. The method was used to develop a model of closed cooling of steel on a unit for continuous hot-dip galvanizing of steel strip. The model can be used for predictive control of thermal processes and for selecting strip speed. It is shown that the method makes it possible to develop a model of thermal processes from a closed cooling section under conditions of unknown disturbances, including low-frequency components.

The presence of a contact boundary between water and transformer oil greatly reduces the electrical strength of the oil phase. The presence of an electric field leads to varying degrees of polarization at the interface and the appearance of a force acting on a liquid with a higher dielectric constant (water) in the direction of a liquid with a lower dielectric constant (oil). This leads to the contact surface instability development. Instability as a result of its development leads to a stream of water being drawn into oil volume and a violation of the insulating gap. In this work, we experimentally and numerically study electrohydrodynamic instability at the phase boundary between electrically weakly conductive water and transformer oil in a highly inhomogeneous electric field directed perpendicular to the contact boundary. The results of a full-scale and numerical experiment of studying of the electrohydrodynamic instability development in a strong electric field at the interface between water and transformer oil are presented. The system consists of a spherical electrode with a radius of 3.5 mm, placed in water with a conductivity of 5 $\mu S/cm$, and a thin blade electrode 0.1 mm thick, placed in transformer oil of the GK brand. The contact boundary passes at the same distance from the nearest points of the electrodes, equal to 3 mm. The work shows that at a certain electric field strength, the cone-shaped structure of water grows towards the electrode immersed in transformer oil. A numerical correspondence was obtained for both the shape of the resulting water structure (cone) during the entire growth time and the size measured from its top to the level of the initial contact boundary of phase separation. The dynamics of this structure growth has been studied. Both in numerical calculations and in experiment, it was found that the size of the resulting cone along the electrode connection line depends linearly on time.

A review of the problems of preparing accurate geometric models of steel ropes based on mathematical models without significant simplifications, taking into account the intended purpose of the model, is carried out. Possible approaches to the generation of precise geometric models of steel ropes that have no fundamental limitations on their integration in computational domains and the subsequent construction of finite element models based on them are shown. A generalized parameterized geometric model of single and double twist ropes and its algorithmic implementation using the OpenCASCADE Core Technology geometric modeling kernel in the Gmsh environment (open source software) is considered. The problems of using generic tabular data from steel rope assortment standards as initial data for constructing geometric models are considered. Methods of preliminary verification of collisions of a geometric model based on the initial data of a geometric model are given. Post-verification methods based on Boolean operations over rope wire bodies are given to identify incorrect results of generating models of wire bodies with curvilinear side surfaces based on the algorithm of sequential hierarchical construction of individual wires of single strand and sequential copying of it. Various methods of the process of constructing geometric models of rope wires by extrusion are shown: through a sequence of generatrix with the formation of a body limited by curvilinear surfaces, through a sequence of generatrix with the formation of a body limited by linearly approximated surfaces, and extrusion of one generatrix along a single guideline. The computational complexity of the geometric model generation and the required volume of RAM for the two most universal methods of creating a body of wire are investigated. A method for estimating the value of the step of the arrangement of the generatrix of a single wire is shown, and the influence of its value on the computational complexity of the procedure of wire construction is investigated. Recommendations are given for choosing the value of the radial gap between the layers of wires. An algorithmic implementation of the method for searching for collisions of a geometric model of a steel rope in a non-interactive mode is shown. Approaches to the formation of procedures for processing collisions are proposed. Approaches presented in the article can be implemented in the form of software modules for execution in the Gmsh environment, as well as for another environment using the OpenCascade Core Technology geometric modeling kernel. Such modules allow automation of the construction of accurate geometric models of steel ropes in any configuration without fundamental restrictions on subsequent use, both stand-alone and in the form of objects (primitives) suitable for integration in a third-party model.

The paper investigates a potential solution to the problem of Self-Interference Cancellation (SIC) encountered in the design of In-Band Full-Duplex (IBFD) communication systems. The suppression of selfinterference is implemented in the digital domain using multilayer nonlinear models adapted via the gradient descent method. The presence of local optima and saddle points in the adaptation of multilayer models prevents the use of second-order methods due to the indefinite nature of the Hessian matrix.

This work proposes the use of the Mixed Newton Method (MNM), which incorporates information about the second-order mixed partial derivatives of the loss function, thereby enabling a faster convergence rate compared to traditional first-order methods. By constructing the Hessian matrix solely with mixed second-order partial derivatives, this approach mitigates the issue of “getting stuck” at saddle points when applying the Mixed Newton Method for adapting multilayer nonlinear self-interference compensators in full-duplex system design.

The Hammerstein model with complex parameters has been selected to represent nonlinear selfinterference. This choice is motivated by the model’s ability to accurately describe the underlying physical properties of self-interference formation. Due to the holomorphic property of the model output, the Mixed Newton Method provides a “repulsion” effect from saddle points in the loss landscape.

The paper presents convergence curves for the adaptation of the Hammerstein model using both the Mixed Newton Method and conventional gradient descent-based approaches. Additionally, it provides a derivation of the proposed method along with an assessment of its computational complexity.

In this paper, we consider the interaction of a kink of the $\varphi^4$ equation with two identical extended impurities. An extended impurity is described using a rectangular function. The case of an attractive impurity is analyzed. Using analytical methods, we consider the case of small amplitudes of localized waves, when it is possible to linearize the equations of motion. For the numerical solution, the method of lines for partial differential equations was used. To find the oscillation frequencies of waves localized on impurities, the discrete Fourier transform is used. The kink was launched in the direction of the impurities with different initial velocities. The distance between the two impurities was also varied. It is shown that when a kink interacts with impurities, long-lived localized breather-type waves are excited on them. Their structure and coupled dynamics are investigated. It is determined how, by changing the parameters of the impurities and the distance between them, it is possible to control the type and dynamic parameters of the coupled oscillations of the waves localized on the impurities. Possible solutions in the form of in-phase, antiphase oscillations, in the form of beats are found. The oscillations of localized waves occur with the emission of small-amplitude waves. The spectrum of these emissions consists of two frequencies. The first is approximately equal to $\sqrt{2}$, which corresponds to the frequency value for the wobbling breather tail of the $\varphi^4$ equation. The second is approximately equal to the doubled frequency of impurity mode oscillations. The presence of two possible frequencies for coupled localized oscillations is found both analytically and numerically. It is shown that the frequencies strongly depend on the distance between impurities. With increasing distance between impurities, the frequencies merge into one — frequency obtained for the case of a single impurity. The dependences of the frequencies on the distance between impurities found numerically and analytically coincide well for large distances, when the interaction between impurities is weak, and begin to differ noticeably at small distances, when the interaction between impurities is strong. The analytical value of the obtained frequencies is always greater than the numerical ones. It is shown that the dependence of the amplitude of localized waves on the initial kink velocity has several minima and maxima.

This study develops a previously proposed Method of Computer Analogy (MCA) based on formalization of digital computer operations. The paper discusses the position of the proposed approach among other well-known methods. It is emphasized that the primary objective is to derive analytical solutions, although in some cases they have to resort to semianalytical approximations. The paper focuses on constructing solutions for systems which, for certain parameter values, demonstrate the deterministic chaos behavior, namely Lorenz, Marioka – Shimitsu and R¨ossler systems. The paper also considers obtaining solution for Van der Pol equation (reduced to a nonlinear system). The aim of the study is to construct semi-analytical solutions represented as a segment of a power series in a step size of approximating difference scheme. To prevent overflow, authors formalize rank transfer operation. The authors apply a convergent difference scheme, referred to as the “guiding” scheme, to advance to the next step of the independent variable. The resulting approximation by a sum with only a few terms provides an approximation to the solution with any accuracy in accordance with the accuracy of the governing difference scheme. The senior digits in the resulting approximation exhibit probabilistic properties that can be modeled by known distributions, thereby enabling the derivation of analytical and semi-analytical approximations. The paper presents linear approximations that are the base for a complete approximations of solutions and provide important qualitative as well as some quantitative properties of solutions of considered systems. This work describes approximations of various orders, including those that do not guarantee convergence to the exact solution, but simplify the analysis of certain properties of nonlinear equations and systems. In particular, for the Van der Pol equation, authors demonstrate that its corresponding system has a cyclic solution and provide an estimate of its scale. A modification of the MCA that has features of the Monte Carlo method makes it possible to remove recurrent sequences and construct complete solutions in simple situations. The authors mention a promising approach for representing the solution using branched continued fractions.

Monte Carlo (MC) reinforcement learning suffers from high sample complexity, especially in environments with sparse rewards, large state spaces, and strongly correlated trajectories that reduce the statistical efficiency of return estimation. These well-known limitations often lead to slow convergence and unstable learning dynamics, particularly in settings where only a small fraction of collected trajectories is actually informative for policy improvement. A key challenge is therefore to identify a compact yet diverse subset of episodes that contributes most to the accuracy of value estimates while preserving sufficient exploration of the environment. To address this challenge, we reformulate episode selection as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solve it using quantum-inspired sampling techniques. Our method, MC+ QUBO, inserts a combinatorial filtering step into the standard MC policy-evaluation pipeline: given a batch of trajectories, it selects a subset that maximizes cumulative reward and encourages broad state-space coverage. This selection procedure is expressed as a QUBO model, where linear terms favor high-return episodes, quadratic terms penalize redundancy between trajectories, and additional coupling terms can be used to enforce coverage-related constraints or promote structural diversity. Within this framework, we investigate two black-box QUBO solvers: Simulated Quantum Annealing (SQA), which emulates tunneling-based exploration of the search landscape, and Simulated Bifurcation (SB), a dynamical-systems-based iterative optimization method. Both solvers demonstrate the ability to efficiently navigate the combinatorial structure of the trajectory-selection problem and to handle batch sizes that are otherwise computationally expensive for exhaustive or deterministic search. Experiments in a finite-horizon GridWorld environment show that MC+QUBO consistently outperforms vanilla MC in convergence speed, stability of return estimates, and final policy quality. These results highlight the promise of quantum-inspired optimization as a practical decision-making subroutine within reinforcement-learning algorithms, offering a scalable way to improve sample efficiency without modifying the underlying learning paradigm.

The currently performed mathematical and computer modeling of thermal processes in technical systems is based on an assumption that all the parameters determining thermal processes are fully and unambiguously known and identified (i.e., determined). Meanwhile, experience has shown that parameters determining the thermal processes are of undefined interval-stochastic character, which in turn is responsible for the intervalstochastic nature of thermal processes in the electronic system. This means that the actual temperature values of each element in an technical system will be randomly distributed within their variation intervals. Therefore, the determinative approach to modeling of thermal processes that yields specific values of element temperatures does not allow one to adequately calculate temperature distribution in electronic systems. The interval-stochastic nature of the parameters determining the thermal processes depends on three groups of factors: (a) statistical technological variation of parameters of the elements when manufacturing and assembling the system; (b) the random nature of the factors caused by functioning of an technical system (fluctuations in current and voltage; power, temperatures, and flow rates of the cooling fluid and the medium inside the system); and (c) the randomness of ambient parameters (temperature, pressure, and flow rate). The interval-stochastic indeterminacy of the determinative factors in technical systems is irremediable; neglecting it causes errors when designing electronic systems. A method that allows modeling of unsteady interval-stochastic thermal processes in technical systems (including those upon interval indeterminacy of the determinative parameters) is developed in this paper. The method is based on obtaining and further solving equations for the unsteady statistical measures (mathematical expectations, variances and covariances) of the temperature distribution in an technical system at given variation intervals and the statistical measures of the determinative parameters. Application of the elaborated method to modeling of the interval-stochastic thermal process in a particular electronic system is considered.