Fast computation of general forward gravitation problems - Archive ouverte HAL Access content directly
Journal Articles Journal of Geodesy Year : 2016

Fast computation of general forward gravitation problems


We consider the well-known problem of the forward computation of the gradient of the gravity potential generated by a mass density distribution of general 3D geometry. Many methods have been developed for given geometries, and the computation time often appears as a limiting practical issue for considering large or complex problems. In this work, we develop a fast method to carry-out this computation, where a tetrahedral mesh is used to model the mass density distribution. Depending on the close-or long-range nature of the involved interactions , the algorithm automatically switches between analytic integration formulae and numerical quadratic formulae, and relies on the Fast Multipole Method to drastically increase the computation speed of the long-range interactions. The parameters of the algorithm are empirically chosen for the computations to be the fastest possible while guarantying a given relative accuracy of the result. Computations that would load many-cores clusters for days can now be carried-out on a desk computer in minutes. The computation of the topographic correction over France and the global topographic correction at the altitude of the satellite GOCE are proposed as numerical illustrations of the method.
Fichier principal
Vignette du fichier
JOGE (1).pdf (42.92 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02127751 , version 1 (13-05-2019)



Fabien Casenave, Laurent Métivier, Gwendoline Pajot-Métivier, Isabelle Panet. Fast computation of general forward gravitation problems. Journal of Geodesy, 2016, 90 (7), pp.655-675. ⟨10.1007/s00190-016-0900-2⟩. ⟨hal-02127751⟩


49 View
29 Download



Gmail Mastodon Facebook X LinkedIn More