Practical considerations for the adoption of Anderson acceleration in nonlinear diffusion accelerated transport
Not provided.
Nuclear Science & Technology↗
SEARCH · Search NASA
Results for “Nonlinear diffusion acceleration”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting
MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)
97 MATHEMATICS AND COMPUTING↗
A flexible nonlinear diffusion acceleration method for the S N transport equations discretized with discontinuous finite elements
This paper presents a flexible nonlinear diffusion acceleration (NDA) method that discretizes both the S N transport equation and the diffusion equation using the discontinuous finite element method (DFEM). The method is flexible in that the diffusion equation can be discretized on a coarser mesh with the only restriction that it is nested within the transport mesh and the FEM shape function orders of the two equations can be different. The consistency of the transport and diffusion solutions at convergence is defined by using a projection operator mapping the transport into the diffusion FEM space. The diffusion weak form is based on the modified incomplete interior penalty (MIP) diffusion DFEM discretization that is extended by volumetric drift, interior face, and boundary closure terms. In contrast to commonly used coarse mesh finite difference (CMFD) methods, the presented NDA method uses a full FEM discretized diffusion equation for acceleration. Suitable projection and prolongation operators arise naturally from the FEM framework. Via Fourier analysis and numerical experiments for a one-group, fixed source problem the following properties of the NDA method are established for structured quadrilateral meshes: (1) the presented method is unconditionally stable and effective in the presence of mild material heterogeneities if the same mesh and identical shape functions either of the bilinear or biquadratic type are used, (2) the NDA method remains unconditionally stable in the presence of strong heterogeneities, (3) the NDA method with bilinear elements extends the range of effectiveness and stability by a factor of two when compared to CMFD if a coarser diffusion mesh is selected. In addition, the method is tested for solving the C5G7 multigroup, eigenvalue problem using coarse and fine mesh acceleration. Finally, while NDA does not offer an advantage over CMFD for fine mesh acceleration, it reduces the iteration count required for convergence by almost a factor of two in the case of coarse mesh acceleration.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
A FLEXIBLE NONLINEAR DIFFUSION ACCELERATION METHOD FOR THE FIRST ORDER EIGENVALUE SN EQUATIONS DISCRETIZED WITH DISCONTINUOUS FEM
This work describes a Nonlinear Diffusion Acceleration (NDA) method for the first order SN equations that discretizes both the transport equation and the associated diffusion system using discontinuous finite elements; the diffusion system is solved on a potentially coarser mesh and with a coarser energy group structure than the SN equations. The developed method differs from current methods by allowing the SN and diffusion system to be discretized with arbitrary FEM bases and by using an additive update of the SN system. The benefit of this capability is extension of the stability region to optically thicker mesh cells and stability without the necessity to underrelax the iterative algorithm. The presented method introduces the notion of consistency of the SN and diffusion solutions and derives suitable definitions of the cross sections, drift vectors, and element face closures. The NDA equations are solved using a Picard iteration scheme. Numerical results are presented for the C5G7 benchmark problem highlighting the effectiveness of the methods when deployed with the diffusion system discretized on the same mesh as the SN system. Additional results are presented for cases where the diffusion system features a coarser mesh, coarser energy group structure, or both, demonstrating its stability and effectiveness in these cases. It is observed that the effectiveness of the NDA method reduces when reducing the resolution of the associated diffusion system.
97 MATHEMATICS AND COMPUTING↗
A Coarse-Mesh Nonlinear Diffusion Acceleration Scheme with Local Refinement for Neutron Transport Calculations
The coarse-mesh nonlinear diffusion acceleration (CM-NDA) technique, or commonly known as coarse-mesh finite difference (CMFD), is one of the most widely used acceleration methods for numerical transport calculations. Although CM-NDA is very effective to reduce the iteration number of neutron transport sweep, it can sometimes become unstable, in particularly when the coarse mesh size becomes large. Over the last two decades a number of ad hoc techniques have been developed to stabilize the CM-NDA scheme. In this paper, we present a new scheme, LR-NDA, which is based on CM-NDA with local refinement. Within the CM-NDA framework, the LR-NDA scheme incorporates solving an additional local boundary-value problem (BVP) of the neutron flux on each individual coarse mesh cell, yielding a finer flux profile than CMNDA. Our assessments show that this new scheme can significantly improve the effectiveness of CM-NDA, and more importantly it is very stable even for extremely high optical thickness. A great feature of LR-NDA is that it is fully adaptive, which means that it can be easily applied to any local region of the problem domain, and local refinement can be performed using any numerical method (e.g., finite difference, finite element, or spectral element, etc.). (authors)
42 ENGINEERING↗
Nonlinear Diffusion Acceleration of the Least-Squares Transport Equation in Geometries with Voids
In this paper we show the extension of the Nonlinear-Diffusion Acceleration (NDA) to geometries containing small voids using a weighted least-squares (WLS) high order equation. Even though the WLS equation is well defined in voids, the low-order drift diffusion equation was not defined in materials with a zero cross section. This paper derives the necessary modifications to the NDA algorithm. We show that a small change to the NDA closure term and a non-local definition of the diffusion coefficient solve the problems for voids regions. These changes do not affect the algorithm for optical thick material regions, while making the algorithm well defined in optically thin ones. We use a Fourier analysis to perform an iterative analysis to confirm that the modifications result in a stable and efficient algorithm. Numerical results of our method will be presented in the second part of the paper. We test this formulation with a small, one-dimensional test problem. Additionally we present results for a modified version of the C5G7 benchmark containing voids as a more complex, reactor like problem. We compared our results to PDT, Texas A&M’s transport code, utilizing a first order discontinuous formulation as reference and the self-adjoint angular flux equation with void treatment (SAAFτ ), a different second order form. The results indicate, that the NDA WLS performed comparably or slightly worse then the asymmetric SAAFτ , while maintaining a symmetric discretization matrix.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Using Directional Diffusion Coefficients for Nonlinear Diffusion Acceleration of the First Order SN Equations in Near-Void Regions
The common definition of the diffusion coeffcient as the inverse of three times the transport cross section is not compat- ible with voids. Morel introduced a non-local tensor diffusion coeffcient that remains finite in voids[1]. It can be obtained by solving an auxiliary transport problem without scattering or fission. Larsen and Trahan successfully applied this diffusion coeffcient for enhancing the accuracy of diffusion solutions of very high temperature reactor (VHTR) problems that feature large, optically thin channels in the z-direction [2]. It is demonstrated that a significant reduction of error can be achieved in particular in the optically thin region. Along the same line of thought, non-local diffusion tensors are applied modeling the TREAT reactor confirming the findings of Larsen and Trahan [3]. Previous work of the authors have introduced a flexible Nonlinear-Diffusion Acceleration (NDA) method for the first order S N equations discretized with the discontinuous finite element method (DFEM), [4], [5], [6]. This NDA method uses a scalar diffusion coeffcient in the low-order system that is obtained as the flux weighted average of the inverse transport cross section. Hence, it su?ers from very large and potentially unbounded diffusion coeffcients in the low order problem. However, it was noted that the choice of the diffusion coeffcient does not influence consistency of the method at convergence and hence the di?usion coeffcient is essentially a free parameter. The choice of the di?usion coeffcient does, however, affect the convergence behavior of the nonlinear di?usion iterations. Within this work we use Morel’s non-local di?usion coef- ficient in the aforementioned NDA formulation in lieu of the flux weighted inverse of three times the transport cross section. The goal of this paper is to demonstrate that significant en- hancement of the spectral properties of NDA can be achieved in near void regions. For testing the spectral properties of the NDA with non-local diffusion coeffcients, the periodical horizontal interface problem is used [7]. This problem consists of alternating stripes of optically thin and thick materials both of which feature scattering ratios close to unity.
97 MATHEMATICS AND COMPUTING↗
Using Directional Diffusion Coefficients for Nonlinear Diffusion Acceleration of the First Order S{sub N} Equations in Near-Void Regions
The common definition of the diffusion coefficient as the inverse of three times the transport cross section is not compatible with voids. Morel introduced a non-local tensor diffusion coefficient that remains finite in voids. It can be obtained by solving an auxiliary transport problem without scattering or fission. Larsen and Trahan successfully applied this diffusion coefficient for enhancing the accuracy of diffusion solutions of very high temperature reactor (VHTR) problems that feature large, optically thin channels in the z-direction. It was demonstrated that a significant reduction of error can be achieved in particular in the optically thin region. Along the same line of thought, non-local diffusion tensors have been applied to modeling the TREAT reactor confirming the findings of Larsen and Trahan. Previous work of the authors have introduced a flexible Nonlinear-Diffusion Acceleration (NDA) method for the first order S{sub N} equations discretized with the discontinuous finite element method (DFEM). This NDA method uses a scalar diffusion coefficient in the low-order system that is obtained as the flux weighted average of the inverse transport cross section. Hence, it suffers from very large and potentially unbounded diffusion coefficients in the low order problem. However, it was noted that the choice of the diffusion coefficient does not influence consistency of the method at convergence and hence the diffusion coefficient is essentially a free parameter. The choice of the diffusion coefficient does, however, affect the convergence behavior of the nonlinear diffusion iterations. Within this work we use Morel's non-local diffusion coefficient in the aforementioned NDA formulation in lieu of the flux weighted inverse of three times the transport cross section. The goal of this paper is to demonstrate that significant enhancement of the spectral properties of NDA can be achieved in near void regions. For testing the spectral properties of the NDA with non-local diffusion coefficients, the periodical horizontal interface problem is used. This problem consists of alternating stripes of optically thin and thick materials both of which feature scattering ratios close to unity. (authors)
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Accelerating the solution of the S N equations with highly anisotropic scattering using the Fokker-Planck approximation
The discrete ordinates method can model forward-peaked transport problems accurately. However, convergence of discrete ordinates solution can become arbitrarily slow upon use of standard iterative procedures like source iteration. Standard zeroth and first moment-based acceleration methods like nonlinear diffusion acceleration and diffusion synthetic acceleration are ineffective in accelerating such problems because these methods do not correct higher order Legendre-moments of angular flux. In this paper, we explore the idea of using the Fokker-Planck approximation as a preconditioner to accelerate the convergence of solution of forward-peaked transport problems. Finally, we observe that such preconditioning can successfully reduce the iteration count by up to four orders of magnitude, and solver runtime by up to three orders of magnitude when compared to diffusion synthetic acceleration.
42 ENGINEERING↗
Convergence Study of LR-NDA Using Fourier Analysis
Numerical solution of neutron transport equations is challenging. It often requires acceleration techniques to improve computational efficiency. In the last two decades, various acceleration methods have been developed. Among those methods, the coarse-mesh nonlinear diffusion acceleration (CM-NDA) technique, or commonly known as coarse-mesh finite difference (CMFD), becomes one of the most popular methods due to its effectiveness and simplicity in recent years. However, CM-NDA will lose its effectiveness and could become unstable when the mesh optical thickness becomes large. There exists a number of stabilization techniques to improve the stability of CM-NDA, such as pCMFD and most recent odCMFD. Wang et al., proposed a new CM-NDA scheme, LR-NDA, which employs local refinement on the coarse mesh. The new scheme can significantly improve the effectiveness and stability of CM-NDA. In this paper, we perform a convergence study of LR-NDA using Fourier analysis. The spectral radius calculated from Fourier analysis is consistent with the numerical results for a 1-D fixed source model problem.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Crystal plasticity modeling of irradiation effects on flow stress in pure-iron and iron-copper alloys
Not Available
Chakraborty, Pritam (ORCID:0000000321987409)↗
A Weighted Least-Squares Transport Equation Compatible with Source Iteration and Voids
We present that second-order forms of the transport equation allow the use of continuous finite elements (CFEMs). This can be desired in multiphysics calculations where other physics require CFEM discretizations. Second-order transport operators are generally self-adjoint, yielding symmetric positive-definite (SPD) matrices, which allow the use of efficient linear algebra solvers with an enormous advantage in memory usage. Least-squares (LS) forms of the transport equation can circumvent the void problems of other second-order forms but are almost always nonconservative. Additionally, the standard LS form is not compatible with discrete ordinates method (SN) iterative solution techniques such as source iteration. A new form of the LS transport equation has recently been developed that is compatible with voids and standard SN iterative solution techniques. Performing nonlinear diffusion acceleration (NDA) using an independently differenced low-order equation enforces conservation for the whole system and makes this equation suitable for reactor physics calculations. In this context, “independent” means that both the transport and low-order solutions converge to the same scalar flux and current as the spatial mesh is refined, but for a given mesh, the solutions are not necessarily equal. In this paper we show that introducing a weight function into this LS equation improves issues with causality and can render our equation equal to the self-adjoint angular flux (SAAF) equation. Causality is a principle of the transport equation that states that information travels only downstream along characteristics. This principle can be violated numerically. We show how to limit the weight function in voids and demonstrate the effect of this limit on accuracy. Using the C5G7 benchmark, we compare our method to the SAAF formulation with a void treatment (SAAFτ) that is not self-adjoint and has a nonsymmetric coefficient matrix. Finallyl, we show that the weighted LS equation with NDA gives acceptable accuracy relative to the SAAFτ equation while maintaining a SPD system matrix.
97 MATHEMATICS AND COMPUTING↗
Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods (Final Report)
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.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Multigrid Algorithms with Projection and Prolongation over Elements of the Phase Space for K-Eigenvalue Transport Problems
This paper describes new multilevel acceleration methods for solving the multigroup neu- tron transport eigenvalue problems. These multilevel algorithms use different projection and prolongation operators in the phase space. The Nonlinear Diffusion Acceleration (NDA) method with multiple grids in energy is formulated with the prolongation oper- ator based on multiplication iterative correction and linear-in-energy mapping. Another multilevel NDA method uses the projection operator with coarsening in energy between the high-order transport and low-order NDA equations. The third algorithm is formu- lated with the partial-current based CMFD low-order equations and applies projection operators in space and energy. The numerical results are presented.
Cornejo, Luke↗
Anderson acceleration stability in NDA-accelerated k-eigenvalue problems
Anderson acceleration (AA) has been used to improve the stability and convergence rate of multiphysics iterative methods for reactor analysis. Most applications studied assume a tightly converged solution for the different physics problems, and AA is usually applied to state variables like temperature, density, and heat generation rate. In this paper, we study the theoretical performance of AA in NDA-accelerated k-eigenvalue problems. The problems and algorithms studied are simplified from the coupled iteration scheme adopted by MPACT and many other high-fidelity whole-core reactor codes. Compared to previous analyses of AA for these iteration schemes, we study the case with a partially converged neutronics solution and possibly partially converged nonlinear diffusion acceleration (NDA)/coarse mesh finite difference (CMFD) solutions. We observe that the performance of the iteration scheme with AA is very sensitive to the initial guess and is affected by the partially converged CMFD solutions. When the NDA solution is fully converged, using AA cannot achieve the optimal convergence rate in large-sized problems. Conversely, if the NDA solution is partially converged, the iteration scheme with AA can diverge or converge extremely slowly. It is found that the loss of robustness for AA is due to the fact that it is applied to the iterative subspace of state variables rather than the fundamental unknowns of the governing equations. To improve the robustness, the scalar flux should also be considered in the implementation of AA. After considering the residuals of flux, we observe that the stability is regardless of the partial convergence of NDA solutions. (authors)
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Stability analysis of nonlinear two-grid method for multigroup neutron diffusion problems
We present theoretical analysis of a nonlinear acceleration method for solving multigroup neutron diffusion problems. This method is formulated with two energy grids that are defined by (i) fine-energy groups structure and (ii) coarse grid with just a single energy group. The coarse-grid equations are derived by averaging of the multigroup diffusion equations over energy. The method uses a nonlinear prolongation operator. We perform stability analysis of iteration algorithms for inhomogeneous (fixed-source) and eigenvalue neutron diffusion problems. To apply Fourier analysis the equations of the method are linearized about solutions of infinite-medium problems. The developed analysis enables us to predict convergence properties of this two-grid method in different types of problems. Numerical results of problems in 2D Cartesian geometry are presented to confirm theoretical predictions.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗