Some efficient seventh-order derivative-free families in root-finding
Author(s) -
Fazlollah Soleymani
Publication year - 2012
Publication title -
opuscula mathematica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.481
H-Index - 16
eISSN - 2300-6919
pISSN - 1232-9274
DOI - 10.7494/opmath.2013.33.1.163
Subject(s) - mathematics , order (exchange) , root (linguistics) , derivative (finance) , combinatorics , linguistics , philosophy , finance , financial economics , economics
The interest in efficient root-finding iterations is nowadays growing and influenced by the widespread use of high-speed computers. On the other hand, the calculation of derivatives is often hard, when the problems are formulated in terms of nonlinear equations and as a result, the importance of derivative-free methods emerges. For these reasons, some efficient three-step families of iterations for solving nonlinear equations are suggested, where the analytical proofs show their seventh-order error equations consuming only four function evaluations per iteration. We employ hard numerical test problems to illustrate the accuracy of the new methods from the families
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom