Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMultiple-correction and continued fraction approximation(II)
130
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The main aim of this paper is to further develop the multiple-correction method that formulated in our previous works~cite{CXY, Cao}. As its applications, we establish a kind of hybrid-type finite continued fraction approximations related to BBP-type series of the constant $pi$ and other classical constants, such as Catalan constant, $pi^2$, etc.
rate research
Read More
We show that the growth rate of denominator $Q_n$ of the $n$-th convergent of negative expansion of $x$ and the rate of approximation: $$ frac{log{n}}{n}log{left|x-frac{P_n}{Q_n}right|}rightarrow -frac{pi^2}{3} quad text{in measure.} $$ for a.e. $x$. In the course of the proof, we reprove known inspiring results that arithmetic mean of digits of negative continued fraction converges to 3 in measure, although the limit inferior is 2, and the limit superior is infinite almost everywhere.
In this paper, we represent a continued fraction expression of Mathieu series by a continued fraction formula of Ramanujan. As application, we obtain some new bounds for Mathieu series.
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 Morticis lemma and the Mortici-transformation. As applications, we will present some sharp inequalities, and the continued fraction expansions associated to the volume of the unit ball. In addition, we obtain a new continued fraction expansion of Ramanujan for a ratio of the gamma functions, which is showed to be the fastest possible. Finally, three conjectures are proposed.
The goal of this work is to formulate a systematical method for looking for the simple closed form or continued fraction representation of a class of rational series. As applications, we obtain the continued fraction representations for the alternating Mathieu series and some rational series. The main tools are multiple-correction and two of Ramanujans continued fraction formulae involving the quotient of the gamma functions.
We compute explicitly the density of the invariant measure for the Reverse algorithm which is absolutely continuous with respect to Lebesgue measure, using a method proposed by Arnoux and Nogueira. We also apply the same method on the unsorted version of Brun algorithm and Cassaigne algorithm. We illustrate some experimentations on the domain of the natural extension of those algorithms. For some other algorithms, which are known to have a unique invariant measure absolutely continuous with respect to Lebesgue measure, the invariant domain found by this method seems to have a fractal boundary, and it is unclear that it is of positive measure.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
