Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 394-396 |
Number of pages | 3 |
Journal | IEEE Transactions on Automatic Control |
Volume | 21 |
Issue number | 3 |
DOIs | |
State | Published - Jun 1976 |
Externally published | Yes |
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering