Scribd
Upload
203 views2 pages

The Method of False Position

The Method of False Position is an iterative method for finding roots of equations. It starts with an initial interval [x1, x2] where the function changes sign only once. It finds x3 at the intersection of the x-axis and a line through (x1, f(x1)) and (x2, f(x2)). The new interval [x1,x3] or [x3,x2] is chosen depending on where the function changes sign. Unlike bisection, false position uses information about the function to dynamically choose x3, allowing it to converge faster to the root.

Uploaded by

Mheyren Angelo Bantugan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
203 views2 pages

The Method of False Position

The Method of False Position is an iterative method for finding roots of equations. It starts with an initial interval [x1, x2] where the function changes sign only once. It finds x3 at the intersection of the x-axis and a line through (x1, f(x1)) and (x2, f(x2)). The new interval [x1,x3] or [x3,x2] is chosen depending on where the function changes sign. Unlike bisection, false position uses information about the function to dynamically choose x3, allowing it to converge faster to the root.

Uploaded by

Mheyren Angelo Bantugan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1/ 2

The Method of False Position

The poor convergence of the bisection method as well as its poor adaptability to
higher dimensions (i.e., systems of two or more non-linear equations) motivates the
use of better techniques. One such method is the Method of False Position. Here, we
start with an initial interval [x1, x2], and we assume that the function changes sign
only once in this interval. Now we find an x3 in this interval, which is given by the
intersection of the x axis and the straight line passing through (x1, f(x1)) and (x2, f(x2)).
It is easy to verify that x3 is given by

Now, we choose the new interval from the two choices [x1,x3] or [x3,x2] depending on
in which interval the function changes sign.

The false position method differs from the bisection method only in the choice it
makes for subdividing the interval at each iteration. It converges faster to the root
because it is an algorithm which uses appropriate weighting of the initial end
points x1 and x2 using the information about the function, or the data of the problem.
In other words, finding x3 is a static procedure in the case of the bisection method
since for a given x1 and x2, it gives identical x3, no matter what the function we wish to
solve. On the other hand, the false position method uses the information about the
function to arrive at x3.

You might also like