- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 13 (2013), pp. 1134-1150.
Published online: 2013-08
[An open-access article; the PDF is free to any online user.]
Cited by
- BibTex
- RIS
- TXT
High-order interpolation algorithms for charge conservation in Particle-in-Cell (PIC) simulations are presented. The methods are valid for the case that a particle trajectory is a zigzag line. The second-order and third-order algorithms which can be applied to any even-order and odd-order are discussed in this paper, respectively. Several test simulations are performed to demonstrate their validity in two-dimensional PIC code. Compared with the simulation results of one-order, high-order algorithms have advantages in computation precision and enlarging the grid scales which reduces the CPU time.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.290811.050412a}, url = {http://global-sci.org/intro/article_detail/cicp/7267.html} }High-order interpolation algorithms for charge conservation in Particle-in-Cell (PIC) simulations are presented. The methods are valid for the case that a particle trajectory is a zigzag line. The second-order and third-order algorithms which can be applied to any even-order and odd-order are discussed in this paper, respectively. Several test simulations are performed to demonstrate their validity in two-dimensional PIC code. Compared with the simulation results of one-order, high-order algorithms have advantages in computation precision and enlarging the grid scales which reduces the CPU time.