Search Advanced

AIMS Mathematics

2026, Volume 11, Issue 4: 11387-11409. doi: 10.3934/math.2026469
Previous Article Next Article
Research article Special Issues

Development of high-order multistep iterative schemes for nonlinear equations with applications in applied sciences

  • 1.
    Mathematical Modelling and Applied Computation Research Group (MMAC), Department of Mathematics, Faculty of Science, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia
  • 2.
    Department of Computing and Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
  • Published: 23 April 2026

  • MSC : 47J25, 49M15, 65H10, 65G99

  • This article investigates a high-order convergent multistep method for solving nonlinear equations, with particular emphasis on the method's local and semi-local convergence properties in general Banach space settings. Conventional convergence analyses typically rely on Taylor series expansions and require the computation of higher-order derivatives, which are not part of the method. Such schemes may be costly, impractical, or nonexistent and are restricted to Euclidean spaces of finite dimension. Other constraints of such analyses involve the absence of a priori error estimates as well as uniqueness of the solution results. This is why, in this article, the convergence is established using only the operators of the method in combination with the concept of generalized continuity required to control the derivative. This is how the applicability of the method is extended. Due to its generality the same methodology is applicable to other methods. Numerical examples are provided to support and illustrate the theoretical findings.

    Citation: Ramandeep Behl, Ioannis K. Argyros, Hashim Alshehri, Majed M. Alotaibi. Development of high-order multistep iterative schemes for nonlinear equations with applications in applied sciences[J]. AIMS Mathematics, 2026, 11(4): 11387-11409. doi: 10.3934/math.2026469

    Related Papers:

  • This article investigates a high-order convergent multistep method for solving nonlinear equations, with particular emphasis on the method's local and semi-local convergence properties in general Banach space settings. Conventional convergence analyses typically rely on Taylor series expansions and require the computation of higher-order derivatives, which are not part of the method. Such schemes may be costly, impractical, or nonexistent and are restricted to Euclidean spaces of finite dimension. Other constraints of such analyses involve the absence of a priori error estimates as well as uniqueness of the solution results. This is why, in this article, the convergence is established using only the operators of the method in combination with the concept of generalized continuity required to control the derivative. This is how the applicability of the method is extended. Due to its generality the same methodology is applicable to other methods. Numerical examples are provided to support and illustrate the theoretical findings.



    加载中


    [1] I. K. Argyros The theory and application of iteration methods, CRC Press, 2022. https://doi.org/10.1201/9781003128915
    [2] I. K. Argyros, S. Shakhno, Extending the applicability of two-step solvers for solving equations, Mathematics, 7 (2019), 62. https://doi.org/10.3390/math7010062 doi: 10.3390/math7010062
    [3] I. K. Argyros, S. Shakhno, H. Yarmolas, Two-step solver for nonlinear equations, Symmetry, 11 (2019), 128. https://doi.org/10.3390/sym11020128 doi: 10.3390/sym11020128
    [4] A. Cordero, J. R. Torregrosa, Variants of Newton's method using fifth-order quadrature formulas, Appl. Math. Comput., 190 (2007), 696–698. https://doi.org/10.1016/j.amc.2007.01.062 doi: 10.1016/j.amc.2007.01.062
    [5] M. Grau-Sanchez, A. Grau, M. Nogueira, On the computational efficiency index and some iterative methods for solving systems of nonlinear equations, J. Comput. Appl. Math., 236 (2011), 1259–1266. https://doi.org/10.1016/j.cam.2011.08.008 doi: 10.1016/j.cam.2011.08.008
    [6] H. H. H. Homeier, On Newton-type methods with cubic convergence, J. Comput. Appl. Math., 176 (2005), 425–432. https://doi.org/10.1016/j.cam.2004.07.027 doi: 10.1016/j.cam.2004.07.027
    [7] P. Jarratt, Some efficient fourth order multipoint methods for solving equations, BIT, 9 (1969), 119–124. https://doi.org/10.1007/BF0193324 doi: 10.1007/BF0193324
    [8] J. Kou, Y. Li, X. Wang, Some modification of Newton's method with fifth-order convergence, J. Comput. Appl. Math., 209 (2007), 146–152. https://doi.org/10.1016/j.cam.2006.10.072 doi: 10.1016/j.cam.2006.10.072
    [9] M. A. Noor, M. Waseem, Some iterative methods for solving a system of nonlinear equations, Comput. Math. Appl., 57 (2009), 101–106. https://doi.org/10.1016/j.camwa.2008.10.067 doi: 10.1016/j.camwa.2008.10.067
    [10] M. Ortega, V.V., Rheinboldt, Iterative solutions of nonlinear equations in several variables, New York: Academic Press, 1970.
    [11] J. R. Sharma, H. Arora, Efficient Jarratt-like methods for solving systems of nonlinear equations, Calcolo, 51 (2014), 193–210. https://doi.org/10.1007/s10092-013-0097-1 doi: 10.1007/s10092-013-0097-1
    [12] J. R. Sharma, R. K. Guha, R. Sharma, An efficient fourth order weighted-newton method for systems of nonlinear equations, Numer. Algor., 62 (2013), 307–323. https://doi.org/10.1007/s11075-012-9585-7 doi: 10.1007/s11075-012-9585-7
    [13] J. R. Sharma, P. Gupta, An efficient fifth order method for solving systems of nonlinear equations, Comput. Math. Appl., 67 (2014), 591–601. https://doi.org/10.1016/j.camwa.2013.12.004 doi: 10.1016/j.camwa.2013.12.004
    [14] X. Y. Xiao, H. W. Yin, Increasing the order of convergence for iterative methods to solve nonlinear systems, Calcolo, 53 (2016), 285–300. https://doi.org/10.1007/s10092-015-0149-9 doi: 10.1007/s10092-015-0149-9
    [15] X.Y. Xiao, H. W. Yin, Achieving higher order of convergence for solving systems of nonlinear equations, Appl. Math. Comput., 311 (2017), 251–261. https://doi.org/10.1016/j.amc.2017.05.033 doi: 10.1016/j.amc.2017.05.033
    [16] X. Y. Xiao, H. W. Yin, Accelerating the convergence speed of iterative methods for solving nonlinear systems, Appl. Math. Comput., 333 (2018), 8–19. https://doi.org/10.1016/j.amc.2018.03.108 doi: 10.1016/j.amc.2018.03.108
    [17] E. G. Villalba, M. Hernandez, J. L. Hueso, E. Martínez, Using decomposition of the nonlinear operator for solving non‐differentiable problems, Math. Method. Appl. Sci., 48 (2025), 7987–8006. https://doi.org/10.1002/mma.9455 doi: 10.1002/mma.9455
    [18] M. Grau-Sánchez, A. Grau, M. Noguera, Ostrowski type methods for solving systems of nonlinear equations, Appl. Math. Comput., 218 (2011), 2377–2385. https://doi.org/10.1016/j.amc.2011.08.011 doi: 10.1016/j.amc.2011.08.011
    [19] H. Sharma, R. Behl, M. Kansal, H. Ramos, A robust iterative family for multiple roots of nonlinear equations: Enhancing accuracy and handling critical points, J. Comput. Appl. Math., 444 (2024), 115795. https://doi.org/10.1016/j.cam.2024.115795 doi: 10.1016/j.cam.2024.115795
    [20] I. K. Argyros, K. Gdawiec, S. Qureshi, A. Soomro, E. Hincal, S. Regmi, Local and semi-local convergence and dynamic analysis of a time-efficient nonlinear technique, Appl. Numer. Math., 201 (2024), 446–464. https://doi.org/10.1016/j.apnum.2024.03.022 doi: 10.1016/j.apnum.2024.03.022
    [21] S. Qureshi, I. K. Argyros, A. Soomro, K. Gdawiec, A. A. Shaikh, E. Hincal, A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography, Numer. Algor., 95 (2024), 1715–1745. https://doi.org/10.1007/s11075-023-01625-7 doi: 10.1007/s11075-023-01625-7
    [22] R. Erfanifar, M. Hajarian, A new multi-step method for solving nonlinear systems with high efficiency indices, Numer. Algor., 97 (2024), 959–984. https://doi.org/10.1007/s11075-023-01735-2 doi: 10.1007/s11075-023-01735-2
    [23] M. Kumar, A. Jhinga, V. Daftardar-Gejji, New algorithm for solving non-linear functional equations, Int. J. Appl. Comput. Math., 6 (2020), 26. https://doi.org/10.1007/s40819-020-0774-0 doi: 10.1007/s40819-020-0774-0
    [24] K. Gdawiec, W. Kotarski, A. Lisowska, On the robust Newton's method with the Mann iteration and the artistic patterns from its dynamics, Nonlinear Dyn., 104 (2021), 297–331. https://doi.org/10.1007/s11071-021-06306-5 doi: 10.1007/s11071-021-06306-5
    [25] A. Naseem, M. A. Rehman, S. Qureshi, N. A. D. Ide, Graphical and numerical study of a newly developed root-finding algorithm and its engineering applications, IEEE Access, 11 (2023), 2375–2383. https://doi.org/10.1109/ACCESS.2023.3234111 doi: 10.1109/ACCESS.2023.3234111
    [26] A. Cordero, J. L. Hueso, E. Martínez, J. R. Torregrosa, Increasing the convergence order of an iterative method for nonlinear systems, Appl. Math. Lett., 25 (2012), 2369–2374. https://doi.org/10.1016/j.aml.2012.07.005 doi: 10.1016/j.aml.2012.07.005
    [27] J. R. Sharma, H. Arora, Efficient Jarratt-like methods for solving systems of nonlinear equations, Calcolo, 51 (2014), 193–210. https://doi.org/10.1007/s10092-013-0097-1 doi: 10.1007/s10092-013-0097-1
    [28] R. Behl, A. Cordero, S. S. Motsa, J. R. Torregrosa, Stable high-order iterative methods for solving nonlinear models, Appl. Math. Comput., 303 (2017), 70–88. https://doi.org/10.1016/j.amc.2017.01.029 doi: 10.1016/j.amc.2017.01.029
  • Reader Comments
  • © 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
AIMS Mathematics
1.8 3.1

Metrics

Article views(140) PDF downloads(19) Cited by(0)

Preview PDF
Download XML
Export Citation
Article outline

Figures and Tables

Tables(6)

Other Articles By Authors

Related pages

Tools

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog