Towards Accurate Temperature and Species Mass Fraction Predictions for Sandia Flame-D using Detailed Chemistry and Adaptive Mesh Refinement

2018 ◽  
Author(s):  
Shuaishuai Liu ◽  
Gaurav Kumar ◽  
Mingjie Wang ◽  
Eric Pomraning
Keyword(s):  
Adaptive Mesh Refinement ◽  
Mass Fraction ◽  
Mesh Refinement ◽  
Adaptive Mesh ◽  
Detailed Chemistry ◽  
Accurate Temperature

scholarly journals Cosmological simulations of low-mass galaxies: some potential issues

2010 ◽  
Vol 6 (S270) ◽  
pp. 503-506
Author(s):  
Pedro Colín ◽  
Vladimir Avila-Reese ◽  
Octavio Valenzuela
Keyword(s):  
Star Formation ◽  
Adaptive Mesh Refinement ◽  
Mass Fraction ◽  
Star Formation Rate ◽  
Formation Rate ◽  
Mesh Refinement ◽  
Adaptive Mesh ◽  
Stellar Mass ◽  
The Galaxy ◽  
Low Mass

AbstractCosmological Adaptive Mesh Refinement simulations are used to study the specific star formation rate (sSFR=SSF/Ms) history and the stellar mass fraction, fs=Ms/MT, of small galaxies, total masses MT between few × 1010 M⊙ to few ×1011 M⊙. Our results are compared with recent observational inferences that show the so-called “downsizing in sSFR” phenomenon: the less massive the galaxy, the higher on average is its sSFR, a trend seen at least since z ~ 1. The simulations are not able to reproduce this phenomenon, in particular the high inferred values of sSFR, as well as the low values of fs constrained from observations. The effects of resolution and sub-grid physics on the SFR and fs of galaxies are discussed.

Dynamic structural analysis of connecting rod through adaptive mesh refinement for different materials

2018 ◽  
Vol 50 (04) ◽  
pp. 561-570
Author(s):  
I. A. QAZI ◽  
A. F. ABBASI ◽  
M. S. JAMALI ◽  
INTIZAR INTIZAR ◽  
A. TUNIO ◽  
...  
Keyword(s):  
Structural Analysis ◽  
Adaptive Mesh Refinement ◽  
Mesh Refinement ◽  
Adaptive Mesh ◽  
Connecting Rod ◽  
Dynamic Structural Analysis

scholarly journals Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver

2021 ◽  
Author(s):  
Alexander Haberl ◽  
Dirk Praetorius ◽  
Stefan Schimanko ◽  
Martin Vohralík
Keyword(s):  
Adaptive Algorithm ◽  
Adaptive Mesh Refinement ◽  
Elliptic Boundary ◽  
Mesh Refinement ◽  
Adaptive Mesh ◽  
Picard Iteration ◽  
Optimal Rate ◽  
Stopping Criteria ◽  
Element Discretization ◽  
Fully Adaptive

AbstractWe consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the Banach–Picard linearization, and a contractive linear algebraic solver. In particular, we identify stopping criteria for the algebraic solver that on the one hand do not request an overly tight tolerance but on the other hand are sufficient for the inexact (perturbed) Banach–Picard linearization to remain contractive. Similarly, we identify suitable stopping criteria for the Banach–Picard iteration that leave an amount of linearization error that is not harmful for the residual a posteriori error estimate to steer reliably the adaptive mesh-refinement. For the resulting algorithm, we prove a contraction of the (doubly) inexact iterates after some amount of steps of mesh-refinement/linearization/algebraic solver, leading to its linear convergence. Moreover, for usual mesh-refinement rules, we also prove that the overall error decays at the optimal rate with respect to the number of elements (degrees of freedom) added with respect to the initial mesh. Finally, we prove that our fully adaptive algorithm drives the overall error down with the same optimal rate also with respect to the overall algorithmic cost expressed as the cumulated sum of the number of mesh elements over all mesh-refinement, linearization, and algebraic solver steps. Numerical experiments support these theoretical findings and illustrate the optimal overall algorithmic cost of the fully adaptive algorithm on several test cases.

Sign in / Sign up

Export Citation Format

Share Document