80 research outputs found

    Adaptive 2-D Vlasov Simulation of Particle Beams

    Get PDF
    International audienceThis paper presents our progress for the solution of the 4D Vlasov equation on a grid of the phase space, using two adaptive methods. We briefly recall the principle of the two methods and then particularly focus on computer science features - as data structures or parallelization - for the efficient implementation of the methods. Some relevant numerical results are presented

    WENO schemes applied to the quasi-relativistic Vlasov--Maxwell model for laser-plasma interaction

    Get PDF
    In this paper we focus on WENO-based methods for the simulation of the 1D Quasi-Relativistic Vlasov--Maxwell (QRVM) model used to describe how a laser wave interacts with and heats a plasma by penetrating into it. We propose several non-oscillatory methods based on either Runge--Kutta (explicit) or Time-Splitting (implicit) time discretizations. We then show preliminary numerical experiments

    ColDICE: a parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation

    Full text link
    Resolving numerically Vlasov-Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincar\'e invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli (1993) generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a "warm" dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.Comment: Code and illustration movies available at: http://www.vlasix.org/index.php?n=Main.ColDICE - Article submitted to Journal of Computational Physic

    A "metric" semi-Lagrangian Vlasov-Poisson solver

    Full text link
    We propose a new semi-Lagrangian Vlasov-Poisson solver. It employs elements of metric to follow locally the flow and its deformation, allowing one to find quickly and accurately the initial phase-space position Q(P)Q(P) of any test particle PP, by expanding at second order the geometry of the motion in the vicinity of the closest element. It is thus possible to reconstruct accurately the phase-space distribution function at any time tt and position PP by proper interpolation of initial conditions, following Liouville theorem. When distorsion of the elements of metric becomes too large, it is necessary to create new initial conditions along with isotropic elements and repeat the procedure again until next resampling. To speed up the process, interpolation of the phase-space distribution is performed at second order during the transport phase, while third order splines are used at the moments of remapping. We also show how to compute accurately the region of influence of each element of metric with the proper percolation scheme. The algorithm is tested here in the framework of one-dimensional gravitational dynamics but is implemented in such a way that it can be extended easily to four or six-dimensional phase-space. It can also be trivially generalised to plasmas.Comment: 32 pages, 14 figures, accepted for publication in Journal of Plasma Physics, Special issue: The Vlasov equation, from space to laboratory plasma

    A mass-conserving sparse grid combination technique with biorthogonal hierarchical basis functions for kinetic simulations

    Full text link
    The exact numerical simulation of plasma turbulence is one of the assets and challenges in fusion research. For grid-based solvers, sufficiently fine resolutions are often unattainable due to the curse of dimensionality. The sparse grid combination technique provides the means to alleviate the curse of dimensionality for kinetic simulations. However, the hierarchical representation for the combination step with the state-of-the-art hat functions suffers from poor conservation properties and numerical instability. The present work introduces two new variants of hierarchical multiscale basis functions for use with the combination technique: the biorthogonal and full weighting bases. The new basis functions conserve the total mass and are shown to significantly increase accuracy for a finite-volume solution of constant advection. Further numerical experiments based on the combination technique applied to a semi-Lagrangian Vlasov--Poisson solver show a stabilizing effect of the new bases on the simulations

    A Hermite type adaptive semi-Lagrangian scheme

    Get PDF
    We study a new Hermite type interpolating operator in a semi-Lagrangian scheme for solving the Vlasov equation in the 2D phase space. Numerical results on uniform and adaptive grid are shown and compared with biquadratic Lagrange interpolation in the case of a rotating Gaussian

    Wavelet and Multiscale Methods

    Get PDF
    [no abstract available

    Sparse data structure design for wavelet-based methods

    Full text link
    corecore