Targeting the smallest root : A comparative study of Ramanujan’s method and classical root-finding algorithms
*Kiran Singh Sisodiya (Bais)Corresponding authorkiransinghbais@gmail.comDepartment of MathematicsChandigarh UniversityMohali, Punjab, 140413, IndiaView full profile → , Lalit Kumarlalit.j4682@cgcuniversity.inDepartment of Computer Science & EngineeringCGC UniversityMohali, Punjab, 140307, IndiaView full profile → , Santosh Kumarsantosh.e11120@cumail.inDepartment of Computer Science & EngineeringChandigarh UniversityMohali, Punjab, 140413, IndiaView full profile → , Navjot Kaurnavjotdhadli76@gmail.comDepartment of Computer Science & EngineeringCGC UniversityMohali, Punjab, 140307, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Feb 2026
- Published Online:
- 25 Aug 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2639
- Pages:
- 2527–2541
Abstract
This research represents an organized comparison of the efficiency of classical iterative root-finding algorithms like Newton-Raphson, secant and bisection with Ramanujan technique which is more specifically designed for finding differentiating minimum positive roots of algebraic and non-linear equations. Classical techniques are fairly generalized methods and can be applied almost everywhere, yet these have high sensitivity with regards to the choice of initial value or interval and can provide any type of roots rather than being specifically related to the smallest one. On the contrary, the technique used by Ramanujan relies on a unique expansion series and a recurrence relationship and ensures a precise and systematic process towards the closest root which becomes quite useful in practical applications where early detection and identification is involved such as in environmental monitoring and early detection of medical conditions. Through practical examples based on real life application, this research highlights the efficacy of Ramanujan technique in particular instances where the earliest root needs to be obtained. It will become quite clear that for finding the smallest root the Ramanujan approach is more appropriate whereas classical algorithms can be considered in situations where any root suffices or function irregularities are involved.
Keywords
Subject Classifications
References
[1] A. Naseem, M. A. Rehman, and T. Abdeljawad, "A novel root-finding algorithm with engineering applications and its dynamics via com- puter technology," IEEE Access, vol. 10, pp. 19677–19684 (2022).
[2] B. Jia and Z. Lu, "Root finding method of failure credibility for fuzzy safety analysis," Struct. Multidiscip. Optim., vol. 58, no. 5, pp. 1917– 1934 (2018).
[3] M. M. Plecnik and R. S. Fearing, "Designing dynamic machines with large-scale root finding," IEEE Trans. Robot., vol. 36, no. 4, pp. 1135– 1152 (2020).
[4] R. Chaudhary, S. Rawat, P. Chauhan, and A. S. Malik, "Unraveling the roots: A comprehensive review of numerical methods for root finding," J. Emerg. Technol. Innov. Res., vol. 11, no. 1, pp. 660–666, Art. no. JETIR2401176 (2024).
[5] T. E. Murphy, K. L. Tsui, and J. K. Allen, “A review of robust design methods for multiple responses,” Res. Eng. Des., vol. 15, no. 4, pp. 201–215 (2005).
[6] A. D. Trigilio, Y. W. Marien, P. H. Van Steenberge, and D. R. D’hooge, “Gillespie-driven kinetic Monte Carlo algorithms to model events for bulk or solution (bio)chemical systems containing elemental and distributed species,” Ind. Eng. Chem. Res., vol. 59, no. 41, pp. 18357–18386 (2020).
[7] A. Iserles, A First Course in the Numerical Analysis of Differential Equations. Cambridge, U.K.: Cambridge Univ. Press (2009).
[8] A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis. New York, USA: Courier Corp. (2001).
[9] D. Weintrop, E. Beheshti, M. S. Horn, K. Orton, K. Jona, L. Trouille, and U. Wilensky, “Defining computational thinking for mathematics and science classrooms,” J. Sci. Educ. Technol., vol. 25, no. 1, pp. 127–147 (2016), doi: 10.1007/s10956-015-9581-5
[10] R. Morales, “Special functions and geometries in scattering amplitudes: From particle physics to gravity,” arXiv preprint arXiv:2506.11911 (2025), doi: 10.48550/arXiv.2506.11911.
[11] L. Debnath, “A brief history of the most remarkable numbers e, i and γ in mathematical sciences with applications,” Int. J. Math. Educ. Sci. Technol., vol. 46, no. 6, pp. 853–878 (2015).
[12] I. Petković and Đ. Herceg, “Computers in mathematical research: The study of three-point root-finding methods,” Numer. Algorithms, vol. 84, no. 3, pp. 1179–1198 (2020).
[13] H. A. Mueen and M. A. Shiker, “Comparison Newton method with bisection method for solving nonlinear equations,” in Proc. 8th Int. Symp. Multidisciplinary Studies and Innovative Technologies (ISMSIT), pp. 1–4 (2024).
[14] R. Bhardwaj, “Numerical simulation of nonlinear equations by modified secant method,” IAPQR Trans., vol. 49, no. 1 (2024).
[15] P. Pathak and N. K. Mani, “A convolutional neural network approach for early detection of plant diseases using leaf imagery,” in Recent Trends in Intelligent Computing and Communication. Boca Raton, FL, USA: CRC Press, pp. 117–123 (2025).
[16] V. Vishwakarma, G. Singh, and N. Mani, “Demonstrating the power of CNN for exoplanets in Kepler’s stellar light using deep learning,” in Machine Intelligence for Research and Innovations: Proc. MAiTRI 2024, vol. 2. Singapore: Springer, p. 323 (2025).
[17] R. Godard, “Finding the roots of a non-linear equation: History and reliability,” in Res. Hist. Philos. Math.: CSHPM 2015. Cham, Switzerland: Springer, pp. 57–68 (2016).
[18] C. L. Sabharwal, “Blended root finding algorithm outperforms bisection and regula falsi algorithms,” Mathematics, vol. 7, no. 11, Art. no. 1118 (2019).
[19] P. Adu, Modified Iterative Method for Computing the Approximate Solutions of Nonlinear Equations. Ph.D. dissertation, Univ. Cape Coast, Cape Coast, Ghana (2020).
[20] M. Takruri, K. Aboura, and S. Challa, “Distributed recursive algorithm for auto calibration in drift aware wireless sensor networks,” in Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering. Dordrecht, Netherlands: Springer, pp. 21–25 (2008).
[21] C. Cai, J. Qiu, and K. Wu, “Provably convergent and robust Newton-Raphson method: A new dawn in primitive variable recovery for relativistic MHD,” arXiv preprint arXiv:2404.05531 (2024), doi: 10.48550/arXiv.2404.05531.
[22] R. Khanal, “A comparative analysis of Newton–Raphson and secant methods based on convergence and computational efficiency for solving nonlinear equations,” J. Balkumari College, vol. 14, no. 1, pp. 45–47 (2025).
[23] S. A. Nowdeh , “A novel maximum power point tracking method for photovoltaic application using secant incremental gradient based on Newton–Raphson,” in Solar Photovoltaic Power Plants: Advanced Control and Optimization Techniques. Singapore: Springer, pp. 71–96 (2019),
[24] F. De Colle, J. Granot, D. López-Cámara, and E. Ramirez-Ruiz, “Gamma-ray burst dynamics and afterglow radiation from adaptive mesh refinement, special relativistic hydrodynamic simulations,” Astrophys. J., vol. 746, no. 2, Art. no. 122 (2012).
[25] M. Awasthi, N. Mani, A. Sharma, and R. Shukla, “Secondary flow for slow rotation of a pervious sphere with source at its centre in a viscous fluid,” J. Indones. Math. Soc., vol. 31, no. 3, Art. no. 1889 (2025).
[26] S. S. Sastry, Introductory Methods of Numerical Analysis, 5th ed. New Delhi, India: PHI Learning Pvt. Ltd., (2012).
[27] F. Simon, “The Numerical Method for Finding All the Zeros of a Function f(x) on an Interval [a, b],” Honors Theses, no. 1050, University of Southern Mississippi, ID: 1050 (2025).
[28] I. Bhardwaj and R. Bhardwaj, “Numerical simulation of nonlinear equations by converting quadrature rule to iterative technique,” J. Interdiscip. Math., vol. 28, no. 5, pp. 1837–1845 (2025).
