Q9E

Question

In Section 3.6, we discussed the improved Euler’s method for approximating the solution to a first-order equation. Extend this method to normal systems and give the recursive formulas for solving the initial value problem.

Step-by-Step Solution

Verified
Answer

The result is: 

xi,n+1=xi,n+h2fi(tn,x1,n,x2,n........,xm,n)+fi(tn+h,x1,n+hf1(tn,x1,n,x2,n........,xm,n)........,xm,n+hfm(tn,x1,n,x2,n........,xm,n)

1Step 1: Use Euler’s method

Here given Euler’s method of the differential equation:

 So, yn+1=yn+h2f(xn,yn)+f(xn+h,yn+hf(xn,yn))

n=0,1,2,…..and xn+1=xn+h.

 Now, 

x'1(t)=f1(t,x1,x2........,xm)x'2(t)=f2(t,x1,x2........,xm)..x'm(t)=fm(t,x1,x2........,xm) 


2Step 2: Solve for every i

For every I from 1 to m, then;

tn+1=tn+hxi,n+1=xi,n+h2fi(tn,x1,n,x2,n........,xm,n)+fi(tn+h,x1,n+hf1(tn,x1,n,x2,n........,xm,n)........,xm,n+hfm(tn,x1,n,x2,n........,xm,n) 


 

This is the required result.