Skip to main content
. 2025 Dec 22;28(1):12. doi: 10.3390/e28010012
1. Initialization:
     Set X ← X0
     Store X0
2. For k = 0, 1, …, N − 1 do
3. Select integration scheme:
         X(k+1) ← Xk + h x F(Xk)
            K1 ← F(X_k)
               K2 ← F(Xk + 0.5 x h x K1)
               K3 ← F(Xk + 0.5 x h x K2)
               K4 ← F(X_k + h x K3)
               X(k+1) ← Xk + (h/6) x (K1 + 2 x K2 + 2 x K3 + K4)
                               If || X(k+1)(n+1)X(k+1)n|| ≤ tol then
                    break
               End For
               X(k+1)X(k+1)(n+1)
End Case
4.    Store X(k+1)
5. End For
6. Return {Xk}