Processing math: 100%
2nd-order Runge-Kutta scheme
Forward-Euler + approximate Crank-Nicolson:
u
∗
=
u
n
+
Δ
t
f
(
u
n
,
t
n
)
,
u
n
+
1
=
u
n
+
Δ
t
1
2
(
f
(
u
n
,
t
n
)
+
f
(
u
∗
,
t
n
+
1
)
)