Scribd
Upload
142 views4 pages

Roots of Equations

This document discusses numerical methods for finding roots of equations. It describes graphical methods, the bisection method, the method of false position, and simple fixed-point iteration. The bisection method uses the function's sign to narrow the interval containing the root at each step. The method of false position finds the root as the x-coordinate of the point where a line through two points crosses the x-axis. Simple fixed-point iteration approximates the root by expressing the next x-value as a function of the previous x-value. The document provides formulas for estimating errors in these

Uploaded by

Jonathan Budinho
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 PDF, TXT or read online on Scribd
142 views4 pages

Roots of Equations

This document discusses numerical methods for finding roots of equations. It describes graphical methods, the bisection method, the method of false position, and simple fixed-point iteration. The bisection method uses the function's sign to narrow the interval containing the root at each step. The method of false position finds the root as the x-coordinate of the point where a line through two points crosses the x-axis. Simple fixed-point iteration approximates the root by expressing the next x-value as a function of the previous x-value. The document provides formulas for estimating errors in these

Uploaded by

Jonathan Budinho
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 PDF, TXT or read online on Scribd
You are on page 1/ 4

Universidad Idustrial De Santander

Petroleum Engineering
Subject: Numerical methods
Topic: Roots of equations
Teacher: Eduardo Carrillo Zambrano PhD
Student: Jonathan Enrique Budez Vergara Code: 2072321

1 Roots of equations

Graphical and close methods

This methods is an approximations of equations root by the graphic, we can obtain approxima-
tion observe where it crosses the x axis.

16,789


d -
12 20

The bisection methods

We can take advantage of the function sign for choose a interval that enclose the root of the
function. This is the principle of the bisection methods, we divide the interval in two part until
obtain the best approximation of equation root. We can say three important criteria about the
function tendency:

1. f (xi )f (xs ) < 0 =⇒ Where xi is the inferior valor of x and xs the superior valor, in this case
the function have a change of sign.

2.

If xi and xs have got the same sign −→ f (x) have not


got roots or have got a par number of roots.

-
xi xs
3.

If xi and xs have got different sign −→ f (x) have got a


odd number of roots

-
xi xs

Obviously exist a exception of this cases, a example of that is next situation:

-
xi xs

The error of the bisection methods can be expresed:


xr =⇒ roots of f (x) (1)
xi − xs new xs − xi
xnew
r = xr − xlast = (2)
new 2 last 2
x − x
εa =
(3)
xnew

xs − xi
εa = (4)
xi + xs
∆x
εa = ∆x =⇒ Ean = n (5)
2
The methods of the false position

This methods is about find the approximation of the root with the crosses point in x axis, with
a rect that unite two points.
the formule is :
f (xs )(xi − xs )
xr = xs − (6)
f (xs ) − f (xi )
Open methods

Simple fixed-point iteration

We can approximate the root valor of equations with se function, in this methods we expressed
the next valor of the variable xi+1 in term of the last variable xi .
f (x) = 0 we expressed x = g(x)
For example :

If we have got the function sin(x) = 0 =⇒ x = sin(x) + x or xi+1 = sin(xi ) + xi

The form of the error of the method is:



xi+1 − xi

εa = ∗ 100%
xii+1
BIBLIOGRAPHY

1. Numerical methods for engineers. Fith Edition. Steven C. Chapra.

You might also like