Guaranteed Convergence Rate Estimates for a Class of Iterative Procedures: Their Comparison

  • Authors:

  • A. M. Krasnosel'skii;A. V. Pokrovskii;D. I. Rachinskii

  • Affiliations:

  • Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia;University College, Cork, Ireland;Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The main difficulty in parallelization and synchronization of computations for speeding up the convergence of iterative procedures is the optimal guaranteed convergence rate estimation. A theorem is formulated concerning the guaranteed convergence rate estimates for certain procedures, in which resources are primarily allotted to the computation of nonlinearity components. Its proof is based on the use of new estimates for the spectral radii of the products of matrix sequences of asynchronous component computations.