For the ordinary differential equation
y′=f(t,y),y(0)=y~0,t⩾0
where y(t)∈RN and the function f:R×RN→RN is analytic, consider an explicit one-step method described as the mapping
yn+1=yn+hφ(tn,yn,h)
Here φ:R+×RN×R+→RN,n=0,1,… and tn=nh with time step h>0, producing numerical approximations yn to the exact solution y(tn) of equation (∗), with y0 being the initial value of the numerical solution.
(i) Define the local error of a one-step method.
(ii) Let ∥⋅∥ be a norm on RN and suppose that
∥φ(t,u,h)−φ(t,v,h)∥⩽L∥u−v∥,
for all h>0,t∈R,u,v∈RN, where L is some positive constant. Let t∗>0 be given and e0=y0−y(0) denote the initial error (potentially non-zero). Show that if the local error of the one-step method ( ↑ ) is O(hp+1), then
n=0,…,⌊t∗/h⌋max∥yn−y(nh)∥⩽et∗L∥e0∥+O(hp),h→0
(iii) Let N=1 and consider equation (∗) where f is time-independent satisfying ∣f(u)−f(v)∣⩽K∣u−v∣ for all u,v∈R, where K is a positive constant. Consider the one-step method given by
yn+1=yn+41h(k1+3k2),k1=f(yn),k2=f(yn+32hk1).
Use part (ii) to show that for this method we have that equation (††) holds (with a potentially different constant L ) for p=2.