Title :
On error bounds for successive approximation methods
Author_Institution :
University of Illinois, Urbana, IL, USA
fDate :
6/1/1976 12:00:00 AM
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.
Keywords :
Approximation methods; Dynamic programming; Approximation methods; Chaotic communication; Dynamic programming; Error correction; Inspection; Iron; Polynomials; Silicon compounds; Transfer functions;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.1976.1101232
