Metraipolis › archive › dc_ba5f438190cd

Batched Wavefront Sweeps for Linear Transport Uncertainty Quantification — arXiv:2609.14496

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14496
License (as archived)
CC0-1.0
Archived
2026-10-16T01:22:28.840Z
SHA-256 of the archived text
0a5c28ba66f02057849c1054410adcc139a2c4a94b794e66b758ea1367d37f15
Stable URL of this page
https://metraipolis.com/documento/dc_ba5f438190cd

How to cite

Batched Wavefront Sweeps for Linear Transport Uncertainty Quantification — arXiv:2609.14496 — arXiv (en), https://arxiv.org/abs/2609.14496 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba5f438190cd (Metraipolis archive dc_ba5f438190cd, sha256 0a5c28ba66f02057849c1054410adcc139a2c4a94b794e66b758ea1367d37f15)
BibTeX
@misc{dcba5f438190cd,
  title = {Batched Wavefront Sweeps for Linear Transport Uncertainty Quantification — arXiv:2609.14496},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14496},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba5f438190cd; sha256 0a5c28ba66f02057849c1054410adcc139a2c4a94b794e66b758ea1367d37f15},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14496. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a graph-compatible batched wavefront formulation for upwind discontinuous Galerkin discretisations of linear transport. For sweepable discretisations, the cell equations form a block lower-triangular system under a topological ordering of the directed upwind dependency graph. This causal structure can be shared across families of fixed-source problems whose local operators, sources and inflow data vary. We exploit this observation by grouping channels with a common dependency graph into graph-compatible sweep classes and carrying samples, right-hand sides, energy groups and sign-compatible angular ordinates as tensor dimensions within a common wavefront schedule. We prove that the resulting batched wavefront algorithm is algebraically equivalent to independent classical DG sweeps for every channel in a class, while exposing parallelism simultaneously across wavefront cells and channel dimensions. We realise the formulation as a GPU tensor program based on batched cell-local solves and quantify its work, depth and storage requirements, including the throughput--memory tradeoff introduced by sample microbatching. We further characterise the discrete parameter-to-observable map on fixed face-sign branches and show that reverse-mode differentiation through the wavefront algorithm reproduces the corresponding discrete adjoint action. Numerical experiments verify the expected DG convergence and adjoint consistency, demonstrate substantial GPU execution gains from sample batching, and illustrate the method in a material-shadowing uncertainty-quantification problem and a coupled multigroup C5G7/KAIST-inspired power-iteration workload.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.14496 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:06.305Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).