Efficient 3-D Large-Scale Forward Modeling and Inversion of Gravitational Fields in Spherical Coordinates With Application to Lunar Mascons

A novel efficient forward modeling algorithm of gravitational fields in spherical coordinates is developed for 3D large-scale gravity inversion problems. 3D Gauss-Legendre quadrature (GLQ) is used to calculate the gravitational fields of mass distributions discretized into tesseroids. Equivalence relations in the kernel matrix of the forward-modeling are exploited to decrease storage and computation time. The numerical investigations demonstrate that the computation time of the proposed algorithm is reduced by approximately two orders of magnitude, and the memory requirement is reduced by N'l times compared with the traditional GLQ method, where N'l is the number of model elements in the longitudinal direction. These significant improvements in computational efficiency and storage make it possible to calculate and store the dense Jacobian matrix in 3D large-scale gravity inversions. The equivalence relations could be equally applied to the Taylor series method or combined with the adaptive discretization to ensure high accuracies

Studies of the major planet satellite systems

A summary is presented of the available data on the satellites of the major planets, including the currently most plausible models for several observed phenomena, for the planning of spacecraft missions to these objects. Some of the important questions likely to be solved by flyby and/or orbital missions to the giant planets are detailed, the importance of these studies to our understanding of the solar system as a whole is indicated

Efficient 3D large-scale forward-modeling and inversion of gravitational fields in spherical coordinates with application to lunar mascons

An efficient forward modeling algorithm for calculation of gravitational fields in spherical coordinates is developed for 3D large‐scale gravity inversion problems. 3D Gauss‐Legendre quadrature (GLQ) is used to calculate the gravitational fields of mass distributions discretized into tesseroids. Equivalence relations in the kernel matrix of the forward‐modeling are exploited to decrease storage and computation time. The numerical tests demonstrate that the computation time of the proposed algorithm is reduced by approximately two orders of magnitude, and the memory requirement is reduced by N'λ times compared with the traditional GLQ method, where N'λ is the number of the model elements in the longitudinal direction. These significant improvements in computational efficiency and storage make it possible to calculate and store the dense Jacobian matrix in 3D large‐scale gravity inversions. The equivalence relations can be applied to the Taylor series method or combined with the adaptive discretization to ensure high accuracy. To further illustrate the capability of the algorithm, we present a regional synthetic example. The inverted results show density distributions consistent with the actual model. The computation took about 6.3 hours and 0.88 GB of memory compared with about a dozen days and 245.86 GB for the traditional 3D GLQ method. Finally, the proposed algorithm is applied to the gravity field derived from the latest lunar gravity model GL1500E. 3D density distributions of the Imbrium and Serenitatis basins are obtained, and high‐density bodies are found at the depths 10‐60 km, likely indicating a significant uplift of the high‐density mantle beneath the two mascon basins.</p

High-Order AFEM for the Laplace-Beltrami Operator: Convergence Rates

We present a new AFEM for the Laplace-Beltrami operator with arbitrary polynomial degree on parametric surfaces, which are globally $W^1_\infty$ and piecewise in a suitable Besov class embedded in $C^{1,\alpha}$ with $\alpha \in (0,1]$. The idea is to have the surface sufficiently well resolved in $W^1_\infty$ relative to the current resolution of the PDE in $H^1$. This gives rise to a conditional contraction property of the PDE module. We present a suitable approximation class and discuss its relation to Besov regularity of the surface, solution, and forcing. We prove optimal convergence rates for AFEM which are dictated by the worst decay rate of the surface error in $W^1_\infty$ and PDE error in $H^1$.Comment: 51 pages, the published version contains an additional glossar

Proceedings for the ICASE Workshop on Heterogeneous Boundary Conditions

Domain Decomposition is a complex problem with many interesting aspects. The choice of decomposition can be made based on many different criteria, and the choice of interface of internal boundary conditions are numerous. The various regions under study may have different dynamical balances, indicating that different physical processes are dominating the flow in these regions. This conference was called in recognition of the need to more clearly define the nature of these complex problems. This proceedings is a collection of the presentations and the discussion groups

Seventh Copper Mountain Conference on Multigrid Methods

The Seventh Copper Mountain Conference on Multigrid Methods was held on 2-7 Apr. 1995 at Copper Mountain, Colorado. This book is a collection of many of the papers presented at the conference and so represents the conference proceedings. NASA Langley graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The multigrid discipline continues to expand and mature, as is evident from these proceedings. The vibrancy in this field is amply expressed in these important papers, and the collection shows its rapid trend to further diversity and depth