Upon A Second Confluent Form of the Ɛ-Algorithm†
Glasgow mathematical journal, Tome 5 (1962) no. 4, pp. 160-165

Voir la notice de l'article provenant de la source Cambridge University Press

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.
Wynn, P. Upon A Second Confluent Form of the Ɛ-Algorithm†. Glasgow mathematical journal, Tome 5 (1962) no. 4, pp. 160-165. doi: 10.1017/S2040618500034535
@article{10_1017_S2040618500034535,
     author = {Wynn, P.},
     title = {Upon {A} {Second} {Confluent} {Form} of the {Ɛ-Algorithm{\textdagger}}},
     journal = {Glasgow mathematical journal},
     pages = {160--165},
     year = {1962},
     volume = {5},
     number = {4},
     doi = {10.1017/S2040618500034535},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S2040618500034535/}
}
TY  - JOUR
AU  - Wynn, P.
TI  - Upon A Second Confluent Form of the Ɛ-Algorithm†
JO  - Glasgow mathematical journal
PY  - 1962
SP  - 160
EP  - 165
VL  - 5
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S2040618500034535/
DO  - 10.1017/S2040618500034535
ID  - 10_1017_S2040618500034535
ER  - 
%0 Journal Article
%A Wynn, P.
%T Upon A Second Confluent Form of the Ɛ-Algorithm†
%J Glasgow mathematical journal
%D 1962
%P 160-165
%V 5
%N 4
%U http://geodesic.mathdoc.fr/articles/10.1017/S2040618500034535/
%R 10.1017/S2040618500034535
%F 10_1017_S2040618500034535

[1] 1.Wynn, P., Confluent forms of certain non-linear algorithms, Arch. Math., 11 (1960), 233–236. Google Scholar

[2] 2.Wynn, P., A note on a confluent form of the Ɛ-algorithm, Arch. Math., 11 (1960), 237. Google Scholar | DOI

[3] 3.Wynn, P., On a device for computing the e(S) transformation, Math. Tables Aids Comput. 10 (1956), 91–96. Google Scholar | DOI

[4] 4.Aitken, A. C., Determinants and matrices (Edinburgh, 1949, 6th edn). Google Scholar

[5] 5.Wynn, P., On the expression of an integral as the limit of an infinite continued fraction; to appear. Google Scholar

[6] 6.Wynn, P., On the rational approximation of a function which is formally defined by a power series expansion, Math. Tables Aids Comput. 14 (1960), 147–186. Google Scholar | DOI

[7] 7.Stieltjes, T. J., Sur la réduction en fraction continue d'une série précédant suivant les puissances descendants d'une variable, Ann. Fac. Sci. Toulouse 3 (1889), 1–17. Google Scholar | DOI

[8] 8.Rutishauser, H., Der quotient Differenzen-Algorithmus (Basel/Stuttgart, 1957). Google Scholar | DOI

[9] 9.Rutishauser, H., Ein kontinuierliches Analogon zum Quotienten-Diflerenzen Algorithmus, Arch. Math. 5 (1954), 132–137. Google Scholar | DOI

[10] 10.Wynn, P., Una nota su un analogo infinitesimale del q-d algoritmo; to appear in Rend. Mat. e Appl. Google Scholar

Cité par Sources :