On Error Bounds for Successive Approximation Methods

Research output: Contribution to journalLetterpeer-review

4 Scopus citations


This note considers a class of contraction mappings and the successive approximation method for obtaining the associated fixed points. Some error bounds are provided which generalize and strengthen those given by McQueen [1] and Denardo [2] for dynamic programming algorithms.

Original languageEnglish (US)
Pages (from-to)394-396
Number of pages3
JournalIEEE Transactions on Automatic Control
Issue number3
StatePublished - Jun 1976
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'On Error Bounds for Successive Approximation Methods'. Together they form a unique fingerprint.

Cite this