diff options
| author | Nadav Rotem <nadavrot@users.noreply.github.com> | 2022-12-15 06:53:47 +0300 |
|---|---|---|
| committer | Jeff Johnston <jjohnstn@redhat.com> | 2022-12-16 20:18:28 +0300 |
| commit | abf672604bd0d8a2ad9f2ec7cae76ad5905c3092 (patch) | |
| tree | a1abcb75973c05faca5da770722d1d94d7a1a199 /newlib/libm | |
| parent | 125e39bfea1a39341a60348c93a65cf4894e0f2a (diff) | |
Fix a typo in the comment.
The implementation of expf() explains how approximation in the range [0 - 0.34] is done. The comment describes the "Reme" algorithm for constructing the polynomial. This is a typo and should be the "Remez" algorithm. The remez algorithm (or minimax) is used to calculate the coefficients of polynomials in other implementations of exp(0 and log().
See more:
https://en.wikipedia.org/wiki/Remez_algorithm
Diffstat (limited to 'newlib/libm')
| -rw-r--r-- | newlib/libm/math/e_exp.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/newlib/libm/math/e_exp.c b/newlib/libm/math/e_exp.c index ec26c2099..77652d687 100644 --- a/newlib/libm/math/e_exp.c +++ b/newlib/libm/math/e_exp.c @@ -28,7 +28,7 @@ * 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 Remez 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, |