520-419 Theory of Iterative Algorithms: Fall 1998

520-419 Theory of Iterative Algorithms Fall 1998

Problems and Algorithm Representations:

solution set and relations between problems,

parameterized families of problems,

problem formulations,

algorithm description and classification,

family of sequences,

miscellaneaous considerations.

The Deterministic Iterative Schema:

schema and characteristic set

analysis andd synthesis

the Liapunov matrix equation

doubling scheme

cluster point set

periodic points

schema without stop rule

Appendix:

topological concepts in E^n

bounded and Cauchy sequences

asymptotically regular sequences

monotonic sequences

Home Page Topics