arXiv subjects

Ansar Calloo

Publications and source records attributed to Ansar Calloo.

3 recordsLinked to original sources

arXiv2026

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

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.

math.NA↗

arXiv2026

Diffusion Synthetic Acceleration for polytopic discretisations of Boltzmann transport

We present a computational study of diffusion synthetic acceleration (DSA) for the monoenergetic, isotropically scattering $S_N$ transport equations, discretised in space by a polytopic discontinuous Galerkin method. Using a discrete ordinates angular discretisation, we construct the DSA correction with an interior-penalty diffusion operator and compare a classical symmetric interior penalty (SIP) formulation with a modified interior penalty (MIP) variant, together with homogeneous Dirichlet and Marshak (Robin) diffusion boundary conditions imposed weakly in the DG framework. We quantify the observed convergence behaviour of the resulting source iteration across variations in optical thickness, scattering ratio, angular quadrature, mesh refinement, polynomial degree and mesh anisotropy on families of bounded Voronoi meshes. The results show that MIP-based DSA remains robust across the parameter ranges tested, whereas SIP-based DSA can lose robustness in the intermediate regime. In challenging optically thick, highly scattering settings, the observed convergence factors for the MIP-based schemes are typically below $0.6$.

math.NA↗

arXiv2024

Cycle-Free Polytopal Mesh Sweeping for Boltzmann Transport

We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi tessellation is feasible in any flow direction and dimension, allowing straightforward application to discontinuous Galerkin (DG) discretisations of first-order hyperbolic partial differential equations and the Boltzmann Transport Equation (BTE) without requiring flux-cycle corrections. We also present an efficient algorithm to perform the topological sort on the dual mesh nodes, ensuring a valid sweep ordering. This result expands the applicability of DG methods for transport problems on polytopal meshes by providing a robust framework for scalable, parallelised solutions. To illustrate its effectiveness, we conduct a series of computational experiments showcasing a DG scheme for BTE, demonstrating both computational efficiency and adaptability to complex geometries.

math.NA↗