MathCastle
Differential EquationsSuperchallengeNumerical Methods: Euler to Runge–Kutta

Numerical Methods: Euler to Runge–Kutta · Superchallenge problem

A three-stage explicit Runge–Kutta method uses k1=f(tn,yn)k_1 = f(t_n, y_n), k2=f ⁣(tn+h4, yn+h4k1)k_2 = f\!\left(t_n + \dfrac{h}{4},\ y_n + \dfrac{h}{4}k_1\right), k3=f ⁣(tn+h, yn+h(a31k1+a32k2))k_3 = f\!\left(t_n + h,\ y_n + h\left(a_{31}k_1 + a_{32}k_2\right)\right) with a31+a32=1a_{31} + a_{32} = 1, and yn+1=yn+h(b1k1+b2k2+b3k3)y_{n+1} = y_n + h(b_1k_1 + b_2k_2 + b_3k_3). The coefficients b1,b2,b3,a31,a32b_1, b_2, b_3, a_{31}, a_{32} are chosen so that the method is third-order accurate: for every smooth ff, one step agrees with the Taylor expansion of the exact solution through the h3h^3 term. Find a32a_{32}. Express your answer as a common fraction.