skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Study of Jupiter’s Interior with Quadratic Monte Carlo Simulations
Abstract We construct models for Jupiter’s interior that match the gravity data obtained by the Juno and Galileo spacecraft. To generate ensembles of models, we introduce a novelquadraticMonte Carlo technique, which is more efficient in confining fitness landscapes than the affine invariant method that relies on linear stretch moves. We compare how long it takes the ensembles of walkers in both methods to travel to the most relevant parameter region. Once there, we compare the autocorrelation time and error bars of the two methods. For a ring potential and the 2d Rosenbrock function, we find that our quadratic Monte Carlo technique is significantly more efficient. Furthermore, we modified thewalkmoves by adding a scaling factor. We provide the source code and examples so that this method can be applied elsewhere. Here we employ our method to generate five-layer models for Jupiter’s interior that include winds and a prominent dilute core, which allows us to match the planet’s even and odd gravity harmonics. We compare predictions from the different model ensembles and analyze how much an increase in the temperature at 1 bar and ad hoc change to the equation of state affect the inferred amount of heavy elements in the atmosphere and in the planet overall.  more » « less
Award ID(s):
2020249
PAR ID:
10439977
Author(s) / Creator(s):
Publisher / Repository:
DOI PREFIX: 10.3847
Date Published:
Journal Name:
The Astrophysical Journal
Volume:
953
Issue:
1
ISSN:
0004-637X
Format(s):
Medium: X Size: Article No. 111
Size(s):
Article No. 111
Sponsoring Org:
National Science Foundation
More Like this
  1. We present a novel technique for tailoring Bayesian quadrature (BQ) to model selection. The state-of-the-art for comparing the evidence of multiple models relies on Monte Carlo methods, which converge slowly and are unreliable for computationally expensive models. Although previous research has shown that BQ offers sample efficiency superior to Monte Carlo in computing the evidence of an individual model, applying BQ directly to model comparison may waste computation producing an overly-accurate estimate for the evidence of a clearly poor model. We propose an automated and efficient algorithm for computing the most-relevant quantity for model selection: the posterior model probability. Our technique maximizes the mutual information between this quantity and observations of the models’ likelihoods, yielding efficient sample acquisition across disparate model spaces when likelihood observations are limited. Our method produces more-accurate posterior estimates using fewer likelihood evaluations than standard Bayesian quadrature and Monte Carlo estimators, as we demonstrate on synthetic and real-world examples. 
    more » « less
  2. Abstract We study the relationship of zonal gravity coefficients, J 2 n , zonal winds, and axial moment of inertia (MoI) by constructing models for the interiors of giant planets. We employ the nonperturbative concentric Maclaurin spheroid method to construct both physical (realistic equation of state and barotropes) and abstract (small number of constant-density spheroids) interior models. We find that accurate gravity measurements of Jupiter’s and Saturn’s J 2 , J 4 , and J 6 by the Juno and Cassini spacecraft do not uniquely determine the MoI of either planet but do constrain it to better than 1%. Zonal winds (or differential rotation (DR)) then emerge as the leading source of uncertainty. For Saturn they are predicted to decrease the MoI by 0.4% because they reach a depth of ∼9000 km, while on Jupiter they appear to reach only ∼3000 km. We thus predict DR to affect Jupiter’s MoI by only 0.01%, too small by one order of magnitude to be detectable by the Juno spacecraft. We find that winds primarily affect the MoI indirectly via the gravity harmonic J 6 , while direct contributions are much smaller because the effects of pro- and retrograde winds cancel. DR contributes +6% and −0.8% to Saturn’s and Jupiter’s J 6 value, respectively. This changes the J 6 contribution that comes from the uniformly rotating bulk of the planet that correlates most strongly with the predicted MoI. With our physical models, we predict Jupiter’s MoI to be 0.26393 ± 0.00001. For Saturn, we predict 0.2181 ± 0.0002, assuming a rotation period of 10:33:34 hr that matches the observed polar radius. 
    more » « less
  3. Gradient-based approximate inference methods, such as Stein variational gradient descent (SVGD), provide simple and general-purpose inference engines for differentiable continuous distributions. However, existing forms of SVGD cannot be directly applied to discrete distributions. In this work, we fill this gap by proposing a simple yet general framework that transforms discrete distributions to equivalent piecewise continuous distributions, on which the gradient-free SVGD is applied to perform efficient approximate inference. The empirical results show that our method outperforms traditional algorithms such as Gibbs sampling and discontinuous Hamiltonian Monte Carlo on various challenging benchmarks of discrete graphical models. We demonstrate that our method provides a promising tool for learning ensembles of binarized neural network (BNN), outperforming other widely used ensemble methods on learning binarized AlexNet on CIFAR-10 dataset. In addition, such transform can be straightforwardly employed in gradient-free kernelized Stein discrepancy to perform goodness-of-fit (GOF) test on discrete distributions. Our proposed method outperforms existing GOF test methods for intractable discrete distributions. 
    more » « less
  4. We introduce an efficient nonreversible Markov chain Monte Carlo algorithm to generate self-avoiding walks with a variable endpoint. In two dimensions, the new algorithm slightly outperforms the two-move nonreversible Berretti-Sokal algorithm introduced by H. Hu, X. Chen, and Y. Deng, while for three-dimensional walks, it is 3–5 times faster. The new algorithm introduces nonreversible Markov chains that obey global balance and allow for three types of elementary moves on the existing self-avoiding walk: shorten, extend or alter conformation without changing the length of the walk. 
    more » « less
  5. Grid-free Monte Carlo methods such aswalk on spherescan be used to solve elliptic partial differential equations without mesh generation or global solves. However, such methods independently estimate the solution at every point, and hence do not take advantage of the high spatial regularity of solutions to elliptic problems. We propose a fast caching strategy which first estimates solution values and derivatives at randomly sampled points along the boundary of the domain (or a local region of interest). These cached values then provide cheap, output-sensitive evaluation of the solution (or its gradient) at interior points, via a boundary integral formulation. Unlike classic boundary integral methods, our caching scheme introduces zero statistical bias and does not require a dense global solve. Moreover we can handle imperfect geometry (e.g., with self-intersections) and detailed boundary/source terms without repairing or resampling the boundary representation. Overall, our scheme is similar in spirit tovirtual point lightmethods from photorealistic rendering: it suppresses the typical salt-and-pepper noise characteristic of independent Monte Carlo estimates, while still retaining the many advantages of Monte Carlo solvers: progressive evaluation, trivial parallelization, geometric robustness,etc.We validate our approach using test problems from visual and geometric computing. 
    more » « less