.png){kind=icon}
.png){kind=icon}
Return
Modified Jarratt method for computing multiple roots
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.06.031.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a fourth order method for computing multiple roots of nonlinear equations. The method is based on Jarratt scheme for simple roots [P. Jarratt, Some efficient fourth order multipoint methods for solving equations, BIT 9 (1969) 119-124]. The method is optimal, since it requires three evaluations per step, namely one evaluation of function and two evaluations of first derivative. The efficacy is tested on a number of relevant numerical problems. It is observed that the present scheme is competitive with other similar robust methods. (C) 2010 Elsevier Inc. All rights reserved.
Keywords:
Rootfinding
Jarratt method
Multiple roots
Order of convergence
Efficiency
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W