Integer-root certificates for rational radicands #
The binary logarithm of the exact radicand locates the root's binade without searching the descriptor's exponent range. After target scaling, the proved integer-root kernel supplies the significand. Scaling is shared with the exact fractional classification, and the binade is reused when constructing the final certificate. Degree zero retains the total comparison specification.
Integer part of the square root after exact target scaling.
Instances For
Floor binary logarithm of a positive root, using Euclidean division for negative exponents.
Instances For
Exact integer part of a scaled root; degree zero retains the comparison specification.
Instances For
Classify the root's fractional part using its already scaled numerator and denominator.
Instances For
Integer cross-products classify the exact root against an integer and its midpoint.
Instances For
Build an integer-root certificate at a known exponent, sharing the exact scaled ratio.
Instances For
Build the same accuracy certificate using integer roots and the radicand's binary logarithm.
Instances For
The degree-two specialization of the integer-root certificate.
Instances For
Single-round rational root using integer binade classification and exact integer roots.
Only the exact underflow midpoint needs a power comparison at a descriptor boundary. Degree zero and nonpositive radicands retain the reference oracle's total behavior.
Instances For
Single-round rational square root without exponent or significand comparison searches.
Instances For
Use integer square root at degree two and proved integer Newton iteration otherwise.