On the complexity of a unified convergence analysis for iterative methods
From MaRDI portal
Publication:6062168
DOI10.1016/j.jco.2023.101781MaRDI QIDQ6062168
S. M. Shakhno, Ioannis K. Argyros, Halyna Yarmola, Samundra Regmi
Publication date: 30 November 2023
Published in: Journal of Complexity (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient derivative-free numerical methods for solving systems of nonlinear equations
- Simple yet efficient Newton-like method for systems of nonlinear equations
- Ostrowski type methods for solving systems of nonlinear equations
- On the Kurchatov method for solving equations under weak conditions
- Some eighth-order root-finding three-step methods
- Historical developments in convergence analysis for Newton's and Newton-like methods
- An Ostrowski-type method with memory using a novel self-accelerating parameter
- On a two-step optimal Steffensen-type method: relaxed local and semi-local convergence analysis and dynamical stability
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Extended two-step-Kurchatov method for solving Banach space valued nondifferentiable equations
- On the convergence of Kurchatov-type methods using recurrent functions for solving equations
- High-order iterations for systems of nonlinear equations
- Newton’s Method: an Updated Approach of Kantorovich’s Theory
This page was built for publication: On the complexity of a unified convergence analysis for iterative methods