Exact hierarchical algorithms for accelerating particle--mesh coupling in sparse-grid particle-in-cell methods

DOI10.48550/ARXIV.2608.19702MaRDI QIDQ7284948arXivFDO

Authors Clément Guillet

Publication date 20 August 2026

Published in arXiv

Tldr This paper proposes two novel hierarchical algorithms to accelerate charge deposition and electric-field interpolation in sparse-grid particle-in-cell methods by exploiting clusters of particles associated with a directed acyclic graph (DAG) of particle-populated boxes, reducing the arithmetic complexity from $Ø(p^d n^{d-1}N)$ to $Ø(p^d(N+M))$.

Full work available at URL https://doi.org/10.48550/ARXIV.2608.19702

Mathematics Subject Classification ID

Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Algorithms in computer science (68W99)

arXiv classification

math.NA

This page was built for publication: Exact hierarchical algorithms for accelerating particle--mesh coupling in sparse-grid particle-in-cell methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284948)