Advertisement

Abstract

We shall study several algorithms of the form
$${X_{n + 1}} = f\left( {{X_n},{Y_n}} \right)$$
$${Y_{n + 1}} = g\left( {{X_n},{Y_n}} \right)$$
where f, g are given functions and x0, y0 are given, from the point of view of the rates of convergence of the sequences y n . In most cases x0, y0 will be non-negative, the sequences x n , y n will be monotonie and bounded and therefore convergent. The limits of x n , y n will be the same in each case but the rates of convergence to these limits will differ markedly from case to case.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag, Basel 1979

Authors and Affiliations

  • John Todd
    • 1
  1. 1.California Institute of TechnologyUSA

Personalised recommendations