Novel Iteration Schemes for Computing Zeros of Non-Linear Equations With Engineering Applications and Their Dynamics
| Autor: | M. A. Rehman, Yu-Ming Chu, Thabet Abdeljawad, Amir Naseem |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
General Computer Science
Series (mathematics) Computer science Newton’s method General Engineering Approximation algorithm Halley’s method TK1-9971 non-linear equations Nonlinear system symbols.namesake Rate of convergence Order of convergence polynomiography Convergence (routing) symbols Taylor series Applied mathematics General Materials Science Electrical engineering. Electronics. Nuclear engineering Series expansion Newton's method |
| Zdroj: | IEEE Access, Vol 9, Pp 92246-92262 (2021) |
| ISSN: | 2169-3536 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|