Skip to main content
Log in

Convergence acceleration by a method of intercalation

Konvergenzbeschleunigung durch Einschiebung

  • Published:
Computing Aims and scope Submit manuscript

Summary

Many convergence acceleration techniques function successfully when applied to series of real terms which alternate in sign, but are unsuccessful when applied to series of terms having the same sign. Given a series Σu v of terms having the same sign and whose sumU is required, it is often possible to construct a series of the form u0−v0+u1−v1+..., where Σv v is a series whose terms have the same sign as the {u v} and whose sumV is known, which is amenable to transformation. The required estimate ofU is then recovered from the transformed estimate ofU−V and the known value ofV. Use of this artifice is illustrated with reference to the ⃛-algorithm, two numerical examples being given.

Zusammenfassung

Gewisse Konvergenzbeschleunigungsmethoden erweisen sich als besonders wirksam im Falle von Reihen mit reellen Gliedern, deren Vorzeichen alternieren. Es wird gezeigt, daß unter günstigen Umständen mit Hilfe eines sehr einfachen Kunstgriffes eine gegebene Reihe mit reellen Gliedern und gleichen Vorzeichen mit einer alternierenden Reihe in Beziehung gebracht werden kann und daß daher die gegebene Reihe mit Erfolg transformiert werden kann. Zwei numerische Beispiele werden angegeben.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Wynn, P.: On a device for Computing thee m (S n) Transformation. Maths. of Comp.10, 91–96 (1956).

    Google Scholar 

  2. Wynn, P.: A Note on Programming Repeated Application of the ⃛-Algorithm. Chiffres8, 23–62 (1965).

    Google Scholar 

  3. British Association for the Advancement of Science, Mathematical Tables, 1, Cambridge (1946).

  4. Wynn, P.: On the Convergence and Stability of the Epsilon Algorithm. SIAM Jour. for Num. Anal.3, 91–122 (1966).

    Google Scholar 

  5. Wynn, P.: Acceleration Techniques in Numerical Analysis, with Particular Reference to Problems in One Independent Variable, Proc. IFIP Congress 1962, pp. 149–156. Amsterdam; North Holland. 1962.

    Google Scholar 

  6. Barkley-Rosser, J.: Theory and Application\(\int\limits_0^z {e^{ - x^2 } dx} \) and\(\int\limits_0^z {e^{ - p^2 y^2 } dy} \int\limits_0^y {e^{ - x^2 } dz} \). Brooklyn, N. Y.: Mapleton Press. 1948.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Work supported by NSF Grant GP-26010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wynn, P. Convergence acceleration by a method of intercalation. Computing 9, 267–273 (1972). https://doi.org/10.1007/BF02241602

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02241602

Keywords

Navigation