Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
49 views12 pages

Methods

Graphical methods plot the graph of the function to find where it crosses the x-axis, which is the root. However, the values obtained can be imprecise and the graph may be difficult to draw. Interval methods like bisection and false position are more suitable as they narrow down the interval containing the root and converge to more accurate values. Open methods like Newton-Raphson and secant method use tangents or divided differences to quickly find better approximations in each iteration, but may oscillate or not converge if the initial value is too far from the root. The fixed point method finds the solution by setting x equal to a function of x and analyzing its convergence properties.

Uploaded by

diegoferro90
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
49 views12 pages

Methods

Graphical methods plot the graph of the function to find where it crosses the x-axis, which is the root. However, the values obtained can be imprecise and the graph may be difficult to draw. Interval methods like bisection and false position are more suitable as they narrow down the interval containing the root and converge to more accurate values. Open methods like Newton-Raphson and secant method use tangents or divided differences to quickly find better approximations in each iteration, but may oscillate or not converge if the initial value is too far from the root. The fixed point method finds the solution by setting x equal to a function of x and analyzing its convergence properties.

Uploaded by

diegoferro90
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/ 12

GRAPHICAL METHODS

In these methods, what is sought is to plot the graph of y = f (x).


The point where cutting the abscissa (x) is the root. These
methods although very general, have their drawbacks.

The values obtained


are not very
precises.

The graph can be


difficult to make

For these reasons


are not suitable, rather
than to find approximate
values.
INTERVAL METHODS
ðISECTION METHODS

Ô Ô

Ô
¢. Then:

a) If F (Xi) * F (Xr) <0, the root is in the lower subinterval


then:

Ô Ô
Ô

b) If F (Xi) * F (Xr)> 0, the root is in the upper


subinterval, then:

Ô Ô

5. Then, repeat the point two y when Error <0.001, the


calculation ends.
THE FALSE POSITION
METHOD

The method of false position is intended to combine the


security of the bisection method with the speed of the
secant method. This method, as with the bisection
method stems from two points surrounding the root
f (x) = 0. However, the method of false position has a
very slow convergence towards the solution.
0sing the two-point form of the line:

O è j è O j
 è  O è O j
O è è O

with a , using  ÿ O j , and solving for V


therefore gives the iteration.

O è è O
O O è Oj
O è j è O j
OPEN METHODS
RHAPSON-NEWTON
.METHOD

It involves taking an initial value and from the same


draw tangents to approach the value of the root.
Jumping at the time
to find the root.
The division y Oscillations
zero around a
local
minimum.
O j
O  O è 
Oj Root
neigh orhoods of
a point of
inflection
SECANT METHOD

It is similar to Newton's method, but the derivative is


replaced by a divided difference. The method requires
two points to start iterate.

 Oj Oè O è j
O   O
 Ojè  O è j Part of two initial
values that do not
Quick need to enclose
Converge. the root
With respect to the Newton
Raphson method does not
need to calculate the
derivative analytically.
FIXED POINT
METHOD
Consist in find an x = g (x), analyzing the form of
convergence depending on the clearing has taken place.

Converge
quickly.
No need to
lock the root
To find a solution f an iterative process is performed until the
process converges with the desired accuracy or exceed a maximum
number of iterations (divergent process).
ðIðLIOGRAPHY

= http://html.rincondelvago.com/0003061310.png

= http://www.uv.mx/anmarin/images/puntofijo.gif

You might also like