Square root algorithms compute the non-negative square root S {\displaystyle {\sqrt {S}}} of a positive real number S {\displaystyle S} . Since all square...
71 KB (12,341 words) - 21:15, 25 July 2025
Fast inverse square root, sometimes referred to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1 x {\textstyle...
35 KB (4,648 words) - 02:43, 15 June 2025
conclusion is that algorithms which compute isqrt() are computationally equivalent to algorithms which compute sqrt(). The integer square root of a non-negative...
26 KB (3,191 words) - 07:11, 19 May 2025
mathematics, a square root of a number x is a number y such that y 2 = x {\displaystyle y^{2}=x} ; in other words, a number y whose square (the result of...
48 KB (6,213 words) - 04:13, 7 July 2025
Quadratic residue (redirect from Modular square root)
factoring algorithms that use quadratic residues and the law of quadratic reciprocity. Several modern factorization algorithms (including Dixon's algorithm, the...
54 KB (5,575 words) - 07:28, 20 July 2025
time is proportional to the square root of the smallest prime factor of the composite number being factorized. The algorithm is used to factorize a number...
13 KB (1,755 words) - 06:12, 18 April 2025
The square root of 2 (approximately 1.4142) is the positive real number that, when multiplied by itself or squared, equals the number 2. It may be written...
42 KB (6,133 words) - 17:56, 24 July 2025
In bioinformatics, the root mean square deviation of atomic positions, or simply root mean square deviation (RMSD), is the measure of the average distance...
10 KB (1,268 words) - 18:55, 14 October 2024
In mathematics, a square-free polynomial is a univariate polynomial (over a field or an integral domain) that has no multiple root in an algebraically...
7 KB (1,340 words) - 14:17, 12 March 2025
designs and software. Division algorithms fall into two main categories: slow division and fast division. Slow division algorithms produce one digit of the...
43 KB (5,900 words) - 04:46, 16 July 2025
have at least one root. Therefore, root-finding algorithms consists of finding numerical solutions in most cases. Root-finding algorithms can be broadly...
28 KB (4,028 words) - 03:22, 26 July 2025
square of the quantity being estimated. In an analogy to standard deviation, taking the square root of MSE yields the root-mean-square error or root-mean-square...
24 KB (3,861 words) - 12:45, 11 May 2025
plus beta min algorithm is a high-speed approximation of the square root of the sum of two squares. The square root of the sum of two squares, also known...
5 KB (636 words) - 19:05, 18 May 2025
Nested radical (redirect from Landau's denesting algorithm)
a nested radical is a radical expression (one containing a square root sign, cube root sign, etc.) that contains (nests) another radical expression...
19 KB (3,544 words) - 05:38, 1 August 2025
Newton's method (redirect from Newton's method for finding a root)
Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or...
71 KB (9,136 words) - 10:06, 10 July 2025
particular, if such an algorithm does not find any root, one does not know whether it is because there is no real root. Some algorithms compute all complex...
32 KB (4,602 words) - 13:39, 29 July 2025
outputted the training data code implementing the fast inverse square root algorithm, including comments and an incorrect copyright notice. In response...
14 KB (1,379 words) - 19:13, 31 July 2025
mathematics, the square root of a matrix extends the notion of square root from numbers to matrices. A matrix B is said to be a square root of A if the matrix...
29 KB (4,651 words) - 22:14, 17 March 2025
integer GCD algorithms, such as those of Schönhage, and Stehlé and Zimmermann. These algorithms exploit the 2×2 matrix form of the Euclidean algorithm given...
126 KB (15,342 words) - 01:03, 25 July 2025
a prime: that is, to find a square root of n modulo p. Tonelli–Shanks cannot be used for composite moduli: finding square roots modulo composite numbers...
19 KB (3,751 words) - 01:15, 9 July 2025
number x of which the root is taken is the radicand. A root of degree 2 is called a square root and a root of degree 3, a cube root. Roots of higher degree...
32 KB (4,774 words) - 19:04, 8 July 2025
then replace r0 with m - r0, which will still be a root of -d). Then use the Euclidean algorithm to find r 1 ≡ m ( mod r 0 ) {\displaystyle r_{1}\equiv...
3 KB (448 words) - 05:09, 6 February 2025
In the real number system, square numbers are non-negative. A non-negative integer is a square number when its square root is again an integer. For example...
18 KB (2,540 words) - 21:45, 22 June 2025
molecular and protein structures (in particular, see root-mean-square deviation (bioinformatics)). The algorithm only computes the rotation matrix, but it also...
9 KB (1,138 words) - 17:15, 11 November 2024
Turing run-time complexity of the square-root sum problem? More unsolved problems in computer science The square-root sum problem (SRS) is a computational...
10 KB (1,436 words) - 22:41, 23 June 2025
The square root of 5, denoted 5 {\displaystyle {\sqrt {5}}} , is the positive real number that, when multiplied by itself, gives the natural number...
21 KB (2,979 words) - 21:29, 31 July 2025
multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient...
47 KB (6,886 words) - 11:27, 22 July 2025
Dixon's factorization method (redirect from Dixon's algorithm)
factorization method (also Dixon's random squares method or Dixon's algorithm) is a general-purpose integer factorization algorithm; it is the prototypical factor...
13 KB (2,513 words) - 21:23, 10 June 2025
algorithms (also known as force-directed algorithms or spring-based algorithm) Spectral layout Network analysis Link analysis Girvan–Newman algorithm:...
72 KB (7,951 words) - 17:13, 5 June 2025
frequently appears in the analysis of algorithms, not only because of the frequent use of binary number arithmetic in algorithms, but also because binary logarithms...
42 KB (5,128 words) - 18:59, 4 July 2025