ANS is committed to advancing, fostering, and promoting the development and application of nuclear sciences and technologies to benefit society.
Explore the many uses for nuclear science and its impact on energy, the environment, healthcare, food, and more.
Explore membership for yourself or for your organization.
Conference Spotlight
Nuclear Energy Conference & Expo (NECX)
September 8–11, 2025
Atlanta, GA|Atlanta Marriott Marquis
Standards Program
The Standards Committee is responsible for the development and maintenance of voluntary consensus standards that address the design, analysis, and operation of components, systems, and facilities related to the application of nuclear science and technology. Find out What’s New, check out the Standards Store, or Get Involved today!
Latest Magazine Issues
Jul 2025
Jan 2025
Latest Journal Issues
Nuclear Science and Engineering
September 2025
Nuclear Technology
August 2025
Fusion Science and Technology
Latest News
Joint NEA project performs high-burnup test
An article in the OECD Nuclear Energy Agency’s July news bulletin noted that a first test has been completed for the High Burnup Experiments in Reactivity Initiated Accident (HERA) project. The project aim is to understand the performance of light water reactor fuel at high burnup under reactivity-initiated accidents (RIA).
T. S. Haut, P. G. Maginot, V. Z. Tomov, B. S. Southworth, T. A. Brunner, T. S. Bailey
Nuclear Science and Engineering | Volume 193 | Number 7 | July 2019 | Pages 746-759
Technical Paper | doi.org/10.1080/00295639.2018.1562778
Articles are hosted by Taylor and Francis Online.
We propose a graph-based sweep algorithm for solving the steady-state, monoenergetic discrete ordinates on meshes of high-order (HO) curved mesh elements. Our spatial discretization consists of arbitrarily HO discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights. Once the set of removed edges is determined, transport sweeps are performed by lagging the upwind dependency associated with the removed edges. The proposed algorithm is tested on several two-dimensional and three-dimensional meshes composed of HO curved mesh elements.