From 36d4bbb7369b3091dcd200286d7b026e1e1a1b90 Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Wed, 14 Dec 2022 19:53:47 -0800 Subject: [PATCH] [e_exp] 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 --- newlib/libm/math/e_exp.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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, -- 2.34.1