Ioannis K. Argyros

dblp:10/495 · DBLP profile ↗
← Back
21ranked-venue papers
14as first author
7since 2021 · last 2026
0000-0002-9189-9298ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 21 · 14 first-author · 7 since 2021
YearPublicationVenuePosition
2026 A high-efficiency fourth-order iterative method for nonlinear equations: Convergence and computational gains
abstract
This study introduces an optimal fourth-order iterative method derived by combining two established methods, resulting in enhanced convergence when solving nonlinear equations. Through rigorous convergence analysis using both Taylor expansion and the Banach space framework, the fourth-order optimality condition is verified. We demonstrate the superior efficiency and stability of this new method compared to traditional alternatives. Numerical experiments confirm its effectiveness, showing a reduction in the average number of iterations and computational time. Visual analysis with polynomiographs confirms the method's robustness, focusing on convergence area index, iteration count, computational time, fractal dimension, and Wada measure of basins. These findings underscore the potential of this optimal method for tackling complex nonlinear problems in various scientific and engineering fields.
Amir Naseem, Krzysztof Gdawiec, Sania Qureshi, Ioannis K. Argyros, Muhammad Aziz ur Rehman, Amanullah Soomro, Evren Hincal, Kamyar Hosseini, Ausif Padder
J. Complex.4
2025 A procedure for increasing the convergence order of iterative methods from p to 5p for solving nonlinear system
Santhosh George, Muniyasamy M, Manjusree Gopal, Chandhini Godavarma, Ioannis K. Argyros
J. Complex.5
2024 On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property
Ioannis K. Argyros, Santhosh George
J. Complex.1
2023 On the complexity of a unified convergence analysis for iterative methods
Ioannis K. Argyros, Stepan Shakhno, Samundra Regmi, Halyna Yarmola
J. Complex.1
2022 Weaker convergence criteria for Traub's method
Ioannis K. Argyros
J. Complex.1
2022 On the complexity of convergence for high order iterative methods
Ioannis K. Argyros, Santhosh George, Christopher I. Argyros
J. Complex.1
2021 On the complexity of extending the convergence ball of Wang's method for finding a zero of a derivative
Hongmin Ren, Ioannis K. Argyros
J. Complex.2
2020 On the complexity of extending the convergence region for Traub's method
Ioannis K. Argyros, Santhosh George
J. Complex.1
2019 Generalized Kung-Traub method and its multi-step iteration in Banach spaces
Janak Raj Sharma, Ioannis K. Argyros
J. Complex.3
2017 Monotone Convergence of Extended Iterative Methods and Fractional Calculus with Applications
abstract
We present monotone convergence results for general iterative methods in order to approximate a solution of a nonlinear equation defined on a partially ordered linear topological space. The main novelty of the paper is that the operators appearing in the iterative method are not necessarily linear. This way we expand of the applicability of iterative methods. Some applications are also provided from fractional calculus using Caputo and Canavati type fractional derivatives and other areas.
George A. Anastassiou, Ioannis K. Argyros
Fundam. Informaticae2
2017 Extended Traub-Woźniakowski convergence and complexity of Newton iteration in Banach space
Ioannis K. Argyros, Gilson N. Silva
J. Complex.1
2016 Newton's method on generalized Banach spaces
abstract
We present a weaker convergence analysis of Newton’s method than in Kantorovich and Akilov (1964), Meyer (1987), Potra and Ptak (1984), Rheinboldt (1978), Traub (1964) on a generalized Banach space setting to approximate a locally unique zero of an operator. This way we extend the applicability of Newton’s method. Moreover, we obtain under the same conditions in the semilocal case weaker sufficient convergence criteria; tighter error bounds on the distances involved and an at least as precise information on the location of the solution. In the local case we obtain a larger radius of convergence and higher error estimates on the distances involved. Numerical examples illustrate the theoretical results.
Ioannis K. Argyros, Ramandeep Behl, Sandile Sydney Motsa
J. Complex.1
2015 Accessibility of solutions of operator equations by Newton-like methods
Daya Ram Sahu, Ravi P. Agarwal, Ioannis K. Argyros
J. Complex.4
2014 Two-step Newton methods
Ángel Alberto Magreñán, Ioannis K. Argyros
J. Complex.2
2013 On the Secant method
Ioannis K. Argyros, Sanjay Kumar Khattri
J. Complex.1
2012 Weaker conditions for the convergence of Newton's method
Ioannis K. Argyros, Saïd Hilout
J. Complex.1
2012 Majorizing sequences for iterative procedures in Banach spaces
Ioannis K. Argyros, Saïd Hilout
J. Complex.1
2011 A unifying theorem for Newton's method on spaces with a convergence structure
Ioannis K. Argyros, Saïd Hilout
J. Complex.1
2010 Improved generalized differentiability conditions for Newton-like methods
Ioannis K. Argyros, Saïd Hilout
J. Complex.1
2010 Inexact Newton-type methods
Ioannis K. Argyros, Saïd Hilout
J. Complex.1
2009 On the weakening of the convergence of Newton's method using recurrent functions
Ioannis K. Argyros, Saïd Hilout
J. Complex.1