2010
DOI: 10.1590/s1807-03022010000300009
|View full text |Cite
|
Sign up to set email alerts
|

Fast convergences towards Euler-Mascheroni constant

Abstract: Abstract. The aim of this paper is to introduce a new family of sequences which faster converge to the Euler-Mascheroni constant. Finally, numerical computations are given.Mathematical subject classification: 41A60, 41A25, 57Q55.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 30 publications
(16 citation statements)
references
References 26 publications
0
16
0
Order By: Relevance
“…Remark 2.1. Lemma 2.1 was first established in [15] and has been effectively applied in many papers such as [2,3,6,7,8,9,10,11,13,14,16].…”
Section: A Lemmamentioning
confidence: 99%
“…Remark 2.1. Lemma 2.1 was first established in [15] and has been effectively applied in many papers such as [2,3,6,7,8,9,10,11,13,14,16].…”
Section: A Lemmamentioning
confidence: 99%
“…Later, some faster approximations to the Euler-Mascheroni constant were established in [3][4][5][6]. For example, Negoi [6] proved that the sequence…”
Section: Introductionmentioning
confidence: 99%
“…where γ is the Euler-Mascheroni constant (γ = 0.5772...) [18]. Proof: Define a sequence U N as U N = ∆ N j=0 c j −ln(N ).…”
Section: A Without Channel Estimation Energy (E T = 0)mentioning
confidence: 99%
“…Step: Consider the case N = n+1. The optimization problem in (18) can be written as By using the threshold policy assumption, we have two cases: i) ρ n = e t for |h n | 2 < γ n (P ) which leads to s n−1 = 1; and ii) ρ n = P for |h n | 2 > γ n (P ) which leads to s n−1 = 0, where γ n (P ) is the threshold at frame n. Thus, the objective function of (23) can be given as…”
Section: B With Channel Estimation Energy (E T = 0)mentioning
confidence: 99%