HIGHER-ORDER FAMILIES OF MULTIPLE ROOT FINDING METHODS SUITABLE FOR NON-CONVERGENT CASES AND THEIR DYNAMICS
Author(s) -
Ramandeep Behl,
V. Kanwar,
Young Ik Kim
Publication year - 2019
Publication title -
mathematical modelling and analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.491
H-Index - 25
eISSN - 1648-3510
pISSN - 1392-6292
DOI - 10.3846/mma.2019.026
Subject(s) - mathematics , root (linguistics) , robustness (evolution) , root finding algorithm , divergence (linguistics) , convergence (economics) , rate of convergence , computer science , nonlinear system , physics , computer network , philosophy , biochemistry , linguistics , chemistry , channel (broadcasting) , quantum mechanics , economics , gene , economic growth
In this paper, we present many new one-parameter families of classical Rall’s method (modified Newton’s method), Schroder’s method, Halley’s method and super-Halley method for the first time which will converge even though the guess is far away from the desired root or the derivative is small in the vicinity of the root and have the same error equations as those of their original methods respectively, for multiple roots. Further, we also propose an optimal family of iterative methods of fourth-order convergence and converging to a required root in a stable manner without divergence, oscillation or jumping problems. All the methods considered here are found to be more effective than the similar robust methods available in the literature. In their dynamical study, it has been observed that the proposed methods have equal or better stability and robustness as compared to the other methods.
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