An algorithmic mechanism for advancing a time‑dependent solution by discrete updates at successive time levels; includes families such as explicit and implicit one‑step methods, multi‑step methods, and Runge‑Kutta schemes.

Principle

Approximate the time derivative or the time evolution operator over a finite time step with a discrete formula whose local truncation error, stability region, and conservation properties determine global behaviour and allowable step sizes.

Demonstration

Explicit Euler advances u^{n+1}=u^n+Δt f(u^n) (first order, conditionally stable), backward Euler uses an implicit solve u^{n+1}=u^n+Δt f(u^{n+1}) (first order, A‑stable), and classical RK4 gives a fourth‑order explicit one‑step integrator for nonstiff problems.

Misapplication

Applying an explicit high‑order time integrator beyond its stability limit on a stiff semi‑discrete system or coupling a high‑order time integrator with a low‑order spatial discretization, leading to wasted effort or spurious error behavior.

Consequence

The chosen time‑stepping scheme sets stability constraints (CFL, A‑stability), temporal accuracy, computational cost per step, and interaction with spatial discretization (order matching, dispersion/dissipation properties).

Reversal

Use continuous‑time analytical solutions where available, steady‑state iterative solvers that avoid time integration, or implicit time‑continuous formulations instead of discrete stepping in time.

Boundary

Pertains only to evolution problems where time is an independent variable to be marched; not applicable to purely steady problems or to formulations that treat time and space in a single coupled variational discretization unless recast as stepping.

Semantic Tension

Interacts with spatial discretization choices and with operator splitting: stability and accuracy constraints are joint properties of time integrator, spatial scheme and splitting strategy, creating tradeoffs in method selection.

Synthesis

A core numerical component that maps a continuous temporal evolution into discrete updates: pick a scheme balancing stability, accuracy and cost, and ensure compatibility with spatial discretization and problem stiffness.