# Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods

## Abstract

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. Asmore »

- Authors:

- Publication Date:

- Research Org.:
- University of Massachusetts

- Sponsoring Org.:
- USDOE Office of Nuclear Energy (NE)

- OSTI Identifier:
- 1511575

- Report Number(s):
- 15-8208

15-8208

- DOE Contract Number:
- NE0008401

- Resource Type:
- Technical Report

- Country of Publication:
- United States

- Language:
- English

### Citation Formats

```
Wang, Dean.
```*Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods*. United States: N. p., 2019.
Web. doi:10.2172/1511575.

```
Wang, Dean.
```*Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods*. United States. doi:10.2172/1511575.

```
Wang, Dean. Tue .
"Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods". United States. doi:10.2172/1511575. https://www.osti.gov/servlets/purl/1511575.
```

```
@article{osti_1511575,
```

title = {Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods},

author = {Wang, Dean},

abstractNote = {This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.},

doi = {10.2172/1511575},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2019},

month = {4}

}