libs/newlib-cygwin
libs
/
newlib-cygwin
mirror of git://sourceware.org/git/newlib-cygwin.git
4
0
Fork 0
Code Issues Projects Releases Wiki Activity

Fix 3 other instances of Reme typo (should be Remez)

This commit is contained in:
Jeff Johnston 2022-12-16 14:18:56 -05:00
parent c04c01524d
commit c8130c3fe8
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
newlib/libm/common/s_expm1.c
View File

@ -68,7 +68,7 @@ PORTABILITY
* R1(r**2) = 6/r *((exp(r)+1)/(exp(r)-1) - 2/r) * R1(r**2) = 6/r *((exp(r)+1)/(exp(r)-1) - 2/r)
* = 6/r * ( 1 + 2.0*(1/(exp(r)-1) - 1/r)) * = 6/r * ( 1 + 2.0*(1/(exp(r)-1) - 1/r))
* = 1 - r^2/60 + r^4/2520 - r^6/100800 + ... * = 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 Remez algorithm on [0,0.347] to generate
* a polynomial of degree 5 in r*r to approximate R1. The * a polynomial of degree 5 in r*r to approximate R1. The
* maximum error of this polynomial approximation is bounded * maximum error of this polynomial approximation is bounded
* by 2**-61. In other words, * by 2**-61. In other words,

2
newlib/libm/common/s_log1p.c
View File

@ -65,7 +65,7 @@ Interface Definition (Issue 2).
* Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s) * 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 + 2/3 s**3 + 2/5 s**5 + .....,
* = 2s + s*R * = 2s + s*R
* We use a special Reme algorithm on [0,0.1716] to generate * We use a special Remez algorithm on [0,0.1716] to generate
* a polynomial of degree 14 to approximate R The maximum error * a polynomial of degree 14 to approximate R The maximum error
* of this polynomial approximation is bounded by 2**-58.45. In * of this polynomial approximation is bounded by 2**-58.45. In
* other words, * other words,

2
newlib/libm/math/e_log.c
View File

@ -23,7 +23,7 @@
* Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s) * 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 + 2/3 s**3 + 2/5 s**5 + .....,
* = 2s + s*R * = 2s + s*R
* We use a special Reme algorithm on [0,0.1716] to generate * We use a special Remez algorithm on [0,0.1716] to generate
* a polynomial of degree 14 to approximate R The maximum error * a polynomial of degree 14 to approximate R The maximum error
* of this polynomial approximation is bounded by 2**-58.45. In * of this polynomial approximation is bounded by 2**-58.45. In
* other words, * other words,