Regularized gradient algorithms for solving the nonlinear gravimetry problem for the multilayered medium

2020

Closed access Metadata (CSL-JSON)
DOI 10.1002/mma.7012
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We present new numerical algorithms for solving the structural inverse gravimetry problem for the case of multiple surfaces. The inverse problem of finding the multiple surfaces that divide the constant density layers is an ill‐posed one described by a nonlinear integral equation of the first kind. To solve it, it is necessary to apply the regularization ideas. The new regularized variants of the gradient type methods with the weighting factors are constructed, namely, the steepest descent and conjugate gradient method. We suggest the empirical rule for choosing the regularization parameters. On the basis of the constructed methods, we elaborate the parallel algorithms and implement them in the multicore CPU using the OpenMP technology. A set of experiments with the disturbed data is performed to test the gradient algorithms and study performance of the developed code. For the test problems with quasi‐real data, these new regularized algorithms increase the accuracy and speed up computation in comparison with the unregularized ones. By using the 8‐core CPU, we achieve the speedup of 8 times.