mlsanityData to 14 Oct 2026

Machine learning moment closure models for the radiative transfer equation II: enforcing global hyperbolicity in gradient based closures

arXiv 2105.14410 ↗First posted 30 May 2021math.NA cs.LG cs.NAcited by 7

Not on the map. Why?

Abstract (arXiv)

This is the second paper in a series in which we develop machine learning (ML) moment closure models for the radiative transfer equation (RTE). In our previous work citehuang2021gradient, we proposed an approach to directly learn the gradient of the unclosed high order moment, which performs much better than learning the moment itself and the conventional PN closure. However, the ML moment closure model in citehuang2021gradient is not able to guarantee hyperbolicity and long time stability. We propose in this paper a method to enforce the global hyperbolicity of the ML closure model. The main idea is to seek a symmetrizer (a symmetric positive definite matrix) for the closure system, and derive constraints such that the system is globally symmetrizable hyperbolic. It is shown that the new ML closure system inherits the dissipativeness of the RTE and preserves the correct diffusion limit as the Knunsden number goes to zero. Several benchmark tests including the Gaussian source problem and the two-material problem show the good accuracy, long time stability and generalizability of our globally hyperbolic ML closure model.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 3 of its 43 references that are in the map. First posted on arXiv 30 May 2021.

Builds on

3 of 43 references.

References · 3

  1. 2017Solving high-dimensional partial differential equations using deep learningcited by 556
  2. 2021Machine learning moment closure models for the radiative transfer equation I: directly learning a gradient based closurecited by 9
  3. 2020Learning Thermodynamically Stable and Galilean Invariant Partial Differential Equations for Non-equilibrium Flowscited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 3; 2025: 1; 2026: 2.

7 papers.