A Comparative Study and Novel Hybrid Approach to Root-Finding Methods for Nonlinear Equations

This paper provides a comprehensive review of iterative methods for solving nonlinear equations and introduces a novel algorithm that combines the strengths of existing methods. The proposed method offers improved convergence and computational efficiency, making it a promising tool for solving complex nonlinear equations in various fields. Future work will involve extensive testing and refinement of the algorithm to validate its effectiveness in real-world applications.

1.           Beong In Yun, “Iterative methods for solving nonlinear equations with finitely many roots in an interval,” Journal of Computational and Applied Mathematics, 2012. 2.           Dey, A., “Mathematical Models Formulation and Comparison Study of Various Meth-ods of Root-Finding Problems,” 2015. 3.           Ehiwario, J.C., Aghamie, S.O., “Comparative Study of Bisection, Newton-Raphson, and Secant Methods of Root-Finding Problems,” IOSR Journal of Engineering (IOS-RJEN), 2014. 4.           Ahmad, A.G., “Comparative Study of Bisection and Newton-Raphson Methods of Root-Finding Problems,” 2015. 5.           Akram, S., Ann, Q.U., “Newton-Raphson Method,” International Journal of Scientific & Engineering Research, 2015. 6.           Saheya, B., Chen, G., Sui, Y., Wu, C., “A New Newton-like Method for Solving Nonlinear Equations,” 2016. 7.           Thota, S., “A New Root Finding Algorithm Using Exponential Series,” Mathematical Journal, 2019. 8.           Sharma, S., “A Comparative Analysis of Rate of Convergence for Linear and Quadratic Approximations in N-R Method,” 2017.