Euler's numerical method (HL)
One of the few calculus topics that is studied in greater depth in AI HL than AA HL.
Contents
Theory
In interpretations of derivatives, it was mentioned that a smooth curve can be approximated by a series of jagged lines segments as each line segment becomes small.
This is exactly what we do in Euler’s method.
Given some differential equation
and some initial point , and a step size , then each successive value of , and is
Note that each iteration depends on only the previous iteration. is the estimate for the gradient of the line. is . So the equation for is saying
On some calculators, you instead use
In both cases, start with , and after iterations, return as a final answer. Questions could also sometimes ask for instead.
Practice
Use sequence mode or recursion mode or spreadsheet on your calculator to implement a solution. As your calculator gets reset before your exams, it is good practice to make the math wrap as opposed to display in one line.
Given that
Use a step size of , estimate when
On TI-84 Plus, u
, v
, w
are available via 2ND + 7
, 2ND + 8
, 2ND + 9
. Here we presume the lists or sequences are named u
, v
, w
etc. It depends on specific model of your calculator.
- Set calculator to sequences mode.
- In
y=
, setnMin
to0
. - Define
u(nMin) = 0, u(n) = 0.1*n
, for a list of - Define
v(nMin) = 1, v(n) = v(n-1) + 0.1*(v(n-1)^2/(1+u(n-1)))
, for a list of - See table of values where
n
is5
, andu(n)
is.5
, and findv(n)
to be1.6225
Typically, writing down a full, correct list of each is sufficient for full marks.
In the above example, an extra set of parentheses were used after h*
, which is a good practice in case is not a fraction, though not necessary in this particular question.