Engineering Papers⌕ Search

Engineering topics

Hauck, Cory D

Publications and source records attributed to Hauck, Cory D.

Particle-in-cell (hPIC) data

Data generated from the hPIC particle-in-cell code to construct a surrogate ion energy-angle distribution (IEAD) model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Realizability-Preserving Discontinuous Galerkin Method for the $M_1$ Model of Radiative Transfer

The M{sub 1} model for radiative transfer coupled to a material energy equation in planar geometry is studied in this paper. For this model to be well-posed, its moment variables must fulfill certain realizability conditions. Our main focus is the design and implementation of an explicit Runge-Kutta discontinuous Galerkin method which, under a more restrictive CFL condition, guarantees the realizability of the moment variables and the positivity of the material temperature. An analytical proof for our realizability-preserving scheme, which also includes a slope-limiting technique, is provided and confirmed by various numerical examples. Among other things, we present accuracy tests showing convergence up to fourth-order, compare our results with an analytical solution in a Riemann problem, and consider a Marshak wave problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗

High-Order Entropy-Based Closures for Linear Transport in Slab Geometries

We compute, for the first time, high-order entropy-based ($M_N$) models for a linear transport equation on a one-dimensional, slab geometry. We simulate two test problems from the literature: the two-beam instability and the plane-source problem. In the former case we compute solutions for systems up to order $N=5$ ; in the latter, up to $N=15$. The most notable outcome of these results is the existence of shocks in the steady-state profiles of the two-beam instability for all odd values of $N$.

99 GENERAL AND MISCELLANEOUS↗

Positive $P_N$ Closures

We introduce a modification to the standard spherical harmonic closure used with linear kinetic equations of particle transport. While the standard closure is known to produce negative particle concentrations, the modification corrects this defect by requiring that the ansatz used to close the equations itself be a nonnegative function. We impose this requirement via explicit constraints in a quadratic optimization problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simulating Radiative Transfer with Filtered Spherical Harmonics

This letter presents a novel application of filters to the spherical harmonics ($P_N$) expansion for radiative transfer problems in the high-energy-density regime. The filter, which is based on non-oscillatory spherical splines, preserves both the equilibrium diffusion limit and formal converges properties of the unfiltered expansion. Results demonstrate that solutions to the filtered $P_N$ equations are (i) more robust and less oscillatory than standard \Pn solutions and (ii) more accurate than discrete ordinates solutions of comparable order. The filtered $P_7$ solution demonstrates comparable accuracy to an implicit Monte Carlo solution for a benchmark hohlraum problem. Given the benefits of this method we believe it will enable more routine use of high-fidelity radiation-hydrodynamics calculations in the simulation of physical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust and Accurate Filtered Spherical Harmonics Expansions for Radiative Transfer

We present a novel application of lters to the spherical harmonics (PN) expansion for radiative transfer problems in the high energy density regime. The lter we use is based on non-oscillatory spherical splines and a lter strength chosen to (i) preserve the equilibrium di usion limit and (ii) vanish as the expansion order tends to in nity. Our implementation is based on modi ed equations that are derived by applying the lter after every time step in a simple rst-order time integration scheme. The method is readily applied to existing codes that solve the PN equations. Numerical results demonstrate that the solution to the ltered PN equations are (i) more robust and less oscillatory than standard PN solutions and (ii) more accurate than discrete ordinates solutions of comparable order. In particular, the ltered P7 solution demonstrates comparable accuracy to an implicit Monte Carlo solution for a benchmark hohlraum problem in 2-D Cartesian geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Methods for diffusive relaxation in the Pn equation

We present recent progress in the development of two substantially different approaches for simulating the so-called of P{sub N} equations. These are linear hyperbolic systems of PDEs that are used to model particle transport in a material medium, that in highly collisional regimes, are accurately approximated by a simple diffusion equation. This limit is based on a balance between function values and gradients of certain variables in the P{sub N} system. Conventional reconstruction methods based on upwinding approximate such gradients with an error that is dependent on the size of the computational mesh. Thus in order to capture the diffusion limit, a given mesh must resolve the dynamics of the continuum equation at the level of the mean-free-path, which tends to zero in the diffusion limit. The two methods analyzed here produce accurate solutions in both collisional and non-collisional regimes; in particular, they do not require resolution of the mean-free-path in order to properly capture the diffusion limit. The first method is a straight-forward application of the discrete Galerkin (DG) methodology, which uses additional variables in each computational cell to capture the balance between function values and gradients, which are computed locally. The second method uses a temporal splitting of the fast and slow dynamics in the P{sub N} system to derive so-called regularized equations for which the diffusion limit is built-in. We focus specifically on the P{sub N} equations for one-dimensional, slab geometries. Preliminary results for several benchmark problems are presented which highlight the advantages and disadvantages of each method. Further improvements and extensions are also discussed.

97 MATHEMATICS AND COMPUTING↗