A cubically convergent class of root finding iterative methods | Zendy

N. A. | Zendy; Hamed Esmaeili | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A cubically convergent class of root finding iterative methods

Author(s) -

N. A.,

Hamed Esmaeili

Publication year - 2014

Publication title -

african journal of mathematics and computer science research

Language(s) - English

Resource type - Journals

ISSN - 2006-9731

DOI - 10.5897/ajmcsr12.036

Subject(s) - mathematics , class (philosophy) , nonlinear system , iterative method , convergence (economics) , local convergence , root finding algorithm , root (linguistics) , function (biology) , derivative (finance) , selection (genetic algorithm) , mathematical analysis , mathematical optimization , computer science , artificial intelligence , linguistics , philosophy , physics , quantum mechanics , evolutionary biology , economics , biology , economic growth , financial economics

In this paper, we propose a new two-parameter class of iterative methods to solve a nonlinear equation. It is proved that any method in this class is cubically convergent if and only if the parameters sum up to one. Some of the existing third-order methods, by suitable selection of parameters, can be put in this class. Every iteration of the class requires an evaluation of the function, three of the first derivative, and none of the second derivative. Hence, its efficiency index is 31/4 = 1.316 that is worse than all other cubically convergent methods considered. However, numerical experiments show that a special method in our class is comparable to those in terms of iterations number. Key words: Nonlinear equations, root finding, iterative method, third-order convergence.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research