A filtered Boris algorithm for charged-particle dynamics in a strong magnetic field
Pith reviewed 2026-05-24 20:24 UTC · model grok-4.3
The pith
The filtered Boris algorithm achieves second-order error bounds in position and parallel velocity, and first-order bounds in normal velocity, for charged particles in strong magnetic fields.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The filtered Boris algorithm, with an appropriate choice of filters, obtains second-order error bounds in the position and in the parallel velocity, and first-order error bounds in the normal velocity with respect to the scaling parameter. The proof compares the modulated Fourier expansions of the exact and the numerical solutions.
What carries the argument
The filtered Boris algorithm, a modification of the standard Boris integrator that incorporates filters chosen to match the maximal-ordering scaling of the magnetic field.
If this is right
- The position and parallel-velocity errors remain of the stated orders uniformly as the scaling parameter tends to zero.
- The normal-velocity error is one order lower but still controlled by the same scaling parameter.
- The error behaviour is confirmed by direct numerical experiments on the filtered scheme.
- The method applies to non-uniform magnetic fields provided they satisfy the maximal ordering assumption.
Where Pith is reading between the lines
- The filtering idea could be transferred to other explicit integrators that are commonly used for Lorentz-force equations.
- Long-term conservation properties beyond the stated error orders might be examined by combining the filters with symplectic or volume-preserving corrections.
- The same modulated-Fourier technique may yield analogous bounds for guiding-centre approximations derived from the same scaling.
Load-bearing premise
The magnetic field must obey the maximal ordering asymptotic scaling so that modulated Fourier expansions can be used to derive the stated error bounds.
What would settle it
Numerical runs in which the observed position error grows faster than order two with respect to the scaling parameter, for a magnetic field that satisfies maximal ordering, would falsify the claim.
read the original abstract
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.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes a filtered Boris algorithm for integrating the equations of motion of charged particles in a strong non-uniform magnetic field under the maximal ordering asymptotic scaling. It claims that suitable filters yield second-order error bounds (w.r.t. the scaling parameter) in position and parallel velocity together with first-order bounds in the normal velocity. The proof proceeds by comparing the modulated Fourier expansions of the exact solution and the filtered numerical solution; numerical experiments are presented to illustrate the observed error behavior.
Significance. If the stated error bounds hold under the given assumptions, the work supplies a practical, structure-preserving integrator with rigorous asymptotic guarantees for an important regime in plasma physics and magnetic confinement simulations. The explicit use of modulated Fourier expansions to obtain the bounds is a methodological strength that allows direct comparison of exact and numerical expansions without requiring machine-checked proofs or parameter-free derivations.
major comments (1)
- [Abstract / proof method] Abstract (paragraph on proof method): the second- and first-order bounds are obtained only under the maximal ordering assumption on the magnetic field (B ~ 1/ε with correspondingly scaled gradients). The manuscript supplies no separate analysis or numerical test showing whether the chosen filters remain stable or the expansion coefficients stay bounded when this scaling is violated even mildly; such a test would be needed to assess the robustness of the claimed error orders.
minor comments (1)
- The abstract refers to 'an appropriate choice of filters' without giving their explicit form; moving the filter definitions to the introduction or stating them in a dedicated subsection would improve readability.
Simulated Author's Rebuttal
We thank the referee for the careful reading of the manuscript and the positive recommendation for minor revision. We address the single major comment below.
read point-by-point responses
-
Referee: [Abstract / proof method] Abstract (paragraph on proof method): the second- and first-order bounds are obtained only under the maximal ordering assumption on the magnetic field (B ~ 1/ε with correspondingly scaled gradients). The manuscript supplies no separate analysis or numerical test showing whether the chosen filters remain stable or the expansion coefficients stay bounded when this scaling is violated even mildly; such a test would be needed to assess the robustness of the claimed error orders.
Authors: The error bounds and their derivation via modulated Fourier expansions are obtained exclusively under the maximal ordering assumption (B ~ 1/ε with correspondingly scaled gradients), which is stated explicitly in the title, abstract, introduction, and throughout the analysis. The comparison of modulated Fourier expansions between the exact solution and the filtered numerical solution relies on this specific asymptotic scaling to control the expansion coefficients and obtain the stated orders. The manuscript makes no claim regarding stability or error orders when the maximal ordering is violated, even mildly; such regimes lie outside the scope of the present work. Consequently, we do not believe that additional analysis or numerical tests outside the stated assumption are required to support the results as presented. revision: no
Circularity Check
No significant circularity; error bounds derived via external modulated Fourier comparison under explicit scaling assumption
full rationale
The paper states error bounds obtained by comparing modulated Fourier expansions of the exact solution and the filtered Boris numerical solution. This is an analytical proof technique applied under the stated assumption that the magnetic field obeys maximal ordering. No quoted step reduces a claimed prediction or bound to a fitted parameter, self-definition, or load-bearing self-citation chain; the comparison is presented as independent of the filter choice itself. The assumption is declared upfront rather than derived from the result, satisfying the criteria for a self-contained derivation against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption The magnetic field is strong and non-uniform under the asymptotic scaling known as maximal ordering.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
The proof compares the modulated Fourier expansions of the exact and the numerical solutions... under the asymptotic scaling known as maximal ordering.
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
With an appropriate choice of filters, second-order error bounds... with respect to the scaling parameter.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.