- +1-530-264-8006
- info@tutorsglobe.com

18,76,764

Questions

Asked

21,311

Experts

9,67,568

Questions

Answered

Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!

Submit Assignment2015 © Tutors Globe. All rights reserved.

## Euler Methods and Differential Equations

Euler Methods::Numerical Solution of an IVPPresume we wish to numerically solve the initial value problem

y? = f (t, y), y(a) = y

_{0},On an period of time [a, b].

By a numerical solution we should mean an approximation of the solution at a finite number of points that is:

(t

_{0}, y_{0}), (t_{1}, y_{1}), (t_{2}, y_{2}), . . . ,(t_{n}, y_{n}),Where t

_{0}= a and t_{n}= b The first of these points is precisely the initial value. If we acquire n steps as above and the steps are evenly spaced then the time change in every step ish = (b − a)/ n

and the times t

_{i}are given simply by t_{i}= a + ih. This leaves the mainly important part of finding a numerical solution determining y_{1}, y_{2}, . . . ,y_{n}in a manner that is as consistent as possible with.To do this first write the discrepancy equation in the indexed notation:

y?

_{i}≈ f (t_{i}, y_{i}),And will then put back the derivative y? by a difference. There are several ways we might carry this out and in the next section we study the simplest.

:The Euler MethodThe mainly straight forward approach is to replace y?

_{ i}by its forward difference approximation.This gives:

(y

_{i+1}– y_{i})/h= f (t_{i}, y_{i}).Rearranging this gives us a method to obtain y

_{i+1}from yiknown as Euler’s method:y

_{i+1}= y_{i}+ hf (t_{i}, y_{i}).With this formula we are able to start from (t0, y0) and compute all the subsequent approximations (t

_{i}, y_{i}).This is extremely easy to implement as you can see from the following program (which can be downloaded from the class web site)

function [T , Y] = myeuler(f,tspan,y0,n)% function [T , Y] = myeuler(f,tspan,y0,n)

% Solves dy/dt = f(t,y) with initial condition y(a) = y0

% on the interval [a,b] using n steps of Euler s method.

% Inputs: f -- a function f(t,y) that returns a column vector of the same

% length as y

% tspan -- a vector [a,b] with the start and end times

% y0 -- a column vector of the initial values, y(a) = y0

% n -- number of steps to use

% Outputs: T -- a n+1 column vector containing the times

% Y -- a (n+1) by d matrix where d is the length of y

% Y(t,i) gives the ith component of y at time t

% parse starting and ending points

a = tspan(1);

b = tspan(2);

h = (b-a)/n; % step size

t = a; y = y0; % t and y are the current variables

T = a; Y = y0’; % T and Y will record all steps

for i = 1:n

y = y + h*f(t,y);

t = a + i*h;

T = [T; t];

Y = [Y; y’];

End

To utilization this program we need a function such as the vector function for the pendulum

> f = inline(’[y(2);-.1*y(2)-sin(y(1)) + sin(t)]’,’t’,’y’)

Then type:

> [T Y] = myeuler(f,[0 20],[1;-1.5],5);

Here [0 20] is the time span you desire to consider, [1;-1.5] is the first value of the vector y and 5 is the number of steps. The output T contains times as well as Y contains values of the vector as the times. Try

>size(T)

>size(Y)

Since the initial coordinate of the vector is the angle we merely plot its values

>theta = Y(:,1);

>plot(T,theta)

In this plot it is clear that n = 5 isn’t adequate to represent the function. Type

> hold on

Afterwards redo the above with 5 replaced by 10. Next try 20, 40, 80, and 200. As you are able to see the graph becomes increasingly better as n increases. We are able to compare these calculations with Mat lab’s

built-in function with the commands

> [T Y]= ode45(f,[0 20],[1;-1.5]);

>theta = Y(:,1);

>plot(T,theta,’r’)

:The problem with the Euler methodYou are able to think of the Euler method as finding a linear approximate solution to the initial value problem on each time interval. An apparent shortcoming of the method is that it makes the approximation based on information at the beginning of the time interval only. This problem is demonstrated well by the following IVP:

x¨ + x = 0, x(0) = 1, x? (0) = 0 .

You can effortlessly check that the exact solution of this IVP is

x(t) = cos(t).

If we create the standard change of variables

y

_{1}= x, y_{2}= x? ,then we obtain

y?

_{1}= y_{2}, y?_{2}= −y_{1}.Then the solution must be y

_{1}(t) = cos(t), y_{2}(t) = sin(t). If we after that plot the solution in the (y_{1}, y_{2}) plane, we must get exactly a unit circle. We are able to solve this IVP with Euler’s method:> g = inline(’[y(2);-y(1)]’,’t’,’y’)

> [T Y] = myeuler(g,[0 4*pi],[1;0],20)

> y

_{1}= Y(:,1);> y

_{2}= Y(:,2);>plot(y

_{1},y_{2})As you are able to see the approximate solution goes far from the true solution. Even if you raise the number of steps the Euler solution will eventually drift outward away from the circle because it doesn’t take into account the curvature of the solution.

:The Modified Euler MethodAn idea which is alike to the idea behind the trapezoid method would be to consider f at both the beginning and end of the time step and take the average of the two. Doing this produces the Modified (or else Improved) Euler method represented by the following equations:

k

_{1}= hf (t_{i}, y_{i})k

_{2}= hf (t_{i}+ h, y_{i}+ k_{1})y

_{i+1}= y_{i+1}/2(k_{1}+ k_{2}) .Here k

_{1}captures the information at the start of the time step (same as Euler) while k_{2}is the information at the end of the time step.The following program executes the Modified method. It perhaps downloaded from the class web site.

function [T , Y] = mymodeuler(f,tspan,y0,n)% Solves dy/dt = f(t,y) with initial condition y(a) = y0

% on the interval [a,b] using n steps of the modified Euler’s method.

% Inputs: f -- a function f(t,y) that returns a column vector of the same

% length as y

% tspan -- a vector [a,b] with the start and end times

% y0 -- a column vector of the initial values, y(a) = y0

% n -- number of steps to use

% Outputs: T -- a n+1 column vector contianing the times

% Y -- a (n+1) by d matrix where d is the length of y

% Y(t,i) gives the ith component of y at time t

% parse starting and ending points

a = tspan(1);

b = tspan(2);

h = (b-a)/n; % step size

t = a; y = y0; % t and y are the current variables

T = a; Y = y0’; % T and Y will record all steps

for i = 1:n

k1 = h*f(t,y);

k2 = h*f(t+h,y+k1);

y = y + .5*(k1+k2);

t = a + i*h;

T = [T; t];

Y = [Y; y’];

end

We are able to test this program on the IVP above:

> [T Ym] = mymodeuler(g,[0 4*pi],[1;0],20)

> ym

_{1}= Ym(:,1);> ym

_{2}= Ym(:,2);>plot(ym1,ym2)

Latest technology based Matlab Programming Online Tutoring AssistanceTutors, at the

www.tutorsglobe.com, take pledge to provide full satisfaction and assurance inMatlab Programming helpviaonline tutoring. Students are getting 100% satisfaction byonline tutorsacross the globe. Here you can get homework help for Matlab Programming, project ideas and tutorials. We provide email basedMatlab Programming help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Matlab Programming. ThroughOnline Tutoring, you would be able to complete your homework or assignments at your home. Tutors at theTutorsGlobeare committed to provide the best qualityonline tutoringassistance forMatlab Programming Homework helpandassignment helpservices. They use their experience, as they have solved thousands of the Matlab Programming assignments, which may help you to solve your complex issues of Matlab Programming.TutorsGlobeassure for the best quality compliance to your homework. Compromise with quality is not in our dictionary. If we feel that we are not able to provide thehomework helpas per the deadline or given instruction by the student, we refund the money of the student without any delay.