Papers › A filtered Boris algorithm for charged-particle dynamics in a strong magnetic field
A filtered Boris algorithm for charged-particle dynamics in a strong magnetic field
Ernst Hairer, Christian Lubich, Bin Wang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A modification of the standard Boris algorithm, called filtered Boris algorithm, is proposed for the numerical integration of the equations of motion of charged particles in a strong non-uniform magnetic field in the asymptotic scaling known as maximal ordering. With an appropriate choice of filters, second-order error bounds in the position and in the parallel velocity, and first-order error bounds in the normal velocity are obtained with respect to the scaling parameter. The proof compares the modulated Fourier expansions of the exact and the numerical solutions. Numerical experiments illustrate the error behaviour of the filtered Boris algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections