{
 "id": "epsf4xh50z",
 "slug": "operator-splitting",
 "title": "Operator splitting",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "physical",
   "label": "Physical world and mathematics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical"
  },
  {
   "id": "physical.math",
   "label": "Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
  },
  {
   "id": "physical.math.analysis",
   "label": "Analysis and mathematical models",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.analysis"
  },
  {
   "id": "physical.math.analysis.numerical_analysis_and_computation",
   "label": "Numerical analysis and computation",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.analysis.numerical_analysis_and_computation"
  },
  {
   "id": "physical.math.analysis.numerical_analysis_and_computation.time-integration-methods",
   "label": "Time integration methods",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.analysis.numerical_analysis_and_computation.time-integration-methods"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1800.physical.math.analysis",
   "label": "Non-geographic · 1800 to 1945: Analysis and mathematical models",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math.analysis",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1800",
     "label": "Non-geographic · 1800 to 1945",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800"
    },
    {
     "id": "geo.nongeo.t1800.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical"
    },
    {
     "id": "geo.nongeo.t1800.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math"
    },
    {
     "id": "geo.nongeo.t1800.physical.math.analysis",
     "label": "Analysis and mathematical models",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math.analysis"
    }
   ]
  },
  {
   "id": "geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation",
   "label": "Non-geographic · 1946 to 2000: Numerical analysis and computation",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical"
    },
    {
     "id": "geo.nongeo.t1946.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math"
    },
    {
     "id": "geo.nongeo.t1946.physical.math.analysis",
     "label": "Analysis and mathematical models",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.analysis"
    },
    {
     "id": "geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation",
     "label": "Numerical analysis and computation",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation"
    }
   ]
  }
 ],
 "excerpt": "Operator splitting is a numerical time-integration method for ODEs and PDEs that applies sub-operators one after another, exact when they commute and otherwise carrying a splitting error.",
 "snippet": "Operator splitting is a numerical time-integration method for ODEs and PDEs that applies sub-operators one after another, exact when they commute and otherwise carrying a splitting error.",
 "node": "physical.math.analysis.numerical_analysis_and_computation.time-integration-methods",
 "markdown": "# Operator splitting\n\nInstead 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. \n\n| Key fact | Detail |\n|---|---|\n| Problem class | ODEs and PDEs whose vector field splits into a sum of simpler parts, e.g. reaction–diffusion systems[4] |\n| Basic scheme | Lie–Trotter: apply sub-operators sequentially over the full step; first order, exact for commuting operators[5] |\n| Symmetric scheme | Strang (half–full–half) composition; second order at roughly the cost of Lie splitting[3,5] |\n| Splitting error | Governed by commutators of the sub-operators through the Baker–Campbell–Hausdorff formula[5] |\n| Stiff behavior | Classical error order is observed only when the step size is sufficiently small relative to the stiffness parameter[6] |\n| 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] |\n| Widespread use | Reaction–diffusion systems, where the reaction part decouples into many small nonlinear blocks[4] |\n\n## How it works\n\n 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]\n\nThe 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]\n\n## How it is done\n\nImplementing 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]\n\nThe 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]\n\nSplitting 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]\n\n## Origin\n\nThe 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]\n\n## Variants\n\nThe 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]\n\nDimensional 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]\n\nHigher-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]\n\n## Applications\n\nThe 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]\n\n## Limitations and alternatives\n\n**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]\n\n**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]\n\n**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]\n\n**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]\n\n## References\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Analysis and mathematical models › Numerical analysis and computation › Time integration methods*\n\n*Initially written Sep 29, 2026 · Reviewed: Sep 30, 2026 · Edited: Oct 15, 2026 · Last review: Sep 30, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [],
 "url": "https://www.edgepedia.org/operator-splitting",
 "markdown_url": "https://www.edgepedia.org/operator-splitting.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"Operator splitting\", Edgepedia (EdgeChat), https://www.edgepedia.org/operator-splitting. Edgepedia Community License 1.0.",
 "credit_md": "\"[Operator splitting](https://www.edgepedia.org/operator-splitting)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/operator-splitting](https://www.edgepedia.org/operator-splitting). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/operator-splitting\">Operator splitting</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/operator-splitting\">https://www.edgepedia.org/operator-splitting</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "Operator splitting is a numerical time-integration method for ODEs and PDEs that applies sub-operators one after another, exact when they commute and otherwise carrying a splitting error."
}