References
- P. LESAINT and P. A. RAVIART, “On a Finite Element Method for Solving the Neutron Transport Equation,” Publications mathématiques et informatique de Rennes, S4, 40 (1974); http://www.numdam.org/item/PSMIR_1974___S4_A8_0 ( current as of Nov. 14, 2019.
- T. A. MANTEUFFEL et al., “Nonsymmetric Reduction-Based Algebraic Multigrid,” SIAM J. Sci. Comput., 41, 5, S242 (2019); https://doi.org/10.1137/18M1193761.
- T. A. MANTEUFFEL, J. RUGE, and B. S. SOUTHWORTH, “Nonsymmetric Algebraic Multigrid Based on Local Approximate Ideal Restriction ($\ell$AIR),” SIAM J. Sci. Comput., 40, 6, A4105 (2018); https://doi.org/10.1137/17M1144350.
- T. S. HAUT et al., “An Efficient Sweep-Based Solver for the SN Equations on High-Order Meshes,” Nucl. Sci. Eng., 193, 7, 746 (2019); https://doi.org/10.1080/00295639.2018.1562778.
- R. S. BAKER and K. R. KOCH, “An Sn Algorithm for the Massively Parallel CM-200 Computer,” Nucl. Sci. Eng., 128, 3, 312 (1998); https://doi.org/10.13182/NSE98-1.
- J. LIU et al., “Parallel Sn Sweep Scheduling Algorithm on Unstructured Grids for Multigroup Time-Dependent Particle Transport Equations,” Nucl. Sci. Eng., 184, 4, 527 (2016); https://doi.org/10.13182/NSE15-53.
- T. S. BAILEY and R. D. FALGOUT, “Analysis of Massively Parallel Discrete-Ordinates Transport Sweep Algorithms with Collisions,” LLNL-CONF–407968, Lawrence Livermore National Laboratory (Oct. 2008).
- M. P. ADAMS et al., “Provably Optimal Parallel Transport Sweeps on Regular Grids,” LLNL-CONF–407968, Lawrence Livermore National Laboratory (2013).
- R. FALGOUT, “An Introduction to Algebraic Multigrid,” Comput. Sci. Eng., 8, 6, 24 (2009); https://doi.org/10.1109/MCSE.2006.105.
- R. D. FALGOUT and U. M. YANG, “hypre: A Library of High Performance Preconditioners,” presented at the European Conf. Parallel Proc., 2331 LNCS, PART 3, 632 (2002); https://link.springer.com/chapter/10.1007/3-540-47789-6_66.
- G. ALZETTA et al., “The deal.II Library, Version 9.0,” J. Numer. Math., 26, 4, 173 (2018); https://doi.org/10.1515/jnma-2018-0054.
- C. BURSTEDDE, L. C. WILCOX, and O. GHATTAS, “p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees,” SIAM J. Sci. Comput., 33, 3, 1103 (2011); https://doi.org/10.1137/100791634.
- M. A. HEROUX et al., “An Overview of the Trilinos Project,” ACM Trans. Math. Softw., 31, 3, 397 (2005); https://doi.org/10.1145/1089014.1089021.
- M. SALA and M. HEROUX, “Robust Algebraic Preconditioners with IFPACK 3.0,” SAND-0662, Sandia National Laboratories (2005).
- D. S. KERSHAW, “Differencing of the Diffusion Equation in Lagrangian Hydrodynamics Codes,” J. Comput. Phys., 39, 375, 375 (1981); https://doi.org/10.1016/0021-9991(81)90158-3.
- J. WARSA, K. THOMPSON, and J. MOREL, “Improving the Efficiency of Simple Parallel SN Algorithms with Krylov Iterative Methods,” Trans. Am. Nucl. Soc., 89, 449 (2003).
- V. FABER and T. A. MANTEUFFEL, “A Look at Transport Theory from the Point of View of Linear Algebra,” in Transport Theory, Invariant Imbedding, and Integral Equations (Santa Fe, NM), pp. 37–61, Dekker, New York (1989).
- B. S. SOUTHWORTH, M. HOLEC, and T. S. HAUT, “Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids,” Nucl. Sci. Eng., 195 (2020); https://doi.org/10.1080/00295639.2020.1799603.
- W. WALTERS, “Use of the Chebyshev-Legendre Quadrature Set in Discrete-Ordinate Codes,” Los Alamos National Laboratory (1987).
- T. A. MANTEUFFEL et al., “A Root-Node Based Algebraic Multigrid Method,” SIAM J. Sci. Comput., 39, 5, S723 (2017); https://doi.org/10.1137/16M1082706.
- M. R. DORR and C. H. STILL, “A Concurrent, Multigroup, Discrete Ordinates Model of Neutron Transport,” Proc. Scalable Parallel Libraries Conf., October 6–8, 1993, Mississippi, IEEE (1993).
- M. R. DORR and C. H. STILL, “Concurrent Source Iteration in the Solution of Three-dimensional, Multigroup Discrete Ordinates Neutron Transport Equations,” Nucl. Sci. Eng., 122, 3, 287 (1996); https://doi.org/10.13182/NSE96-A24166.
- G. TANASE et al., “The STAPL Parallel Container Framework,” SIGPLAN Not., 46, 8, 235 (2011); https://doi.org/10.1145/2038037.1941586.
- S. D. PAUTZ and T. S. BAILEY, “Parallel Deterministic Transport Sweeps of Structured and Unstructured Meshes with Overloaded Mesh Decompositions,” Nucl. Sci. Eng., 185, 1, 70 (2017); https://doi.org/10.13182/NSE16-34.
- W. HAWKINS et al., “Validation of Full-Domain Massively Parallel Transport Sweep Algorithms,” Trans. Am. Nucl. Soc., 111, 699 (2014).
- M. P. ADAMS et al., “Provably Optimal Parallel Transport Sweeps on Semi-Structured Grids,” J. Comput. Phys., 407, 109234 (2020); https://doi.org/10.1016/j.jcp.2020.109234.
- A. BIENZ, L. OLSON, and W. GROPP, “Reducing Communication in Algebraic Multigrid with Multi-Step Node Aware Communication,” https://arxiv.org/abs/1904.05838 (2019).
- A. BIENZ, W. D. GROPP, and L. N. OLSON, “Node Aware Sparse Matrix–Vector Multiplication,” J. Parallel Distrib. Comput., 130, 166 (2019); https://doi.org/10.1016/j.jpdc.2019.03.016.
- R. M. CORLESS et al., “On the Lambert W-Function,” Adv. Comput. Math., 5, 1, 329 (1996); https://doi.org/10.1007/BF02124750.