- This algorithm is designed for non-negative integers only. - The result is rounded down to the nearest integer. - The algorithm has a time complexity of O(log(x)). - Original algorithm idea based on ...

A high-speed algorithm for calculating the square root is proposed. This algorithm, which can be regarded as calculation of the step response of a kind of nonlinear IIR filter, requires no divisions.

Abstract: This article proposes a set of algorithms for calculating the square root and inverse square root for normalized single and double precision floating-point numbers. They are based on the ...

- This algorithm is designed for non-negative integers only. - The result is rounded down to the nearest integer. - The algorithm has a time complexity of O(log(x)). - Original algorithm idea based on ...