Advanced search
Publication Cover
Journal of Computational and Theoretical Transport Volume 47, 2018 - Issue 4-6: Proceedings of the 25th International Conference on Transport Theory, Part II: Computational and Applied Transport
Submit an article Journal homepage
104
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Chaotic Iterations for SN Transport

C. K. GarrettLos Alamos National Laboratory, New Mexico, USACorrespondence[email protected]
,
J. S. WarsaLos Alamos National Laboratory, New Mexico, USA
&
K. G. BudgeLos Alamos National Laboratory, New Mexico, USA
Pages 486-506 | Received 19 Mar 2018, Accepted 19 Jun 2018, Published online: 11 Nov 2018

References

  • Adams, M. L. 2001. Discontinuous finite element transport solutions in thick diffusive problems. Nucl. Sci. Eng. 137 (3):298–333.
  • Adams, M. P., M. L. Adams, W. Daryl Hawkins, T. G. Smith, L. Rauchwerger, N. M. Amato, T. S. Bailey, and R. D. Falgout. 2013. Provably optimal parallel transport sweeps on regular grids. In International Conference on Mathematics and Computational Methods Applied to Nuclear Science & Engineering (M&C 2013): Sun Valley, ID.
  • Baker, R. S., and K. R. Koch. 1998. An Sn algorithm for the massively parallel CM-200 computer. Nucl. Sci. Eng. 128 (3):312–320.
  • Calef, M. T., E. D. Fichtl, J. S. Warsa, M. Berndt, and N. N. Carlson. 2013. Nonlinear Krylov acceleration applied to a discrete ordinates formulation of the k-eigenvalue problem. J. Comput. Phys. 238:188–209.
  • Chazan, D., and W. Miranker. 1969. Chaotic relaxation. Linear Algebra Its Appl. 2 (2):199–222.
  • Ciarlet, P. G. 2002. The finite element method for elliptic problems. Philadelphia, PA: Society for Industrial and Applied Mathematics.
  • Hiromoto, R., B. R. Wienke, and R. G. Brickner. 1992. The performance of asynchronous iteration schemes applied to the linearized boltzmann transport equation. Parallel Comput. 18 (3):241–268.
  • Kumar, S., M. Marathe, S. Parthasarathy, A. Srinivasan, and S. Zst. 2006. Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distrib. Comput. 66:807–821.
  • Nemanic, M. K., and P. Nowak. 1999. Radiation transport calculations on unstructured grids using a spatially decomposed and threaded algorithm. In Proc. Int. Conf. Mathematics and Computation, Reactor Physics and Environmental Analysis in Nuclear Applications: Madrid, Spain.
  • Pautz, S. D. 2002. An algorithm for parallel Sn sweeps on unstructured meshes. Nucl. Sci. Eng. 140 (2):111–136.
  • Pautz, S. D., and T. S. Bailey. 2017. Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions. Nucl. Sci. Eng. 185 (1):70–77.
  • Plimpton, S. J., B. Hendrickson, S. P. Burns, W. McLendon, III, and L. Rauchwerger. 2005. Parallel Sn sweeps on unstructured grids: Algorithms for prioritization, grid partitioning, and cycle detection. Nucl. Sci. Eng. 150:267–283.
  • Plimpton, S., B. Hendrickson, S. Burns, and W. McLendon. 2000. Parallel algorithms for radiation transport on unstructured grids. In Supercomputing, ACM/IEEE 2000 Conference, pages 25–25, Nov 2000, Dallas, TX.
  • Saad, Y. 2003. Iterative methods for sparse linear systems (2nd ed.). Philadelphia, PA: Society for Industrial and Applied Mathematics.
  • Strikwerda, J. C. 1997. A convergence theorem for chaotic asynchronous relaxation. Linear Algebra Its Appl. 253 (1):15–24.
  • Warburton, T., and J. S. Hesthaven. 2003. On the constants in hp-finite element trace inverse inequalities. Comput. Methods Appl. Mech. Eng. 192 (25):2765–2773.
  • Wienke, B. R., and R. E. Hiromoto. 1986. Parallel Sn transport algorithms. Transport Theory Statist. Phys. 15 (1/2):49–59.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.