Efficient algorithms and implementations of entropybased moment closures for rarefied gases
Abstract
We present efficient algorithms and implementations of the 35moment system equipped with the maximumentropy closure in the context of rarefied gases. While closures based on the principle of entropy maximization have been shown to yield very promising results for moderately rarefied gas flows, the computational cost of these closures is in general much higher than for closure theories with explicit closedform expressions of the closing fluxes, such as Grad's classical closure. Following a similar approach as Garrett et al. (2015) , we investigate efficient implementations of the computationally expensive numerical quadrature method used for the moment evaluations of the maximumentropy distribution by exploiting its inherent finegrained parallelism with the parallelism offered by multicore processors and graphics cards. We show that using a single graphics card as an accelerator allows speedups of two orders of magnitude when compared to a serial CPU implementation. To accelerate the timetosolution for steadystate problems, we propose a new semiimplicit time discretization scheme. The resulting nonlinear system of equations is solved with a Newton type method in the Lagrange multipliers of the dual optimization problem in order to reduce the computational cost. Additionally, fully explicit timestepping schemes of first and second order accuracy are presented. Wemore »
 Authors:
 Publication Date:
 OSTI Identifier:
 22622300
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Computational Physics; Journal Volume: 340; Other Information: Copyright (c) 2017 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND SUPERFLUIDITY; ACCELERATORS; ACCURACY; ALGORITHMS; CLOSURES; COMPARATIVE EVALUATIONS; DISTRIBUTION; ENTROPY; EQUATIONS; EQUILIBRIUM; GAS FLOW; MATHEMATICAL SOLUTIONS; NONLINEAR PROBLEMS; QUADRATURES; RAREFIED GASES; STEADYSTATE CONDITIONS; VELOCITY
Citation Formats
Schaerer, Roman Pascal, Email: schaerer@mathcces.rwthaachen.de, Bansal, Pratyuksh, and Torrilhon, Manuel. Efficient algorithms and implementations of entropybased moment closures for rarefied gases. United States: N. p., 2017.
Web. doi:10.1016/J.JCP.2017.02.064.
Schaerer, Roman Pascal, Email: schaerer@mathcces.rwthaachen.de, Bansal, Pratyuksh, & Torrilhon, Manuel. Efficient algorithms and implementations of entropybased moment closures for rarefied gases. United States. doi:10.1016/J.JCP.2017.02.064.
Schaerer, Roman Pascal, Email: schaerer@mathcces.rwthaachen.de, Bansal, Pratyuksh, and Torrilhon, Manuel. Sat .
"Efficient algorithms and implementations of entropybased moment closures for rarefied gases". United States.
doi:10.1016/J.JCP.2017.02.064.
@article{osti_22622300,
title = {Efficient algorithms and implementations of entropybased moment closures for rarefied gases},
author = {Schaerer, Roman Pascal, Email: schaerer@mathcces.rwthaachen.de and Bansal, Pratyuksh and Torrilhon, Manuel},
abstractNote = {We present efficient algorithms and implementations of the 35moment system equipped with the maximumentropy closure in the context of rarefied gases. While closures based on the principle of entropy maximization have been shown to yield very promising results for moderately rarefied gas flows, the computational cost of these closures is in general much higher than for closure theories with explicit closedform expressions of the closing fluxes, such as Grad's classical closure. Following a similar approach as Garrett et al. (2015) , we investigate efficient implementations of the computationally expensive numerical quadrature method used for the moment evaluations of the maximumentropy distribution by exploiting its inherent finegrained parallelism with the parallelism offered by multicore processors and graphics cards. We show that using a single graphics card as an accelerator allows speedups of two orders of magnitude when compared to a serial CPU implementation. To accelerate the timetosolution for steadystate problems, we propose a new semiimplicit time discretization scheme. The resulting nonlinear system of equations is solved with a Newton type method in the Lagrange multipliers of the dual optimization problem in order to reduce the computational cost. Additionally, fully explicit timestepping schemes of first and second order accuracy are presented. We investigate the accuracy and efficiency of the numerical schemes for several numerical test cases, including a steadystate shockstructure problem.},
doi = {10.1016/J.JCP.2017.02.064},
journal = {Journal of Computational Physics},
number = ,
volume = 340,
place = {United States},
year = {Sat Jul 01 00:00:00 EDT 2017},
month = {Sat Jul 01 00:00:00 EDT 2017}
}

HighOrder EntropyBased Closures for Linear Transport in Slab Geometries
We compute, for the first time, highorder entropybased (more » 
Highorder entropybased closures for linear transport in slab geometry II: A computational study of the optimization problem
We present a numerical algorithm to implement entropybased (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 entropybased 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 secondorder kinetic scheme which uses MUSCLtype limiting in spacemore »