Average Error: 58.5 → 0.6
Time: 4.0s
Precision: 64
\[\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right)\]
↓
\[\mathsf{fma}\left(2, {\varepsilon}^{2} - \mathsf{fma}\left(\frac{\varepsilon}{1}, \frac{\varepsilon}{1}, \varepsilon\right), \log 1\right)\]
\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right)
↓
\mathsf{fma}\left(2, {\varepsilon}^{2} - \mathsf{fma}\left(\frac{\varepsilon}{1}, \frac{\varepsilon}{1}, \varepsilon\right), \log 1\right)
double code(double eps) {
	return log(((1.0 - eps) / (1.0 + eps)));
}
↓
double code(double eps) {
	return fma(2.0, (pow(eps, 2.0) - fma((eps / 1.0), (eps / 1.0), eps)), log(1.0));
}

Error

Bits error versus eps

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original58.5
Target0.1
Herbie0.6
\[-2 \cdot \left(\left(\varepsilon + \frac{{\varepsilon}^{3}}{3}\right) + \frac{{\varepsilon}^{5}}{5}\right)\]

Derivation

  1. Initial program 58.5

    \[\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right)\]

  2. Taylor expanded around 0 0.6

    \[\leadsto \color{blue}{\left(2 \cdot {\varepsilon}^{2} + \log 1\right) - \left(2 \cdot \frac{{\varepsilon}^{2}}{{1}^{2}} + 2 \cdot \varepsilon\right)}\]

  3. Simplified0.6

    \[\leadsto \color{blue}{\mathsf{fma}\left(2, {\varepsilon}^{2} - \mathsf{fma}\left(\frac{\varepsilon}{1}, \frac{\varepsilon}{1}, \varepsilon\right), \log 1\right)}\]

  4. Final simplification0.6

    \[\leadsto \mathsf{fma}\left(2, {\varepsilon}^{2} - \mathsf{fma}\left(\frac{\varepsilon}{1}, \frac{\varepsilon}{1}, \varepsilon\right), \log 1\right)\]

Reproduce

herbie shell --seed 2020078 +o rules:numerics
(FPCore (eps)
  :name "logq (problem 3.4.3)"
  :precision binary64

  :herbie-target
  (* -2 (+ (+ eps (/ (pow eps 3) 3)) (/ (pow eps 5) 5)))

  (log (/ (- 1 eps) (+ 1 eps))))