Spatial adaptivity of the SAAF and Weighted Least Squares (WLS) forms of the neutron transport equation using constraint based, locally refined, isogeometric analysis (IGA) with dual weighted residual (DWR) error measures
- 1. Nuclear Engineering Group, Department of Mechanical Engineering, Imperial College London, City and Guilds Building, Exhibition Road, South Kensington Campus, SW7 2AZ, United Kingdom of Great Britain and Northern (Ireland)
- 2. Department of Aerospace and Mechanical Engineering, University of Notre Dame, Fitzpatrick Hall, Notre Dame, IN 46556, United States of America (United States)
Description
Highlights: • A constraint based local refinement method for NURBS based IGA is fully explained. • The physical adjoint of the SAAF and WLS equations are derived. • A heuristic error measure and a goal-based, error measure are derived. • These error measure are used to drive adaptive IGA spatial refinement algorithms. • The accuracy of the heuristic and goal-based error measures are compared. This paper describes a methodology that enables NURBS (Non-Uniform Rational B-spline) based Isogeometric Analysis (IGA) to be locally refined. The methodology is applied to continuous Bubnov-Galerkin IGA spatial discretisations of second-order forms of the neutron transport equation. In particular this paper focuses on the self-adjoint angular flux (SAAF) and weighted least squares (WLS) equations. Local refinement is achieved by constraining degrees of freedom on interfaces between NURBS patches that have different levels of spatial refinement. In order to effectively utilise constraint based local refinement, adaptive mesh refinement (AMR) algorithms driven by a heuristic error measure or forward error indicator (FEI) and a dual weighted residual (DWR) or goal-based error measure (WEI) are derived. These utilise projection operators between different NURBS meshes to reduce the amount of computational effort required to calculate the error indicators. In order to apply the WEI to the SAAF and WLS second-order forms of the neutron transport equation the adjoint of these equations are required. The physical adjoint formulations are derived and the process of selecting source terms for the adjoint neutron transport equation in order to calculate the error in a given quantity of interest (QoI) is discussed. Several numerical verification benchmark test cases are utilised to investigate how the constraint based local refinement affects the numerical accuracy and the rate of convergence of the NURBS based IGA spatial discretisation. The nuclear reactor physics verification benchmark test cases show that both AMR algorithms are superior to uniform refinement with respect to accuracy per degree of freedom. Furthermore, it is demonstrated that for global QoI the FEI driven AMR and WEI driven AMR produce similar results. However, if local QoI are desired then WEI driven AMR algorithm is more computationally efficient and accurate per degree of freedom.
Availability note (English)
Available from http://dx.doi.org/10.1016/j.jcp.2020.109941Additional details
Identifiers
- DOI
- 10.1016/j.jcp.2020.109941;
- PII
- S0021999120307154;
Publishing Information
- Journal Title
- Journal of Computational Physics (Print)
- Journal Volume
- 426
- Journal Page Range
- vp.
- ISSN
- 0021-9991
- CODEN
- JCTPAH
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 54001952
- Subject category
- S73: NUCLEAR PHYSICS AND RADIATION PHYSICS; S22: GENERAL STUDIES OF NUCLEAR REACTORS;
- Descriptors DEI
- ALGORITHMS; BENCHMARKS; DEGREES OF FREEDOM; ERRORS; LEAST SQUARE FIT; NEUTRON TRANSPORT; NEUTRON TRANSPORT THEORY; NUCLEAR PHYSICS; PROJECTION OPERATORS; REACTOR PHYSICS; REACTORS; SOURCE TERMS
- Descriptors DEC
- MATHEMATICAL LOGIC; MATHEMATICAL OPERATORS; MATHEMATICAL SOLUTIONS; MAXIMUM-LIKELIHOOD FIT; NEUTRAL-PARTICLE TRANSPORT; NUMERICAL SOLUTION; PHYSICS; RADIATION TRANSPORT; TRANSPORT THEORY
Optional Information
- Copyright
- Copyright (c) 2020 Elsevier Inc. All rights reserved.