Search

This article deals with the question of the unique solvability of systems of linear algebraic equations, to the solution of which many inverse problems of geophysics are reduced as a result of discretization when applying the methods of integral equations or integral representations. Examples are given of degenerate and nondegenerate systems of different dimensions that arise in the processing of magnetometric and gravimetric data from experimental observations. Conclusions are drawn about the methods for constructing the optimal grid of experimental observation points. [ABSTRACT FROM AUTHOR]

The paper proposes a parallel algorithm for solving large overdetermined systems of linear algebraic equations with a dense matrix. This algorithm is based on the use of a modification of the conjugate gradient method, which is able to take into account rounding errors accumulated during calculations when making a decision to terminate the iterative process. The parallel algorithm is constructed in such a way that it takes into account the capabilities of the message passing interface (MPI) parallel programming technology, which is used for the software implementation of the proposed algorithm. The programming examples are shown using the Python programming language and the mpi4py package, but all programs are built in such a way that they can be easily rewritten using the C/C++/Fortran programming languages. The advantage of using the modern MPI-4.0 standard is demonstrated. [ABSTRACT FROM AUTHOR]

A new technique for reconstructing the magnetic image of Mercury from satellite observation data is proposed. The technique is based on extracting from the general observational data only the part that is associated with magnetic field sources concentrated in Mercury's crust. The extracted data are used to solve the inverse problem of reconstructing the near-surface magnetic image of Mercury. The results of processing real experimental data obtained via the MESSENGER interplanetary mission are presented. [ABSTRACT FROM AUTHOR]

This paper discusses a method for taking into account rounding errors when constructing a stopping criterion for the iterative process in gradient minimization methods. The main aim of this work was to develop methods for improving the quality of the solutions for real applied minimization problems, which require significant amounts of calculations and, as a result, can be sensitive to the accumulation of rounding errors. However, this paper demonstrates that the developed approach can also be useful in solving computationally small problems. The main ideas of this work are demonstrated using one of the possible implementations of the conjugate gradient method for solving an overdetermined system of linear algebraic equations with a dense matrix. [ABSTRACT FROM AUTHOR]

A new technique for three-dimensional surface reconstruction of relatively smooth surface topography using the scanning electron microscopy with backscattered electron detector is considered. Experiments show high effectiveness of the method. [ABSTRACT FROM AUTHOR]

We establish the local (in time) solvability in the classical sense for the Cauchy problem and first and second boundary‐value problems on the half‐line for a nonlinear equation similar to Benjamin‐Bona‐Mahony‐Bürgers‐type equation. We also derive an a priori estimate that implies sufficient blow‐up conditions for the second boundary‐value problem. We obtain analytically an upper bound of the blow‐up time and refine it numerically using Richardson effective accuracy order technique. [ABSTRACT FROM AUTHOR]

In this paper, we consider an inverse backward problem for a nonlinear singularly perturbed parabolic equation of the Burgers' type. We demonstrate how a method of asymptotic analysis of the direct problem allows developing a rather simple algorithm for solving the inverse problem in comparison with minimization of the cost functional. Numerical experiments demonstrate the effectiveness of this approach. [ABSTRACT FROM AUTHOR]

This work develops the theory of the blow‐up phenomena for Joseph–Egri equation. The existence of the nonextendable solution of two initial‐boundary value problems (on a segment and a half‐line) is demonstrated. Sufficient conditions of the finite‐time blow‐up of these solutions, as well as the analytical estimates of the blow‐up time, are obtained. A numerical method that allows to precise the blow‐up moment for specified initial data is proposed. [ABSTRACT FROM AUTHOR]

In this paper, a new asymptotic-numerical approach to solving an inverse boundary value problem for a nonlinear singularly perturbed parabolic equation with time-periodic coefficients is proposed. An unknown boundary condition is reconstructed by using known additional information about the location of a moving front. An asymptotic analysis of the direct problem allows us to reduce the original inverse problem to that with a simpler numerical solution. Numerical examples demonstrate the efficiency of the method. [ABSTRACT FROM AUTHOR]

The initial-boundary value problems for a Sobolev equation with exponential nonlinearities, classical, and nonclassical boundary conditions are considered. For this model, which describes processes in crystalline semiconductors, the blow-up phenomena are studied. The sufficient blow-up conditions and the blow-up time are analyzed by the method of the test functions. This analytical a priori information is used in the numerical experiments, which are able to determine the process of the solution's blow-up more accurately. The model derivation and some questions of local solvability and uniqueness are also discussed. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this article, we consider an inverse problem for the integral equation of the convolution type in a multidimensional case. This problem is severely ill-posed. To deal with this problem, using a priori information (sourcewise representation) based on optimal recovery theory we propose a new method. The regularization and optimization properties of this method are proved. An optimal minimal a priori error of the problem is found. Moreover, a so-called optimal regularized approximate solution and its corresponding error estimation are considered. Efficiency and applicability of this method are demonstrated in a numerical example of the image deblurring problem with noisy data. [ABSTRACT FROM AUTHOR]

This paper considers a model for the accumulation of mutations in a population of mice with a weakened function of polymerases responsible for correcting DNA copying errors during cell division. The model uses the results of the experiment published by Japanese scientists, which contain data on the accumulation of phenotypic differences in three isolated groups of laboratory mice. We have developed a model for the accumulation of negative mutations. Since the accumulation of phenotypic differences in each of the three groups of mice occurred in its own way, we assumed that these differences were associated with genotypic differences in the zeroth generation and set the inverse problem of determining the initial distribution of these differences. Additional information for solving the inverse problem was a set of experimental data on the number of mutant lines and the number of individuals in each group of mice. The results obtained confirmed our assumption. [ABSTRACT FROM AUTHOR]

In this paper, approaches to the numerical recovering of the initial condition in the inverse problem for a nonlinear singularly perturbed reaction–diffusion–advection equation are considered. The feature of the formulation of the inverse problem is the use of additional information about the value of the solution of the equation at the known position of a reaction front, measured experimentally with a delay relative to the initial moment of time. In this case, for the numerical solution of the inverse problem, the gradient method of minimizing the cost functional is applied. In the case when only the position of the reaction front is known, the method of deep machine learning is applied. Numerical experiments demonstrated the possibility of solving such kinds of considered inverse problems. [ABSTRACT FROM AUTHOR]

Enhancing the reliability of inversion results has always been a prominent issue in the field of geophysics. In recent years, data-driven inversion methods leveraging deep neural networks (DNNs) have gained prominence for their ability to address non-uniqueness issues and reduce computational costs compared to traditional physically model-driven methods. In this study, we propose a GMNet machine learning method, i.e., a CNN-based inversion method for gravity and magnetic field data. This method relies more on data-driven training, and in the prediction phase after the model is trained, it does not heavily depend on a priori assumptions, unlike traditional methods. By forward modeling gravity and magnetic fields, we obtain a substantial dataset to train the CNN model, enabling the direct mapping from field data to subsurface property distribution. Applying this method to synthetic data and one-field data yields promising inversion results. [ABSTRACT FROM AUTHOR]

The work continues a series of articles devoted to the peculiarities of solving coefficient inverse problems for nonlinear singularly perturbed equations of the reaction-diffusion-advection-type with data on the position of the reaction front. In this paper, we place the emphasis on some problems of the numerical solving process. One of the approaches to solving inverse problems of the class under consideration is the use of methods of asymptotic analysis. These methods, under certain conditions, make it possible to construct the so-called reduced formulation of the inverse problem. Usually, a differential equation in this formulation has a lower dimension/order with respect to the differential equation, which is included in the full statement of the inverse problem. In this paper, we consider an example that leads to a reduced formulation of the problem, the solving of which is no less a time-consuming procedure in comparison with the numerical solving of the problem in the full statement. In particular, to obtain an approximate numerical solution, one has to use the methods of the numerical diagnostics of the solution's blow-up. Thus, it is demonstrated that the possibility of constructing a reduced formulation of the inverse problem does not guarantee its more efficient solving. Moreover, the possibility of constructing a reduced formulation of the problem does not guarantee the existence of an approximate solution that is qualitatively comparable to the true one. In previous works of the authors, it was shown that an acceptable approximate solution can be obtained only for sufficiently small values of the singular parameter included in the full statement of the problem. However, the question of how to proceed if the singular parameter is not small enough remains open. The work also gives an answer to this question. [ABSTRACT FROM AUTHOR]

The paper considers the features of numerical reconstruction of the advection coefficient when solving the coefficient inverse problem for a nonlinear singularly perturbed equation of the reaction-diffusion-advection type. Information on the position of a reaction front is used as data of the inverse problem. An important question arises: is it possible to obtain a mathematical connection between the unknown coefficient and the data of the inverse problem? The methods of asymptotic analysis of the direct problem help to solve this question. But the reduced statement of the inverse problem obtained by the methods of asymptotic analysis contains a nonlinear integral equation for the unknown coefficient. The features of its solution are discussed. Numerical experiments demonstrate the possibility of solving problems of such class using the proposed methods. [ABSTRACT FROM AUTHOR]

The paper considers the question of the possibility of recovering symmetric stable states of a bistable medium in the inverse problem for a nonlinear singularly perturbed autowave equation by data given on the position of an autowave front propagating through it. It is shown that under certain conditions, this statement of the problem is ill-posed in the sense of the non-uniqueness of the solution. A regularizing approach to its solution was proposed. [ABSTRACT FROM AUTHOR]