2018
DOI: 10.1134/s1069351318040079
|View full text |Cite
|
Sign up to set email alerts
|

On Solving the Forward Problem of Gravimetry in Curvilinear and Cartesian Coordinates: Krasovskii’s Ellipsoid and Plane Modeling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…Let us choose some discretization of D = N i=1 D i and approximate the volume of an element of the partition D i by a polyhedron Di , obtaining an approximated model. Now, we can apply the previously proposed [10] algorithm to solve the forward gravity problem. Let us represent the basic steps of the algorithm and for the first time present the derivation of the closed-form formula for the gravitational field of a polyhedron.…”
Section: The Forward Gravity Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…Let us choose some discretization of D = N i=1 D i and approximate the volume of an element of the partition D i by a polyhedron Di , obtaining an approximated model. Now, we can apply the previously proposed [10] algorithm to solve the forward gravity problem. Let us represent the basic steps of the algorithm and for the first time present the derivation of the closed-form formula for the gravitational field of a polyhedron.…”
Section: The Forward Gravity Problemmentioning
confidence: 99%
“…The source codes of the program, distribution kit, test model, and user instructions are publicly available at https://github.com/AlexIII/GRAFEN (accessed on 10 March 2024) under a free MIT license. The convergence, speed, and errors of computing the gravity field by using the proposed method were tested by comparison with the five-point Gauss-Legendre (GL) numerical integration method [10] for various configurations of partitions of the "ellipsoidal" model of the Earth's crust. The testing showed that the increase in computation speed by the proposed method is tens of times (compared to the Gauss-Legendre method), with an equivalent error rate.…”
Section: The Forward Gravity Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Let us choose some discretization of D = N i=1 D i . Now we can approximate the volume of an element of the partition D i by a polyhedron Di , obtaining an approximated model, to which we can apply the previously proposed [Martyshko et al, 2018b] algorithm for solving the direct gravity problem. Here we will reproduce the basic steps of the algorithm.…”
Section: Direct Gravity Calculation For a Spherical Density Model Wit...mentioning
confidence: 99%
“…When a satisfactory solution in the "flat" framework is found, it can be used as an initial approximation for the original inverse problem (taking into account the topography and sphericity). This step can be performed with transformation of the "flat" geometry into spherical [Martyshko et al, 2018b]. Thus, we will consider the problem of refinement of the already existing model, which includes all the necessary a priori data, to fit the target field.…”
Section: Inverse Linear Problem For the Gravity Fieldmentioning
confidence: 99%