Generalization of Ramanujan Method of Approximating root of an equation

2011/12/21 by Ramesh Kumar Muthumalai, Muthumalai, Ramesh Kumar
Mathematics · #65H04 #65H05 #Advanced Mathematical Identities #FOS: Mathematics #Graph theory and applications #Mathematical Inequalities and Applications #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.1112.5092

openalex publication_date 2011/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We generalize Ramanujan method of approximating the smallest root of an equation which is found in Ramanujan Note books, Part-I. We provide simple analytical proof to study convergence of this method. Moreover, we study iterative approach of this method on approximating a root with arbitrary order of convergence.

Citations

• Tables of Integrals, Series, and Products

Related

• Generalization of Ramanujan Famous Nested Radicals to the nth Root and their Evaluation
• An iterative algorithm for approximating roots of integers
• Ramanujan's approximation to the exponential function and generalizations
• A Grammatical Calculus for the Ramanujan Polynomials
• Reflections on Ramanujan's Mathematical Gems