Euler Methods:
Numerical Solution of an IVP:Presume we wish to numerically solve the initial value problem
y? = f (t, y), y(a) = y0,
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:
(t0, y0), (t1, y1), (t2, y2), . . . ,(tn, yn),
Where t0 = a and tn= 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 is
h = (b − a)/ n
and the times ti are given simply by ti= a + ih. This leaves the mainly important part of finding a numerical solution determining y1, y2, . . . ,yn 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 (ti, yi),
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 Method:
The mainly straight forward approach is to replace y? i by its forward difference approximation.
This gives:
(yi+1– yi)/h= f (ti, yi).
Rearranging this gives us a method to obtain yi+1 from yiknown as Euler’s method:
yi+1 = yi+ hf (ti, yi).
With this formula we are able to start from (t0, y0) and compute all the subsequent approximations (ti, yi).
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 pointsa = tspan(1);b = tspan(2);h = (b-a)/n; % step sizet = a; y = y0; % t and y are the current variablesT = a; Y = y0’; % T and Y will record all stepsfor i = 1:ny = 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 method:
You 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
y1 = x, y2 = x? ,
then we obtain
y?1 = y2, y?2 = −y1.
Then the solution must be y1(t) = cos(t), y2(t) = sin(t). If we after that plot the solution in the (y1, y2) 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)> y1 = Y(:,1);> y2 = Y(:,2);>plot(y1,y2)
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 Method:
An 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:
k1 = hf (ti, yi)k2 = hf (ti+ h, yi+ k1)yi+1 = yi+1/2(k1 + k2) .
Here k1 captures the information at the start of the time step (same as Euler) while k2 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 pointsa = tspan(1);b = tspan(2);h = (b-a)/n; % step sizet = a; y = y0; % t and y are the current variablesT = a; Y = y0’; % T and Y will record all stepsfor i = 1:nk1 = 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)> ym1 = Ym(:,1);> ym2 = Ym(:,2);>plot(ym1,ym2)
Latest technology based Matlab Programming Online Tutoring Assistance
Tutors, at the www.tutorsglobe.com, take pledge to provide full satisfaction and assurance in Matlab Programming help via online tutoring. Students are getting 100% satisfaction by online tutors across the globe. Here you can get homework help for Matlab Programming, project ideas and tutorials. We provide email based Matlab Programming help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Matlab Programming. Through Online Tutoring, you would be able to complete your homework or assignments at your home. Tutors at the TutorsGlobe are committed to provide the best quality online tutoring assistance for Matlab Programming Homework help and assignment help services. 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. TutorsGlobe assure 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 the homework help as per the deadline or given instruction by the student, we refund the money of the student without any delay.
tutorsglobe.com hypersensitivity-immune complex assignment help-homework help by online classification of hypersensitivity reactions tutors
Concept of communities and community interactions tutorial all along with the key concepts of concept of Communities, Coevolution of species within Communities, Types of Communities, Terrestrial Communities, Freshwater Communities, structure of Communities
Theory of Searching and their types including the key concepts of Binary Search, Binary Search Tree, Variations on Binary Trees, Dictionary, Collision Handling and Hash Table variations
tutorsglobe.com natural immunity assignment help-homework help by online immunity tutors
tutorsglobe.com physiological role and deficiency symptoms assignment help-homework help by online mineral nutrition tutors
The value added statement (VAS) came into existence in the middle 1970s following publication of an influential discussion document that entitled The Corporate Report. The Corporate Report argued for the inclusion of the VAS under the annual report.
a software development life cycle is an abstract representation of gradual development and evolution of the software that undergoes a series of sequential or concurrent steps of the software development process.
Want to secure top-notch marks? Avail American Foreign Policy Assignment Help service with skilled tutors for notable grades!
www.tutorsglobe.com offers answering questions to income elasticity of demand, types of income elasticity, economics assignment help - homework help.
build up a 3 phase, single layer concentric type of winding for a 2 pole ac machine comprising 24 slots.
tutorsglobe.com monera assignment help-homework help by online five kingdom system of classification tutors
Mechanism of Antibody Formation tutorial all along with the key concepts of Theories of Antibody Formation, Production of Antibodies, Qualitative Changes and Cellular Events, Antigen/antibody interactions, Lymphocytes, B-Lymphocytes and T-Lymphocytes
Tissues-Organs and Systems tutorial all along with the key concepts of Plant Tissues, Meristematic Tissue, Parenchymatous Tissue, Collenchyma Tissue, Xylem, Phloem, Animal Tissues, Organs of plants and animals, Systems, Circulatory System, Digestive System
Hire qualified Computational Science Assignment Help tutors and leave your worries aside and get A++ solutions at fair prices and score top grades.
Tapeworms of man and other human cestode tutorial all along with the key concepts of Taenia spp, Morphology of Taenia spp, Pathology of Infection in Taenia spp, Diagnosis of Infection due to Taenia spp, Infection by Adult tapeworms and Infection by Larvae
1946005
Questions Asked
3689
Tutors
1475238
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!