Stability and Convergence of Monotonic Algorithms.

Monotonic numerical algorithms in a partially ordered metric space are considered. Using a termination criterion which is appropriate to the monotonicity, one finds that consistency and local stability imply convergence. Applications to interval analysis are presented. The numerical differentiation of a function is treated as an example. Author