Modified Bisection Algorithm for Multiple Roots of Nonlinear Equation With the R Software

2019 ◽  
Author(s):  
Mohammed Ridha Kouider
Algorithms ◽  
2015 ◽  
Vol 8 (3) ◽  
pp. 656-668 ◽  
Author(s):  
Juan Liang ◽  
Xiaowu Li ◽  
Zhinan Wu ◽  
Mingsheng Zhang ◽  
Lin Wang ◽  
...  

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.


Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 546
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Ángel Alberto Magreñán ◽  
Alejandro Moysi

In this manuscript, we introduce the higher-order optimal derivative-free family of Chebyshev–Halley’s iterative technique to solve the nonlinear equation having the multiple roots. The designed scheme makes use of the weight function and one parameter α to achieve the fourth-order of convergence. Initially, the convergence analysis is performed for particular values of multiple roots. Afterward, it concludes in general. Moreover, the effectiveness of the presented methods are certified on some applications of nonlinear equations and compared with the earlier derivative and derivative-free schemes. The obtained results depict better performance than the existing methods.


Sign in / Sign up

Export Citation Format

Share Document