SearcharxivSearch

arXiv · 2608.28022

Transport-Matched Penalties for Diffusion Synthetic Acceleration of Polytopic Discontinuous Galerkin Discretisations

Abstract

Diffusion synthetic acceleration is most effective when its diffusion correction reflects the transport discretisation that generates the iteration error. We develop this principle for high-order upwind discontinuous Galerkin discretisations of discrete-ordinates transport on polytopic meshes. From the discrete transport sweep, we derive the exact scalar correction that removes the source-iteration scalar error in one step. We prove that the associated scalar response is positive and self-adjoint, obtain an exact expression for the source-iteration convergence factor, and quantify the additional damping produced by vacuum leakage. Using the exact correction as a reference, we construct a transport-matched modified interior penalty correction whose boundary terms are inherited directly from homogeneous vacuum inflow. In the optically thick regime, the resulting MIP form approximates the exact correction with relative error proportional to the effective cell Knudsen number. This gives a strict acceleration of source iteration, with bounds uniform in mesh size, polynomial degree, and element face count for admissible polytopic meshes. Numerical experiments on Cartesian and centroidal Voronoi meshes confirm the predicted convergence and correction-operator scaling.

Explore related subjects

Keep this discovery

BibTeXRIS

Ansar Calloo, Matthew Evans, Francois Madiot, Tristan Pryer. 2026-08-28. Transport-Matched Penalties for Diffusion Synthetic Acceleration of Polytopic Discontinuous Galerkin Discretisations. https://arxiv.org/abs/2608.28022

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

Optimal control of fractional diffusion with Dirac measures

We study a PDE-constrained optimization problem for an elliptic equation with the spectral fractional Laplacian and a linear combination of Dirac measures as the forcing term; the controls are the amplitudes of these singular sources. We prove existence and uniqueness of an optimal solution and derive first-order optimality conditions. We then propose a discretization based on finite elements. Since the set of admissible controls is finite dimensional, the control variable itself does not require discretization. We conclude by deriving a priori error bounds

math.OC

Overcoming the spatial order barrier for nonlinear SPDEs with additive space-time white noise

We introduce a fully discrete numerical scheme for semilinear SPDEs with additive space-time white noise that overcomes the previous order barrier for the spatial convergence rate. The scheme achieves a strong convergence rate of $M^{-1+ε}$ in time and $N^{-3/2+ε}$ in space for any $ε>0$, where $M^{-1}$ and $N^{-1}$ are the temporal, respectively the spatial, meshsizes. This substantially improves the standard spatial error bounds of order $N^{-1/2}$ in the literature.

math.NA