Author
Listed:
- Moujaes, Paul
- Kuzmin, Dmitri
- Bäumer, Christian
Abstract
We discretize the M1 model of radiative transfer using continuous finite elements and propose a tailor-made monolithic convex limiting (MCL) procedure for enforcing physical realizability. The M1 system of nonlinear balance laws for the zeroth and first moments of a probability distribution function is derived from the linear Boltzmann equation and equipped with an entropy-based closure for the second moment. To ensure hyperbolicity and physical admissibility, evolving moments must stay in an invariant domain representing a convex set of realizable states. We first construct a low-order method that is provably invariant domain preserving (IDP). Introducing intermediate states that represent spatially averaged exact solutions of homogeneous Riemann problems, we prove that these so-called bar states are realizable in any number of space dimensions. This key auxiliary result enables us to show the IDP property of a fully discrete scheme with a diagonally implicit treatment of reactive terms. To achieve high resolution, we add nonlinear correction terms that are constrained using a two-step MCL algorithm. In the first limiting step, local bounds are imposed on each conserved variable to avoid spurious oscillations and maintain positivity of the scalar-valued zeroth moment (particle density). The second limiting step constrains the magnitude of the vector-valued first moment to be realizable. The flux-corrected finite element scheme is provably IDP. Its ability to prevent nonphysical behavior while attaining high-order accuracy in smooth regions is verified in a series of numerical tests. The developed methodology provides a robust simulation tool for dose calculation in radiotherapy.
Suggested Citation
Moujaes, Paul & Kuzmin, Dmitri & Bäumer, Christian, 2026.
"Realizability-preserving monolithic convex limiting in continuous Galerkin discretizations of the M1 model of radiative transfer,"
Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 246(C), pages 570-590.
Handle:
RePEc:eee:matcom:v:246:y:2026:i:c:p:570-590
DOI: 10.1016/j.matcom.2026.02.011
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:246:y:2026:i:c:p:570-590. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.