Integrated: 8334755: Asymptotically faster implementation of square root algorithm

[fabioromano1]

On Thu, 13 Jun 2024 18:31:33 GMT, fabioromano1 <duke at openjdk.org> wrote:

> I have implemented the Zimmermann's square root algorithm, available in works [here](https://inria.hal.science/inria-00072854/en/) and [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
> 
> The algorithm is proved to be asymptotically faster than the Newton's Method, even for small numbers. To get an idea of how much the Newton's Method is slow,  consult my article [here](https://arxiv.org/abs/2406.07751), in which I compare Newton's Method with a version of classical square root algorithm that I implemented. After implementing Zimmermann's algorithm, it turns out that it is faster than my algorithm even for small numbers.

This pull request has now been integrated.

Changeset: 367e0a65
Author:    fabioromano1 <51378941+fabioromano1 at users.noreply.github.com>
Committer: Raffaello Giulietti <rgiulietti at openjdk.org>
URL:       https://git.openjdk.org/jdk/commit/367e0a65561f95aad61b40930d5f46843fee3444
Stats:     416 lines in 4 files changed: 331 ins; 26 del; 59 mod

8334755: Asymptotically faster implementation of square root algorithm

Reviewed-by: rgiulietti

-------------

PR: https://git.openjdk.org/jdk/pull/19710