High-order Newton-type iterative methods with memory for solving nonlinear equations
Wang, Xiaofeng ; Zhang, Tie
Mathematical Communications, Tome 19 (2014) no. 1, p. 91-109 / Harvested from Mathematical Communications
In this paper, we present a new family of two-step Newton-type iterative methods with memory for solving nonlinear equations. In order to obtain a Newton-type method with memory, we first present an optimal two-parameter fourth-order Newton-type method without memory. Then, based on the two-parameter method without memory, we present a new two-parameter Newton-type method with memory. Using two self-correcting parameters calculated by Hermite interpolatory polynomials, the R-order of convergence of a new Newton-type method with memory is increased from 4 to 5.7016 without any additional calculations. Numerical comparisons are made with some known methods by using the basins of attraction and through numerical computations to demonstrate the efficiency and the performance of the presented methods.
Publié le : 2014-06-10
Classification:  Newton-type iterative method with memory; Nonlinear equations; R-order convergence; Root-finding,  65H05; 65B99
@article{mc290,
     author = {Wang, Xiaofeng and Zhang, Tie},
     title = {High-order Newton-type iterative methods with memory for solving nonlinear equations},
     journal = {Mathematical Communications},
     volume = {19},
     number = {1},
     year = {2014},
     pages = { 91-109},
     language = {eng},
     url = {http://dml.mathdoc.fr/item/mc290}
}
Wang, Xiaofeng; Zhang, Tie. High-order Newton-type iterative methods with memory for solving nonlinear equations. Mathematical Communications, Tome 19 (2014) no. 1, pp.  91-109. http://gdmltest.u-ga.fr/item/mc290/