Stirling's Original Asymptotic Series from a Formula like one of Binet's and its Evaluation by Sequence Acceleration
From MaRDI portal
Publication:6300352
DOI10.1080/10586458.2019.1593898arXiv1804.05263WikidataQ128044161 ScholiaQ128044161MaRDI QIDQ6300352FDOQ6300352
Authors: Robert M. Corless, Leili Rafiee Sevyeri
Publication date: 14 April 2018
Abstract: We give an apparently new proof of Stirling's original asymptotic formula for the behavior of for large . Stirling's original formula is not the formula widely known as "Stirling's formula", which was actually due to De Moivre. We also show by experiment that this old formula is quite effective for numerical evaluation of over , when coupled with the sequence acceleration method known as Levin's -transform. As an homage to Stirling, who apparently used inverse symbolic computation to identify the constant term in his formula, we do the same in our proof.
This page was built for publication: Stirling's Original Asymptotic Series from a Formula like one of Binet's and its Evaluation by Sequence Acceleration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300352)