SlideShare uma empresa Scribd logo
1 de 37
Numerical Analysis
Roots of equations (Theory & problems)Roots of equations (Theory & problems)
Years ago , we learn to use the
cuadratic formula to solve F(x).
The values calculated with this
equation are called the ‘’roots’’.
They represents the values of x
that make f(x) equal to zero.
Thus we can define the roots of
an equation as the value of x
that makes f(x)=0. For this
reason , roots are sometimes
called the zeros of the equation
• A root or solution of equation f(x)=0 are
the values of x for which the equation
holds true. Sometimes roots of equations
are called the zeros of the equation.
• Numerical methods for finding roots of
equations can often be easily
programmed.
ROOTS OF EQUATIONS
Classification
 1. GRAPHICAL METHOD
It is a simple method to obtain an
approximation to the equation root f(x) =0.
It consists of to plot the function and
determine where it crosses the x-axis. At
this point, which represents the x value where
f(x) =0, offer an initial approximation of the
root.The graphical method is necessary to use
any method to find roots, due to it allows us to
have a value or a domain values in which the
function will be evaluated, due to these will be
next to the root. Likewise, with this method we
can indentify if the function has several roots.
2. CLOSED
METHODS
These are called closed methods because
are necessary two initial values to the
root, which should “enclose” or to be to
the both root sides. The key feature of
these methods is that we evaluate a
domain or range in which values are close
to
the function root; these methods are
known as convergent. Within the closed
methods are the following methods:
The bisection method, which is alternatively called binary chopping,
interval halving, or Bolzano's method, is one type of incremental search
method in which the interval is always divided in half. If a function changes
sign over interval, the function value at the midpoint is evaluated. The
location of the root is then determinate as lying at the midpoint of the
subinternal within which the sign change occurs .The process is repeated
to obtain refined estimates.
A simple algorithm for the calculation is shown in the figure ( CHAPRA,
source information)
THE FALSE-POSITION METHOD
 “An alternative method that exploits tis graphical insight is to
join f(xi) and f(xu) by a straight line. The intersection of this
line with the x axis represents an improved estimate of the
root. The fact that the replacement of the curve by a straight
line gives a “false position”. Source: CHAPRA, numerical methods for
engineers.
The intersection of the line with the x axis can be estimated
as
Source: Internet
Although bisection is a perfectly valid technique for determining roots, its
‘’brute-force’’ approach is relatively inefficient . False position is an
alternative based on a graphical insight.
A shortcoming of the bisection methods is that , in dividing the interval
from xl to xa into equal halves, no account is taken of the magnitudes of
f(xl) and F(xa).
For example f(xl) is much closer to zero than f(xa), it is likely that the root
is closer to xl than to xa.
An alternative method that exploits this graphical insight is to join f(xl) and
F(xa) by a straight line
The fact that the replacement of the curve by a straight line gives a false
position of the root is the origin of the name, method of false position, it is
also called the liner interpolation method
• Another option to find this roots is to
incorporate an incremental search at the
beginning of the computer program. This
method consist in taking one end of the
region of interest and then evaluate the
function at small increments across the
region. The point is: When the function
changes the sign this mean that in that
point there is a root.
INCREMENTAL SEARCHES
A simple method for obtaining an
estimate of the root of the equation
f(x)=0 is to make a plot of the function
and observe where it crosses the x
axis. this point which represents the x
value for which f(x)=0, provides a rough
approximation of the root
Graphical techniques are of limited
practical value because they are not
precise. However, graphical methods
can be utilized to obtain rough
estimates of roots.
• Solution: You have to build a chart with values of x and
f(x), trying to get a crossing with the x-axis.
GRAPHICAL METHODS
Root Root
So we can see that there are two roots, one is
approximately -2 and the other is approximately 6.
Cases where roots could be missed because the increment length of the search
procedure is too large. note that the last root on the right is multiple and would be
missed regardless of increment length
INCREMENTAL SEARCHES AND DETERMINING
INITINAL GUESSE
 Another option to determinate all possible root is incorporate
an incremental search at the beginning of the computer
program. This consists of starting at one end of the region of
interest and then making function evaluations at small
increments across the region. When the function changes sign,
it is assumed that the root falls within the increment.
 A potential problem with an incremental search is the choice
of the incremental 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 space roots might
be missed . The problem is compounded by the possible
existence of multiple roots. A partial remedy for such cases is
to computed the first derivate changes sign, it suggests that a
minimum or maximum may have occurred and the interval
should be examined more closely for the existence of a
possible root
OPEN METHODS
• To rearrange the function f(x)=0
• x=g(x)
SIMPLE FIXED-POINT ITERATION
THE NEWTON RAPHSON METHOD
Perhaps the most widely use of all root- locating formulas is
the Newton – Raphson equation . if the initial guess at the
root is xi , a tangent can be extended from the point ( xi, f(xi)).
the point where this tangent crosses the x axis usually
represents an improved estimate of the root
• If the initial guess at the root is xi, a
tangent can be extended from the point
{xi,x(xi)}. The point where this tangent
crosses the x axis usaually represents an
improved estimate of the root.
• The Newton-Raphson formula is:
THE NEWTON-RAPHSON
METHOD
The Newton-Raphson method
can be derived on the basis
on the basis of this
geometrical interpretation.,
the first derivative at x is
equivalent to slope:
Which cab be
rearranged to yield
Newton – Raphson
formula
Graphical depiction of the secant method. This technique is similar to the
Newton-Raphson .technique in the sense that an estimate of the root is
predicted by extrapolating a tangent of the function to the x axis . However ,
The secant method uses a difference rather than a derivative to estimate the
slope
• In the Secant method the derivative is approximated by
a backward finite divided difference.
• This approximation can be substituted with the following
iterative equation:
THE SECANT METHOD
The difference between the secant method and the false
position method is how one of the initial values is replaced
by the new estimate
A multiple root corresponds to a point where a function is
tangent to the x axis. For example, a double root results from
The equation has a double root because one value of x
makes two terms in 1st
equation equal to zero. Graphically,
this corresponds to the curve touching the x axis tangentially
at the double root. Examine Fig 6.10a at x=1. Notice that the
function touches the axis but does not cross it at the root.
A triple root corresponds to the case where one x value
makes three terms in a equation equal to zero as in
Notice that the graphical depiction ( fig6.10B) again indicates
that the function is tangent to the axis at the root , but that for
this case the axis is crossed. In general, odd multiplied roots
cross the axis, whereas even ones do not. For example, the
quadruple root in fig 6.10c does not cross the axis
PROBLEM
step
xi-1 xi
f(xi-1) f(xi)
xi+1
1 2 3 -1 16 2.05882
2 3 2.05882 16 -0.3908 2.08126
3 2.05882 2.08126 -0.3908 -0.1472 2.09482
2.09482 is correct up to three decimal points
PROBLEM
step
xi-1 xi
f(xi-1) f(xi)
xi+1
1 0 1 -1 0.6321 0.6127
2 1 0.6127 0.632 0.0708 0.5638
3 0.6127 0.5638 0.0708 -0.0052 0.5672
0.5672 is correct up to three decimal points
PROBLEM
step i=0,1,2….. xi xi+1
1 x0 1 0.6839397
2 x1 0.6839397 0.5774545
3 x2 0.5774545 0.5672297
4 x3 0.5672297 0.5671433
0.5671433 is correct up to five decimal points
 Find a real root of the equation:
 Xsinx+cosx=0
 f(x)=Xsinx+cosx
 f’(x)= xcosx+sinx-sinx = xcosx
 xi+1 =xi-{(Xisinxi+cosxi)/ xcosxi}
PROBLEM
solution
 Using NR method:
step i=0,1,2….. xi xi+1
1 x0 3.1416 2.8233
2 x1 2.8233 2.7986
3 x2 2.7986 2.7984
4 x3 2.7984 2.7984
2.7984 is the root of the equation
PROBLEM
 Using Bisection method:
solution
0.5672 is correct up to three decimal points
PROBLEM
solution
1.3203125 is correct up to two decimal points
PROBLEM
solution
step xi xu
Xr= xu-{f(xu)(xi-
xu)/f(xi)-f(xu)}
Sign of
f(xi)
Sign of
f(xr)
Sign of
f(xi) f(xr)
1 2 1 1.33
+ - -
2 2 1.33 1.399
+ - -
3 2 1.399 1.412 + - -
1.412 is correct up to two decimal points
 Introduction Method of Numerical Analysis
(S.S Sastry) Page: 22-72
 Numerical methods for engineers ( Steven c.
Chapra, Raymond p. canale) page: 124-54
Reference
Reference
http://www.sosmath.com/algebra/quadraticeq
/root/root.html
http://www.algebra.com/algebra/homework/Average/A
verage.faq.question.1129.html
http://www.thefreedictionary.com/Root
+of+an+equation
THE END
THANK YOU FOR BEING WITH
US

Mais conteúdo relacionado

Mais procurados

Numerical Analysis (Solution of Non-Linear Equations) part 2
Numerical Analysis (Solution of Non-Linear Equations) part 2Numerical Analysis (Solution of Non-Linear Equations) part 2
Numerical Analysis (Solution of Non-Linear Equations) part 2Asad Ali
 
Bisection & Regual falsi methods
Bisection & Regual falsi methodsBisection & Regual falsi methods
Bisection & Regual falsi methodsDivya Bhatia
 
Newton raphson method
Newton raphson methodNewton raphson method
Newton raphson methodJayesh Ranjan
 
Partial differential equations
Partial differential equationsPartial differential equations
Partial differential equationsaman1894
 
First order non-linear partial differential equation & its applications
First order non-linear partial differential equation & its applicationsFirst order non-linear partial differential equation & its applications
First order non-linear partial differential equation & its applicationsJayanshu Gundaniya
 
System Of Linear Equations
System Of Linear EquationsSystem Of Linear Equations
System Of Linear Equationssaahil kshatriya
 
Presentation on Numerical Method (Trapezoidal Method)
Presentation on Numerical Method (Trapezoidal Method)Presentation on Numerical Method (Trapezoidal Method)
Presentation on Numerical Method (Trapezoidal Method)Syed Ahmed Zaki
 
03 convexfunctions
03 convexfunctions03 convexfunctions
03 convexfunctionsSufyan Sahoo
 
Numerical Methods: curve fitting and interpolation
Numerical Methods: curve fitting and interpolationNumerical Methods: curve fitting and interpolation
Numerical Methods: curve fitting and interpolationNikolai Priezjev
 
Application of definite integrals
Application of definite integralsApplication of definite integrals
Application of definite integralsVaibhav Tandel
 
Higher order ODE with applications
Higher order ODE with applicationsHigher order ODE with applications
Higher order ODE with applicationsPratik Gadhiya
 
Solution of non-linear equations
Solution of non-linear equationsSolution of non-linear equations
Solution of non-linear equationsZunAib Ali
 

Mais procurados (20)

Numerical Analysis (Solution of Non-Linear Equations) part 2
Numerical Analysis (Solution of Non-Linear Equations) part 2Numerical Analysis (Solution of Non-Linear Equations) part 2
Numerical Analysis (Solution of Non-Linear Equations) part 2
 
Bisection method
Bisection methodBisection method
Bisection method
 
Bisection & Regual falsi methods
Bisection & Regual falsi methodsBisection & Regual falsi methods
Bisection & Regual falsi methods
 
Newton Raphson
Newton RaphsonNewton Raphson
Newton Raphson
 
Newton raphson method
Newton raphson methodNewton raphson method
Newton raphson method
 
Partial differential equations
Partial differential equationsPartial differential equations
Partial differential equations
 
First order non-linear partial differential equation & its applications
First order non-linear partial differential equation & its applicationsFirst order non-linear partial differential equation & its applications
First order non-linear partial differential equation & its applications
 
System Of Linear Equations
System Of Linear EquationsSystem Of Linear Equations
System Of Linear Equations
 
Bracketing Methods
Bracketing MethodsBracketing Methods
Bracketing Methods
 
Presentation on Numerical Method (Trapezoidal Method)
Presentation on Numerical Method (Trapezoidal Method)Presentation on Numerical Method (Trapezoidal Method)
Presentation on Numerical Method (Trapezoidal Method)
 
Linear programming ppt
Linear programming pptLinear programming ppt
Linear programming ppt
 
03 convexfunctions
03 convexfunctions03 convexfunctions
03 convexfunctions
 
Fourier series 1
Fourier series 1Fourier series 1
Fourier series 1
 
Chapter 17 - Multivariable Calculus
Chapter 17 - Multivariable CalculusChapter 17 - Multivariable Calculus
Chapter 17 - Multivariable Calculus
 
Numerical Methods: curve fitting and interpolation
Numerical Methods: curve fitting and interpolationNumerical Methods: curve fitting and interpolation
Numerical Methods: curve fitting and interpolation
 
Application of definite integrals
Application of definite integralsApplication of definite integrals
Application of definite integrals
 
Higher order ODE with applications
Higher order ODE with applicationsHigher order ODE with applications
Higher order ODE with applications
 
Solution of non-linear equations
Solution of non-linear equationsSolution of non-linear equations
Solution of non-linear equations
 
simplex method
simplex methodsimplex method
simplex method
 
Introduction of Partial Differential Equations
Introduction of Partial Differential EquationsIntroduction of Partial Differential Equations
Introduction of Partial Differential Equations
 

Semelhante a Roots of equations

Chapter 3: Roots of Equations
Chapter 3: Roots of EquationsChapter 3: Roots of Equations
Chapter 3: Roots of EquationsMaria Fernanda
 
Numerical Study of Some Iterative Methods for Solving Nonlinear Equations
Numerical Study of Some Iterative Methods for Solving Nonlinear EquationsNumerical Study of Some Iterative Methods for Solving Nonlinear Equations
Numerical Study of Some Iterative Methods for Solving Nonlinear Equationsinventionjournals
 
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...Stephen Faucher
 
Roots of equations
Roots of equationsRoots of equations
Roots of equationsMileacre
 
Equations root
Equations rootEquations root
Equations rootMileacre
 
Roots of equations
Roots of equationsRoots of equations
Roots of equationsMileacre
 
Newton cotes integration method
Newton cotes integration  methodNewton cotes integration  method
Newton cotes integration methodshashikant pabari
 
Newton paper.docx
Newton  paper.docxNewton  paper.docx
Newton paper.docxnitmor1
 
B02110105012
B02110105012B02110105012
B02110105012theijes
 
The International Journal of Engineering and Science (The IJES)
 The International Journal of Engineering and Science (The IJES) The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)theijes
 
83662164 case-study-1
83662164 case-study-183662164 case-study-1
83662164 case-study-1homeworkping3
 

Semelhante a Roots of equations (20)

Chapter 3: Roots of Equations
Chapter 3: Roots of EquationsChapter 3: Roots of Equations
Chapter 3: Roots of Equations
 
Roots equation
Roots equationRoots equation
Roots equation
 
Roots equation
Roots equationRoots equation
Roots equation
 
Numerical Study of Some Iterative Methods for Solving Nonlinear Equations
Numerical Study of Some Iterative Methods for Solving Nonlinear EquationsNumerical Study of Some Iterative Methods for Solving Nonlinear Equations
Numerical Study of Some Iterative Methods for Solving Nonlinear Equations
 
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...
 
Roots of equations
Roots of equationsRoots of equations
Roots of equations
 
Equations root
Equations rootEquations root
Equations root
 
Chapter 3
Chapter 3Chapter 3
Chapter 3
 
Roots of equations
Roots of equationsRoots of equations
Roots of equations
 
Chapter 3 roots of equations
Chapter 3 roots of equationsChapter 3 roots of equations
Chapter 3 roots of equations
 
Chapter 2 roots of equations
Chapter 2 roots of equationsChapter 2 roots of equations
Chapter 2 roots of equations
 
Chapter 3 roots of equations
Chapter 3 roots of equationsChapter 3 roots of equations
Chapter 3 roots of equations
 
Chapter 3 roots of equations
Chapter 3 roots of equationsChapter 3 roots of equations
Chapter 3 roots of equations
 
Newton cotes integration method
Newton cotes integration  methodNewton cotes integration  method
Newton cotes integration method
 
Newton paper.docx
Newton  paper.docxNewton  paper.docx
Newton paper.docx
 
Secant method
Secant methodSecant method
Secant method
 
B02110105012
B02110105012B02110105012
B02110105012
 
The International Journal of Engineering and Science (The IJES)
 The International Journal of Engineering and Science (The IJES) The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)
 
Es272 ch3a
Es272 ch3aEs272 ch3a
Es272 ch3a
 
83662164 case-study-1
83662164 case-study-183662164 case-study-1
83662164 case-study-1
 

Último

Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Dr.Costas Sachpazis
 
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130Suhani Kapoor
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINESIVASHANKAR N
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Call Girls in Nagpur High Profile
 
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICSAPPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICSKurinjimalarL3
 
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escortsranjana rawat
 
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)Suman Mia
 
Porous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingPorous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingrakeshbaidya232001
 
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).pptssuser5c9d4b1
 
result management system report for college project
result management system report for college projectresult management system report for college project
result management system report for college projectTonystark477637
 
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130Suhani Kapoor
 
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...Soham Mondal
 
UNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular ConduitsUNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular Conduitsrknatarajan
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...ranjana rawat
 
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur EscortsCall Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
College Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service NashikCollege Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service NashikCall Girls in Nagpur High Profile
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escortsranjana rawat
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Christo Ananth
 
Microscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxMicroscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxpurnimasatapathy1234
 

Último (20)

Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
 
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
 
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICSAPPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
 
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
 
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)
 
Porous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingPorous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writing
 
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
 
result management system report for college project
result management system report for college projectresult management system report for college project
result management system report for college project
 
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
 
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
 
UNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular ConduitsUNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular Conduits
 
★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR
★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR
★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
 
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur EscortsCall Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
 
College Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service NashikCollege Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
 
Microscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxMicroscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptx
 

Roots of equations

  • 1. Numerical Analysis Roots of equations (Theory & problems)Roots of equations (Theory & problems)
  • 2. Years ago , we learn to use the cuadratic formula to solve F(x). The values calculated with this equation are called the ‘’roots’’. They represents the values of x that make f(x) equal to zero. Thus we can define the roots of an equation as the value of x that makes f(x)=0. For this reason , roots are sometimes called the zeros of the equation
  • 3. • A root or solution of equation f(x)=0 are the values of x for which the equation holds true. Sometimes roots of equations are called the zeros of the equation. • Numerical methods for finding roots of equations can often be easily programmed. ROOTS OF EQUATIONS
  • 4. Classification  1. GRAPHICAL METHOD It is a simple method to obtain an approximation to the equation root f(x) =0. It consists of to plot the function and determine where it crosses the x-axis. At this point, which represents the x value where f(x) =0, offer an initial approximation of the root.The graphical method is necessary to use any method to find roots, due to it allows us to have a value or a domain values in which the function will be evaluated, due to these will be next to the root. Likewise, with this method we can indentify if the function has several roots.
  • 5. 2. CLOSED METHODS These are called closed methods because are necessary two initial values to the root, which should “enclose” or to be to the both root sides. The key feature of these methods is that we evaluate a domain or range in which values are close to the function root; these methods are known as convergent. Within the closed methods are the following methods:
  • 6. The bisection method, which is alternatively called binary chopping, interval halving, or Bolzano's method, is one type of incremental search method in which the interval is always divided in half. If a function changes sign over interval, the function value at the midpoint is evaluated. The location of the root is then determinate as lying at the midpoint of the subinternal within which the sign change occurs .The process is repeated to obtain refined estimates.
  • 7. A simple algorithm for the calculation is shown in the figure ( CHAPRA, source information)
  • 8. THE FALSE-POSITION METHOD  “An alternative method that exploits tis graphical insight is to join f(xi) and f(xu) by a straight line. The intersection of this line with the x axis represents an improved estimate of the root. The fact that the replacement of the curve by a straight line gives a “false position”. Source: CHAPRA, numerical methods for engineers. The intersection of the line with the x axis can be estimated as Source: Internet
  • 9.
  • 10. Although bisection is a perfectly valid technique for determining roots, its ‘’brute-force’’ approach is relatively inefficient . False position is an alternative based on a graphical insight. A shortcoming of the bisection methods is that , in dividing the interval from xl to xa into equal halves, no account is taken of the magnitudes of f(xl) and F(xa). For example f(xl) is much closer to zero than f(xa), it is likely that the root is closer to xl than to xa. An alternative method that exploits this graphical insight is to join f(xl) and F(xa) by a straight line The fact that the replacement of the curve by a straight line gives a false position of the root is the origin of the name, method of false position, it is also called the liner interpolation method
  • 11. • Another option to find this roots is to incorporate an incremental search at the beginning of the computer program. This method consist in taking one end of the region of interest and then evaluate the function at small increments across the region. The point is: When the function changes the sign this mean that in that point there is a root. INCREMENTAL SEARCHES
  • 12. A simple method for obtaining an estimate of the root of the equation f(x)=0 is to make a plot of the function and observe where it crosses the x axis. this point which represents the x value for which f(x)=0, provides a rough approximation of the root Graphical techniques are of limited practical value because they are not precise. However, graphical methods can be utilized to obtain rough estimates of roots.
  • 13. • Solution: You have to build a chart with values of x and f(x), trying to get a crossing with the x-axis. GRAPHICAL METHODS Root Root So we can see that there are two roots, one is approximately -2 and the other is approximately 6.
  • 14. Cases where roots could be missed because the increment length of the search procedure is too large. note that the last root on the right is multiple and would be missed regardless of increment length
  • 15. INCREMENTAL SEARCHES AND DETERMINING INITINAL GUESSE  Another option to determinate all possible root is incorporate an incremental search at the beginning of the computer program. This consists of starting at one end of the region of interest and then making function evaluations at small increments across the region. When the function changes sign, it is assumed that the root falls within the increment.  A potential problem with an incremental search is the choice of the incremental 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 space roots might be missed . The problem is compounded by the possible existence of multiple roots. A partial remedy for such cases is to computed the first derivate changes sign, it suggests that a minimum or maximum may have occurred and the interval should be examined more closely for the existence of a possible root
  • 17. • To rearrange the function f(x)=0 • x=g(x) SIMPLE FIXED-POINT ITERATION
  • 18. THE NEWTON RAPHSON METHOD Perhaps the most widely use of all root- locating formulas is the Newton – Raphson equation . if the initial guess at the root is xi , a tangent can be extended from the point ( xi, f(xi)). the point where this tangent crosses the x axis usually represents an improved estimate of the root
  • 19. • If the initial guess at the root is xi, a tangent can be extended from the point {xi,x(xi)}. The point where this tangent crosses the x axis usaually represents an improved estimate of the root. • The Newton-Raphson formula is: THE NEWTON-RAPHSON METHOD
  • 20. The Newton-Raphson method can be derived on the basis on the basis of this geometrical interpretation., the first derivative at x is equivalent to slope: Which cab be rearranged to yield Newton – Raphson formula
  • 21. Graphical depiction of the secant method. This technique is similar to the Newton-Raphson .technique in the sense that an estimate of the root is predicted by extrapolating a tangent of the function to the x axis . However , The secant method uses a difference rather than a derivative to estimate the slope
  • 22. • In the Secant method the derivative is approximated by a backward finite divided difference. • This approximation can be substituted with the following iterative equation: THE SECANT METHOD The difference between the secant method and the false position method is how one of the initial values is replaced by the new estimate
  • 23. A multiple root corresponds to a point where a function is tangent to the x axis. For example, a double root results from The equation has a double root because one value of x makes two terms in 1st equation equal to zero. Graphically, this corresponds to the curve touching the x axis tangentially at the double root. Examine Fig 6.10a at x=1. Notice that the function touches the axis but does not cross it at the root. A triple root corresponds to the case where one x value makes three terms in a equation equal to zero as in Notice that the graphical depiction ( fig6.10B) again indicates that the function is tangent to the axis at the root , but that for this case the axis is crossed. In general, odd multiplied roots cross the axis, whereas even ones do not. For example, the quadruple root in fig 6.10c does not cross the axis
  • 24. PROBLEM step xi-1 xi f(xi-1) f(xi) xi+1 1 2 3 -1 16 2.05882 2 3 2.05882 16 -0.3908 2.08126 3 2.05882 2.08126 -0.3908 -0.1472 2.09482 2.09482 is correct up to three decimal points
  • 25. PROBLEM step xi-1 xi f(xi-1) f(xi) xi+1 1 0 1 -1 0.6321 0.6127 2 1 0.6127 0.632 0.0708 0.5638 3 0.6127 0.5638 0.0708 -0.0052 0.5672 0.5672 is correct up to three decimal points
  • 26. PROBLEM step i=0,1,2….. xi xi+1 1 x0 1 0.6839397 2 x1 0.6839397 0.5774545 3 x2 0.5774545 0.5672297 4 x3 0.5672297 0.5671433 0.5671433 is correct up to five decimal points
  • 27.  Find a real root of the equation:  Xsinx+cosx=0  f(x)=Xsinx+cosx  f’(x)= xcosx+sinx-sinx = xcosx  xi+1 =xi-{(Xisinxi+cosxi)/ xcosxi} PROBLEM
  • 28. solution  Using NR method: step i=0,1,2….. xi xi+1 1 x0 3.1416 2.8233 2 x1 2.8233 2.7986 3 x2 2.7986 2.7984 4 x3 2.7984 2.7984 2.7984 is the root of the equation
  • 30.  Using Bisection method: solution 0.5672 is correct up to three decimal points
  • 32. solution 1.3203125 is correct up to two decimal points
  • 34. solution step xi xu Xr= xu-{f(xu)(xi- xu)/f(xi)-f(xu)} Sign of f(xi) Sign of f(xr) Sign of f(xi) f(xr) 1 2 1 1.33 + - - 2 2 1.33 1.399 + - - 3 2 1.399 1.412 + - - 1.412 is correct up to two decimal points
  • 35.  Introduction Method of Numerical Analysis (S.S Sastry) Page: 22-72  Numerical methods for engineers ( Steven c. Chapra, Raymond p. canale) page: 124-54 Reference
  • 37. THE END THANK YOU FOR BEING WITH US