Skip Navigation

The Computer Journal 1971 14(4):437-441; doi:10.1093/comjnl/14.4.437
© 1971 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow A correction has been published
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (15)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wynn, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A note on the generalised Euler transformation*

P. Wynn §

Department of Mathematics, Louisiana State University in New Orleans, Louisiana, USA

The generalised Euler transformation is a well-known device for accelerating the numerical convergence of infinite series. In practice the transformation is often applied to the infinite series remaining after the first m terms have been added together to form a partial sum. The other partial sums, obtained by taking the first m terms of the original series and the first r terms of the transformed remained series form a double sequence of approximations to the sum or formal sum of the original series. The purpose of this note is to point out that the partial sums may be built up by means of a remarkably simple recursion.


* Technical Report No. 42, April 1970.

§ Department of Mathematics, Louisiana State University in New Orleans


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.