A stability-optimized four-stage, third-order 2-split operator-splitting method with seven sub-integrations per step and a strategy of using explicit low-order sub-integrators for backward steps yield about 30% speedup on a cardiac benchmark.
pythOS: A Python library for solving IVPs by operator splitting
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Operator-splitting methods are widespread in the numerical solution of differential equations, especially the initial-value problems in ordinary differential equations that arise from a method-of-lines discretization of partial differential equations. Such problems can often be solved more effectively by treating the various terms individually with specialized methods rather than simultaneously in a monolithic fashion. This paper describes \pythOS, a Python software library for the systematic solution of differential equations by operator-splitting methods. The functionality of \pythOS\ focuses on fractional-step methods, including those with real and complex coefficients, but it also implements additive Runge--Kutta methods, generalized additive Runge--Kutta methods, and multi-rate, and multi-rate infinitesimal methods. Experimentation with the solution of practical problems is facilitated through an interface to the \Firedrake\ library for the finite element spatial discretization of partial differential equations and further enhanced by the convenient implementation of exponential time-integration methods and fully implicit Runge--Kutta methods available from the \Irksome\ software library. The functionality of \pythOS\ as well as some less generally appreciated aspects of operator-splitting methods are demonstrated by means of examples.
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improving the stability and efficiency of high-order operator-splitting methods
A stability-optimized four-stage, third-order 2-split operator-splitting method with seven sub-integrations per step and a strategy of using explicit low-order sub-integrators for backward steps yield about 30% speedup on a cardiac benchmark.