- Research
- Open Access
- Published:
Approximation for the gamma function via the tri-gamma function
Journal of Inequalities and Applications volume 2017, Article number: 309 (2017)
Abstract
In this paper, we present a new sharp approximation for the gamma function via the tri-gamma function. This approximation is fast in comparison with the recently discovered asymptotic series. We also establish the inequalities related to this approximation. Finally, some numerical computations are provided for demonstrating the superiority of our approximation.
1 Introduction
It is well known that we often need to deal with the problem of approximating the factorial function n! and its extension to real numbers called the gamma function, defined by
and the logarithmic derivatives of \(\Gamma (x)\) are called the psi-gamma functions, denoted by
For \(x > 0\), the derivatives \(\psi '(x)\) are called the tri-gamma functions, while the derivatives \(\psi^{(k)}(x)\), \(k = 1, 2, 3,\ldots\) , are called the poly-gamma functions.
Mortici [1] proved that
and
where \(B_{k}\), \(k\geq 0\), noting the Bernoulli numbers which are generated by
It is found that
However, those coefficients of the asymptotic formula (1.1) are not complete. The asymptotic expansion of \(\Gamma (x+1)\) via the tri-gamma function can be generalized to the general cases by the arguments in [2] as follows.
Barnes (1899) and Rowe (1931) have shown that
where \(\vert \arg z\vert \leq \pi -\varepsilon \), \(\varepsilon >0\) and \(B_{k}(x)\) is the Bernoulli polynomial. If \(a=\frac{1}{2}\), \(B_{k}(a)\) vanishes if k is odd, note that
for \(\vert \arg z\vert \leq \pi -\varepsilon \), \(\varepsilon >0\) listed in [2], p. 32, (5). We can get as \(x\rightarrow \infty \),
So we consider a function \(h(x)\) defined by
By (1.7), one can easily obtain that as \(x\rightarrow \infty \),
Thus, together with (1.8) the asymptotic expansion can be explicitly expressed as
where
here \(B_{n}\) denotes the Bernoulli number.
In this paper we will apply the multiple-correction method [3–5] to construct a new asymptotic expansion for the factorial n! and the gamma function via the tri-gamma function.
Theorem 1
For every integer \(n\geq 1\), we have
where
Using Theorem 1, we provide some inequalities for the gamma function.
Theorem 2
For every integer \(n>1\), the following holds:
To obtain Theorem 2, we need the following lemma which was used in [6–8] and is very useful for constructing asymptotic expansions.
Lemma 1
If the sequence \((x_{n})_{n\in \mathbb{N}}\) is convergent to zero and there exists the limit
with \(s>1\), then
Lemma 1 was proved by Mortici in [6]. From Lemma 1, we can see that the speed of convergence of the sequences \((x_{n})_{n\in \mathbb{N}}\) increases together with the values s satisfying (1.13).
2 Proof of Theorem 1
(Step 0) The initial-correction. We can introduce a sequence \((u_{0}(n))_{n\geq 1}\) by the relation
and to say that an approximation \(n! \sim \sqrt{2\pi n} ( \frac{n}{e} ) ^{n} \exp ( \frac{1}{12}\psi '(n+1/2) ) \) is better if the speed of convergence of \(u_{0}(n)\) is higher.
From (2.1), we have
For any integer k, \(x > 0\), we have \(\psi^{(k)}(x+1)=\psi^{(k)}(x)+(-1)^{k}\frac{k!}{x ^{k+1}}\) and when \(k=1\), \(x=n\), it yields \(\psi '(n+1)=\psi '(n)-\frac{1}{n ^{2}}\). Thus,
Developing (2.3) into power series expansion in \(1/n\), we have
By Lemma 1, we know that the rate of convergence of the sequence \((u_{0}(n))_{n\geq 1}\) is \(n^{-3}\).
(Step 1) The first-correction. We define the sequence \((u_{1}(n))_{n\geq 1}\) by the relation
where
From (2.5), we have
Developing (2.6) into power series expansion in \(1/n\), we have
By Lemma 1, the fastest possible sequence \((u_{1}(n))_{n\geq 1}\) is obtained as the first four items on the right-hand side of (2.7) vanish.
-
(i)
If \(a_{1}\neq \frac{1}{240}\), then the rate of convergence of the sequence \((u_{1}(n))_{n\geq 1}\) is \(n^{-3}\).
-
(ii)
If \(a_{1}=\frac{1}{240}\), \(b_{2}=0\), \(b_{1}=\frac{11}{28}\), \(b_{0}=0\), from (2.7) we have
$$\begin{aligned} u_{1}(n)-u_{1}(n+1)=\frac{193}{40{,}320}\frac{1}{n^{8}}+O \biggl( \frac{1}{n ^{9}} \biggr) , \end{aligned}$$and the rate of convergence of the sequence \((u_{1}(n))_{n\geq 1}\) is at least \(n^{-7}\).
(Step 2) The second-correction. So we define the sequence \((u_{2}(n))_{n\geq 1}\) by the relation
where
Using the same method as above, we obtain that the sequence \((u_{2}(n))_{n\geq 1}\) converges fastest only if \(a_{2}= \frac{193}{282{,}240}\), \(b_{6}=0\), \(b_{5}=\frac{108{,}338}{44{,}583}\), \(b_{4}=0\), \(b _{3}=-\frac{21{,}252{,}897{,}179}{59{,}061{,}418{,}416}\), \(b_{2}=0\), \(b_{1}= \frac{997{,}042{,}514{,}542{,}183}{188{,}081{,}086{,}945{,}752}\), \(b_{0}=0\), and the rate of convergence of the sequence \((u_{2}(n))_{n\geq 1}\) is at least \(n^{-15}\). We can get
The new asymptotic (1.11) is obtained.
3 Proof of Theorem 2
The double-side inequality (1.12) may be written as follows:
and
Suppose \(F(n)=f(n+1)-f(n)\) and \(G(n)=g(n+1)-g(n)\). For every \(x>1\), we can get
and
where
\(A(x)=471{,}110{,}623{,}493{,}199{,}298{,}560 x^{20}+\cdots\) is a polynomial of 20th degree with all positive coefficients and \(B(x)=-26{,}572{,}808{,}192 x^{12}-\cdots\) is a polynomial of 12th degree with all negative coefficients.
This shows that \(F(x)\) is strictly convex and \(G(x)\) is strictly concave on \((0,\infty )\). According to Theorem 1, when \(n\rightarrow \infty \), it holds that \(\lim_{n\rightarrow \infty }f(n) = \lim_{n\rightarrow \infty }g(n) = 0\); thus \(\lim_{n\rightarrow \infty }F(n) = \lim_{n\rightarrow \infty }G(n) = 0\). As a result, we can make sure that \(F(x) > 0\) and \(G(x) < 0\) on \((0,\infty )\). Consequently, the sequence \(f(n)\) is strictly increasing and \(g(n)\) is strictly decreasing while they both converge to 0. As a result, we conclude that \(f(n) < 0\) and \(g(n) > 0\) for every integer \({n > 1}\).
The proof of Theorem 2 is complete.
4 Numerical computations
In this section, we give Table 1 to demonstrate the superiority of our new series respectively. From what has been discussed above, we found out the new asymptotic function as follows:
where
Mortici and Qi [1] gave the formula
We can get the approximation by truncation of the asymptotic formula (1.9)
The great advantage of our approximation \(\beta (n)\) consists in its simple form and its accuracy. From Table 1, we can see that the formula \(\beta (n)\) converges faster than the approximation of the formula \(\alpha_{1}(n)\) and \(\alpha_{2}(n)\).
References
Mortici, C, Qi, F: Asymptotic formulas and inequalities for the gamma function in terms of the tri-gamma function. Results Math. 67, 395-402 (2015)
Luke, YL: The Special Functions and Their Applications, Vol. I, pp. 8-37. Academic Press, New York (1969)
Cao, XD, Xu, HM, You, X: Multiple-correction and faster approximation. J. Number Theory 149, 327-350 (2015)
Cao, XD: Multiple-correction and continued fraction approximation. J. Math. Anal. Appl. 424, 1425-1446 (2015)
Cao, XD, You, X: Multiple-correction and continued fraction approximation (II). Appl. Math. Comput. 261, 192-205 (2015)
Mortici, C: Product approximations via asymptotic integration. Am. Math. Mon. 117(5), 434-441 (2010)
Mortici, C: New improvements of the Stirling formula. Appl. Math. Comput. 217(2), 699-704 (2010)
Mortici, C: A continued fraction approximation of the gamma function. J. Math. Anal. Appl. 402, 405-410 (2013)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant No. 61403034) and Beijing Municipal Commission of Education Science and Technology Program KM201810017009. Computations made in this paper were performed using Mathematica 9.0.
Author information
Authors and Affiliations
Contributions
The authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
You, X., Li, X. Approximation for the gamma function via the tri-gamma function. J Inequal Appl 2017, 309 (2017). https://doi.org/10.1186/s13660-017-1585-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-017-1585-7
MSC
- 33B15
- 26D15
- 41A25
Keywords
- approximation
- gamma function
- inequalities
- multiple-correction method