Pith. sign in

Beyond Strang: A practical assessment of some second-order 3-splitting methods

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Operator splitting is a popular divide-and-conquer strategy for solving differential equations. Typically, the right-hand side of the differential equation is split into a number of parts that are then integrated separately. Many methods are known that split the right-hand side into two parts. This approach is limiting, however, and there are situations when 3-splitting is more natural and ultimately more advantageous. The second-order Strang operator-splitting method readily generalizes to a right-hand side splitting into any number of operators. It is arguably the most popular method for 3-splitting because of its efficiency, ease of implementation, and intuitive nature. Other 3-splitting methods exist, but they are less well-known, and \rev{analysis and} evaluation of their performance in practice are scarce. We demonstrate the effectiveness of some alternative 3-split, second-order methods to Strang splitting on two problems: the reaction-diffusion Brusselator, which can be split into three parts that each have closed-form solutions, and the kinetic Vlasov--Poisson equations that is used in semi-Lagrangian plasma simulations. We find alternative second-order 3-operator-splitting methods that realize efficiency gains of 10\%--20\% over traditional Strang splitting. Our analysis for the practical assessment of efficiency of operator-splitting methods includes the computational cost of the integrators and can be used in method design.

fields

math.NA 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Improving the stability and efficiency of high-order operator-splitting methods math.NA · 2025-01-04 · conditional · none · ref 25 · internal anchor

    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.