---
title: Ordered Line Integral Methods (OLIM)
url: https://www.emergentmind.com/topics/ordered-line-integral-methods-olim
type: topic
---

# Ordered Line Integral Methods (OLIM)

Ordered Line Integral Methods (OLIM) constitute a family of numerical solvers for Hamilton–Jacobi equations that arise in the computation of the quasi-potential in small-noise stochastic differential equations (SDEs) and in front propagation problems, such as the eikonal equation. OLIM combines the causality-driven, label-setting approach of Dijkstra-like algorithms with the direct minimization of geometric action functionals via local quadrature-based variational updates. This methodology yields provably convergent, efficient, and high-accuracy solvers for capturing rare event transition pathways, invariant measures, and wavefront arrival times in systems with complex dynamics, including those with variable anisotropic diffusion.

## 1. Mathematical Foundation and Quasi-potential Formulation

The prototypical setting for OLIM is the analysis of perturbed dynamical systems
$$
dx = b(x)\,dt + \sigma(x)\sqrt{\epsilon}\,dW, \quad x\in\Omega\subset\mathbb{R}^2, \quad \epsilon\ll1,
$$
where $b$ is a smooth drift, $\sigma(x)$ is a nondegenerate diffusion matrix, and $W$ is standard Brownian motion. In Freidlin–Wentzell large deviation theory, the quasi-potential $U_E(x)$ associated with an attractor $E$ is the minimal action
$$
U_E(x) = \inf_{\substack{T>0,\, \phi(0)\in E,\, \phi(T) = x}} S_T[\phi],
$$
where
$$
S_T[\phi] = \frac{1}{2} \int_0^T \|\dot{\phi}(t) - b(\phi(t))\|_{A(\phi(t))}^2 dt, \qquad A(x) = [\sigma(x)\sigma(x)^T]^{-1}.
$$
Minimizing also over $T$, one obtains a geometric action
$$
S[\psi] = \int_0^L \left( \|b(\psi(s))\|_{A(\psi)} \|\psi'(s)\|_{A(\psi)} - \langle \psi'(s), b(\psi(s)) \rangle_{A(\psi)} \right)\,ds,
$$
where $s$ is arc-length and all metric operations are with respect to $A(x)$. The quasi-potential $U_E$ satisfies the Hamilton–Jacobi equation
$$
\nabla U^T A^{-1}(x) \nabla U + 2b(x)\cdot\nabla U = 0.
$$
For the isotropic eikonal equation—another principal application—OLIM solves
$$
\|\nabla u(x)\|_2 = s(x)
$$
and its factored variant via analogous geometric action principles [1706.07509][1806.05321][1902.06825].

## 2. Discretization Strategy and Label-setting Framework

OLIM employs a regular mesh, typically rectangular in $\mathbb{R}^2$ or $\mathbb{R}^3$, where each grid point is assigned a label:
- Far (unknown, not yet tentatively updated),
- Considered (tentative value, neighbor to at least one AcceptedFront point),
- AcceptedFront (value finalized; at least one considered neighbor),
- Accepted (finalized; no considered neighbors).

Propagation proceeds by always accepting the Considered point with minimal $U$, updating its neighbors within a fixed update radius $R = K h$ $(K\in\mathbb{N},\, h=$ mesh size$)$, and strictly advancing in order of increasing $U$, which guarantees causality and monotonicity. This is analogous to the Fast Marching/Ordered Upwind Method, but OLIM replaces upwind finite difference stencils with direct local minimization of the geometric action functional [1706.07509][1806.05321][1902.06825].

## 3. Local Variational Updates and Quadrature Formulations

At the core of OLIM is the local update, formulated as an action/minimization along straight segments or triangles:
- **One-point (line) update:** For a pair $(x_0, x)$, the cost is
  $$
  Q_{1pt}(x_0 \to x) = U(x_0) + \text{Quadrature}\Big( [x_0,x],\ b,\,A \Big)
  $$
  Common quadrature choices include:
    - *Midpoint*: Employs $b$ and $A$ at $(x_0 + x)/2$; order $O(\ell^3)$ for segment length $\ell$.
    - *Right-hand*: Uses $b(x)$; order $O(\ell^2)$.
    - *Trapezoid, Simpson*: Higher-order, yielding further improved accuracy for smooth fields.

- **Two-point (triangle) update:** Given $x_0, x_1$, the update solves
  $$
  Q_{2pt}(x_0, x_1 \to x) = \min_{s\in[0,1]} \Big\{
    U(x_0) + s (U(x_1) - U(x_0))
    + \text{Quadrature}\Big( [y(s), x],\ b,\,A \Big)
  \Big\}
  $$
  with $y(s) = x_0 + s (x_1 - x_0)$. The minimization is performed either analytically or by a root-finding method for the nonlinear equation. This triangle-update increases directional coverage and accuracy.

For the eikonal case and general Hamilton–Jacobi class, OLIM generalizes using local cost functionals $F(\lambda)$ over $d$-simplexes $\lambda\in\Delta^d$, minimizing
$$
F(\lambda) = U_\lambda + \text{(approximate slowness term)} \cdot h \cdot \|p_\lambda\|_2
$$
with prescribed quadrature rule [1902.06825].

## 4. Algorithmic Complexity, Parameter Selection, and Error Analysis

The global complexity of OLIM on an $N\times N$ grid is $O(N^2 K^2)$ in two dimensions. Each mesh point may require $O(K^2)$ neighbor updates due to the update radius $R=K h$. Efficient hierarchical update strategies, such as prioritizing one-point over two-point (triangle) updates and applying top-down/bottom-up simplex enumeration in 3D, yield significant constant-factor savings [1902.06825][1806.05321]. Memory usage is $O(N^2)$, dominated by storage for $U$, state labels, and the heap.

Selection of the update factor $K$ is guided by error analysis: too small $K$ leads to missed nonlocal characteristics; too large increases computational cost and may reduce efficiency due to excessive quadrature/curvature error. Rules-of-thumb, empirically validated, are:
- For OLIM-MID (midpoint quadrature) or higher: $K(N) = 10 + 4(p-7)$ for $N=2^p$, effective for moderate anisotropy ($\lambda_{\max}/\lambda_{\min}\le10$). Higher anisotropy may require up to $50\%$ increase in $K$.
- For OLIM-R (right-hand): $K(N) = \lfloor\log_2 N\rfloor - 3$ [1706.07509][1806.05321].

Theoretical and empirical error rates: OLIM-MID, OLIM-TR, OLIM-SIM achieve superlinear convergence in practice (exponents $q\approx1.2-1.6$) with error constants mildly dependent on anisotropy; OLIM-R and OUM are typically first-order or slightly sublinear [1706.07509][1806.05321].

## 5. Extension to Variable and Anisotropic Diffusion

OLIM extends to SDEs with general position-dependent and anisotropic diffusion via the matrix $A(x) = [\sigma(x)\sigma(x)^T]^{-1}$, entering all norms and inner products in the geometric action. For constant anisotropy models $D = \sigma\sigma^T = R(\theta) \operatorname{diag}(\alpha, \beta) R(\theta)^T$, the induced metric affects both numerical errors and the geometry of transition paths. The local metric unit ball becomes an ellipse, and OLIM’s error and the structure of quasi-potential level sets depend sensitively on the anisotropy ratio and orientation.

OLIM has been demonstrated in nonlinear, variable-diffusion models using closed-form or numerically constructed action-minimizers, and supports both global quasi-potential surface computation and pathwise transition analysis (instantons), even in biologically realistic models [1806.05321].

## 6. Benchmarks, Applications, and Extensions

Key benchmarks for OLIM include:
- Linear SDEs with analytic $U(x)$ under constant anisotropic diffusion (error exponents $p \approx 1.2–1.4$; optimal $K$ mildly increasing with anisotropy) [1806.05321][1706.07509].
- Nonlinear SDEs with variable diffusion, designed for analytic comparison.
- Complex systems:
  - Maier–Stein model: OLIM computes quasi-potentials and instantons on fine grids (e.g., $2048\times2048$), revealing strong deformation of level sets and transition paths under anisotropy.
  - Genetic toggle switch in λ-phage: OLIM captures position-dependent transitions and quantitative rate constants, revealing up to $\sim14\%$ change due to diffusion structure [1806.05321].

In eikonal and front propagation contexts, OLIM offers alternatives to fast marching, providing higher accuracy per CPU and supporting additively factored equations for singularity handling [1902.06825].

Recent and ongoing extensions include:
- Three-dimensional OLIM, employing efficient simplex pruning strategies (top-down, bottom-up, KKT-driven) for computational scalability [1902.06825].
- Higher-order quadrature rules (Simpson, Gaussian) for smoother fields.
- Adaptive mesh refinement near critical regions.
- Coupling with path-based solvers for multiscale approaches.

## 7. Relationship to Previous Methods and Theoretical Properties

A key theoretical property is the equivalence of OLIM-R (right-hand quadrature) and the Ordered Upwind Method for local updates under appropriate interpolation, establishing continuity with classical Dijkstra-like and upwind PDE schemes. OLIM’s variational structure directly exploits the dynamic programming principle, replacing finite-difference Hamilton–Jacobi updates by more accurate minimizations of the local geometric action [1706.07509][1806.05321].

Causality and monotonicity of the updates are mathematically guaranteed under acuteness conditions on simplices (all pairwise directions make angles ≤ 90°); theoretical error bounds are rigorously linked to quadrature rule order, curvature of minimizers, and update radius [1706.07509][1902.06825]. Convexity and strict minima for the local action minimization are proven under mild regularity for the Lagrangian.

OLIM yields viscosity solutions to the underlying Hamilton–Jacobi equations, and Dijkstra-like label-setting ensures global causal ordering. In practice, higher-order OLIM solvers achieve orders-of-magnitude smaller error for fixed computational budget compared to upwind finite-difference methods.

---
For detailed proofs, code listings, and comprehensive numerical data, see the original works: [1706.07509], [1806.05321], and [1902.06825].

Source: https://www.emergentmind.com/topics/ordered-line-integral-methods-olim