Reme algorithm -> Remes algorithm. in comments

diff --git a/lib/libm/src/e_exp.c b/lib/libm/src/e_exp.c
index f9be5ac..c9ecdec 100644 (file)
--- a/lib/libm/src/e_exp.c
+++ b/lib/libm/src/e_exp.c
@@ -31,7 +31,7 @@ static char rcsid[] = "$NetBSD: e_exp.c,v 1.8 1995/05/10 20:45:03 jtc Exp $";
  *     the interval [0,0.34658]:
  *     Write
  *         R(r**2) = r*(exp(r)+1)/(exp(r)-1) = 2 + r*r/6 - r**4/360 + ...
- *      We use a special Reme algorithm on [0,0.34658] to generate 
+ *      We use a special Remes algorithm on [0,0.34658] to generate 
  *     a polynomial of degree 5 to approximate R. The maximum error 
  *     of this polynomial approximation is bounded by 2**-59. In
  *     other words,

diff --git a/lib/libm/src/e_log.c b/lib/libm/src/e_log.c
index efb74e6..968faea 100644 (file)
--- a/lib/libm/src/e_log.c
+++ b/lib/libm/src/e_log.c
@@ -26,7 +26,7 @@ static char rcsid[] = "$NetBSD: e_log.c,v 1.8 1995/05/10 20:45:49 jtc Exp $";
  *     Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s)
  *              = 2s + 2/3 s**3 + 2/5 s**5 + .....,
  *              = 2s + s*R
- *      We use a special Reme algorithm on [0,0.1716] to generate 
+ *      We use a special Remes algorithm on [0,0.1716] to generate 
  *     a polynomial of degree 14 to approximate R The maximum error 
  *     of this polynomial approximation is bounded by 2**-58.45. In
  *     other words,

diff --git a/lib/libm/src/s_expm1.c b/lib/libm/src/s_expm1.c
index b209d4a..37a6db5 100644 (file)
--- a/lib/libm/src/s_expm1.c
+++ b/lib/libm/src/s_expm1.c
@@ -36,7 +36,7 @@ static char rcsid[] = "$NetBSD: s_expm1.c,v 1.8 1995/05/10 20:47:09 jtc Exp $";
  *         R1(r**2) = 6/r *((exp(r)+1)/(exp(r)-1) - 2/r)
  *                  = 6/r * ( 1 + 2.0*(1/(exp(r)-1) - 1/r))
  *                  = 1 - r^2/60 + r^4/2520 - r^6/100800 + ...
- *      We use a special Reme algorithm on [0,0.347] to generate 
+ *      We use a special Remes algorithm on [0,0.347] to generate 
  *     a polynomial of degree 5 in r*r to approximate R1. The 
  *     maximum error of this polynomial approximation is bounded 
  *     by 2**-61. In other words,

diff --git a/lib/libm/src/s_log1p.c b/lib/libm/src/s_log1p.c
index 5596a2d..0a80598 100644 (file)
--- a/lib/libm/src/s_log1p.c
+++ b/lib/libm/src/s_log1p.c
@@ -32,7 +32,7 @@ static char rcsid[] = "$NetBSD: s_log1p.c,v 1.8 1995/05/10 20:47:46 jtc Exp $";
  *     Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s)
  *              = 2s + 2/3 s**3 + 2/5 s**5 + .....,
  *              = 2s + s*R
- *      We use a special Reme algorithm on [0,0.1716] to generate 
+ *      We use a special Remes algorithm on [0,0.1716] to generate 
  *     a polynomial of degree 14 to approximate R The maximum error 
  *     of this polynomial approximation is bounded by 2**-58.45. In
  *     other words,