Q5.3-15E
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 . Starting with , continue halving the step size until two successive approximations of both and differ by at most 0.1.
Step-by-Step Solution
Verified Answer
The solution is and .
1Transform the equation
Write the equation as
The equations can be written as:
The transformation of the equation is:
The initial conditions are:
2Apply Runge –Kutta method
For the solution, apply the Runge-Kutta method in MATLAB, and the solution is and .
3Find that y 1 and y ' ( 1 ) differ by at most 0.01.
Subtracting the values of and then
Therefore, and differ by at most 0.1.
Other exercises in this chapter
Q5.3-13E
In Problems 10–13, use the vectorized Euler method with h = 0.25 to find an approximation for the solution to the given initial value problem on the speci
View solution Q5.3-14E
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-17E
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