On Some Optimal Multiple Root-Finding Methods and their Dynamics (original) (raw)
Related papers
Mathematical Modelling and Analysis
In this paper, we present many new one-parameter families of classical Rall’s method (modified Newton’s method), Schröder’s method, Halley’s method and super-Halley method for the first time which will converge even though the guess is far away from the desired root or the derivative is small in the vicinity of the root and have the same error equations as those of their original methods respectively, for multiple roots. Further, we also propose an optimal family of iterative methods of fourth-order convergence and converging to a required root in a stable manner without divergence, oscillation or jumping problems. All the methods considered here are found to be more effective than the similar robust methods available in the literature. In their dynamical study, it has been observed that the proposed methods have equal or better stability and robustness as compared to the other methods.
A family of optimal fourth‐order methods for multiple roots of nonlinear equations
Mathematical Methods in the Applied Sciences, 2018
Newton‐Raphson method has always remained as the widely used method for finding simple and multiple roots of nonlinear equations. In the past years, many new methods have been introduced for finding multiple zeros that involve the use of weight function in the second step, thereby, increasing the order of convergence and giving a flexibility to generate a family of methods satisfying some underlying conditions. However, in almost all the schemes developed over the past, the usual way is to use Newton‐type method at the first step. In this paper, we present a new two‐step optimal fourth‐order family of methods for multiple roots (m > 1). The proposed iterative family has the flexibility of choice at both steps. The development of the scheme is based on using weight functions. The first step can not only recapture Newton's method for multiple roots as special case but is also capable of defining new choices of first step. A stability analysis of some particular cases is also gi...
On the development of iterative methods for multiple roots
Applied Mathematics and Computation, 2013
There are very few optimal fourth order methods for solving nonlinear algebraic equations having roots of multiplicity m. Here we compare 4 such methods, two of which require the evaluation of the ðm À 1Þ st root. We will show that such computation does not affect the overall cost of the method. Published by Elsevier Inc. The method is based on Newton's method for the function GðxÞ ¼ ffiffiffiffiffiffiffiffi ffi f ðxÞ m p which obviously has a simple root at a, the multiple root with multiplicity m of f ðxÞ.
An Optimal Eighth-Order Family of Iterative Methods for Multiple Roots
Mathematics
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.
A general family of third order method for finding multiple roots
Applied Mathematics and Computation, 2014
In this paper, we describe a general family of iterative methods for approximating a multiple root z with multiplicity m of a complex defined function. Almost of the family of the methods existing in the literature that use two-function and one-derivative evaluations are a special choice of this general method. We give some conditions to have the third order of convergence and we discuss how to choose a small asymptotic error constant which may be affect the speed of the convergence. Using Mathematica with its high precision compatibility, we present some numerical examples to confirm the theoretical results.
A Family of Derivative Free Optimal Fourth Order Methods for Computing Multiple Roots
Symmetry, 2020
Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. But contrarily, derivative free optimal order techniques for multiple root are almost nonexistent. By this as an inspirational factor, here we present a family of optimal fourth order derivative-free techniques for computing multiple roots of nonlinear equations. At the beginning the convergence analysis is executed for particular values of multiplicity afterwards it concludes in general form. Behl et. al derivative-free method is seen as special case of the family. Moreover, the applicability and comparison is demonstrated on different nonlinear problems that certifies the efficient convergent nature of the new methods. Finally, we conclude that our new methods consume the lowest CPU time as compared to the existing ones. This illuminates the theoretical outcomes to a great extent of this study.
A Novel Family of Efficient Weighted-Newton Multiple Root Iterations
Symmetry, 2020
We propose a novel family of seventh-order iterative methods for computing multiple zeros of a nonlinear function. The algorithm consists of three steps, of which the first two are the steps of recently developed Liu–Zhou fourth-order method, whereas the third step is based on a Newton-like step. The efficiency index of the proposed scheme is 1.627, which is better than the efficiency index 1.587 of the basic Liu–Zhou fourth-order method. In this sense, the proposed iteration is the modification over the Liu–Zhou iteration. Theoretical results are fully studied including the main theorem of local convergence analysis. Moreover, convergence domains are also assessed using the graphical tool, namely, basins of attraction which are symmetrical through the fractal like boundaries. Accuracy and computational efficiency are demonstrated by implementing the algorithms on different numerical problems. Comparison of numerical experiments shows that the new methods have an edge over the exist...
emis.ams.org
In this paper, we present and analyse fourth order method for finding simultaneously multiple zeros of polynomial equations. S. M. Ilič and L. Rančič modified cubically convergent Ehrlich Aberth method to fourth order for the simultaneous determination of simple zeros [5]. We generalize this method to the case of multiple zeros of complex polynomial equations. It is proved that the method has fourth order convergence. Numerical tests show its efficient computational behaviour in the case of multiple real/complex roots of polynomial equations.
Generating Optimal Eighth Order Methods for Computing Multiple Roots
Symmetry, 2020
There are a few optimal eighth order methods in literature for computing multiple zeros of a nonlinear function. Therefore, in this work our main focus is on developing a new family of optimal eighth order iterative methods for multiple zeros. The applicability of proposed methods is demonstrated on some real life and academic problems that illustrate the efficient convergence behavior. It is shown that the newly developed schemes are able to compete with other methods in terms of numerical error, convergence and computational time. Stability is also demonstrated by means of a pictorial tool, namely, basins of attraction that have the fractal-like shapes along the borders through which basins are symmetric.
An Efficient Family of Root-Finding Methods with Optimal Eighth-Order Convergence
Advances in Numerical Analysis, 2012
We derive a family of eighth-order multipoint methods for the solution of nonlinear equations. In terms of computational cost, the family requires evaluations of only three functions and one first derivative per iteration. This implies that the efficiency index of the present methods is 1.682. Kung and Traub (1974) conjectured that multipoint iteration methods without memory based on n evaluations have optimal order . Thus, the family agrees with Kung-Traub conjecture for the case . Computational results demonstrate that the developed methods are efficient and robust as compared with many well-known methods.