Rigorous Bounds on Computed Approximations to Square Roots and Cube Roots.

Abstract

Algorithms are given for computing rigorous upper and lower bounds for the square rtoo and the cube root of real machine representable numbers, subject to the condition that the computer operates in the binary number system and allows upward directed rounding. The bounds on the square root are best possible, whereas the cube root is determined within three significant bits. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1970
Accession Number
AD0723806

Entities

People

  • J. Michael Yohe

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Numbers
  • Square Roots

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.