Cory D. Hauck

Irene M. Gamba, Jeffrey R. Haack, Cory D. Hauck et al.

We propose a simple fast spectral method for the Boltzmann collision operator with general collision kernels. In contrast to the direct spectral method \cite{PR00, GT09} which requires $O(N^6)$ memory to store precomputed weights and has $O(N^6)$ numerical complexity, the new method has complexity $O(MN^4\log N)$, where $N$ is the number of discretization points in each of the three velocity dimensions and $M$ is the total number of discretization points on the sphere and $M\ll N^2$. Furthermore, it requires no precomputation for the variable hard sphere (VHS) model and only $O(MN^4)$ memory to store precomputed functions for more general collision kernels. Although a faster spectral method is available \cite{MP06} (with complexity $O(MN^3\log N)$), it works only for hard sphere molecules, thus limiting its use for practical problems. Our new method, on the other hand, can apply to arbitrary collision kernels. A series of numerical tests is performed to illustrate the efficiency and accuracy of the proposed method.

Michael A. Puthawala, Cory D. Hauck, Stanley J. Osher

We investigate overdetermined linear inverse problems for which the forward operator may not be given accurately. We introduce a new tool called the structure, based on the Wasserstein distance, and propose the use of this to diagnose and remedy forward operator error. Computing the structure turns out to use an easy calculation for a Euclidean homogeneous degree one distance, the Earth Mover's Distance, based on recently developed algorithms. The structure is proven to distinguish between noise and signals in the residual and gives a plan to help recover the true direct operator in some interesting cases. We expect to use this technique not only to diagnose the error, but also to correct it, which we do in some simple cases presented below.

Graham W. Alldredge, Martin Frank, Cory D. Hauck

We present a new entropy-based moment method for the velocity discretization of kinetic equations. This method is based on a regularization of the optimization problem defining the original entropy-based moment method, and this gives the new method the advantage that the moment vectors of the solution do not have to take on realizable values. We show that this equation still retains many of the properties of the original equations, including hyperbolicity, an entropy-dissipation law, and rotational invariance. The cost of the regularization is mismatch between the moment vector of the solution and that of the ansatz returned by the regularized optimization problem. However, we show how to control this error using the parameter defining the regularization. This suggests that with proper choice of the regularization parameter, the new method can be used to generate accurate solutions of the original entropy-based moment method, and we confirm this with numerical simulations.

Martin Frank, Cory D. Hauck, Edgar Olbrant

We derive a hierarchy of closures based on perturbations of well-known entropy-based closures; we therefore refer to them as perturbed entropy-based models. Our derivation reveals final equations containing an additional convective and diffusive term which are added to the flux term of the standard closure. We present numerical simulations for the simplest member of the hierarchy, the perturbed M1 or PM1 model, in one spatial dimension. Simulations are performed using a Runge-Kutta discontinuous Galerkin method with special limiters that guarantee the realizability of the moment variables and the positivity of the material temperature. Improvements to the standard M1 model are observed in cases where unphysical shocks develop in the M1 model.

M. Paul Laiu, Martin Frank, Cory D. Hauck

We present a positive and asymptotic preserving numerical scheme for solving linear kinetic, transport equations that relax to a diffusive equation in the limit of infinite scattering. The proposed scheme is developed using a standard spectral angular discretization and a classical micro-macro decomposition. The three main ingredients are a semi-implicit temporal discretization, a dedicated finite difference spatial discretization, and realizability limiters in the angular discretization. Under mild assumptions on the initial condition and time step, the scheme becomes a consistent numerical discretization for the limiting diffusion equation when the scattering cross-section tends to infinity. The scheme also preserves positivity of the particle concentration on the space-time mesh and therefore fixes a common defect of spectral angular discretizations. The scheme is tested on the well-known line source benchmark problem with the usual uniform material medium as well as a medium composed from different materials that are arranged in a checkerboard pattern. We also report the observed order of space-time accuracy of the proposed scheme.

Zheng Chen, Cory D. Hauck

In this work, we prove rigorous convergence properties for a semi-discrete, moment-based approximation of a model kinetic equation in one dimension. This approximation is equivalent to a standard spectral method in the velocity variable of the kinetic distribution and, as such, is accompanied by standard algebraic estimates of the form $N^{-q}$, where $N$ is the number of modes and $q>0$ depends on the regularity of the solution. However, in the multiscale setting, the error estimate can be expressed in terms of the scaling parameter $ε$, which measures the ratio of the mean-free-path to the characteristic domain length. We show that, for isotropic initial conditions, the error in the spectral approximation is $\mathcal{O}(ε^{N+1})$. More surprisingly, the coefficients of the expansion satisfy super convergence properties. In particular, the error of the $\ell^{th}$ coefficient of the expansion scales like $\mathcal{O}(ε^{2N})$ when $\ell =0$ and $\mathcal{O}(ε^{2N+2-\ell})$ for all $1\leq \ell \leq N$. This result is significant, because the low-order coefficients correspond to physically relevant quantities of the underlying system. All the above estimates involve constants depending on $N$, the time $t$, and the initial condition. We investigate specifically the dependence on $N$, in order to assess whether increasing $N$ actually yields an additional factor of $ε$ in the error. Numerical tests will also be presented to support the theoretical results.

Steffen Schotthöfer, M. Paul Laiu, Martin Frank et al.

The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the context of regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy closure as a two-stage approximation to the original entropy closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy.

Wei Zhu, Bao Wang, Richard Barnard et al.

We propose to apply a low dimensional manifold model to scientific data interpolation from regular and irregular samplings with a significant amount of missing information. The low dimensionality of the patch manifold for general scientific data sets has been used as a regularizer in a variational formulation. The problem is solved via alternating minimization with respect to the manifold and the data set, and the Laplace-Beltrami operator in the Euler-Lagrange equation is discretized using the weighted graph Laplacian. Various scientific data sets from different fields of study are used to illustrate the performance of the proposed algorithm on data compression and interpolation from both regular and irregular samplings.