scholarly journals A multidimensional implementation of the Advanced Spectral neutrino Leakage scheme

2019 ◽  
Vol 490 (3) ◽  
pp. 4211-4229 ◽  
Author(s):  
D Gizzi ◽  
E O’Connor ◽  
S Rosswog ◽  
A Perego ◽  
R M Cabezón ◽  
...  

ABSTRACT We present a new, multidimensional implementation of the Advanced Spectral Leakage (ASL) scheme with the purpose of modelling neutrino–matter interactions in neutron star mergers. A major challenge is the neutrino absorption in the semitransparent regime, which is responsible for driving winds from the merger remnant. The composition of such winds is crucial in the understanding of the electromagnetic emission in the recently observed macronova following GW170817. Compared to the original version, we introduce an optical-depth-dependent flux factor to model the average angle of neutrino propagation, and a modulation that accounts for flux anisotropies in non-spherical geometries. We scrutinize our approach by first comparing the new scheme against the original one for a spherically symmetric core-collapse supernova snapshot, both in 1D and in 3D, and additionally against a two-moment (M1) scheme as implemented in 1D into the code GR1D. The luminosities and mean energies agree to a few per cents in most tests. Finally, for the case of a binary merger remnant snapshot we compare the new ASL scheme with the M1 scheme that is implemented in the Eulerian adaptive mesh refinement code flash. We find that the neutrino absorption distribution in the semitransparent regime is overall well reproduced. Both approaches agree to within $\lesssim 15{{\ \rm per\ cent}}$ for the average energies and to better than $\sim 35 {{\ \rm per\ cent}}$ in the total luminosities.

2011 ◽  
Vol 529 ◽  
pp. A35 ◽  
Author(s):  
B. Commerçon ◽  
R. Teyssier ◽  
E. Audit ◽  
P. Hennebelle ◽  
G. Chabrier

2012 ◽  
Vol 85 (4) ◽  
Author(s):  
John Ellis ◽  
Hans-Thomas Janka ◽  
Nikolaos E. Mavromatos ◽  
Alexander S. Sakharov ◽  
Edward K. G. Sarkisyan

2018 ◽  
Vol 50 (04) ◽  
pp. 561-570
Author(s):  
I. A. QAZI ◽  
A. F. ABBASI ◽  
M. S. JAMALI ◽  
INTIZAR INTIZAR ◽  
A. TUNIO ◽  
...  

2019 ◽  
Vol 490 (1) ◽  
pp. L52-L56
Author(s):  
Bastian Sander ◽  
Gerhard Hensler

ABSTRACT This paper aims at studying the reliability of a few frequently raised, but not proven, arguments for the modelling of cold gas clouds embedded in or moving through a hot plasma and at sensitizing modellers to a more careful consideration of unavoidable acting physical processes and their relevance. At first, by numerical simulations we demonstrate the growing effect of self-gravity on interstellar clouds and, by this, moreover argue against their initial set-up as homogeneous. We apply the adaptive-mesh refinement code flash with extensions to metal-dependent radiative cooling and external heating of the gas, self-gravity, mass diffusion, and semi-analytic dissociation of molecules, and ionization of atoms. We show that the criterion of Jeans mass or Bonnor–Ebert mass, respectively, provides only a sufficient but not a necessary condition for self-gravity to be effective, because even low-mass clouds are affected on reasonable dynamical time-scales. The second part of this paper is dedicated to analytically study the reduction of heat conduction by a magnetic dipole field. We demonstrate that in this configuration, the effective heat flow, i.e. integrated over the cloud surface, is suppressed by only 32 per cent by magnetic fields in energy equipartition and still insignificantly for even higher field strengths.


Author(s):  
Alexander Haberl ◽  
Dirk Praetorius ◽  
Stefan Schimanko ◽  
Martin Vohralík

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