相关论文: Generalization of Ramanujan Method of Approximatin…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
This paper gives a short but reasonably comprehensive review of Ramanujan's {_1\psi_1} summation and its generalisations. It covers the history of Ramanujan's summation, simple applications to sums of squares and orthogonal polynomials,…
We give a simplified approach to the Abhyankar--Moh theory of approximate roots. Our considerations are based on properties of the intersection multiplicity of local curves.
In this paper we want to prove some formulas listed by S. Ramanujan in his paper "Modular equations and approximations to $\pi$" \cite{24} with an elementary method.
Ramanujan's approximation to the exponential function is reexamined with the help of Perron's saddle-point method. This allows for a wide generalization that includes the results of Buckholtz, and where all the asymptotic expansion…
We revisit several entries from Ramanujan's notebooks which follow from more elementary arguments than a first glance may suggest. Our goal is to demystify these results through more accessible proofs, while also shining some light on the…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…
The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…
Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.
In this paper we present experimental ways of evaluating Ramanujan`s quantities which as someone can see are related with algebraic numbers. The good thing with algebraic numbers is that can be found in a closed form, from there…
In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…
We give an elementary proof for new strict upper and lower bounds for the correction term in Ramanujan's approximation for the factorial function
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
In this short note, we aim to discuss some summations due to Ramanujan, their generalizations and some allied series
In this short research note, we aim to establish an interesting extension of a summation due to Ramanujan.The result is derived with the help of an extension of Gauss's summation theorem available in the literature.
We suggest a continued fraction origin to Ramanujan's approximation to {(a-b)/(a+b)}^2 in terms of the arc length of an ellipse with semiaxes a and b. Moreover, we discuss the asymptotic accuracy of the approximation.
We consider numerical approximation to the solution of non-autonomous evolution equations. The order of convergence of the simplest possible Magnus method will be investigated.
In this article we use theoretical and numerical methods to evaluate in a closed-exact form the parameters of Ramanujan type $1/\pi$ formulas.
We study the problem of approximating the largest root of a real-rooted polynomial of degree $n$ using its top $k$ coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in $k$ that…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…