Affiliation:
1. Bell Telephone Lab, Murray Hill, NJ
Abstract
The class of iteration formulas obtainable by rational approximations of “Euler's formula” is derived with the corresponding error estimates. Some historical notes on iterative procedures are followed by a derivation of Euler's formula with the associated error estimate in a new notation which simplifies the error estimate and suggests generalizations. The final section considers the Padé approximants to the “Euler polynomial” and shows how a number of known formulas may be derived from this unified approach. There is a short discussion of the “best” formula.
Publisher
Association for Computing Machinery (ACM)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Methods Involving Second or Higher Derivatives;Studies in Computational Mathematics;2013
2. On the Geometry of Halley's Method;The American Mathematical Monthly;1995-05
3. On the Geometry of Halley's Method;The American Mathematical Monthly;1995-05
4. Several new methods for solving equations;International Journal of Computer Mathematics;1988-01
5. Procedures for solving Kepler's equation;Celestial Mechanics;1986-04