Stability and Convergence of Monotonic Algorithms.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0770705

Entities

People

  • Karl L. Nickel

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Consistency
  • Convergence

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space