cylindrical grid
Recently Published Documents


TOTAL DOCUMENTS

30
(FIVE YEARS 1)

H-INDEX

6
(FIVE YEARS 0)

2021 ◽  
pp. 114351
Author(s):  
Peng Zhang ◽  
Zhenyu Han ◽  
Jiachen Gu ◽  
Shouzheng Sun ◽  
Hongya Fu
Keyword(s):  


2020 ◽  
Vol 222 (3) ◽  
pp. 1656-1670
Author(s):  
S Agarwal ◽  
N Tosi ◽  
D Breuer ◽  
S Padovan ◽  
P Kessel ◽  
...  

SUMMARY Constraining initial conditions and parameters of mantle convection for a planet often requires running several hundred computationally expensive simulations in order to find those matching certain ‘observables’, such as crustal thickness, duration of volcanism, or radial contraction. A lower fidelity alternative is to use 1-D evolution models based on scaling laws that parametrize convective heat transfer. However, this approach is often limited in the amount of physics that scaling laws can accurately represent (e.g. temperature and pressure-dependent rheologies or mineralogical phase transitions can only be marginally simulated). We leverage neural networks to build a surrogate model that can predict the entire evolution (0–4.5 Gyr) of the 1-D temperature profile of a Mars-like planet for a wide range of values of five different parameters: reference viscosity, activation energy and activation volume of diffusion creep, enrichment factor of heat-producing elements in the crust and initial temperature of the mantle. The neural network we evaluate and present here has been trained from a subset of ∼10 000 evolution simulations of Mars ran on a 2-D quarter-cylindrical grid, from which we extracted laterally averaged 1-D temperature profiles. The temperature profiles predicted by this trained network match those of an unseen batch of 2-D simulations with an average accuracy of $99.7\, {\rm per~cent}$.







Author(s):  
A I Siyanov ◽  
M Rynkovskaya ◽  
E Tupikova






2016 ◽  
Vol 17 (3) ◽  
pp. 367
Author(s):  
Rommel Melgaço Barbosa ◽  
Márcia Rodrigues Cappelle

If a graph G has exactly t different sizes of maximal independent sets, G belongs to a collection called Mt. For the Cartesian product of the graph Pn, the path of length n, and Cm, the cycle of length m, called cylindrical grid, we present a method to find maximal independent sets having different sizes and a lower bound on t, such that these graphs belong to Mt.







Sign in / Sign up

Export Citation Format

Share Document