Related papers: Ramanujan's approximation to the exponential funct…
Perron's saddle-point method gives a way to find the complete asymptotic expansion of certain integrals that depend on a parameter going to infinity. We give two proofs of the key result. The first is a reworking of Perron's original proof,…
A conjectured relation between Ramanujan's asymptotic approximations to the exponential function and the exponential integral is established. The proof involves Stirling numbers, second-order Eulerian numbers, modifications of both of…
We investigate depoissonization, the problem of recovering asymptotics of sequence coefficients from their exponential generating function. Classical approaches rely on complex-analytic growth conditions, but here we develop real-variable…
We obtain the asymptotic expansion for large integer $n$ of a generalised sine-integral \[\int_0^\infty\left(\frac{\sin\,x}{x}\right)^{n}dx\] by utilising the saddle-point method. This expansion is shown to agree with recent results of J.…
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…
We give an overview of basic methods that can be used for obtaining asymptotic expansions of integrals: Watson's lemma, Laplace's method, the saddle point method, and the method of stationary phase. Certain developments in the field of…
The perimeter of an ellipse has no exact closed-form expression in terms of elementary functions, and numerous approximations have been proposed since the eighteenth century. Classical formulas by Fagnano, Euler, and Ramanujan, as well as…
We give an elementary proof for new strict upper and lower bounds for the correction term in Ramanujan's approximation for the factorial function
Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.
In this work, we introduce two algorithmic frameworks, named Bregman extragradient method and Bregman extrapolation method, for solving saddle point problems. The proposed frameworks not only include the well-known extragradient and…
In this work, we deal with an iteration method for approximating a fixed point of a contraction mapping using the Mann's algorithm under functional random errors. We first show its almost complete convergence to the fixed point by mean of…
We study in detail the Ramanujan smooth expansions, for arithmetic functions; we start with the most general ones, for which we supply the "$P-$local expansions", for arguments with all prime-factors $p\le P$ (namely, $P-$smooth arguments),…
In this paper, we apply the saddle-point method in conjunction with the theory of the N$\ddot{o}$rlund-Rice integrals to derive a precise asymptotic formula for the generalized Li coefficients established by Omar and Mazhouda. Actually, for…
For $k\geqslant 1$, denote by $p_k(n)$ the number of partitions of an integer $n$ into $k$-th powers. In this note, we apply the saddle-point method to provide a new proof for the well-known asymptotic expansion of $p_k(n)$. This approach…
A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…
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 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.
Here we introduce a generalization of the exponential sampling series of optical physics and establish pointwise and uniform convergence theorem, also in a quantitative form. Moreover we compare the error of approximation for Mellin…
All arithmetical functions $F$ satisfying Ramanujan Conjecture, i.e., $F(n)\ll_{\varepsilon}n^{\varepsilon}$, and with $Q-$smooth divisors, i.e., with Eratosthenes transform $F':=F\ast \mu$ supported in $Q-$smooth numbers, have a kind of…
This technical note describes the application of saddle-point integration to the asymptotic Fourier analysis of the well-known $C_\infty$ "bump" function $\exp[-(1-x^2)^{-1}]$, deriving both the asymptotic decay rate $k^{-3/4} \exp(-\sqrt…