520-419 Theory and Design of Iterative Algorithms: Fall 1999

520-419 Theory and Design of Iterative Algorithms Fall 1999

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

Contractive and Affine Maps

Appendix

topological concepts in E^n

bounded and Cauchy sequences

asymptotically regular sequences

monotonic sequences

Home Page Topics