A Positivity-Preserving Relaxation Algorithm

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Izgin, Thomas, Ranocha, Hendrik, Shu, Chi-Wang
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911563727765504
author Izgin, Thomas
Ranocha, Hendrik
Shu, Chi-Wang
author_facet Izgin, Thomas
Ranocha, Hendrik
Shu, Chi-Wang
contents We combine Patankar-type methods with suitable relaxation procedures that are capable of ensuring correct dissipation or conservation of functionals such as entropy or energy while producing unconditionally positive and conservative approximations. To that end, we adapt the relaxation algorithm to enforce positivity by using either ideas from the dense output framework when a linear invariant must be preserved, or simply a geometric mean if the only constraint is positivity preservation. The latter merely requires the solution of a scalar nonlinear equation while former results in a coupled linear-nonlinear system of equations. We present sufficient conditions for the solvability of the respective equations. Several applications in the context of ordinary and partial differential equations are presented, and the theoretical findings are validated numerically.
format Preprint
id arxiv_https___arxiv_org_abs_2604_02308
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Positivity-Preserving Relaxation Algorithm
Izgin, Thomas
Ranocha, Hendrik
Shu, Chi-Wang
Numerical Analysis
65M06, 65M08, 65M20, 65M22
We combine Patankar-type methods with suitable relaxation procedures that are capable of ensuring correct dissipation or conservation of functionals such as entropy or energy while producing unconditionally positive and conservative approximations. To that end, we adapt the relaxation algorithm to enforce positivity by using either ideas from the dense output framework when a linear invariant must be preserved, or simply a geometric mean if the only constraint is positivity preservation. The latter merely requires the solution of a scalar nonlinear equation while former results in a coupled linear-nonlinear system of equations. We present sufficient conditions for the solvability of the respective equations. Several applications in the context of ordinary and partial differential equations are presented, and the theoretical findings are validated numerically.
title A Positivity-Preserving Relaxation Algorithm
topic Numerical Analysis
65M06, 65M08, 65M20, 65M22
url https://arxiv.org/abs/2604.02308