Back to Explorer
Research PaperResearchia:202604.05014[Mathematics > Mathematics]

A Positivity-Preserving Relaxation Algorithm

Thomas Izgin

Abstract

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.


Source: arXiv:2604.02308v1 - http://arxiv.org/abs/2604.02308v1 PDF: https://arxiv.org/pdf/2604.02308v1 Original Link: http://arxiv.org/abs/2604.02308v1

Submission:4/5/2026
Comments:0 comments
Subjects:Mathematics; Mathematics
Original Source:
View Original PDF
arXiv: This paper is hosted on arXiv, an open-access repository
Was this helpful?

Discussion (0)

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

A Positivity-Preserving Relaxation Algorithm | Researchia