scholarly journals On Dynamics of Iterative Techniques for Nonlinear Equation with Applications in Engineering

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Mudassir Shams ◽  
Nazir Ahmad Mir ◽  
Naila Rafiq ◽  
A. Othman Almatroud ◽  
Saima Akram

In this article, we construct an optimal family of iterative methods for finding the single root and then extend this family for determining all the distinct as well as multiple roots of single-variable nonlinear equations simultaneously. Convergence analysis is presented for both the cases to show that the optimal order of convergence is 4 in the case of single root finding methods and 6 for simultaneous determination of all distinct as well as multiple roots of a nonlinear equation. The computational cost, basins of attraction, efficiency, log of residual, and numerical test examples show that the newly constructed methods are more efficient as compared to the existing methods in the literature.

2020 ◽  
Vol 2020 ◽  
pp. 1-20
Author(s):  
Naila Rafiq ◽  
Saima Akram ◽  
Nazir Ahmad Mir ◽  
Mudassir Shams

In this article, we first construct a family of optimal 2-step iterative methods for finding a single root of the nonlinear equation using the procedure of weight function. We then extend these methods for determining all roots simultaneously. Convergence analysis is presented for both cases to show that the order of convergence is 4 in case of the single-root finding method and is 6 for simultaneous determination of all distinct as well as multiple roots of a nonlinear equation. The dynamical behavior is presented to analyze the stability of fixed and critical points of the rational operator of one-point iterative methods. The computational cost, basins of attraction, efficiency, log of the residual, and numerical test examples show that the newly constructed methods are more efficient as compared with the existing methods in the literature.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mudassir Shams ◽  
Naila Rafiq ◽  
Nasreen Kausar ◽  
Praveen Agarwal ◽  
Choonkil Park ◽  
...  

AbstractIn this article, we construct a family of iterative methods for finding a single root of nonlinear equation and then generalize this family of iterative methods for determining all roots of nonlinear equations simultaneously. Further we extend this family of root estimating methods for solving a system of nonlinear equations. Convergence analysis shows that the order of convergence is 3 in case of the single root finding method as well as for the system of nonlinear equations and is 5 for simultaneous determination of all distinct and multiple roots of a nonlinear equation. The computational cost, basin of attraction, efficiency, log of residual and numerical test examples show that the newly constructed methods are more efficient as compared to the existing methods in literature.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 164
Author(s):  
Moin-ud-Din Junjua ◽  
Fiza Zafar ◽  
Nusrat Yasmin

Finding a simple root for a nonlinear equation f ( x ) = 0 , f : I ⊆ R → R has always been of much interest due to its wide applications in many fields of science and engineering. Newton’s method is usually applied to solve this kind of problems. In this paper, for such problems, we present a family of optimal derivative-free root finding methods of arbitrary high order based on inverse interpolation and modify it by using a transformation of first order derivative. Convergence analysis of the modified methods confirms that the optimal order of convergence is preserved according to the Kung-Traub conjecture. To examine the effectiveness and significance of the newly developed methods numerically, several nonlinear equations including the van der Waals equation are tested.


Author(s):  
Mudassir Shams ◽  
Nazir Mir ◽  
Naila Rafiq

We construct a family of two-step optimal fourth order iterative methods for finding single root of non-linear equations. We generalize these methods to simultaneous iterative methods for determining all the distinct as well as multiple roots of single variable non-linear equations. Convergence analysis is present for both cases to show that the order of convergence is four in case of single root finding method and is twelve for simultaneous determination of all roots of non-linear equation. The computational cost, Basin of attraction, efficiency, log of residual and numerical test examples shows, the newly constructed methods are more efficient as compared to the existing methods in literature.


2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Rajni Sharma ◽  
Janak Raj Sharma

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.


2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Rajni Sharma ◽  
Ashu Bahl

We present a new fourth order method for finding simple roots of a nonlinear equation f(x)=0. In terms of computational cost, per iteration the method uses one evaluation of the function and two evaluations of its first derivative. Therefore, the method has optimal order with efficiency index 1.587 which is better than efficiency index 1.414 of Newton method and the same with Jarratt method and King’s family. Numerical examples are given to support that the method thus obtained is competitive with other similar robust methods. The conjugacy maps and extraneous fixed points of the presented method and other existing fourth order methods are discussed, and their basins of attraction are also given to demonstrate their dynamical behavior in the complex plane.


2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Fiza Zafar ◽  
Nusrat Yasmin ◽  
Saima Akram ◽  
Moin-ud-Din Junjua

We construct a new general class of derivative freen-point iterative methods of optimal order of convergence2n-1using rational interpolant. The special cases of this class are obtained. These methods do not need Newton’s iterate in the…first step of their iterative schemes. Numerical computations are presented to show that the new methods are efficient and can be seen as better alternates.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mudassir Shams ◽  
Naila Rafiq ◽  
Nasreen Kausar ◽  
Praveen Agarwal ◽  
Choonkil Park ◽  
...  

AbstractTwo new iterative methods for the simultaneous determination of all multiple as well as distinct roots of nonlinear polynomial equation are established, using two suitable corrections to achieve a very high computational efficiency as compared to the existing methods in the literature. Convergence analysis shows that the orders of convergence of the newly constructed simultaneous methods are 10 and 12. At the end, numerical test examples are given to check the efficiency and numerical performance of these simultaneous methods.


Author(s):  
Wartono Wartono ◽  
Revia Agustiwari ◽  
Rahmawati Rahmawati

AbstractBehl’s method is one of the iterative methods to solve a nonlinear equation that converges cubically. In this paper, we modified the iterative method with real parameter β using second Taylor’s series expansion and reduce the second derivative of the proposed method using the equality of Chun-Kim and Newton Steffensen. The result showed that the proposed method has a fourth-order convergence for b = 0 and involves three evaluation functions per iteration with the efficiency index equal to 41/3 = 1.5874. Numerical simulation is presented for several functions to demonstrate the performance of the new method. The final results show that the proposed method has better performance as compared to some other iterative methods.Keywords: efficiency index; third-order iterative method; Chun-Kim’s method; Newton-Steffensen’s method; nonlinear equation. AbstrakMetode Behl adalah salah satu metode iterasi yang digunakan untuk menyelesaikan persamaan nonlinear dengan orde konvergensi tiga. Pada artikel ini, modifikasi terhadap metode iterasi menggunakan ekspansi deret Taylor orde dua dengan parameter β  dan turunan kedua dihilangkan menggunakan penyetaraan dari metode Chun-Kim dan Newton-Steffensen. Hasil kajian menunjukkan bahwa metode iterasi yang diusulkan memiliki orde konvergensi empat untuk b = 0 dan melibatkan tiga evaluasi fungsi setiap iterasinya dengan indeks efisiensi sebesar 41/3 = 1,5874. Simulasi numerik dilakukan terhadap beberapa fungsi untuk menunjukkan performa modifikasi metode iterasi yang diusulkan. Hasil akhir menunjukkan bahwa metode iterasi tersebut mempunyai performa lebih baik dibandingkan dengan beberapa metode iterasi lainnya.Kata kunci: indeks efisiensi; metode iterasi orde tiga; metode Chun-Kim; metode Newton- Steffensen; persamaan nonlinear.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Saima Akram ◽  
Faiza Akram ◽  
Moin-ud-Din Junjua ◽  
Misbah Arshad ◽  
Tariq Afzal

In this manuscript, we present a new general family of optimal iterative methods for finding multiple roots of nonlinear equations with known multiplicity using weight functions. An extensive convergence analysis is presented to verify the optimal eighth order convergence of the new family. Some special cases of the family are also presented which require only three functions and one derivative evaluation at each iteration to reach optimal eighth order convergence. A variety of numerical test functions along with some real-world problems such as beam designing model and Van der Waals’ equation of state are presented to ensure that the newly developed family efficiently competes with the other existing methods. The dynamical analysis of the proposed methods is also presented to validate the theoretical results by using graphical tools, termed as the basins of attraction.


Sign in / Sign up

Export Citation Format

Share Document