STUDYING THE EFFICIENCY OF ROOT FINDING METHODS
Abstract views: 7
/ 
PDF downloads: 2
Keywords:
Iterative Method, Order of Convergence, Efficiency Index, Root FindingAbstract
Root finding is one of the most significant problems not only of applied mathematics, but also of engineering sciences, physics, finance etc. The implementation of efficient numerical methods to build in functions in different software programs is a task we want to achieve. We possess different groups of methods with sufficiently good convergence order, but as we know the higher the speed is a larger amount of function and derivative evaluations per iteration is needed. The main goal in this paper is the construction of new methods with higher computational efficiency. The comparison will be made by defining the computational efficiency based on the speed of convergence, cost of evaluating the function and its derivatives and the cost of constructing the iterative process. The calculations are made using the symbolic programming language of MATLAB environment.
Downloads
References
Ostrowski A. M., Solution of Equations and Systems of
Equations, Academic Press, New York, 1960.
Traub J. F., Iterative methods for the solution of equations,
Prentice-Hall, Englewood Cliffs, New Jersey, 1964.
Ortega J., M., Rheinboldt W. C., Iterative solution of
nonlinear equations in several variables, Academic Press, New
York, 1970.
McNamee, J. M., Numerical methods for roots of
polynomials, Studies in Computational Mathematics 14,
Elsevier, 2007.
Osada N., An optimal multiple root-finding method of
order three, J. Comput. Appl. Math. 51, 131-133,1994.
Zheng Q., Li J., Huang F., Optimal Steffensen-type
families for solving nonlinear equations, Appl. Math. Comput.
, 2011.
Petkovic M., Neta B., Petkovic L., Dzunic J., Multipoint
methods for solving nonlinear equations: A survey, Appl.
Math. Comput. 226, 2014.
