Академический Документы
Профессиональный Документы
Культура Документы
ON
Finding Roots of Non-Linear Programming
By:
Devisharan Tripathi
Sanjay Chudasma
ABSTRACT
The study is aimed at comparing the rate of performance,
the rate of convergence of Bisection method, Newton-
Raphson method and the Secant method of root-finding.
Using this code program, the roots of the equation for the
function f(x)=x-cosx is obtained on the closed interval
[0,1] and the results are compared.
It was observed that the Bisection method converges at
the 52 second iteration while Newton and Secant
methods converge to the exact root of 0.739085 with
error 0.000000 at the 8th and 6th iteration respectively.
It was then concluded that of the three methods
considered, Secant method is the most effective scheme
OBJECTIVE
The objective of this code program is to
compare the implementation of three numerical
methods for the function given and comparing
the results at the same time.
The effective method can be observed out of the
three methods.
The best time can also be observed for find
finding the roots of an equation with the effective
method observed.
In addition, the accuracy level of the output can
also be compared.
FLOWCHARTS
BISECTION METHOD
FLOWCHARTS
NEWTON RAPHSON METHOD
FLOWCHARTS
SECANT METHOD
COMPARISON OF GRAPHS
BISECTION METHOD
COMPARISON OF GRAPHS
NEWTON RAPHSON METHOD
COMPARISON OF GRAPHS
SECANT METHOD
ITERATION TABLE
BISECTION METHOD
ITERATION TABLE
BISECTION METHOD
ITERATION TABLE
BISECTION METHOD