An optimal multiple root-finding method of order three
Journal of Computational and Applied Mathematics
Modified Newton's method with third-order convergence and multiple roots
Journal of Computational and Applied Mathematics
High-order nonlinear solver for multiple roots
Computers & Mathematics with Applications
Extension of Murakami's high-order non-linear solver to multiple roots
International Journal of Computer Mathematics
Some fourth-order nonlinear solvers with closed formulae for multiple roots
Computers & Mathematics with Applications
Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
Computers & Mathematics with Applications
A new third-order family of nonlinear solvers for multiple roots
Computers & Mathematics with Applications
Fifth-order iterative method for finding multiple roots of nonlinear equations
Numerical Algorithms
Hi-index | 0.09 |
In this paper, we present two new families of iterative methods for multiple roots of nonlinear equations. One of the families require one-function and two-derivative evaluation per step, and the other family requires two-function and one-derivative evaluation. It is shown that both are third-order convergent for multiple roots. Numerical examples suggest that each family member can be competitive to other third-order methods and Newton's method for multiple roots. In fact the second family is even better than the first.