Iterative Algorithms
3.0
creditsAverage Course Rating
An introduction to the study of the structure, behavior and design of iterative algorithms. Topics include problem formulations, algorithm description and classification, the deterministic iterative (DI) schema, doubling schema, cluster point sets, periodic points, DI schemas without stop rule, the monotonic DI schema, contractive and affine maps, bounded and Cauchy sequences, asymptotically regular sequences, monotonic sequences.