pith. sign in

arxiv: 2604.18771 · v1 · submitted 2026-04-20 · 🧮 math.NA · cs.NA· physics.comp-ph

Diffusion Synthetic Acceleration for polytopic discretisations of Boltzmann transport

Ansar Calloo , Matthew Evans , Fran\c{c}ois Madiot , Tristan Pryer This is my paper

Pith reviewed 2026-05-10 03:19 UTC · model grok-4.3

classification 🧮 math.NA cs.NAphysics.comp-ph
keywords diffusion synthetic accelerationdiscontinuous Galerkinpolytopic meshesBoltzmann transportinterior penalty methodssource iteration
0
0 comments X

The pith

Modified interior-penalty diffusion synthetic acceleration remains robust for polytopic discontinuous Galerkin discretizations of the monoenergetic Boltzmann transport equation, unlike the symmetric interior-penalty version.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper examines how to accelerate the source iteration for solving the discrete ordinates transport equations when the spatial discretization uses polytopic discontinuous Galerkin methods. The authors construct a low-order correction using diffusion operators based on interior-penalty formulations and test both the standard symmetric version and a modified one under varying conditions of optical thickness, scattering, mesh quality, and polynomial degree. They find that the modified interior-penalty approach keeps the iteration converging reliably across the tested ranges while the symmetric one can degrade in intermediate regimes, with convergence factors often below 0.6 in the most demanding optically thick and scattering-dominated cases. A reader would care because efficient acceleration is essential for making high-fidelity transport simulations computationally feasible on complex meshes.

Core claim

The study demonstrates that diffusion synthetic acceleration based on a modified interior-penalty diffusion operator, paired with either homogeneous Dirichlet or Marshak boundary conditions, maintains robust convergence behavior for the source iteration of the S_N transport equations discretized by polytopic DG methods on bounded Voronoi meshes, across wide variations in optical thickness, scattering ratio, angular quadrature, refinement, degree, and anisotropy, whereas the symmetric interior-penalty variant can lose robustness in the intermediate optical thickness regime.

What carries the argument

The modified interior-penalty (MIP) diffusion operator used as the low-order correction within the diffusion synthetic acceleration scheme for the polytopic discontinuous Galerkin discretization of the transport equation.

If this is right

  • Source iteration for these transport problems converges with factors typically below 0.6 in optically thick, highly scattering settings when using MIP-based DSA.
  • The MIP approach remains effective under mesh anisotropy and for different polynomial degrees on Voronoi-type polytopic meshes.
  • SIP-based DSA shows reduced robustness specifically in the intermediate scattering and optical thickness regime.
  • The choice of weakly imposed diffusion boundary conditions (Dirichlet or Marshak) does not alter the overall robustness pattern for MIP.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • These results suggest that MIP DSA could enable reliable acceleration for transport problems on highly irregular meshes arising in complex geometries without needing problem-specific tuning.
  • Extending the comparison to higher-dimensional or time-dependent problems might reveal whether the robustness holds more broadly.
  • Practitioners modeling neutron transport or radiative transfer on polytopic meshes may prefer MIP formulations to avoid convergence failures in intermediate regimes.

Load-bearing premise

The interior-penalty diffusion operator paired with the chosen boundary conditions provides a sufficiently accurate low-order correction to the transport operator over the tested ranges of optical thicknesses and scattering ratios on polytopic meshes.

What would settle it

Observing convergence factors greater than 0.9 or divergence in the source iteration for MIP-based DSA in any of the optically thick, highly scattering test cases on the Voronoi meshes would falsify the robustness claim.

Figures

Figures reproduced from arXiv: 2604.18771 by Ansar Calloo, Fran\c{c}ois Madiot, Matthew Evans, Tristan Pryer.

Figure 1
Figure 1. Figure 1: Experiment 4.1. Empirical convergence factor as a function of the total macro￾scopic cross-section σt, comparing unaccelerated source iteration with DSA using SIP or MIP diffusion discretisations and either homogeneous Dirichlet or Marshak (Robin) diffu￾sion boundary conditions. 4.2. Experiment 2: Comparison of the computational costs of SI and DSA. Having established that DSA can substantially reduce the … view at source ↗
Figure 2
Figure 2. Figure 2: Experiment 4.2. Per-iteration cost of DSA (MIP–Dirichlet) as a function of the number of discrete ordinates NQ. Shown are the mean wall-clock time spent in the diffusion correction (source assembly plus diffusion solve) and the corresponding percentage of the total per-iteration time. by 100 × TSI − TDSA TSI . 101 102 103 100 101 102 Number of discrete ordinates, NQ Wall-clock time, [s] Total wall-clock ti… view at source ↗
Figure 3
Figure 3. Figure 3: Experiment 4.2. Total wall-clock time to convergence for unaccelerated source iteration (SI) and DSA (MIP–Dirichlet), shown as a function of the number of discrete ordinates NQ. Also shown is the percentage speed-up achieved by DSA [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Experiment 4.3. Empirical convergence factor as a function of σt for scattering ratios c ∈ {0.8, 0.9, 0.99, 0.999, 0.9999, 1}. Shown are unaccelerated source iteration and the four DSA variants (SIP/MIP combined with Dirichlet/Marshak diffusion boundary condi￾tions). media) one can derive mode-by-mode damping factors that are explicit functions of the quadrature [1]. On a bounded polytopal domain, however,… view at source ↗
Figure 5
Figure 5. Figure 5: Experiment 4.4. Empirical convergence factor as a function of σt for angular refinements NQ ∈ {4, 8, 16, 32, 64, 128}, comparing the four DSA variants (SIP/MIP com￾bined with Dirichlet/Marshak diffusion boundary conditions). Across the refinement levels tested, typical maximal convergence factors are approximately 0.57 and 0.66 for the Dirichlet and Marshak SIP schemes respectively (in regimes where the SI… view at source ↗
Figure 6
Figure 6. Figure 6: Experiment 4.5. Empirical convergence factor as a function of the optical thick￾ness hσt, comparing unaccelerated source iteration with the four DSA variants (SIP/MIP combined with Dirichlet/Marshak diffusion boundary conditions) across meshes of increas￾ing refinement. conditions and the applied Marshak (Robin) boundary conditions may result in a lack of damping of the low-frequency boundary error compone… view at source ↗
Figure 7
Figure 7. Figure 7: Experiment 4.5. Iteration counts to convergence as a function of σt for the four DSA variants, comparing multiple mesh refinement levels. manufactured solution (21). The resulting observed convergence factors as functions of σt are shown in [PITH_FULL_IMAGE:figures/full_fig_p019_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Experiment 8. Empirical convergence factor as a function of σt for polynomial degrees p ∈ {1, 2, 3}, comparing the four DSA variants (SIP/MIP combined with Dirich￾let/Marshak diffusion boundary conditions). observed for the Marshak MIP variant, although the behaviour is less pronounced. Overall, these results support the use of p-refinement within the present polytopal DGFEM–DSA framework. To complement [… view at source ↗
Figure 9
Figure 9. Figure 9: Experiment 4.8. Empirical convergence factor as a function of σt, shown for multiple meshes with different anisotropy ratios η (defined in (22)), comparing the four DSA variants (SIP/MIP combined with Dirichlet/Marshak diffusion boundary conditions) [PITH_FULL_IMAGE:figures/full_fig_p022_9.png] view at source ↗
read the original abstract

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$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 4 minor

Summary. The manuscript presents a computational study of diffusion synthetic acceleration (DSA) for the monoenergetic, isotropically scattering S_N transport equations discretized in space by a polytopic discontinuous Galerkin method. Using discrete ordinates angular discretization, the DSA correction employs an interior-penalty diffusion operator, comparing the classical symmetric interior penalty (SIP) formulation with a modified interior penalty (MIP) variant, along with homogeneous Dirichlet and Marshak (Robin) boundary conditions imposed weakly. Numerical experiments quantify source-iteration convergence behavior across variations in optical thickness, scattering ratio, angular quadrature, mesh refinement, polynomial degree, and mesh anisotropy on families of bounded Voronoi meshes. The results indicate that MIP-based DSA remains robust across the tested parameter ranges, while SIP-based DSA can lose robustness in the intermediate regime, with MIP convergence factors typically below 0.6 in optically thick, highly scattering settings.

Significance. If the reported numerical observations hold, this work supplies practical empirical guidance on selecting robust DSA variants for polytopic DG discretizations of Boltzmann transport, a setting relevant to complex geometries in neutronics and radiative transfer. The systematic sweeps over optical thickness, scattering ratio, quadrature order, polynomial degree, and multiple Voronoi-mesh families, together with direct SIP-versus-MIP comparison, provide quantified evidence that is not always available from theory. The study strengthens the case for MIP modifications when standard SIP formulations degrade in intermediate regimes.

major comments (2)
  1. [Section 4] Section 4 (numerical results): the central claim that MIP convergence factors are 'typically below 0.6' in optically thick, highly scattering regimes requires an explicit definition of the convergence factor (e.g., asymptotic spectral radius estimate versus ratio of successive residuals at a fixed tolerance) and reporting of the iteration counts or residual histories used to obtain each value; without this, the quantitative comparison between MIP and SIP cannot be fully assessed.
  2. [Section 3.2] Section 3.2 (diffusion operator construction): the weak imposition of Marshak boundary conditions within the DG framework is stated, but the manuscript does not verify consistency of the MIP-modified operator with the transport discretization in the optically thin limit; a short consistency or truncation-error check would confirm that the observed robustness is not an artifact of inconsistent boundary treatment.
minor comments (4)
  1. [Abstract] Abstract: the phrase 'polytopic discretisations' should be clarified on first use as referring to discontinuous Galerkin methods on general polygonal or polyhedral meshes.
  2. [Figures] Figure captions (e.g., Figures 2-5): include the specific values of optical thickness, scattering ratio, and polynomial degree for each plotted curve to improve readability without consulting the text.
  3. [Introduction] Introduction: add one or two references to prior DSA analyses for DG transport methods on simplicial or Cartesian meshes to better situate the polytopic extension.
  4. [Section 2] Notation: the symbols for angular quadrature order and polynomial degree are introduced late; moving their definitions to Section 2 would aid readers.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for the constructive comments, which will improve the clarity of the presentation. We address each major comment below.

read point-by-point responses

  1. Referee: [Section 4] Section 4 (numerical results): the central claim that MIP convergence factors are 'typically below 0.6' in optically thick, highly scattering regimes requires an explicit definition of the convergence factor (e.g., asymptotic spectral radius estimate versus ratio of successive residuals at a fixed tolerance) and reporting of the iteration counts or residual histories used to obtain each value; without this, the quantitative comparison between MIP and SIP cannot be fully assessed.

    Authors: We agree that an explicit definition of the convergence factor is required for readers to fully assess the quantitative claims. We will revise the opening of Section 4 to define the convergence factor as the ratio of successive residual norms in the asymptotic regime (specifically, the geometric mean of the final five ratios prior to reaching the solver tolerance). We will also add a table of source-iteration counts for representative combinations of optical thickness, scattering ratio, and mesh parameters to support the reported factors and enable direct SIP-MIP comparison. revision: yes

  2. Referee: [Section 3.2] Section 3.2 (diffusion operator construction): the weak imposition of Marshak boundary conditions within the DG framework is stated, but the manuscript does not verify consistency of the MIP-modified operator with the transport discretization in the optically thin limit; a short consistency or truncation-error check would confirm that the observed robustness is not an artifact of inconsistent boundary treatment.

    Authors: We acknowledge that a consistency verification in the optically thin limit would strengthen the manuscript. We will add a brief numerical check (either in Section 3.2 or an appendix) showing the source-iteration behavior as optical thickness approaches zero. This will confirm that both SIP and MIP operators recover the expected single-iteration convergence for pure-transport problems, verifying that the weak Marshak boundary treatment remains consistent with the underlying transport discretization. revision: yes

Circularity Check

0 steps flagged

Empirical numerical study with no circular derivation chain

full rationale

The paper is a computational study that quantifies source-iteration convergence for MIP- and SIP-based DSA on polytopic DG discretizations of the monoenergetic SN transport equation. All reported claims (robustness of MIP across tested optical thicknesses, scattering ratios, quadrature orders, polynomial degrees, and Voronoi-mesh families; convergence factors typically below 0.6 in optically thick regimes) rest on direct numerical observation rather than any derivation that reduces to fitted inputs, self-citations, or ansatzes by construction. The standard DSA premise that the diffusion operator supplies a low-order correction is explicitly probed by the SIP-vs-MIP comparison and is not asserted as a new theoretical result. No load-bearing step in the presented work reduces to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The study relies on standard assumptions from numerical analysis for discontinuous Galerkin methods and diffusion synthetic acceleration; no new free parameters, axioms, or invented entities are introduced beyond those in the classical DSA framework.

axioms (2)
  • domain assumption The diffusion operator provides a consistent low-order approximation to the transport equation in the optically thick limit.
    Invoked implicitly when constructing the DSA correction for the S_N equations.
  • standard math Standard stability and consistency properties hold for the interior-penalty DG formulation on polytopic meshes.
    Required for the spatial discretization to be well-posed.

pith-pipeline@v0.9.0 · 5483 in / 1387 out tokens · 29350 ms · 2026-05-10T03:19:29.067971+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

45 extracted references · 45 canonical work pages

  1. [1]

    L., and Larsen, E

    Adams, M. L., and Larsen, E. W. Fast iterative methods for discrete-ordinates particle transport calculations. Progress in Nuclear Energy 40 , 1 (2002), 3--159

    work page 2002

  2. [2]

    L., and Martin, W

    Adams, M. L., and Martin, W. R. Diffusion synthetic acceleration of discontinuous finite element transport iterations. Nuclear science and engineering 111 , 2 (1992), 145--167

    work page 1992

  3. [3]

    Alcouffe, R. E. Diffusion synthetic acceleration methods for the diamond-differenced discrete-ordinates equations. Nuclear Science and Engineering 64 , 2 (1977), 344--355

    work page 1977

  4. [4]

    S., Chronholm, V., Hajnal, D

    Ashby, B. S., Chronholm, V., Hajnal, D. K., Lukyanov, A., MacKenzie, K., Pim, A., and Pryer, T. Efficient proton transport modelling for proton beam therapy and biological quantification. Journal of Mathematical Biology 90 , 5 (2025), 1--33

    work page 2025

  5. [5]

    S., and Koch, K

    Baker, R. S., and Koch, K. R. An sn algorithm for the massively parallel cm-200 computer. Nuclear Science and Engineering 128 , 3 (1998), 312--320

    work page 1998

  6. [6]

    S., and Oden, J

    Bey, K. S., and Oden, J. T. hp-version discontinuous galerkin methods for hyperbolic conservation laws. Computer Methods in Applied Mechanics and Engineering 133 , 3-4 (1996), 259--286

    work page 1996

  7. [7]

    Local virtual element basis functions for space-time discontinuous galerkin schemes on unstructured voronoi meshes

    Boscheri, W., and Bertaglia, G. Local virtual element basis functions for space-time discontinuous galerkin schemes on unstructured voronoi meshes. Communications in Computational Physics 36 , 2 (2024), 348--388

    work page 2024

  8. [8]

    Continuous finite element subgrid basis functions for discontinuous galerkin schemes on unstructured polygonal voronoi meshes

    Boscheri, W., Gaburro, E., et al. Continuous finite element subgrid basis functions for discontinuous galerkin schemes on unstructured polygonal voronoi meshes. Communications in Computational Physics 32 , 1 (2022), 259--298

    work page 2022

  9. [9]

    Cycle-free polytopal mesh sweeping for boltzmann transport

    Calloo, A., Evans, M., Lockyer, H., Madiot, F., Pryer, T., and Zanetti, L. Cycle-free polytopal mesh sweeping for boltzmann transport. Numerical Algorithms\/ (2025), 1--24

    work page 2025

  10. [10]

    Transport-matched penalties for diffusion synthetic acceleration in polytopic discontinuous galerkin methods

    Calloo, A., Evans, M., Madoit, F., and Pryer, T. Transport-matched penalties for diffusion synthetic acceleration in polytopic discontinuous galerkin methods. Preprint\/ (2026)

    work page 2026

  11. [11]

    hp -version discontinuous galerkin methods on essentially arbitrarily-shaped elements

    Cangiani, A., Dong, Z., and Georgoulis, E. hp -version discontinuous galerkin methods on essentially arbitrarily-shaped elements. Mathematics of Computation 91 , 333 (2022), 1--35

    work page 2022

  12. [12]

    H., and Houston, P

    Cangiani, A., Dong, Z., Georgoulis, E. H., and Houston, P. hp-Version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes . Springer, 2017

    work page 2017

  13. [13]

    H., and Houston, P

    Cangiani, A., Georgoulis, E. H., and Houston, P. hp-version discontinuous galerkin methods on polygonal and polyhedral meshes. Mathematical Models and Methods in Applied Sciences 24\/ (2014), 2009--2041

    work page 2014

  14. [14]

    Dong, Z., and Georgoulis, E. H. Robust interior penalty discontinuous galerkin methods. Journal of Scientific Computing 92 , 2 (2022), 57

    work page 2022

  15. [15]

    Some software

    Evans, M. Some software. Zenodo\/ (2026)

    work page 2026

  16. [16]

    Reyna: A minimal overhead polytopal discontinuous galerkin finite element library

    Evans, M., and Pryer, T. Reyna: A minimal overhead polytopal discontinuous galerkin finite element library. Journal of Open Source Software 11 , 118 (2026), 9292

    work page 2026

  17. [17]

    M., Stafford, A

    Evans, T. M., Stafford, A. S., Slaybaugh, R. N., and Clarno, K. T. Denovo: A new three-dimensional parallel discrete ordinates code in scale. Nuclear technology 171 , 2 (2010), 171--200

    work page 2010

  18. [18]

    Georgoulis, E. H. hp -version interior penalty discontinuous galerkin finite element methods on anisotropic meshes. International Journal of Numerical Analysis and Modeling 3 , 1 (2006), 52--79

    work page 2006

  19. [19]

    Gol'Din, V. Y. A quasi-diffusion method of solving the kinetic equation. USSR Computational Mathematics and Mathematical Physics 4 , 6 (1964), 136--149

    work page 1964

  20. [20]

    Hackemack, M. W. Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures . PhD thesis, Texas A&M University, 2016

    work page 2016

  21. [21]

    W., and Ragusa, J

    Hackemack, M. W., and Ragusa, J. C. Quadratic serendipity discontinuous finite element discretization for sn transport on arbitrary polygonal grids. Journal of Computational Physics 374\/ (2018), 188--212

    work page 2018

  22. [22]

    E., and Radley, T

    Houston, P., Hubbard, M. E., and Radley, T. J. Iterative solution methods for high-order/hp--dgfem approximation of the linear boltzmann transport equation. Computers & Mathematics with Applications 166\/ (2024), 37--49

    work page 2024

  23. [23]

    E., Radley, T

    Houston, P., Hubbard, M. E., Radley, T. J., Sutton, O. J., and Widdowson, R. S. Efficient high-order space-angle-energy polytopic discontinuous galerkin finite element methods for linear boltzmann transport. Journal of Scientific Computing 100 , 2 (2024), 52

    work page 2024

  24. [24]

    Convergence of a fully discrete scheme for two-dimensional neutron transport

    Johnson, C., and Pitk\" a ranta, J. Convergence of a fully discrete scheme for two-dimensional neutron transport. SIAM Journal on Numerical Analysis 20 , 5 (1983), 951--966

    work page 1983

  25. [25]

    An analysis of the discontinuous galerkin method for a scalar hyperbolic equation

    Johnson, C., and Pitk \"a ranta, J. An analysis of the discontinuous galerkin method for a scalar hyperbolic equation. Mathematics of computation 46 , 173 (1986), 1--26

    work page 1986

  26. [26]

    Larsen, E. W. Unconditionally stable diffusion-synthetic acceleration methods for the slab geometry discrete ordinates equations. part i: Theory. Nuclear Science and Engineering 82 , 1 (1982), 47--63

    work page 1982

  27. [27]

    On a finite element method for solving the neutron transport equation

    Lesaint, P., and Raviart, P.-A. On a finite element method for solving the neutron transport equation. Publications des s \'e minaires de math \'e matiques et informatique de Rennes , S4 (1974), 1--40

    work page 1974

  28. [28]

    Initial and boundary conditions for diffusive linear transport problems

    Malvagi, F., and Pomraning, G. Initial and boundary conditions for diffusive linear transport problems. Journal of mathematical physics 32 , 3 (1991), 805--820

    work page 1991

  29. [29]

    E., and Warsa, J

    Morel, J. E., and Warsa, J. S. An sn spatial discretization scheme for tetrahedral meshes. Nuclear science and engineering 151 , 2 (2005), 157--166

    work page 2005

  30. [30]

    J., Springel, V., Marcus, R., Vogelsberger, M., and Hernquist, L

    Mu\ n oz, D. J., Springel, V., Marcus, R., Vogelsberger, M., and Hernquist, L. Multidimensional, compressible viscous flow on a moving voronoi mesh. Monthly Notices of the Royal Astronomical Society 428 , 1 (2012), 254--279

    work page 2012

  31. [31]

    J., Houston, P., and Hubbard, M

    Radley, T. J., Houston, P., and Hubbard, M. E. Quadrature-free polytopic discontinuous galerkin methods for transport problems. Mathematics in Engineering 6 , 1 (2024), 192--220

    work page 2024

  32. [32]

    Ragusa, J. C. Discontinuous finite element solution of the radiation diffusion equation on arbitrary polygonal meshes and locally adapted quadrilateral grids. Journal of Computational Physics 280\/ (2015), 195--213

    work page 2015

  33. [33]

    C., and Wang, Y

    Ragusa, J. C., and Wang, Y. A two-mesh adaptive mesh refinement technique for sn neutral-particle transport using a higher-order dgfem. Journal of computational and applied mathematics 233 , 12 (2010), 3178--3188

    work page 2010

  34. [34]

    L., Adams, M

    Ramone, G. L., Adams, M. L., and Nowak, P. F. A transport synthetic acceleration method for transport iterations. Nuclear science and engineering 125 , 3 (1997), 257--283

    work page 1997

  35. [35]

    H., and Hill, T

    Reed, W. H., and Hill, T. R. Triangular mesh methods for the neutron transport equation. Tech. rep., Los Alamos Scientific Lab., N. Mex.(USA), 1973

    work page 1973

  36. [36]

    Discrete ordinates quadrature schemes based on the angular interpolation of radiation intensity

    Rukolaine, S., and Yuferev, V. Discrete ordinates quadrature schemes based on the angular interpolation of radiation intensity. Journal of Quantitative Spectroscopy and Radiative Transfer 69 , 3 (2001), 257--275

    work page 2001

  37. [37]

    S., Holec, M., and Haut, T

    Southworth, B. S., Holec, M., and Haut, T. S. Diffusion synthetic acceleration for heterogeneous domains, compatible with voids. Nuclear Science and Engineering 195 , 2 (2021), 119--136

    work page 2021

  38. [38]

    The tn quadrature set for the discrete ordinates method

    Thurgood, C., Pollard, A., and Becker, H. The tn quadrature set for the discrete ordinates method. Journal of Heat Transfer\/ (1995)

    work page 1995

  39. [39]

    Turcksin, B., and Ragusa, J. C. Discontinuous diffusion synthetic acceleration for sn transport on 2d arbitrary polygonal meshes. Journal of Computational Physics 274\/ (2014), 356--369

    work page 2014

  40. [40]

    I., Ragusa, J

    Vermaak, J. I., Ragusa, J. C., Adams, M. L., and Morel, J. E. Massively parallel transport sweeps on meshes with cyclic dependencies. Journal of Computational Physics 425\/ (2021), 109892

    work page 2021

  41. [41]

    A discrete-ordinate discontinuous-streamline diffusion method for the radiative transfer equation

    Wang, C., Sheng, Q., and Han, W. A discrete-ordinate discontinuous-streamline diffusion method for the radiative transfer equation. Communications in Computational Physics 20 , 5 (2016), 1443--1465

    work page 2016

  42. [42]

    Wang, Y., and Ragusa, J. C. On the convergence of dgfem applied to the discrete ordinates transport equation for structured and unstructured triangular meshes. Nuclear Science and Engineering 163 , 1 (2009), 56--72

    work page 2009

  43. [43]

    Wang, Y., and Ragusa, J. C. Diffusion synthetic acceleration for high-order discontinuous finite element sn transport schemes and application to locally refined unstructured meshes. Nuclear Science and Engineering 166 , 2 (2010), 145--166

    work page 2010

  44. [44]

    A., McGhee, J

    Wareing, T. A., McGhee, J. M., Morel, J. E., and Pautz, S. D. Discontinuous finite element sn methods on three-dimensional unstructured grids. Nuclear science and engineering 138 , 3 (2001), 256--268

    work page 2001

  45. [45]

    S., Wareing, T

    Warsa, J. S., Wareing, T. A., and Morel, J. E. Krylov iterative methods and the degraded effectiveness of diffusion synthetic acceleration for multidimensional sn calculations in problems with material discontinuities. Nuclear science and engineering 147 , 3 (2004), 218--248

    work page 2004