Vlasov simulations on an adaptive phase-space grid

M. Gutnic; M. Haefele; I. Paun; E. Sonnendrücker

doi:10.1016/j.cpc.2004.06.073

Vlasov simulations on an adaptive phase-space grid

M. Gutnic
, M. Haefele
, I. Paun
, E. Sonnendrücker

Universit Louis Pasteur
Universite de Strasbourg

Research output: Contribution to journal › Conference article › peer-review

45 Scopus citations

Abstract

We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained through a multiresolution analysis which enables to keep or remove grid points from the simulation depending on the size of their associated coefficients in a multiresolution expansion. The adaptive algorithm consists in three steps: prediction of the active grid points at the next time step, the usual semi-Lagrangian algorithm, and a compression allowing to eliminate unnecessary grid points.

Original language	English
Pages (from-to)	214-219
Number of pages	6
Journal	Computer Physics Communications
Volume	164
Issue number	1-3
DOIs	https://doi.org/10.1016/j.cpc.2004.06.073
State	Published - 1 Dec 2004
Externally published	Yes
Event	Proceedings of the 18th International Conference - Falmouth, United States Duration: 7 Sep 2003 → 10 Sep 2003

Keywords

Adaptive
Beam physics
Multiresolution
Phase-space grid
Plasma physics
Vlasov

Access to Document

10.1016/j.cpc.2004.06.073

Cite this

@article{797a4030d00c46af8ef71e62209647ca,

title = "Vlasov simulations on an adaptive phase-space grid",

abstract = "We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained through a multiresolution analysis which enables to keep or remove grid points from the simulation depending on the size of their associated coefficients in a multiresolution expansion. The adaptive algorithm consists in three steps: prediction of the active grid points at the next time step, the usual semi-Lagrangian algorithm, and a compression allowing to eliminate unnecessary grid points.",

keywords = "Adaptive, Beam physics, Multiresolution, Phase-space grid, Plasma physics, Vlasov",

author = "M. Gutnic and M. Haefele and I. Paun and E. Sonnendr{\"u}cker",

note = "Funding Information: This work has been partially supported by Commissariat {\`a} l'{\'E}nergie Atomique, Bruy{\`e}res-Le-Ch{\^a}tel, France. The authors acknowledge helpful discussions with J.-L. Lemaire. ; Proceedings of the 18th International Conference ; Conference date: 07-09-2003 Through 10-09-2003",

year = "2004",

month = dec,

day = "1",

doi = "10.1016/j.cpc.2004.06.073",

language = "English",

volume = "164",

pages = "214--219",

journal = "Computer Physics Communications",

issn = "0010-4655",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Vlasov simulations on an adaptive phase-space grid

AU - Gutnic, M.

AU - Haefele, M.

AU - Paun, I.

AU - Sonnendrücker, E.

N1 - Funding Information: This work has been partially supported by Commissariat à l'Énergie Atomique, Bruyères-Le-Châtel, France. The authors acknowledge helpful discussions with J.-L. Lemaire.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained through a multiresolution analysis which enables to keep or remove grid points from the simulation depending on the size of their associated coefficients in a multiresolution expansion. The adaptive algorithm consists in three steps: prediction of the active grid points at the next time step, the usual semi-Lagrangian algorithm, and a compression allowing to eliminate unnecessary grid points.

AB - We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained through a multiresolution analysis which enables to keep or remove grid points from the simulation depending on the size of their associated coefficients in a multiresolution expansion. The adaptive algorithm consists in three steps: prediction of the active grid points at the next time step, the usual semi-Lagrangian algorithm, and a compression allowing to eliminate unnecessary grid points.

KW - Adaptive

KW - Beam physics

KW - Multiresolution

KW - Phase-space grid

KW - Plasma physics

KW - Vlasov

UR - https://www.scopus.com/pages/publications/10444269517

U2 - 10.1016/j.cpc.2004.06.073

DO - 10.1016/j.cpc.2004.06.073

M3 - Conference article

AN - SCOPUS:10444269517

SN - 0010-4655

VL - 164

SP - 214

EP - 219

JO - Computer Physics Communications

JF - Computer Physics Communications

IS - 1-3

T2 - Proceedings of the 18th International Conference

Y2 - 7 September 2003 through 10 September 2003

ER -

Vlasov simulations on an adaptive phase-space grid

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this