0% found this document useful (0 votes)
340 views6 pages

Numerical Solutions - Module 5 - Incremental Search

The incremental search method locates intervals where a function changes sign to find roots. It starts with an initial x value and increases x by a step size h. If the function changes sign between two x values, or if one function value is negative and the next positive, then a root exists between those x values. The estimated root is the average of the lower and upper bounds of that interval. The example demonstrates finding the root of a quadratic function using incremental search, starting at x=0 with h=0.1, then refining the interval and step size to get a more accurate root.

Uploaded by

Denzel Galapon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
340 views6 pages

Numerical Solutions - Module 5 - Incremental Search

The incremental search method locates intervals where a function changes sign to find roots. It starts with an initial x value and increases x by a step size h. If the function changes sign between two x values, or if one function value is negative and the next positive, then a root exists between those x values. The estimated root is the average of the lower and upper bounds of that interval. The example demonstrates finding the root of a quadratic function using incremental search, starting at x=0 with h=0.1, then refining the interval and step size to get a more accurate root.

Uploaded by

Denzel Galapon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

MODULE 3: ROOTS OF EQUATION

INCREMENTAL SEARCH
PREPARED BY:
ENGR. MARY ABEGAIL P. CADANG
INCREMENTAL SEARCH

 Incremental Search
- this methods capitalize by locating an interval where the
function changes sign. A potential problem with an incremental
search is in the choice of the length. If the length is too small, the
search can be very time consuming. On the other hand, if the
length is too great, there is a possibility that closely spaced roots
might be missed, The problem is compounded by the possible
existence of multiple roots.
INCREMENTAL SEARCH

 It starts with an initial value, 𝑥0


 The next value 𝑥𝑛 for 𝑛 = 1,2,3, …is calculated by using 𝑥𝑛 =
𝑥𝑛−1 + ℎ, where his referred to a step size.
 If the sign of two 𝑓(𝑥) changes or if 𝑓 𝑥𝑛 . 𝑓 𝑥𝑛−1 < 0, then the
root exist over the prescribed interval of the lower bound, 𝑥𝑙 and
upper bound, 𝑥𝑢 .
 The root is estimated by using
𝑥𝑙 + 𝑥𝑢
𝑥𝑟 =
2
EXAMPLE # 1
 Find the first root of 𝑓( 𝑥) = 4.15𝑥 2 − 16𝑥 + 8 by using incremental search. Start the procedure with the initial
value, 𝑥0 = 0 and the step size, ℎ = 0.1. Perform three iterations of the incremental search to achieve the best
approximation root.

x f(x) Step 1. Compute the value of f(x) Step 2. Check the value of x where the sign of
0 8 when your starting x is equal to f(x) changes. Using your
zero and its step size is 0.1. Tabulate formula𝑓 𝑥𝑛 . 𝑓 𝑥𝑛−1 < 0, see if it is satisfied.
0.1 6.4415
it and use Cal-Tech to solve your
0.2 4.966 values easily. 𝑓 0.5 . 𝑓 0.6 < 0
0.3 3.5735 Hint:You can end your f(x) 1.0375 −0.106 < 0
computation when its sign changes −0.109975 < 0
0.4 2.264
satisfied
0.5 1.0375
0.6 -0.106
𝑥𝑙 +𝑥𝑢
Step 3. Use 𝑥𝑟 = to find your estimated Step 4. Since we are required x f(x)
2
root and set aside. to compute up to three 0.5 1.0375
iteration, use the interval
from 0.5 to 0.6 to get the 0.51 0.9194
closer root, reduce your step 0.52 0.8022
𝑥𝑙 + 𝑥𝑢
𝑥𝑟 = size to 0.01. Tabulate another 0.53 0.6857
2 set of iteration and repeat
0.5 + 0.6 0.54 0.5701
𝑥𝑟 = process.
2
𝒙𝒓 = 𝟎. 𝟓𝟓 0.55 0.4554
𝑥𝑙 + 𝑥𝑢
𝑥𝑟 = 0.56 0.3414
2
0.59 + 0.6 0.57 0.2283
𝑥𝑟 =
2 0.58 0.1161
𝒙𝒓 = 𝟎. 𝟓𝟗𝟓
0.59 0.0046
0.6 -0.106
EXAMPLE # 1
Step 5. Repeat process and x f(x) Step 6. Compute the approximate
iteration from interval 0.59 0.59 0.0046 estimate of error..
to 0.60 with step size 0.001.
0.591 -0.0065 𝑝𝑟𝑒𝑠𝑒𝑛𝑡 𝑎𝑝𝑝. −𝑝𝑟𝑒𝑣𝑖𝑜𝑢𝑠 𝑎𝑝𝑝.
𝜀𝑎 = %
𝑝𝑟𝑒𝑠𝑒𝑛𝑡 𝑎𝑝𝑝.
𝑥𝑙 + 𝑥𝑢 0.5905 − 0.595
𝑥𝑟 = 𝜀𝑎 = %
2 0.5905
0.59 + 0.591
𝑥𝑟 = 0.5905 − 0.595
2 𝜀𝑎 = %
𝒙𝒓 = 𝟎. 𝟓𝟗𝟎𝟓 0.5905

𝜀𝑎 = 0.7621%

0.6 -0.106

You might also like