A Recursive Scheme for Improving the Original Rate of Convergence to the Euler—Mascheroni Constant
Edward Chlebus
Abstract
Edward Chlebus
Abstract
We have used Euler-Maclaurin summation to develop a recursive scheme for modifying the original approximation for the Euler-Mascheroni constant γ. Convergence to γ resulting from successively employing the proposed scheme has been significantly accelerated while the form of the approximation originally introduced by Euler is still preserved.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We have used Euler-Maclaurin summation to develop a recursive scheme for modifying the original approximation for the Euler-Mascheroni constant γ. Convergence to γ resulting from successively employing the proposed scheme has been significantly accelerated while the form of the approximation originally introduced by Euler is still preserved.
Key concepts: Euler's formula, Constant (computer programming), Convergence (economics), Scheme (mathematics), Euler summation, Mathematics, Rate of convergence, Applied mathematics