V.B. Kumar Vatti1, Ramadevi Sri2 and M.S.Kumar Mylapalli2

1Dept. of Engineering Mathematics, Andhra University, Visakhapatnam, India

2Dept. of Mathematics, Gitam University, Visakhapatnam, India,

 

Corresponding author Email: drvattivbk@yahoo.co.in

 

DOI : http://dx.doi.org/10.13005/ojcst/10.04.19

ABSTRACT:

In this paper, the Eighteenth Order Convergent Method (EOCM) developed by Vatti et.al is considered and this method is further studied without the presence of second derivative. It is shown that this method has same efficiency index as that of EOCM. Several numerical examples are given to illustrate the efficiency and performance of the new method.

AMS Subject Classification: 41A25, 65K05, 65H05.

KEYWORDS:

Iterative method; Nonlinear equation; Newton’s method; Convergence analysis; Higher order convergence

Download this article as: 

Copy the following to cite this article:

Vatti V. B. K, Sri R, Mylapalli M. S. K. Second Derivative Free Eighteenth Order Convergent Method for Solving Non-Linear Equations. Orient.J. Comp. Sci. and Technol;10(4)


Copy the following to cite this URL:

Vatti V. B. K, Sri R, Mylapalli M. S. K. Second Derivative Free Eighteenth Order Convergent Method for Solving Non-Linear Equations. Orient. J. Comp. Sci. and Technol;10(4). Available from: http://www.computerscijournal.org/?p=7325


Introduction

It is well known that a wide class of problems, which arises in diverse disciplines of mathematical and engineering science can be studied by the nonlinear equation of the form

f (x) = 0       (1.1)

Where f : D ⊂ R → R is a scalar function on an open interval D and f (x) may be algebraic, transcendental or combined of both. The most widely used algorithm for solving (1.1) by the use of value of the function and its derivative is the well known quadratic convergent Newton’s method (NM) given by

Formula

starting with an initial guess x0 which is in the vicinity of the exact root x* The efficiency index of Newton’s method is 2√2 = 1.4142

The Extrapolated Newton’s method (ENM) suggested by V.B.Kumar, Vatti et.al [11] which is developed by extrapolating Newton’s method (1.2) introducing a parameter ‘αn’ given by

Formula

Which is same as Halley’s method having third order convergence which requires three functional evaluations. The efficiency index of this method is 3√3 = 1.4422

A three step Predictor-corrector Newton’s Halley method (PCNH) suggested by Mohammed and Hafiz [10], is given by:

For a given x0 compute xn+1 by using

Formula

This method has eighteenth order convergence and its efficiency index is 8√18 = 1.4352

The three step Eighteenth Order Extrapolated Newton’s method(EOCM) developed by Vatti et.al [12] is given by:

For a given x0, compute xn+1 by the iterative schemes

Formula

This method has eighteenth order convergence and its efficiency index is 8√18 = 1.4352

In section 2, we consider the Second derivative free Eighteenth Order Extrapolated Newton’s method and discuss the convergence criteria of this method in section 3. Few numerical examples are considered to show the superiority of this method in the concluding section.

Second Derivative Free Eighteenth Order Convergent Method (Seocm):

Considering the Eighteenth Order Extrapolated Newton’s method(EOCM) (1.8) with (1.9) and (1.10), and expanding f (wn) about xn we obtain.

Formula

and rewriting equations (2.2), (2.3) in (1.8), we thus have the following algorithm:

Algorithm 2.1: For a given x0, compute xn+1 by the iterative schemes 

Formula

Where pn and pn are as given in (2.2) and (2.3).

This algorithm can be called as Second derivative free Eighteenth Order Extrapolated Newton’s method (SEOCM) and it requires eight functional evaluations.

Convergence Criteria

Theorem 3.1.

Let x* ∈ D be a single zero of a sufficiently differentiable function f : D ⊂ R → R for an open interval D and let x0 be in the vicinity of x* then the algorithm (2.1) has eighteenth order convergence.

Formula

Formula

Formula

Formula

Formula

Formula

Formula

Formula

Formula

Numerical Examples

We consider the same examples considered by Mohammed and Hafiz [10] and V.B.Kumar, Vatti et.al [13] and compared EOCM with NM and PCNH methods. The computations are carried out by using mpmath-PYTHON software programming and comparison of number of iterations for these methods are obtained such that |xn+1- xn| <10-201 and |f(xn+1)|<10-201.

It is evident from these tabulated values that SEOCM is superior to the methods (1.2) and (1.7) considering the number of iterations and accuracy and the rate at which SEOCM converged and the convergence rate is almost same as that of the method (1.8). Of these methods, SEOCM is free from second derivatives.

Table 1. Comparison of different methods

Table 1: Comparison of different methods 



Click here to View table

 

References

  1. I.K. Argyros, S.K. Khattri, An improved semi local convergence analysis for the Chebyshev method, Journal of Applied Mathematics and computing, 42, No-s: 1, 2 (2013), 509-528, doi: 10.1007/s12190-013-0647-3.
  2. M.A. Hafiz, Solving nonlinear equations using steffensen-type methods with optimal order of convergence, Palestine Journal of Mathematics, 3, No: 1 (2014), 113-119.
  3. M.A. Hafiz, A new combined bracketing method for solving nonlinear equations, Journal of Mathematical and Computational Science, 3, No.1 (2013)..
  4. M.A. Hafiz, S.M.H. Al-Goria, Solving nonlinear equations using a new tenth-and seventh- order methods free from second derivative, International Journal of Differential Equations and Applications, 12, No. 3 (2013), 169-183,2013, doi: 10.12732/ijdea.v12i3.1344.
  5. S.K. Khattri, Torgrim Log, Constructing third-order derivative-free iterative methods, Int. J. Comput. Math., 88, No. 7 (2011), 1509-1518, doi: 10.1080/00207160.2010520705.
  6. S.K. Khattri, Quadrature based optimal iterative methods with applications in high precision computing, Numer. Math. Theor. Meth. Appl., 5 (2012), 592-601.
  7. S.K. Khattri, Trond Steihaug, Algorithm for forming derivative-free optimal methods, , Numerical Algorithms, (2013), doi: 10.1007/s11075-013-9715-x.
  8. Mohamed S.M. Bahgat, M.A. Hafiz, New two-step predictor-corrector method with ninth order convergence for solving nonlinear equations, Journal of Advances in Mathematics ,2 (2013), 432-437.
  9. Khalida Inayat Noor, Muhammad Aslam Noor, Shaher Momani, Modified Householder iterative methods for nonlinear equations”, Applied Mathematics and Computation, 190 (2007), 1534-1539, doi: 10.1016/j.amc.2007.02.036.
  10. Mohamed S.M. Bahgat, M.A. Hafiz, Three-step iterative method with eighteenth order convergence for solving nonlinear equations, Int. Journal of Pure and Applied Mathematics, Vol. 93, No. 1, 2014, 85-94.
  11. Vatti V.B.Kumar, Mylapalli M. S. Kumar, Katragadda A. Kumari,Extrapolated Newton-
    1. Raphson Method, Math. Educ. 43, No. 1, 103-108 (2009).
  12. Vatti V. B. K, Sri R, Mylapalli M. S. K., Eighteenth Order Convergent Method for Solving Non-Linear Equations. Orient.J. Comp. Sci. and Technol;10(1), 144-150 (2017).
  13. Vatti V. B. K, Ramadevi Sri, Mylapalli M. S. K., Two Step Extrapolated Newton’s Method with High Efficiency Index, Journal of Advanced Research in Dynamical and Control Systems; 9(5), 08-15 (2017).

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Share Knowledge: Share on LinkedInShare on FacebookTweet about this on TwitterShare on Google+Share on RedditEmail this to someone

Comments are closed.