# Operator splitting

Instead of solving the coupled problem directly, the method advances the solution by applying the sub-operators one after another or in symmetric compositions, producing an approximation to the full flow that is exact when the parts commute and otherwise carries a splitting error. The practical appeal is that each subproblem can be treated with its own solver and its own time step; fast chemical reactions, for example, can be stepped much more finely than slow diffusion within the same overall scheme. 

| Key fact | Detail |
|---|---|
| Problem class | ODEs and PDEs whose vector field splits into a sum of simpler parts, e.g. reaction–diffusion systems[4] |
| Basic scheme | Lie–Trotter: apply sub-operators sequentially over the full step; first order, exact for commuting operators[5] |
| Symmetric scheme | Strang (half–full–half) composition; second order at roughly the cost of Lie splitting[3,5] |
| Splitting error | Governed by commutators of the sub-operators through the Baker–Campbell–Hausdorff formula[5] |
| Stiff behavior | Classical error order is observed only when the step size is sufficiently small relative to the stiffness parameter[6] |
| Cost limit | For positive fractional steps, second-order splittings are optimal; one extra order of accuracy essentially requires a three-fold increase in work[7] |
| Widespread use | Reaction–diffusion systems, where the reaction part decouples into many small nonlinear blocks[4] |

## How it works

 The Lie–Trotter scheme advances the solution by applying one sub-operator and then the other over the full step. When the matrices commute, this product equals \( e^{h(F_1+F_2)} \) and the sequence produces the exact solution; otherwise the sub-operators fail to recombine perfectly and a splitting error appears.[5] The local truncation error of the scheme is bounded by \( \tfrac{h^2}{2} \lVert L_1 \cdot L_2 - L_2 \cdot L_1 \rVert + O(h^3) \), so it vanishes precisely when the operators commute.[4]

The Strang splitting symmetrizes the composition, producing a second-order approximation.[5] Its leading error constant follows from the [Baker–Campbell–Hausdorff formula](https://www.edgepedia.org/baker-campbell-hausdorff-formula), \( C = \tfrac{1}{24}([F_1,[F_1,F_2]] + 2[F_2,[F_1,F_2]]) \), so the error is determined entirely by nested commutators of the sub-operators.[5]

## How it is done

Implementing a splitting scheme proceeds in three steps: choosing the decomposition of the vector field \( f \), solving each sub-equation exactly or approximately, and combining the sub-solutions to approximate the full flow. Order conditions are derived with the Baker–Campbell–Hausdorff formula, and for time-symmetric methods the even-order conditions are satisfied automatically.[9]

The sub-solvers limit the whole scheme. If the nonlinear subproblem is integrated with first-order explicit Euler, every splitting method reduces to first order regardless of its composition; with a classical fourth-order Runge–Kutta sub-integration, the splitting orders are retained.[10] In a reaction–diffusion example, the reaction part can use second-order Adams–Bashforth while diffusion uses Crank–Nicolson, and convergence experiments confirm rates of 1 for ordinary and 2 for Strang splitting.[2]

Splitting methods are an important class of geometric numerical integrators, preserving symplecticity, unitarity, volume, and first integrals, and the FSAL property (first-same-as-last) saves one sub-evaluation per step.[5] Stability of each inner solver on its own does not guarantee stability of the composed scheme; stability of the full split step must be assessed separately, particularly when the sub-operators do not commute.[11]

## Origin

The earliest splitting scheme is credited to [Sophus Lie](https://www.edgepedia.org/sophus-lie), whose *Theorie der Transformationsgruppen I* appeared in *Mathematische Annalen* in 1880.[12] The analytic underpinning, the product formula for semigroups of operators, was established by H. F. Trotter in the *Proceedings of the American Mathematical Society* in 1959.[16] A simple splitting procedure was proposed as an example, but the subject was systematically studied only in 1968 by Marchuk and by Strang.[13] Strang's paper, "On the Construction and Comparison of Difference Schemes," was published in the *SIAM Journal on Numerical Analysis* in 1968.[14] Yanenko's monograph *The Method of Fractional Steps* appeared with Springer in 1971 and consolidated the Soviet fractional-step school.[15] After World War II, development ran along two parallel schools: Douglas, Peaceman, Rachford, and Wachspress in the USA with alternating direction implicit (ADI) methods, and Dyakonov, Marchuk, and Yanenko in the USSR with fractional step methods.[18]

## Variants

The symmetric version of the first-order Lie–Trotter formula is known as the Strang–Marchuk splitting, the leapfrog, or the Störmer–Verlet method depending on the context.[9] Weighted splittings were introduced because they allow the sub-problems to be solved in parallel; for matrices, the sequential splitting is first order while the Strang and symmetrically weighted splittings are second order.[13]

Dimensional splitting produced the locally one-dimensional (LOD) methods and the ADI family.[9] The Peaceman–Rachford scheme divides each step into two half-steps, treating one operator implicitly and the other explicitly, then switching roles; it is first-order accurate in general but second order when the operators are linear, time independent, and commuting.[19] The Douglas–Rachford scheme is a predictor–corrector variant that is first-order accurate at best even for commuting linear operators, but is more robust and faster when one operator is non-smooth.[19]

Higher-order compositions exist but carry structural costs. Schemes of order higher than two necessarily involve at least one negative coefficient, meaning backward-in-time substeps, which has severe repercussions for reaction–diffusion problems and can shrink stability intervals enough to render the schemes useless in practice.[5] For splittings using only positive fractional steps, no scheme of order higher than two can exist, since higher-order compositions require a negative coefficient; for the linear case, second-order splittings are optimal because one extra power of accuracy essentially requires a three-fold increase in work.[7] Fractional-step Runge–Kutta methods have more recently been given a systematic representation and linear stability analysis.[22]

## Applications

The most widespread application is reaction–diffusion, where splitting lets the reaction part decouple into many small nonlinear blocks solved independently of the diffusion solve.[4] Air-pollution modeling uses splitting for advection–diffusion–reaction problems.[24] Beyond PDEs, splitting appears in molecular dynamics, celestial mechanics, quantum mechanics, plasma physics, and MCMC, and connects to optimization schemes such as ADMM and split Bregman; MacNamara and Strang judge that if numerical analysis has only ten big ideas, "splitting is undoubtedly one of them."[5]

## Limitations and alternatives

**Stiffness degrades the order.** For stiff problems with stiffness parameter \( \varepsilon \), the classical \( O(h^2) \) local error of first-order splitting is observed only for sufficiently small step sizes, a phenomenon analogous to order reduction in [Runge–Kutta methods](https://www.edgepedia.org/runge-kutta-methods) that can severely degrade standard step-size control.[6] For multi-scale stiff problems the standard analysis fails, and schemes ending with the stiff substep can reduce to order zero in the stiff regime.[25]

**Stability constrains step size and design.** A \( k \)-stage splitting scheme is typically unstable for sufficiently large step sizes, and high-order schemes are often built without regard to stability, ending up less stable than the basic Lie–Trotter and Strang schemes.[26] The backward-in-time substeps required above second order can be unstable for operators that are not time-reversible, such as diffusion.[23] For diffusion problems, splitting of order higher than two is generally impossible because negative coefficients lead to ill-posed subproblems, though complex-valued coefficients can circumvent this in some cases.[9]

**Steady states and boundary conditions.** Ordinary splitting does not capture the correct steady-state solutions where these exist; balanced splitting and rebalanced splitting were introduced to correct this flaw in combustion simulation.[5,27] Splitting the \( \varphi \) functions of [exponential integrators](https://www.edgepedia.org/exponential-integrator) can dramatically reduce cost, but when the vector to which they are applied does not satisfy the boundary conditions, order reduction follows.[28]

**Alternatives.** IMEX (implicit–explicit) additive Runge–Kutta methods of orders three to five often outperform both fully implicit and fully explicit monolithic methods on advection–diffusion–reaction problems, but physics-based splitting can fail when the relative stiffness of terms changes during a simulation, and Runge–Kutta–Chebyshev monolithic methods occasionally beat IMEX in speed for low-accuracy solutions.[21]

## References

---
*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Analysis and mathematical models › Numerical analysis and computation › Time integration methods*

*Initially written Sep 29, 2026 · Reviewed: Sep 30, 2026 · Edited: Oct 15, 2026 · Last review: Sep 30, 2026*

*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*

License: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license