Advanced reactor concepts span the spectrum from heat pipe–cooled microreactors, through thermal and fast molten-salt reactors, to gas- and salt-cooled pebble bed reactors. The modeling and simulation of each of these reactor types comes with their own geometrical complexities and multiphysics challenges. However, the common theme for all nuclear reactors is the necessity to be able to accurately predict neutron distribution in the presence of multiphysics feedback. We argue that the current standards of modeling and simulation, which couple single-physics, single-reactor-focused codes via ad hoc methods, are not sufficiently flexible to address the challenges of modeling and simulation for advanced reactors. In this work, we present the Multiphysics Object Oriented Simulation Environment (MOOSE)–based radiation transport application Rattlesnake. The use of Rattlesnake for the modeling and simulation of nuclear reactors represents a paradigm shift away from makeshift data exchange methods, as it is developed based on the MOOSE platform with its very natural form of shared data distribution. Rattlesnake is well equipped for addressing the geometric and multiphysics challenges of advanced reactor concepts because it is a flexible finite element tool that leverages the multiphysics capabilities inherent in MOOSE. This paper focuses on the concept and design of Rattlesnake. We also demonstrate the capabilities and performance of Rattlesnake with a set of problems including a microreactor, a molten-salt reactor, a pebble bed reactor, the Advanced Test Reactor at the Idaho National Laboratory, and two benchmarks: a multiphysics version of the C5G7 benchmark and the LRA benchmark.
1 January 2020 in SIAM Journal on Scientific Computing
The multigroup neutron transport equation is crucial for studying the motion of neutrons and their interaction with materials. Numerical simulation of the multigroup neutron transport equation is computationally challenging because the equation is defined on a high-dimensional phase space, the computational spatial domain is complex, and the materials are heterogeneous. A scalable parallel solver is required to address such a challenge. In this paper, we study a highly parallel Newton--Krylov--Schwarz (NKS) method consisting of a Newton-based eigenvalue solver, a Krylov subspace method, and a novel multilevel Schwarz preconditioner. The multilevel method is one of the most popular preconditioners for accelerating neutron transport calculations, but the construction of coarse spaces can be expensive and often unscalable when a large number of processors is used. We propose a novel matrix coarsening algorithm in which a multilevel hierarchy is constructed using a single-component matrix instead of the full matrix of the neutron transport equation. This new coarsening algorithm is referred to as “subspace-based coarsening.” Above 8,000 processors, we show a 13x enhancement in multilevel preconditioner setup time when using the subspace-based coarsening method. A partition-based balancing strategy is studied to enhance the parallel efficiency of the NKS algorithm by equalizing the work for each processor. A hierarchical mesh partitioning algorithm is employed to generate a large number of submeshes while minimizing off-node communication. We demonstrate that the proposed algorithm is scalable with more than 10,000 processors for a realistic application on three-dimensional unstructured meshes with a few billion degrees of freedom. Neutron transport calculations using the improved NKS algorithm are twice as fast as those based on the unmodified NKS solver when over 8,000 processors are employed.
14 February 2018 in Numerical Linear Algebra with Applications
The ability to identify features within finite element simulations and track them over time is necessary for understanding and quantifying complex behaviors as disparate as turbulent vortices in a flow field to microstructure evolution. We extend our previous research on feature identification in parallel unstructured meshes with the novel ability to maintain feature distinctness by dynamically remapping individual features to new simulation variables as the simulation evolves. We utilize this capability to drastically reduce the number of variables required in a simulation while maintaining the same fidelity as simulations without these reductions. We present this novel remapping algorithm and the corresponding implementation within the open-source Multiphysics Object Oriented Simulation Environment (MOOSE) framework. We demonstrate the utility of the method with a novel phase-field model of irradiation-driven grain subdivision in UO2. Grain population statistics are tracked over time, and a dynamically stable population of grains with a reduced size evolves. These results indicate that the small grain sizes observed in high-burnup UO2 can be explained by this mechanism.
17 August 2022 in The International Journal of Advanced Manufacturing Technology
The communities who develop and support open source scientific software packages are crucial to the utility and success of such packages. Moreover, these communities form an important part of the human infrastructure that enables scientific progress. This paper discusses aspects of the PETSc (Portable Extensible Toolkit for Scientific Computation) community, its organization, and technical approaches that enable community members to help each other efficiently and effectively.