arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.04467math.NAcs.NA
收藏

线性动力学方程最小熵矩近似的一种新的基于熵变量的离散化方法

A new entropy-variable-based discretization method for minimum entropy moment approximations of linear kinetic equations

Tobias Leibner, Mario Ohlberger

摘要:

在这篇文章中,我们推导和分析了一个新的数值方法的动力学方程的基础上的变量变换的矩近似。经典最小熵矩闭包是一类动力学方程的降阶模型,它保留了解的许多基本物理性质。然而,它们的实际应用受到其高计算成本的限制,因为必须为时空网格中的每个单元求解最优化问题。此外,这些模型的数值求解器的实施受到以下事实的阻碍:即,只有当矩向量保持在可实现的集合内时,最优化问题才是定义良好的。出于同样的原因,进一步减少这些模型,例如,缩减基方法不是一项简单的任务。我们的新方法克服了经典方法的这些缺点。该变换是在半离散化水平上进行的,这使得它们适用于广泛的动力学方案,并通过正定黑塞矩阵的逆来代替非线性最优化问题。因此,新方案摆脱了可实现性相关的问题。此外,离散熵定律可以通过修改时间步进方案来实施。我们的数值实验表明,我们的新方法往往是几倍的速度比标准的优化为基础的计划。

英文摘要:

In this contribution we derive and analyze a new numerical method for kinetic equations based on a variable transformation of the moment approximation. Classical minimum-entropy moment closures are a class of reduced models for kinetic equations that conserve many of the fundamental physical properties of solutions. However, their practical use is limited by their high computational cost, as an optimization problem has to be solved for every cell in the space-time grid. In addition, implementation of numerical solvers for these models is hampered by the fact that the optimization problems are only well-defined if the moment vectors stay within the realizable set. For the same reason, further reducing these models by, e.g., reduced-basis methods is not a simple task. Our new method overcomes these disadvantages of classical approaches. The transformation is performed on the semi-discretized level which makes them applicable to a wide range of kinetic schemes and replaces the nonlinear optimization problems by inversion of the positive-definite Hessian matrix. As a result, the new scheme gets rid of the realizability-related problems. Moreover, a discrete entropy law can be enforced by modifying the time stepping scheme. Our numerical experiments demonstrate that our new method is often several times faster than the standard optimization-based scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑