Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 82e7948

Browse files
authored
Fix typos in comment (GH-21966)
1 parent 31967fd commit 82e7948

1 file changed

Lines changed: 2 additions & 2 deletions

File tree

Modules/mathmodule.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2440,7 +2440,7 @@ addend should be in the range: 0.5 <= |x| <= 1.0. Accordingly,
24402440
scaling or division by *max* should not be skipped even if not
24412441
otherwise needed to prevent overflow or loss of precision.
24422442
2443-
The assertion that hi*hi >= 1.0 is a bit subtle. Each vector element
2443+
The assertion that hi*hi <= 1.0 is a bit subtle. Each vector element
24442444
gets scaled to a magnitude below 1.0. The Veltkamp-Dekker splitting
24452445
algorithm gives a *hi* value that is correctly rounded to half
24462446
precision. When a value at or below 1.0 is correctly rounded, it
@@ -2458,7 +2458,7 @@ The correction is the first order term of the Maclaurin series
24582458
expansion of sqrt(h**2 + x) == h + x/(2*h) + O(x**2).
24592459
24602460
Essentially, this differential correction is equivalent to one
2461-
refinement step in the Newton divide-and-average square root
2461+
refinement step in Newton's divide-and-average square root
24622462
algorithm, effectively doubling the number of accurate bits.
24632463
This technique is used in Dekker's SQRT2 algorithm and again in
24642464
Borges' ALGORITHM 4 and 5.

0 commit comments

Comments
 (0)