Efficient Iterative Methods for Approximating Multiple Roots

2014 ◽  
Author(s):  
J.L. Hueso ◽  
E. Martínez ◽  
C. Teruel
Keyword(s):  
Iterative Methods ◽  
Multiple Roots

scholarly journals Derivative-Free King’s Scheme for Multiple Zeros of Nonlinear Functions

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1242
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Eulalia Martínez ◽  
Majed Aali Alsulami
Keyword(s):  
Iterative Methods ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Real Life ◽  
Multiple Roots ◽  
Computational Results ◽  
Nonlinear Functions ◽  
First Order ◽  
Life Problems ◽  
Derivative Free

There is no doubt that the fourth-order King’s family is one of the important ones among its counterparts. However, it has two major problems: the first one is the calculation of the first-order derivative; secondly, it has a linear order of convergence in the case of multiple roots. In order to improve these complications, we suggested a new King’s family of iterative methods. The main features of our scheme are the optimal convergence order, being free from derivatives, and working for multiple roots (m≥2). In addition, we proposed a main theorem that illustrated the fourth order of convergence. It also satisfied the optimal Kung–Traub conjecture of iterative methods without memory. We compared our scheme with the latest iterative methods of the same order of convergence on several real-life problems. In accordance with the computational results, we concluded that our method showed superior behavior compared to the existing methods.

scholarly journals Three New Optimal Fourth-Order Iterative Methods to Solve Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gustavo Fernández-Torres ◽  
Juan Vásquez-Aquino
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
Classical Method ◽  
Multiple Roots ◽  
Order Convergence ◽  
Numerical Examples ◽  
Optimal Methods

We present new modifications to Newton's method for solving nonlinear equations. The analysis of convergence shows that these methods have fourth-order convergence. Each of the three methods uses three functional evaluations. Thus, according to Kung-Traub's conjecture, these are optimal methods. With the previous ideas, we extend the analysis to functions with multiple roots. Several numerical examples are given to illustrate that the presented methods have better performance compared with Newton's classical method and other methods of fourth-order convergence recently published.

scholarly journals Optimal iterative methods for finding multiple roots of nonlinear equations using free parameters

2017 ◽  
Vol 56 (7) ◽  
pp. 1884-1901 ◽  
Author(s):  
Fiza Zafar ◽  
Alicia Cordero ◽  
R. Quratulain ◽  
Juan R. Torregrosa
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Multiple Roots ◽  
Free Parameters

scholarly journals A Two-Parameter Family of Fourth-Order Iterative Methods with Optimal Convergence for Multiple Zeros

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Numerical Experiments ◽  
Harmonic Mean ◽  
Optimal Order ◽  
Multiple Roots ◽  
Multiple Zeros ◽  
Asymptotic Error ◽  
Two Parameter

We develop a family of fourth-order iterative methods using the weighted harmonic mean of two derivative functions to compute approximate multiple roots of nonlinear equations. They are proved to be optimally convergent in the sense of Kung-Traub’s optimal order. Numerical experiments for various test equations confirm well the validity of convergence and asymptotic error constants for the developed methods.

scholarly journals A New Biparametric Family of Two-Point Optimal Fourth-Order Multiple-Root Finders

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Multiple Root ◽  
Multiple Roots ◽  
Asymptotic Error ◽  
Error Constant ◽  
Asymptotic Error Constant

We construct a biparametric family of fourth-order iterative methods to compute multiple roots of nonlinear equations. This method is verified to be optimally convergent. Various nonlinear equations confirm our proposed method with order of convergence of four and show that the computed asymptotic error constant agrees with the theoretical one.

scholarly journals An Optimal Eighth-Order Family of Iterative Methods for Multiple Roots

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 672 ◽  
Author(s):  
Saima Akram ◽  
Fiza Zafar ◽  
Nusrat Yasmin
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Multiple Root ◽  
Multiple Roots ◽  
Order Convergence ◽  
Eighth Order ◽  
Root Finding ◽  
New Family ◽  
Two Parameters ◽  
Theoretical Results

In this paper, we introduce a new family of efficient and optimal iterative methods for finding multiple roots of nonlinear equations with known multiplicity ( m ≥ 1 ) . We use the weight function approach involving one and two parameters to develop the new family. A comprehensive convergence analysis is studied to demonstrate the optimal eighth-order convergence of the suggested scheme. Finally, numerical and dynamical tests are presented, which validates the theoretical results formulated in this paper and illustrates that the suggested family is efficient among the domain of multiple root finding methods.

scholarly journals New Families of Third-Order Iterative Methods for Finding Multiple Roots

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
R. F. Lin ◽  
H. M. Ren ◽  
Z. Šmarda ◽  
Q. B. Wu ◽  
Y. Khan ◽  
...  
Keyword(s):  
Iterative Methods ◽  
Newton Method ◽  
Multiple Roots ◽  
Third Order ◽  
Cubic Convergence ◽  
Numerical Examples ◽  
Mild Conditions ◽  
First Derivative ◽  
Modified Newton Method ◽  
Iteration Methods

Two families of third-order iterative methods for finding multiple roots of nonlinear equations are developed in this paper. Mild conditions are given to assure the cubic convergence of two iteration schemes (I) and (II). The presented families include many third-order methods for finding multiple roots, such as the known Dong's methods and Neta's method. Some new concrete iterative methods are provided. Each member of the two families requires two evaluations of the function and one of its first derivative per iteration. All these methods require the knowledge of the multiplicity. The obtained methods are also compared in their performance with various other iteration methods via numerical examples, and it is observed that these have better performance than the modified Newton method, and demonstrate at least equal performance to iterative methods of the same order.

Sign in / Sign up

Export Citation Format

Share Document