Q5.3-17E
Question
In Problems 14–24, you will need a computer and a programmed version of the vectorized classical fourth-order Runge–Kutta algorithm. (At the instructor’s discretion, other algorithms may be used.)†
Using the vectorized Runge–Kutta algorithm, approximate the solution to the initial value problem
at x = 1. Starting with h=1, continue halving the step size until two successive approximations of u(1)and v(1) differ by at most 0.001.
Step-by-Step Solution
Verified Answer
The solution is and .
1Transform the equation
Write the equation as and .
The transformation of the equation is:
The initial conditions are
2Apply Runge –Kutta method
For the solution apply the Runge-Kutta method in MATLAB for h=0.25, and the solution is u(1)=0.36789 and v(1)=0.36789.
3Find that u 1 and v ( 1 ) differ by at most 0.001.
Subtracting the values of and then
Therefore, and differ by at most 0.001.
Other exercises in this chapter
Q5.3-15E
In Problems 14–24, you will need a computer and a programmed version of the vectorized classical fourth-order Runge–Kutta algorithm. (At the instruc
View solution Q5.3-16E
In Problems 14–24, you will need a computer and a programmed version of the vectorized classical fourth-order Runge–Kutta algorithm. (At the instruc
View solution Q5.3-18E
Combat Model. A simplified mathematical model for conventional versus guerrilla combat is given by the system x'1=-(0.1)x1x2; x1(0)=10;
View solution Q5.3-20E
In Project C of Chapter 4, it was shown that the simple pendulum equation θ''(t)+sinθ(t)=0 has periodic solutions when the initial displacement a
View solution