euler_step Subroutine

private subroutine euler_step(state)

Advance the solution by one time step using the explicit Euler scheme.

First-order, one-stage method:

Q^{n+1} = Q^n + dt * R(Q^n)

No scratch arrays are required; the single-stage update is atomic. Also computes the global L2 residual norm for convergence monitoring.

Arguments

Type	Intent	Optional	Attributes		Name
type(solver_state_t),	intent(inout)			::	state