expfmod

Average Error: 59.6 → 23.4

Time: 12.9s

Precision: binary64

Math

\[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

↓

\[\begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\ t_1 := e^{-x}\\ \mathbf{if}\;\begin{array}{l} t_2 := t_0 \cdot t_1\\ t_2 \leq 0 \lor \neg \left(t_2 \leq 1.0000000000000002\right) \end{array}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;e^{\sqrt[3]{{\left(\log t_0 - x\right)}^{3}}}\\ \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

↓

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x)))) (t_1 (exp (- x))))
   (if (let* ((t_2 (* t_0 t_1)))
         (or (<= t_2 0.0) (not (<= t_2 1.0000000000000002))))
     t_1
     (exp (cbrt (pow (- (log t_0) x) 3.0))))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}

↓

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double t_1 = exp(-x);
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 1.0000000000000002)) {
		tmp = t_1;
	} else {
		tmp = exp(cbrt(pow((log(t_0) - x), 3.0)));
	}
	return tmp;
}

Error

Bits error versus x

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 0.0 or 1.00000000000000022 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 61.8

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Simplified 61.8

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

   3. Applied add-exp-log_binary64 61.8

      \[\leadsto \frac{\color{blue}{e^{\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}}{e^{x}} \]

   4. Applied div-exp_binary64 61.8

      \[\leadsto \color{blue}{e^{\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x}} \]

   5. Taylor expanded in x around inf 23.9

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]

   if 0.0 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 1.00000000000000022

   1. Initial program 12.3

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Simplified 12.1

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

   3. Applied add-exp-log_binary64 12.1

      \[\leadsto \frac{\color{blue}{e^{\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}}{e^{x}} \]

   4. Applied div-exp_binary64 12.1

      \[\leadsto \color{blue}{e^{\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x}} \]

   5. Applied add-cbrt-cube_binary64 12.1

      \[\leadsto e^{\color{blue}{\sqrt[3]{\left(\left(\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x\right) \cdot \left(\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x\right)\right) \cdot \left(\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x\right)}}} \]

   6. Simplified 12.1

      \[\leadsto e^{\sqrt[3]{\color{blue}{{\left(\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x\right)}^{3}}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 23.4

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 0 \lor \neg \left(\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 1.0000000000000002\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;e^{\sqrt[3]{{\left(\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x\right)}^{3}}}\\ \end{array} \]

Reproduce

herbie shell --seed 2022081 
(FPCore (x)
  :name "expfmod"
  :precision binary64
  (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))