Upon A Second Confluent Form of the Ɛ-Algorithm
- 1 January 1962
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Glasgow Mathematical Association
- Vol. 5 (4) , 160-165
- https://doi.org/10.1017/s2040618500034535
Abstract
In two previous papers [1], [2] the confluent formof the δ-algorithm [3]was established, and various properties which the confluent form of the algorithm possesses were discussed. It was shown, among other things, that if in (1)and the notationis used, then (1) is satisfied byand further that under certain conditions, and for a certain n,identically. It is the purpose of this note to derive another confluent form of the Ɛ-algorithm and to discuss its properties.Keywords
This publication has 6 references indexed in Scilit:
- A note on a confluent form of the ?-algorithmArchiv der Mathematik, 1960
- The rational approximation of functions which are formally defined by a power series expansionMathematics of Computation, 1960
- Der Quotienten-Differenzen-AlgorithmusPublished by Springer Nature ,1957
- On a Device for Computing the e m (S n ) TransformationMathematical Tables and Other Aids to Computation, 1956
- Ein infinitesimales Analogon zum Quotienten-Differenzen-AlgorithmusArchiv der Mathematik, 1954
- Sur la réduction en fraction continue d'une série procédant suivant les puissances descendantes d'une variableAnnales de la faculté des sciences de Toulouse Mathématiques, 1889