Upon A Second Confluent Form of the Ɛ-Algorithm
P. Wynn · Proceedings of the Glasgow Mathematical Association · 1962
In two previous papers [1], [2] the confluent form of 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 notation is used, then (1) is satisfied by and further that under certain conditions, and for a certainn, identically. It is the purpose of this note to derive another confluent form of the Ɛ-algorithm and to discuss its properties.