2016
DOI: 10.1088/1361-6587/59/2/024002
|View full text |Cite
|
Sign up to set email alerts
|

Sparse grid techniques for particle-in-cell schemes

Abstract: We propose the use of sparse grids to accelerate particlein-cell (PIC) schemes. By using the so-called 'combination technique' from the sparse grids literature, we are able to dramatically increase the size of the spatial cells in multi-dimensional PIC schemes while paying only a slight penalty in grid-based error. The resulting increase in cell size allows us to reduce the statistical noise in the simulation without increasing total particle number. We present initial proof-of-principle results from test case… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
67
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 34 publications
(69 citation statements)
references
References 48 publications
2
67
0
Order By: Relevance
“…We consider a classical Landau-damping test case [3,11], simulating 2 billion particles on a 64×64×64 grid, for 500 time steps. We use the same parameters as in [18]: time step of 0.05, periodic boundary conditions on spatial domain Ω = [0, 22] 3 and initial distribution function:…”
Section: Numerical Resultsmentioning
confidence: 99%
“…We consider a classical Landau-damping test case [3,11], simulating 2 billion particles on a 64×64×64 grid, for 500 time steps. We use the same parameters as in [18]: time step of 0.05, periodic boundary conditions on spatial domain Ω = [0, 22] 3 and initial distribution function:…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Following the formal analysis conducted by Ricketson and Cerfon [35] a sparse grid approximation of charge density , ( denoting the particle species) may be reconstructed on the regular grid using Eq. (1):…”
Section: B Sparse Grid Pic Algorithmmentioning
confidence: 99%
“…We have hence adopted a different strategy (also detailed in ref. [35]) to benefit from the advantage of the sparse grid combination technique by resolving Poisson's equation on each of the 2 − 1 sub-grids (2 − 1 corresponding to the total number of sub-grids that are constructed from a depth in the maximum-norm based grid). Due to the reduction of the size of linear systems solved on each of the sparse grids, a substantial gain in numerical efficiency is achieved.…”
Section: B Sparse Grid Pic Algorithmmentioning
confidence: 99%
See 2 more Smart Citations