MathCastle
Differential EquationsHardNumerical Methods: Euler to Runge–Kutta

Numerical Methods: Euler to Runge–Kutta · Hard problem

Apply one step of the backward Euler method y1=y0+h f(t1,y1)y_1 = y_0 + h\,f(t_1, y_1) with h=12h = \dfrac{1}{2} to y′=−y2y' = -y^2, y(0)=1y(0) = 1. The implicit equation has two roots; take the one near y0y_0 (the positive one). What is y1y_1?