IPE 329, Truncation Error and Taylor Series
IPE 329, Truncation Error and Taylor Series
Roots of Equations
1
9/9/2020
Roots of Equations
• An approximate solution technique graphical methods.
• Plot the function and determine where it crosses the x axis.
• Although graphical methods are useful for obtaining rough
estimates of roots, they are limited because of their lack of
precision.
• An alternative approach is to use trial and error.
• This technique consists of guessing a value of x and
evaluating whether f(x) is zero.
• If not (as is almost always the case), another guess is made,
and f(x) is again evaluated to determine whether the new
value provides a better estimate of the root.
Optimization
• Besides roots, another feature of interest to engineers
and scientists are a function’s minimum and maximum
values referred to as optimization.
• From a numerical standpoint, such optimization methods
are similar in spirit to the root-location methods.
• Both involve guessing and searching for a location on a
function.
• Root location involves searching for the location where
the function equals zero.
• In contrast, optimization involves searching for the
function’s extreme points.
Bangladesh University of Eng. & Tech. Slide 4 of 52 Industrial &Production Engineering
2
9/9/2020
3
9/9/2020
4
9/9/2020
Graphical Methods
5
9/9/2020
Graphical Methods
Graphical Methods
• In general, if f(xl) and f(xu) have opposite signs, there are an
odd number of roots in the interval.
• If f(xl) and f(xu) have the same sign, there are either no roots
or an even number of roots between the values.
• Although these generalizations are usually true, there are
cases where they do not hold.
• For example, functions that are tangential to the x axis and
discontinuous functions can violate these principles.
• An example of a function that is tangential to the axis is the
cubic equation f(x) = (x − 2)(x − 2)(x − 4).
• Notice that x = 2 makes two terms in this polynomial equal to
zero. Mathematically, x = 2 is called a multiple root.
Bangladesh University of Eng. & Tech. Slide 12 of 52 Industrial &Production Engineering
6
9/9/2020
7
9/9/2020
Numerical Methods
Bracketing Methods
8
9/9/2020
Incremental Search
Incremental Search
9
9/9/2020
Incremental Search
Incremental Search
10
9/9/2020
11
9/9/2020
Bisection Method
• The bisection method is also known as binary chopping,
interval halving, or Bolzano’s method.
• It is a variation of the incremental search method in
which the interval is always divided in half.
• If a function changes sign over an interval, the function
value at the midpoint is evaluated.
• The location of the root is then determined as lying within
the subinterval where the sign change occurs.
• The subinterval then becomes the interval for the next
iteration.
• The process is repeated until the root is known to the
required precision.
Bangladesh University of Eng. & Tech. Slide 23 of 52 Industrial &Production Engineering
Bisection Method
12
9/9/2020
Bisection Method
13
9/9/2020
14
9/9/2020
15
9/9/2020
16
9/9/2020
17
9/9/2020
18
9/9/2020
Bisection Algorithm
(n+1) function
evaluations are
performed, rather
than 2n
19
9/9/2020
20
9/9/2020
21
9/9/2020
22
9/9/2020
23
9/9/2020
• After five iterations, the true error has only been reduced
to about 59 percent.
• In addition, note that εa < εt the approximate error is
misleading.
Bangladesh University of Eng. & Tech. Slide 48 of 52 Industrial &Production Engineering
24
9/9/2020
25
9/9/2020
Assignment-05
26