Progress in modeling streamer and leader discharges­­­

Author(s):  
Ute Ebert ◽  
Dennis Bouwman ◽  
Hani Francisco ◽  
Baohong Guo ◽  
Xiaoran Li ◽  
...  

<p>We present recent progress in pulsed discharge modeling in Amsterdam that is motivated by high voltage and plasma engineering and by lightning.</p><p>We perform streamer simulations with adaptive mesh refinement in 2D and 3D using PIC particle models and fluid models, where we now can include complex electrode shapes and dielectric boundaries. For the longer time evolution, we also have added Ohmic heating, gas expansion, and the relevant ­­­plasma chemistry for air and methane-air mixtures.</p><p>Results relevant for lightning physics include</p><ul><li>Validation and verification of streamer propagation models (with S. Dijcks and S. Nijdam for the experimental counterpart)</li> <li>Simulations of streamer branching and comparison with experiments</li> <li>Parameter studies for long non-branching streamers that can accelerate or decelerate, and vary largely in velocity, radius and inner electron density, depending on the electric field</li> <li>Different stagnation behavior of positive and negative streamers in low electric fields</li> <li>Positive streamers in air that can continue to propagate as isolated patches of positive charge, without a conducting channel behind the streamer head</li> <li>Repetitive discharges, heating, and plasma-chemistry</li> </ul>

SoftwareX ◽  
2019 ◽  
Vol 10 ◽  
pp. 100317 ◽  
Author(s):  
Daniel Rettenmaier ◽  
Daniel Deising ◽  
Yun Ouedraogo ◽  
Erion Gjonaj ◽  
Herbert De Gersem ◽  
...  

2002 ◽  
Vol 2 (1) ◽  
pp. 92-109 ◽  
Author(s):  
Margreet Nool ◽  
Rony Keppens

Abstract We present the results obtained with AMRVAC, a software package designed for solution-adaptive time-accurate (magneto)hydrodynamic simulations. In any dimensionality, the grid adjusts to capture shocks and other sharp flow features accurately following an automated Adaptive Mesh Refinement [AMR] strategy. This grid adaptation algorithm is incorporated with the Versatile Advection Code [VAC], so that it can be used to time-advance sets of conservation laws with options for the spatial discretization employed. We demonstrate and evaluate the efficiency achievable by AMR for 1D, 2D, and 3D test problems and describe the employed data structures.


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.


Author(s):  
Weiqun Zhang ◽  
Andrew Myers ◽  
Kevin Gott ◽  
Ann Almgren ◽  
John Bell

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.


Sign in / Sign up

Export Citation Format

Share Document