Search NASA⌕ Search

SEARCH · Search NASA

Results for “Synthetic 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.

At least 19 records

Krylov iterative methods and synthetic acceleration for transport in binary statistical media

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S{sub 2} synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Monte Carlo synthetic-acceleration method for solving the thermal radiation diffusion equation

We present a novel synthetic-acceleration-based Monte Carlo method for solving the equilibrium thermal radiation diffusion equation in three spatial dimensions. The algorithm performance is compared against traditional solution techniques using a Marshak benchmark problem and a more complex multiple material problem. Our results show that our Monte Carlo method is an effective solver for sparse matrix systems. For solutions converged to the same tolerance, it performs competitively with deterministic methods including preconditioned conjugate gradient and GMRES. We also discuss various aspects of preconditioning the method and its general applicability to broader classes of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Multiple-Set Overlapping-Domain Decomposed Monte Carlo Synthetic Acceleration Method for Linear Systems

We present a multiple-set overlapping-domain decomposed strategy for parallelizing the Monte Carlo Synthetic Acceleration method. Monte Carlo Synthetic Acceleration methods use the Neumann-Ulam class of Monte Carlo solvers for linear systems to accelerate a fixed-point iteration sequence. Effective parallel algorithms for these methods require the parallelization of the underlying Neumann-Ulam solvers. To do this in a domain decomposed environment, we borrow strategies traditionally implemented in Monte Carlo particle transport to parallelize the problem. The parallel Neumann-Ulam and multiple-set overlapping-domain decomposition algorithms are presented along with parallel scaling data for the resulting implementation using the Titan Cray XK7 machine at Oak Ridge National Laboratory.

Computer Science↗

SU-E-T-270: Diffusion Synthetic Acceleration for Linear Boltzmann Transport Equation

Purpose: Linear Boltzmann transport equation (LBTE) is as accurate as the Monte Carlo method (MC) for dose calculation in photon/particle therapy (LBTE is a deterministic and Eulerian formulation and MC is a statistical and Lagrangian description). An advantage of LBTE is that numerous acceleration techniques can be utilized for acceleration. This work is to explore the acceleration of LBTE via diffusion synthetic acceleration (DSA). Methods: For simplicity, two-dimensional, steady-state, and within-group LBTE is considered with two angular dimensions and two spatial dimensions. The discrete ordinate method is developed for solving this integro-differential equation. The angular variables are discretized using a level-symmetric quadrature set on the unit sphere. The spatial variables are discretized on the structured grid based on the diamond scheme. The source-iteration method (SI) is used to solve the discretized system.Since SI is slow in optically thick and highly scattering regime. DSA is developed to accelerate SI. The motivation for DSA is that diffusion equation (DE) is a good approximation of LBTE in the above regime. However, DE is much cheaper than LBTE computationally since DE only involves spatial variables. Thus, in each DSA iteration, DSA adds to the SI step a computationally-negligible DE step, i.e., to first solve DE with the SI residual as source term, and then compensate the SI solution with DE solution. Results: DSA was benchmarked and compared with SI. The difference between two methods was within 0.12% which verifies the accuracy of DSA, while DSA demonstrated the great advantage in speed, e.g., the reduction of iteration number to 6% and 4% respectively for cases with 100 and 1,000 scattering-absorption ratio that commonly occur in clinical dose calculation. Conclusion: DSA has been developed as one of many possible means for accelerating the numerical solver of LBTE for dose calculation. The authors were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

60 APPLIED LIFE SCIENCES↗

Diffusion Synthetic Acceleration for High-Order Discontinuous Finite Element SN Transport Schemes and Application to Locally Refined Unstructured Meshes

Diffusion synthetic acceleration (DSA) schemes compatible with adaptive mesh refinement (AMR) grids are derived for the SN transport equations discretized using high-order discontinuous finite elements. These schemes are directly obtained from the discretized transport equations by assuming a linear dependence in angle of the angular flux along with an exact Fick's law and, therefore, are categorized as partially consistent. These schemes are akin to the symmetric interior penalty technique applied to elliptic problems and are all based on a second-order discontinuous finite element discretization of a diffusion equation (as opposed to a mixed or P1 formulation). Therefore, they only have the scalar flux as unknowns. A Fourier analysis has been carried out to determine the convergence properties of the three proposed DSA schemes for various cell optical thicknesses and aspect ratios. Out of the three DSA schemes derived, the modified interior penalty (MIP) scheme is stable and effective for realistic problems, even with distorted elements, but loses effectiveness for some highly heterogeneous configurations. The MIP scheme is also symmetric positive definite and can be solved efficiently with a preconditioned conjugate gradient method. Its implementation in an AMR SN transport code has been performed for both source iteration and GMRes-based transport solves, with polynomial orders up to 4. Numerical results are provided and show good agreement with the Fourier analysis results. Results on AMR grids demonstrate that the cost of DSA can be kept low on locally refined meshes.

42 ENGINEERING↗

Fourier analysis of continuous fractional diffusion synthetic acceleration schemes in slab geometry

We propose two fractional extensions of continuous diffusion synthetic acceleration (DSA) with fractional derivative order α varying over the interval 2 ≥ α ≥ 1 . We investigate the spectral properties of the corresponding continuous families of fractional preconditioners by performing Fourier analysis for a model infinite homogeneous medium problem in slab geometry. The first family results in a fractional acceleration scheme, FrDSAo, that reduces to traditional DSA for .α = 2 and scattering ratio c limiting to a unit value (c → 1) but is otherwise optimized via the Fourier analysis, to obtain the smallest possible spectral radius, for c < 1 and 2 ≥ α ≥ 1. The second family corresponds to a fractional acceleration scheme, FrDSAs, that reduces to traditional DSA for α = 2 for all values of c. The latter scheme is not optimized but has the advantage of lending itself to a more straightforward implementation. For high values of c, the results of the Fourier analysis point to the existence of an interval 2 > α > ∼1.8 where both FrDSAo and FrDSAs can achieve a lower spectral radius than DSA. For example, DSA has a spectral radius of ∼0.2246 for c = 0.9999 while FrDSAo produces a value of ∼0.1616 at α = 1.92 and FrDSAs results in ∼0.2116 at α =1.93. (author)

97 MATHEMATICS AND COMPUTING↗

Discontinuous diffusion synthetic acceleration for S{sub n} transport on 2D arbitrary polygonal meshes

In this paper, a Diffusion Synthetic Acceleration (DSA) technique applied to the S{sub n} radiation transport equation is developed using Piece-Wise Linear Discontinuous (PWLD) finite elements on arbitrary polygonal grids. The discretization of the DSA equations employs an Interior Penalty technique, as is classically done for the stabilization of the diffusion equation using discontinuous finite element approximations. The penalty method yields a system of linear equations that is Symmetric Positive Definite (SPD). Thus, solution techniques such as Preconditioned Conjugate Gradient (PCG) can be effectively employed. Algebraic MultiGrid (AMG) and Symmetric Gauss–Seidel (SGS) are employed as conjugate gradient preconditioners for the DSA system. AMG is shown to be significantly more efficient than SGS. Fourier analyses are carried out and we show that this discontinuous finite element DSA scheme is always stable and effective at reducing the spectral radius for iterative transport solves, even for grids with high-aspect ratio cells. Numerical results are presented for different grid types: quadrilateral, hexagonal, and polygonal grids as well as grids with local mesh adaptivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A diffusion synthetic acceleration scheme for rectangular geometries based on bilinear discontinuous finite elements

A DSA technique to accelerate the iterative convergence of S{sub n} transport solves is derived for bilinear discontinuous (BLD) finite elements on rectangular grids. The diffusion synthetic acceleration equations are discretized using BLD elements by adapting the Modified Interior Penalty technique, introduced in [4] for triangular grids. The MIP-DSA equations are SPD and thus are solved using a preconditioned CG technique. Fourier analyses and implementation of the technique in a BLD S{sub n} transport code show that the technique is stable is effective. (authors)

97 MATHEMATICS AND COMPUTING↗

Diffusion Synthetic Acceleration for High Order S{sub N} Transport on Meshes with Curved Surfaces

Thermal radiation transport is integral to multiphysics applications such as inertial confinement fusion and astrophysics. Materials in these problems can be exceptionally optically thick and diffusive. A transport solver must be capable of accurate and efficient solutions to such problems. Previously, Woods et al. established a proof-of-concept for high order (HO) discontinuous Galerkin finite element (DGFEM) transport on meshes with curved surfaces. They numerically demonstrated the spatial convergence is order p + 1. Remarkably, these convergence rates are relatively invariant to the amount of curvature of the spatial mesh. We present here an extension of this work that demonstrates a rapidly-convergent iterative solver for the FEM transport equations on meshes with curved sides. We use the modified interior penalty (MIP) diffusion synthetic acceleration (DSA) established by Wang and Ragusa. The partially consistent MIP equations stem from the symmetric interior penalty (IP) derivation of the diffusion equation. The IP method is not stable for optically thick cells so it was combined with the diffusion conforming form (DCF), a discretized diffusion equation derived from the discretized S N equations that is not stable for intermediate optical thicknesses. The MIP equations adapt a 'switch' to the IP method in optically thinner regions and the DCF method in optically thicker regions. The literature does not reveal any Fourier analyses performed for iterative transport on meshes with curved surfaces. Wang and Ragusa performed a Fourier analysis for orthogonal meshes and our results appear to be as expected. Previous literature has reported on some of the sensitivities that affect the spectral radius of DSA schemes: polynomial order, and scattering ratios. Presently, we focus on the sensitivity of the spectral radius to polynomial order, scattering ratio, the constant C, and mesh curvature for varying cell thicknesses. We also numerically study the behavior of the spectral radius to verify our DSA implementation. A sequence of problems is designed to exercise the acceleration. As the problems become more optically thick and diffusive, the accelerated solution continues to converge toward the analytic solution. We employ the Modular Finite Element Methods (MFEM) package, developed at Lawrence Livermore National Laboratory, to generate the linear algebraic system of equations for each angle in the discrete ordinates quadrature set, and use UMFPack to solve this system of equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Transient MOC with frequency transform and DSA on unstructured mesh

We present an implementation of the transient method of characteristics (MOC) with isotropic time derivatives, accelerated by diffusion synthetic acceleration (DSA). The fully implicit frequency transform method is used to solve the transient problem with analytic precursor integration. The code works on meshes composed of almost any of the commonly used non-curvilinear finite element types, and can handle the deformation of geometry in time-dependent transport calculations. We present results of a continuous Fourier analysis for the transient multigroup DSA problem, and representative benchmarking results are presented for the C5G7-TD benchmark in 2D showing reasonable performance and agreement compared to other codes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Denovo--A New Three-Dimensional Parallel Discrete Ordinates Code in SCALE

Denovo is a new, three-dimensional, discrete ordinates (SN) transport code that uses state-of-the-art solution methods to obtain accurate solutions to the Boltzmann transport equation. Denovo uses the Koch-Baker-Alcouffe parallel sweep algorithm to obtain high parallel efficiency on O(100) processors on XYZ orthogonal meshes. As opposed to traditional SN codes that use source iteration, Denovo uses nonstationary Krylov methods to solve the within-group equations. Krylov methods are far more efficient than stationary schemes. Additionally, classic acceleration schemes (diffusion synthetic acceleration) do not suffer stability problems when used as a preconditioner to a Krylov solver. Denovo's generic programming framework allows multiple spatial discretization schemes and solution methodologies. Denovo currently provides diamond-difference, theta-weighted diamond-difference, linear-discontinuous finite element, trilinear-discontinuous finite element, and step characteristics spatial differencing schemes. Also, users have the option of running traditional source iteration instead of Krylov iteration. Multigroup upscatter problems can be solved using Gauss-Seidel iteration with transport, two-grid acceleration. A parallel first-collision source is also available. Denovo solutions to the Kobayashi benchmarks are in excellent agreement with published results. Parallel performance shows excellent weak scaling up to 20000 cores and good scaling up to 40000 cores.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗