Search NASA⌕ Search

Engineering topics

McClarren, Ryan G.

Publications and source records attributed to McClarren, Ryan G..

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗

A collision-based hybrid method for the BGK equation

In this article, we apply the collision-based hybrid method introduced by Hauck and McClarren to the Boltzmann equation with the BGK operator and a hyperbolic scaling. An implicit treatment of the source term is used to handle stiffness associated with the BGK operator. Although it helps the numerical scheme become stable with a large time step size, it is still not obvious to achieve the desired order of accuracy due to the relationship between the size of the spatial cell and the mean free path. Without asymptotic preserving property, a very restricted grid size is required to resolve the mean free path, which is not practical. Our approaches are based on the noncollision-collision decomposition of the BGK equation. We introduce the arbitrary order of nodal discontinuous Galerkin (DG) discretization in space with a semi-implicit time-stepping method; we employ the backward Euler time integration for the uncollided equation and the 2nd order predictor-corrector scheme for the collided equation, i.e., both source terms in uncollided and collided equations are treated implicitly and only streaming term in the collided equation is solved explicitly. This improves the computational efficiency without the complexity of the numerical implementation. Numerical results are presented for various Knudsen numbers to present the effectiveness and accuracy of our hybrid method. Also, we compare the solutions of the hybrid and non-hybrid schemes.

97 MATHEMATICS AND COMPUTING↗

Multigroup Neutron Transport Using a Collision-Based Hybrid Method

A collision-based hybrid algorithm for the discrete ordinates approximation of the neutron transport equation is extended to the isotropic multigroup setting. The algorithm uses discrete energy and angle grids at two different resolutions and approximates the fission and scattering sources on the coarser grids. The coupling of a collided transport equation, discretized on the coarse grid, with an uncollided transport equation, discretized on the fine grid, yields an algorithm that, in most cases, is more efficient than the traditional multigroup approach. In conclusion, the improvement over existing techniques is demonstrated for time-dependent problems with different materials, geometries, and energy groups.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Transfer Learning of High-Fidelity Opacity Spectra in Autoencoders and Surrogate Models

Simulations of high energy density physics are expensive, largely in part for the need to produce nonlocal thermodynamic equilibrium opacities. High-fidelity spectra may reveal new physics in the simulations not seen with low-fidelity spectra, but the cost of these simulations also scales with the level of fidelity of the opacities being used. Neural networks are capable of reproducing these spectra, but neural networks need data to train them, which limits the level of fidelity of the training data. Here this article demonstrates that it is possible to reproduce high-fidelity spectra with median errors in the realm of 3%–4% using as few as 50 samples of high-fidelity Krypton data by performing transfer learning on a neural network trained on many times more low-fidelity data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data reduction in deterministic neutron transport calculations using machine learning

Neutron cross section matrices for fission and scattering data are required for each material, temperature, and enrichment level to calculate the neutron transport equation accurately. Here, this information can be a limiting factor when using the multigroup discrete ordinates (S N ) method when the number of energy groups is large. Machine Learning (ML) can be used to replace the need for the cross section matrices by reproducing the function that maps the scalar flux to the scattering and fission sources. Through the use of autoencoders and Deep Jointly-Informed Neural Networks (DJINN), the data storage requirements are reduced by 94% of the original data for a 618 group problem. This is accomplished while preserving the scalar flux, maintaining generality, and decreasing wall clock times.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Data-driven acceleration of thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singular value decomposition

In this work, we present a method for accelerating discrete ordinates radiative transfer calculations for radiative transfer. Our method works with nonlinear positivity fixes, in contrast to most acceleration schemes. The method is based on the dynamic mode decomposition (DMD) and using a sequence of rank-one updates to compute the singular value decomposition needed for DMD. Using a sequential method allows us to automatically determine the number of solution vectors to include in the DMD acceleration. We present results for slab geometry discrete ordinates calculations with the standard temperature linearization. Compared with positive source iteration, our results demonstrate that our acceleration method reduces the number of transport sweeps required to solve the problem by a factor of about 3 on a standard diffusive Marshak wave problem, a factor of several thousand on a cooling problem where the effective scattering ratio approaches unity, and a factor of 20 improvement in a realistic, multimaterial radiating shock problem.

97 MATHEMATICS AND COMPUTING↗

Parameter inference with deep jointly informed neural networks

Abstract A common challenge in modeling inertial confinement fusion (ICF) experiments with computer simulations is that many of the simulation inputs are unknown and cannot be directly measured. Often, parameters that are measured in the experiment are used to infer the unknown inputs by solving the inverse problem: finding the set of simulation inputs that result in outputs consistent with the experimental observations. In ICF, this process is often referred to as a “post‐shot analysis.” Post‐shot analyses are challenging as the inverse problem is often highly degenerate, the input parameter space is vast, and simulations are computationally expensive. In this work, deep neural network models equipped with model uncertainty estimates are used to train inverse models, which map directly from output to input space, to find the distribution of post‐shot simulations that are consistent with experimental observations. The inverse model approach is compared to Markov chain Monte Carlo (MCMC) sampling of the forward model, which maps from input to output space, for parameter inference tasks of varying complexity. The inverse models perform best when searching vast parameter spaces for post‐shot simulations that are consistent with a large number of observables, where MCMC sampling can be prohibitively expensive. We demonstrate how augmenting inverse models with autoencoders enable the inclusion of several dozen observables in the inverse mapping, reducing the degeneracy of the model and improving the accuracy of the post‐shot analysis.

Humbird, Kelli D.↗

A Continuous-Discontinuous Hybrid Finite Element Method for S{sub N} Transport

Particle transport phenomenon for neutral particles, such as neutrons and photons, is governed by the linear Boltzmann equation, which is a first-order partial differential equation (PDE). In order to solve the transport equation, discontinuous finite element method (DFEM) is heavily developed. However, the large memory consumption due to the extra degrees of freedom is problematic in multi-D calculations. Another path is to recast the transport equation to a second-order form, such as the well-known self-adjoint angular flux equation (SAAF) and the even parity equations, and spatially discretize the equation using continuous finite element method (CFEM). Yet, such forms generally have problems in void situation as the streaming operator contains a 1/σ{sub t} term and becomes singular in void, which draws numerous efforts on developing void-treatment methods. An intuition to mitigate the shortcomings of both methods is then to develop a method that utilizes DFEM in part of the problem where CFEM has issues while in the other part, CFEM is employed to avoid DFEM's high cost. In this work, we present a novel continuous-discontinuous finite element method (CDFEM) for solving the discrete-ordinates (S{sub N}) transport equations. We perform the hybridization between 1/σ{sub t}-weighted least-squares finite element methods (1/σ{sub t}-LSFEM), with continuous basis functions, and first-order solver. Different solvers are defined in different regions, or subdomains, of the problem. The resulting scheme is such that CFEM-SAAF is performed in subdomains with continuous basis functions while upwinding based DFEM solver is utilized in subdomains with discontinuous basis functions. The connection between subdomains is through an upwinding operation on the interface, which can be performed via the sweep procedure. A foreseeable benefit is such a scheme is compatible with void as first-order DFEM solver can be used in void. On the other hand, as DFEM is only used in part of the problem, CDFEM can effectively avoid the notorious memory consumption of DFEM in multi-D calculation for the future work.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Adjoint-based sensitivity analysis for high-energy density radiative transfer using flux-limited diffusion

Uncertainty quantification and sensitivity analyses are a vital component for predictive modeling in the sciences and engineering. The adjoint approach to sensitivity analysis requires solving a primary system of equations and a mathematically related set of adjoint equations. The information contained in the equations can be combined to produce sensitivity information in a computationally efficient manner. Here in this work, sensitivity analyses are performed on systems described by flux-limited radiative diffusion using the adjoint approach. The sensitivities computed are shown to agree with standard perturbation theory and require significantly less computational time. The adjoint approach saves the computational cost of one forward solve per sensitivity, making the method attractive when multiple sensitivities are of interest.

42 ENGINEERING↗

Implicit filtered P{sub N} for high-energy density thermal radiation transport using discontinuous Galerkin finite elements

In this work, we provide a fully-implicit implementation of the time-dependent, filtered spherical harmonics (FP{sub N}) equations for non-linear, thermal radiative transfer. We investigate local filtering strategies and analyze the effect of the filter on the conditioning of the system, showing in particular that the filter improves the convergence properties of the iterative solver. We also investigate numerically the rigorous error estimates derived in the linear setting, to determine whether they hold also for the non-linear case. Finally, we simulate a standard test problem on an unstructured mesh and make comparisons with implicit Monte Carlo (IMC) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗