In this paper,a new family of eighth-order iterative methods for solving simple roots of nonlinear equations is developed.Each member of the proposed family requires four functional evaluations in each iteration that it is optimal according to the sense of Kung-Traub’s conjecture.They have four self-accelerating parameters that are calculated using the adaptive method.The R-order of convergence has increased from 8 to 16 (maximum improvement).
Torkashvand, V., & Kazemi, M. (2022). The Fastest Three-Step with Memory Method by Four Self-Accelerating Parameters. Global Analysis and Discrete Mathematics, 7(2), 243-263. doi: 10.22128/gadm.2022.682.1092
MLA
Vali Torkashvand; Manochehr Kazemi. "The Fastest Three-Step with Memory Method by Four Self-Accelerating Parameters". Global Analysis and Discrete Mathematics, 7, 2, 2022, 243-263. doi: 10.22128/gadm.2022.682.1092
HARVARD
Torkashvand, V., Kazemi, M. (2022). 'The Fastest Three-Step with Memory Method by Four Self-Accelerating Parameters', Global Analysis and Discrete Mathematics, 7(2), pp. 243-263. doi: 10.22128/gadm.2022.682.1092
VANCOUVER
Torkashvand, V., Kazemi, M. The Fastest Three-Step with Memory Method by Four Self-Accelerating Parameters. Global Analysis and Discrete Mathematics, 2022; 7(2): 243-263. doi: 10.22128/gadm.2022.682.1092
)