A new iteration method with cubic convergence to solve nonlinear algebraic equations
Introduction
The techniques to find the roots of algebraic equations have lots of applications in many science or engineering problems. Among the techniques, iteration methods are very popular and are used by many researchers. One of the most well-known iteration methods is called Newton’s method [1], [2], [3]. Other methods such as bisection method, fixed point iteration, secant method are also used in solving algebraic equations [1], [2], [3]. A new iteration method based on Taylor’s theorem was proposed to solve nonlinear algebraic equations by He [4]. It is claimed that this new method has better convergent characteristics than the well-known Newton’s method. However, some problems for the proposed scheme were pointed out in a recent paper [5]. By comparing with Newton’s method, it was shown that the He’s scheme converges slower than Newton’s method and even diverges for some cases. In the current work, a new iteration scheme will be proposed to correct the mentioned problems. The advantages of this new proposed scheme will be discussed and compared with other methods.
Section snippets
Theoretical background
The current approach is based on Taylor’s series expansion. Consider an arbitrary algebraic equation, f(x) = 0. The Taylor’s series expansion around a given initial point x = x0, assuming x0 being close enough to the root x = p, is given as follows:where HOT denotes the higher order terms. Then the algebraic equation becomesSubstituting x = p into Eq. (2) yieldsWhen x0
Convergence analysis
In order to analyze the convergent characteristics of the iteration scheme in Eq. (6), consider the following iteration function:In the following derivation, it is assumed that f″(p) ≠ 0. From Eq. (7), it is obtainedand
Some examples
Example 1 As pointed out by Luo [5], He’s scheme fails in an example as f(x) = x3 − e−x = 0. We will apply the current scheme to this problem. All the examples in the current work are computed using MATLAB with double precision. The first two derivatives can be obtained asandWe start our iteration from p0 = 0. The iteration results are shown in Table 1, Table 2 for different signs in the iteration scheme. When using the positive sign in Eq. (6), the result converges to a real root after
Conclusion
In this paper, a new iteration scheme is proposed to solve the roots of algebraic equations. Results show that this method has better performance than the well-known Newton’s method. Unique characteristics of the new method include:
- (1)
The new scheme has cubic local convergence in the neighborhood of the root.
- (2)
Using one initial guess, two solutions can be found using different iteration directions.
- (3)
Given a real initial guess, complex solutions can be obtained.
- (4)
Current approach can provide a root
References (6)
A new iteration method for solving algebraic equations
Appl. Math. Comput.
(2003)- et al.
Some variant of Newton’s method with third-order convergence
Appl. Math. Comput.
(2003) - et al.
Numerical Analysis
(2001)
Cited by (11)
One-point Newton-type iterative methods: A unified point of view
2015, Journal of Computational and Applied MathematicsOn the dynamics of the Euler iterative function
2008, Applied Mathematics and ComputationA note on some recent methods for solving nonlinear equations
2007, Applied Mathematics and ComputationModified iterative methods with cubic convergence for solving nonlinear equations
2007, Applied Mathematics and ComputationIteration functions for complex solutions of cubic polynomial equations
2022, AIP Conference ProceedingsA simple algorithm for high order newton iteration formulae and some new variants
2020, Hacettepe Journal of Mathematics and Statistics