Abstract

The task of root-finding of the non-linear equations is perhaps, one of the most complicated problems in applied mathematics especially in a diverse range of engineering applications. The characteristics of the root-finding methods such as convergence rate, performance, efficiency, etc., are directly relied upon the initial guess of the solution to execute the process in most of the systems of non-linear equations. Keeping these facts into mind, based on Taylor’s series expansion, we present some new modifications of Halley, Househölder and Golbabai and Javidi’s methods and then making them second derivative free by applying Taylor’s series. The convergence analysis of the suggested methods is discussed. It is established that the proposed methods possess convergence of orders five and six. Several numerical problems have been tested to demonstrate the validity and applicability of the proposed methods. These test examples also include some real-life problems associated with chemical and civil engineering such as open channel flow problem, the adiabatic flame temperature equation, conversion of nitrogen-hydrogen feed to ammonia and the van der Wall’s equation whose numerical results prove the better performance of the suggested methods as compared to other well-known existing methods of the same kind in the literature. Finally, the dynamics of the presented algorithms in the form of polynomiographs have been shown with the aid of computer program by considering some complex polynomials and compared them with the other well-known iterative algorithms that revealed the convergence speed and other dynamical aspects of the presented methods.

Highlights

  • I n applied mathematics and engineering sciences, the rootfinding algorithms for the solution of non-linear algebraic equations of the general form: ξ(s) = 0, (1)have played a key role especially in a diverse range of fuzzy systems, image processing and engineering applications.Where ξ : D ⊂ R → R is a scalar function defined on the domain D which is an open connected set

  • MAIN RESULTS Let ξ : D → R, D ⊂ R is a scalar function defined on the domain D where D is an open connected set, in the light of (2), one can write: s

  • The numeric and dynamic comparisons of the proposed methods have been presented by considering some engineering and arbitrary test problems

Read more

Summary

INTRODUCTION

Which is cubically convergent and well-known Halley’s method [5], [15] for root-finding of non-linear scalar equations. Noor et al in 2007 [31], established a new second-derivative free two-step Halley’s method with the help of finite difference scheme and proved that the proposed algorithm possesses the fifth order of convergence. Nazeer et al [30], in (2016), proposed a new second derivative free generalized Newton-Raphson’s method with convergence of order five by means of finite difference scheme. Naseem et al [27] presented some new ninth order iterative algorithms for determining the zeros of non-linear scalar equations and presented their graphical representation by means of polynomiographs using different complex polynomials.

MAIN RESULTS
NUMERICAL RESULTS
Method N
Method
POLYNOMIOGRAPHY
APPLICATIONS
CONCLUDING REMARKS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call