Scribd
Upload
155 views

Metodos Cerrados

The bisection method is a root-finding algorithm that repeatedly bisects an interval and selects a subinterval in which the root must lie. It is simple but slow. The false position method is similar to bisection but also uses the function value to calculate a weighted average for one endpoint of the new interval at each iteration, making it faster than bisection. An example applies the false position method to find the root of a function within eight iterations, with the interval width decreasing until it is less than 0.00001.

Uploaded by

marcelita2789
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
155 views

Metodos Cerrados

The bisection method is a root-finding algorithm that repeatedly bisects an interval and selects a subinterval in which the root must lie. It is simple but slow. The false position method is similar to bisection but also uses the function value to calculate a weighted average for one endpoint of the new interval at each iteration, making it faster than bisection. An example applies the false position method to find the root of a function within eight iterations, with the interval width decreasing until it is less than 0.00001.

Uploaded by

marcelita2789
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

CLOSED

METHOD
BISECTION METHOD
The bisection method
is a root-finding
algorithm which
repeatedly bisects an
interval then selects a
subinterval in which a
root must lie for
further processing. It
is a very simple and
robust method, but it
is also relatively slow.
EXAMPLE
Consider finding the root of f(x) = x^2 - 3. Let εstep = 0.01,
εabs=0.01 and start with the interval [1, 2].
y

        








Table 1. Bisection method applied to f(x) = x^2 - 3.

a b f(a) f(b) c = (a + b)/2 f(c) Update new b − a

1.0 2.0 -2.0 1.0 1.5 -0.75 a=c 0.5


1.5 2.0 -0.75 1.0 1.75 0.062 b=c 0.25
1.5 1.75 -0.75 0.0625 1.625 -0.359 a=c 0.125

1.625 1.75 -0.3594 0.0625 1.6875 -0.1523 a = c 0.0625

1.6875 1.75 -0.1523 0.0625 1.7188 -0.0457 a = c 0.0313

1.7188 1.75 -0.0457 0.0625 1.7344 0.0081 b=c 0.0156

1.71988 1.7344 -0.0457 0.0081 1.7266 -0.0189 a = c 0.0078


Thus, with the seventh
iteration, we note that
the final interval,
[1.7266, 1.7344], has a
width less than 0.01
and |f(1.7344)| < 0.01,
and therefore we chose
b = 1.7344 to be our
approximation of the
root.
FLOW DIAGRAM
FALSE
POSITION
METHOD
The false position method method is a root-finding
algorithm that combines features from the bisection
method and the secant method.

The first two


iterations of the
false position
method. The red
curve shows the
function f and
the blue lines are
the secants
False position method uses F(X) not only in deciding the new
interval [ an,bn] as in bisection method but also in calculating
one of the end points of the new interval. Here one of end
points of [ an,bn] say W is calculated as a weighted average
defined on previous interval as [an-1,bn-1] as:
Given a function continuous on an interval
satisfying the criteria , carry out the following
steps to find the root of in :

(1) Set
(2) For n = 0,1,2.... until convergence criteria is satisfied , do:

(a) Compute      

(b) If  ,    then set

otherwise set
EXAMPLE
Solve for the root in the interval [1,2] by
Regula-Falsi method:

Since , we go ahead in finding the root of


given function f(x) in [1,2].
Set .

Set
proceed with iteration. Iteration details are provide below in a
tabular form:
FALSE POSITION METHOD
         
Iteration no. an bn wn F(wn)
0 1.0000000000 2.0000000000 1.4782608747 -2.2348976135

1 1.4782608747 2.0000000000 1.6198574305 -0.5488323569

2 1.6198574305 2.0000000000 1.6517157555 -0.1169833690

3 1.6517157555 2.0000000000 1.6583764553 -0.0241659321

4 1.6583764553 2.0000000000 1.6597468853 -0.0049594725

5 1.6597468853 2.0000000000 1.6600278616 -0.0010169938

6 1.6600278616 2.0000000000 1.6600854397 -0.0002089010

7 1.6600854397 2.0000000000 1.6600972414 -0.0000432589

8 1.6600972414 2.0000000000 1.6600997448 -0.0000081223


y

        














BIBLIOGRAPHY
•http://www.uv.es/etomar/13042/MC_P5_08.pdf

•http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-
KANPUR/Numerical%20Analysis/numerical-analysis/Rathish-
kumar/ratish-1/f3node3.html

•http://en.wikipedia.org/wiki/False_position_method

•http://www.ece.uwaterloo.ca/~dwharder/NumericalAnalysi
s/10RootFinding/bisection/examples.html

•http://en.wikipedia.org/wiki/Bisection_method
FLOW DIAGRAM

You might also like