Asymptotic-preserving Schemes for the Boltzmann Equation and Related Problems
Listen now
Description
We propose a general framework to design asymptotic preserving schemes for the Boltzmann kinetic kinetic and related equations. Numerically solving these equations are challenging due to the nonlinear stiff collision (source) terms induced by small mean free or relaxation time. We propose to penalize the nonlinear collision term by a BGK-type relaxation term, which can be solved explicitly even if discretized implicitly in time. Moreover, the BGK-type relaxation operator helps to drive the density distribution toward the local Maxwellian, thus natually imposes an asymptotic-preserving scheme in the Euler limit. The scheme so designed does not need any nonlinear iterative solver or the use of Wild Sum. It is uniformly stable in terms of the (possibly small) Knudsen number, and can capture the macroscopic fluid dynamic (Euler) limit even if the small scale determined by the Knudsen number is not numerically resolved. It is also consistent to the compressible Navier-Stokes equations if the viscosity and heat conductivity are numerically resolved. The method is applicable to many other related problems, such as hyperbolic systems with stiff relaxation, and high order parabilic equations.
More Episodes
Algebraic statistics advocates polynomial algebra as a tool for addressing problems in statistics and its applications. This connection is based on the fact that most statistical models are defined either parametrically or implicitly via polynomial equations. The idea is summarized by the phrase...
Published 04/28/11
Mathematical concepts are often difficult for students to acquire. This difficulty is evidenced by failure of knowledge to transfer from the learning situation to a novel isomorphic situation. What choice of instantiation most effectively facilitates successful transfer? One possibility is that...
Published 04/27/11
This presentation does not require previous knowledge of C*-algebras, labeled graphs, or group actions. A labeled graph over an alphabet consists of a directed graph together with a labeling map . One can associate a C*-algebra to a labeled graph in such a way that if the labeling is...
Published 04/08/11