Rigorous Bounds on Computed Approximations to Square Roots and Cube Roots

摘要

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)