Numerical analysis: an introduction
Numerical analysis: an introduction
Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
| Hi-index | 7.29 |
In the letter to Daniel Bernoulli, Euler reports on his attempt to compute the common logarithm logx by interpolation at the successive powers of 10. He notes that for x=9 the procedure, though converging fast, yields an incorrect answer. The interpolation procedure is analyzed mathematically, and the discrepancy explained on the basis of modern function theory. It turns out that Euler's procedure converges to a q-analogue S"q(x) of the logarithm, where q=110. In the case of the logarithm log"@wx to base @w1 (considered by Euler almost twenty years later), the limit of the analogous procedure (interpolating at the successive powers of @w) is S"q(x) with q=1/@w. It is shown that by taking @w1 sufficiently close to 1 and interpolating at sufficiently many points, the logarithm logx can indeed be approximated arbitrarily closely, although, if x, 10, accumulating at the lower end point, is shown to converge to the desired limit, but also not without numerical complications.