English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Afterlive: A performant code for Vlasov-Hybrid simulations

Kilian, P., Schreiner, C., & Spanier, F. (2018). Afterlive: A performant code for Vlasov-Hybrid simulations. Computer Physics Communications, 230, 121-134. doi:10.1016/j.cpc.2018.04.014.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kilian, Patrick, Author
Schreiner, Cedric1, Author
Spanier, Felix, Author
Affiliations:
1Max Planck Institute for Solar System Research, Max Planck Society, Justus-von-Liebig-Weg 3, 37077 Göttingen, DE, ou_1125546              

Content

show
hide
Free keywords: -
 Abstract: A parallelized implementation of the Vlasov-Hybrid method (Nunn, 1993) is presented. This method is a hybrid between a gridded Eulerian description and Lagrangian meta-particles. Unlike the Particle-in-Cell method (Dawson, 1983) which simply adds up the contribution of meta-particles, this method does a reconstruction of the distribution function f in every time step for each species. This interpolation method combines meta-particles with different weights in such a way that particles with large weight do not drown out particles that represent small contributions to the phase space density. These core properties allow the use of a much larger range of macro factors and can thus represent a much larger dynamic range in phase space density.

The reconstructed phase space density f is used to calculate momenta of the distribution function such as the charge density p. The charge density p is also used as input into a spectral solver that calculates the self-consistent electrostatic field which is used to update the particles for the next time-step.

Afterlive (A Fourier-based Tool in the Electrostatic limit for the Rapid Low-noise Integration of the Vlasov Equation) is fully parallelized using MPI and writes output using parallel HDF5. The input to the simulation is read from a JSON description that sets the initial particle distributions as well as domain size and discretization constraints. The implementation presented here is intentionally limited to one spatial dimension and resolves one or three dimensions in velocity space. Additional spatial dimensions can be added in a straight forward way, but make runs computationally even more costly.

Details

show
hide
Language(s): eng - English
 Dates: 2018
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: DOI: 10.1016/j.cpc.2018.04.014
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computer Physics Communications
  Abbreviation : Comput. Phys. Commun.
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier B.V.
Pages: - Volume / Issue: 230 Sequence Number: - Start / End Page: 121 - 134 Identifier: ISSN: 0010-4655
CoNE: https://pure.mpg.de/cone/journals/resource/954925392326