euler
intsharp/timesteppers.py
Forward Euler (explicit, first-order)
\[ f^{n+1} = f^n + \Delta t \cdot \text{RHS}(f^n, t^n) \]
Simple and fast, but only first-order accurate in time.
This is a registry timestepper and applies directly in advection/FV workflows. The current DG Euler path uses internal SSP-RK3 in euler_dg_1d.py.