> After changing `BigInteger.sqrt()` algorithm, this can be also used to speed > up `BigDecimal.sqrt()` implementation. Here is how I made it. > > The main steps of the algorithm are as follows: > first argument reduce the value to an integer using the following relations: > > x = y * 10 ^ exp > sqrt(x) = sqrt(y) * 10^(exp / 2) if exp is even > sqrt(x) = sqrt(y*10) * 10^((exp-1)/2) is exp is odd > > Then use BigInteger.sqrt() on the reduced value to compute the numerical > digits of the desired result. > > Finally, scale back to the desired exponent range and perform any adjustment > to get the preferred scale in the representation.
fabioromano1 has updated the pull request incrementally with one additional commit since the last revision: Ensure no increase of precision in 99...9+1 cases ------------- Changes: - all: https://git.openjdk.org/jdk/pull/21301/files - new: https://git.openjdk.org/jdk/pull/21301/files/571507af..5cd590c2 Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=21301&range=09 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=21301&range=08-09 Stats: 3 lines in 1 file changed: 0 ins; 0 del; 3 mod Patch: https://git.openjdk.org/jdk/pull/21301.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/21301/head:pull/21301 PR: https://git.openjdk.org/jdk/pull/21301
