.png){kind=icon}
Return
A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2004.06.076.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A treecode algorithm is presented for computing the electrostatic potential and electric field in a system of charged particles. The algorithm is grid-free and with N particles it reduces the operation count to O(N log N), as opposed to O(N-2) which is required for direct summation of pairwise interactions. The key idea is to replace the particle-particle interactions by particle-cluster interactions which are evaluated using a Taylor approximation in Cartesian coordinates. The treecode is combined here with a boundary integral method to simulate electron dynamics in a Penning-Malmberg trap. (C) 2004 Elsevier B.V. All rights reserved.
Keywords:
charged particles
electrostatic potential
treecode algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more