𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Legendre modified moments for Euler's constant

✍ Scribed by Marc Prévost

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
164 KB
Volume
219
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

Polynomial moments are often used for the computation of Gauss quadrature to stabilize the numerical calculation of the orthogonal polynomials, see [W.

📜 SIMILAR VOLUMES

Criteria for irrationality of generalize
Criteria for irrationality of generalized Euler's constant
✍ T Hessami Pilehrood; Kh Hessami Pilehrood 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 257 KB

We generalize Sondow's (ir)rationality criteria for Euler's constant and give necessary and sufficient conditions for irrationality of generalized Euler's constant g a ; as well as obtain new asymptotic formulas for computing g a : The proof is based on constructing linear forms in 1; g a and logari

An Efficient Method for Computation of L
An Efficient Method for Computation of Legendre Moments
✍ Huazhong Shu; Limin Luo; Xudong Bao; Wenxue Yu; Guoniu Han 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 227 KB

The two-dimensional (2D) and three-dimensional (3D) orthogonal moments are useful tools for 2D and 3D object recognition and image analysis. However, the problem of computation of orthogonal moments has not been well solved because there exist few algorithms that can efficiently reduce the computati

A new fast method for computing Legendre
A new fast method for computing Legendre moments
✍ H.Z. Shu; L.M. Luo; W.X. Yu; Y. Fu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 161 KB

This paper presents a new algorithm for fast and accurate computation of Legendre moments. For a binary image, by use of a Green's theorem, we transform a surface integral to a simple integration along the boundary. The inter-order relationship of Legendre moments is then investigated. As a result,

Two new algorithms for efficient computa
Two new algorithms for efficient computation of Legendre moments
✍ J.D. Zhou; H.Z. Shu; L.M. Luo; W.X. Yu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Orthogonal moments have been successfully used in the ÿeld of pattern recognition and image analysis. However, the direct computation of orthogonal moments is very expensive. In this paper, we present two new algorithms for fast computing the two-dimensional (2D) Legendre moments. The ÿrst algorithm

On a sequence transformation with integr
On a sequence transformation with integral coefficients for Euler's constant, II
✍ Carsten Elsner 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Let s n = 1 + 1/2 + • • • + 1/(n -1)log n. In 1995, the author has found a series transformation of the type n k=0 μ n,k,τ s k+τ with integer coefficients μ n,k,τ , from which geometric convergence to Euler's constant γ for τ = O(n) results. In recently published papers T. Rivoal and Kh. & T. Hessam