A New Three-Step Root-Finding Numerical Method and Its Fractal Global Behavior

被引:14
|
作者
Tassaddiq, Asifa [1 ]
Qureshi, Sania [2 ,3 ]
Soomro, Amanullah [2 ]
Hincal, Evren [3 ]
Baleanu, Dumitru [4 ,5 ]
Shaikh, Asif Ali [2 ]
机构
[1] Majmaah Univ, Coll Comp & Informat Sci, Dept Basic Sci & Humanities, Al Majmaah 11952, Saudi Arabia
[2] Mehran Univ Engn & Technol, Dept Basic Sci & Related Studies, Jamshoro 76062, Pakistan
[3] Near East Univ TRCN, Dept Math, Mersin 10, TR-99138 Nicosia, Turkey
[4] Cankaya Univ, Dept Math, TR-06530 Ankara, Turkey
[5] Inst Space Sci, R-76900 Bucharest, Romania
关键词
nonlinear models; efficiency index; computational cost; Halley's method; basin of attraction; computational order of convergence; ITERATIVE METHODS; NONLINEAR EQUATIONS; NEWTONS METHOD; SOLVE SYSTEMS; EFFICIENT;
D O I
10.3390/fractalfract5040204
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
There is an increasing demand for numerical methods to obtain accurate approximate solutions for nonlinear models based upon polynomials and transcendental equations under both single and multivariate variables. Keeping in mind the high demand within the scientific literature, we attempt to devise a new nonlinear three-step method with tenth-order convergence while using six functional evaluations (three functions and three first-order derivatives) per iteration. The method has an efficiency index of about 1.4678, which is higher than most optimal methods. Convergence analysis for single and systems of nonlinear equations is also carried out. The same is verified with the approximated computational order of convergence in the absence of an exact solution. To observe the global fractal behavior of the proposed method, different types of complex functions are considered under basins of attraction. When compared with various well-known methods, it is observed that the proposed method achieves prespecified tolerance in the minimum number of iterations while assuming different initial guesses. Nonlinear models include those employed in science and engineering, including chemical, electrical, biochemical, geometrical, and meteorological models.
引用
收藏
页数:25
相关论文
共 50 条
  • [1] New Eighth-Order Root-Finding Three-Step Iterative Methods
    Wang, Xiaofeng
    2012 2ND INTERNATIONAL CONFERENCE ON APPLIED ROBOTICS FOR THE POWER INDUSTRY (CARPI), 2012, : 898 - 901
  • [2] Some eighth-order root-finding three-step methods
    Kou, Jisheng
    Wang, Xiuhua
    Li, Yitian
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2010, 15 (03) : 536 - 544
  • [3] Numerical integration error method - A new method for polynomial root-finding
    Suzuki, T
    Suzuki, T
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2001, 47 (06) : 3859 - 3868
  • [4] A Two-Step Quaternionic Root-Finding Method
    Falcao, Maria Irene
    Miranda, Fernando
    Severino, Ricardo
    Soares, Maria Joana
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS-ICCSA 2023 WORKSHOPS, PT I, 2023, 14104 : 708 - 721
  • [5] A Novel Three-Step Numerical Solver for Physical Models under Fractal Behavior
    Awadalla, Muath
    Qureshi, Sania
    Soomro, Amanullah
    Abuasbeh, Kinda
    SYMMETRY-BASEL, 2023, 15 (02):
  • [6] A new optimal family of three-step methods for efficient finding of a simple root of a nonlinear equation
    Raleviac, Nebojsa
    Cebic, Dejan
    MATHEMATICAL COMMUNICATIONS, 2016, 21 (02) : 189 - 197
  • [7] Graphical and Numerical Study of a Newly Developed Root-Finding Algorithm and Its Engineering Applications
    Naseem, Amir
    Rehman, M. A.
    Qureshi, Sania
    Ide, Nasr Al Din
    IEEE ACCESS, 2023, 11 : 2375 - 2383
  • [8] A derivative-free root-finding algorithm using exponential method and its implementation
    Srinivasarao Thota
    Mohamed M. Awad
    P. Shanmugasundaram
    Laxmi Rathour
    BMC Research Notes, 16
  • [9] A derivative-free root-finding algorithm using exponential method and its implementation
    Thota, Srinivasarao
    Awad, Mohamed M.
    Shanmugasundaram, P.
    Rathour, Laxmi
    BMC RESEARCH NOTES, 2023, 16 (01)
  • [10] Numerical Properties of Different Root-Finding Algorithms Obtained for Approximating Continuous Newton's Method
    Gutierrez, Jose M.
    ALGORITHMS, 2015, 8 (04): : 1210 - 1218