expq3 (problem 3.4.2)

Average Error: 60.5 → 0.9

Time: 15.2s

Precision: binary64

Cost: 61385

\[-1 < \varepsilon \land \varepsilon < 1\]

Math

\[\frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]

↓

\[\begin{array}{l} t_0 := \varepsilon \cdot \left(a + b\right)\\ t_1 := \frac{\varepsilon \cdot \left(e^{t_0} + -1\right)}{\left(e^{\varepsilon \cdot a} + -1\right) \cdot \left(e^{\varepsilon \cdot b} + -1\right)}\\ \mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 0\right):\\ \;\;\;\;\frac{1}{b} + \frac{1}{a}\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \frac{\mathsf{expm1}\left(t_0\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}\\ \end{array} \]

FPCore

(FPCore (a b eps)
 :precision binary64
 (/
  (* eps (- (exp (* (+ a b) eps)) 1.0))
  (* (- (exp (* a eps)) 1.0) (- (exp (* b eps)) 1.0))))

↓

(FPCore (a b eps)
 :precision binary64
 (let* ((t_0 (* eps (+ a b)))
        (t_1
         (/
          (* eps (+ (exp t_0) -1.0))
          (* (+ (exp (* eps a)) -1.0) (+ (exp (* eps b)) -1.0)))))
   (if (or (<= t_1 (- INFINITY)) (not (<= t_1 0.0)))
     (+ (/ 1.0 b) (/ 1.0 a))
     (* eps (/ (expm1 t_0) (* (expm1 (* eps a)) (expm1 (* eps b))))))))

C

double code(double a, double b, double eps) {
	return (eps * (exp(((a + b) * eps)) - 1.0)) / ((exp((a * eps)) - 1.0) * (exp((b * eps)) - 1.0));
}

↓

double code(double a, double b, double eps) {
	double t_0 = eps * (a + b);
	double t_1 = (eps * (exp(t_0) + -1.0)) / ((exp((eps * a)) + -1.0) * (exp((eps * b)) + -1.0));
	double tmp;
	if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 0.0)) {
		tmp = (1.0 / b) + (1.0 / a);
	} else {
		tmp = eps * (expm1(t_0) / (expm1((eps * a)) * expm1((eps * b))));
	}
	return tmp;
}

Java

public static double code(double a, double b, double eps) {
	return (eps * (Math.exp(((a + b) * eps)) - 1.0)) / ((Math.exp((a * eps)) - 1.0) * (Math.exp((b * eps)) - 1.0));
}

↓

public static double code(double a, double b, double eps) {
	double t_0 = eps * (a + b);
	double t_1 = (eps * (Math.exp(t_0) + -1.0)) / ((Math.exp((eps * a)) + -1.0) * (Math.exp((eps * b)) + -1.0));
	double tmp;
	if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 0.0)) {
		tmp = (1.0 / b) + (1.0 / a);
	} else {
		tmp = eps * (Math.expm1(t_0) / (Math.expm1((eps * a)) * Math.expm1((eps * b))));
	}
	return tmp;
}

Python

def code(a, b, eps):
	return (eps * (math.exp(((a + b) * eps)) - 1.0)) / ((math.exp((a * eps)) - 1.0) * (math.exp((b * eps)) - 1.0))

↓

def code(a, b, eps):
	t_0 = eps * (a + b)
	t_1 = (eps * (math.exp(t_0) + -1.0)) / ((math.exp((eps * a)) + -1.0) * (math.exp((eps * b)) + -1.0))
	tmp = 0
	if (t_1 <= -math.inf) or not (t_1 <= 0.0):
		tmp = (1.0 / b) + (1.0 / a)
	else:
		tmp = eps * (math.expm1(t_0) / (math.expm1((eps * a)) * math.expm1((eps * b))))
	return tmp

Julia

function code(a, b, eps)
	return Float64(Float64(eps * Float64(exp(Float64(Float64(a + b) * eps)) - 1.0)) / Float64(Float64(exp(Float64(a * eps)) - 1.0) * Float64(exp(Float64(b * eps)) - 1.0)))
end

↓

function code(a, b, eps)
	t_0 = Float64(eps * Float64(a + b))
	t_1 = Float64(Float64(eps * Float64(exp(t_0) + -1.0)) / Float64(Float64(exp(Float64(eps * a)) + -1.0) * Float64(exp(Float64(eps * b)) + -1.0)))
	tmp = 0.0
	if ((t_1 <= Float64(-Inf)) || !(t_1 <= 0.0))
		tmp = Float64(Float64(1.0 / b) + Float64(1.0 / a));
	else
		tmp = Float64(eps * Float64(expm1(t_0) / Float64(expm1(Float64(eps * a)) * expm1(Float64(eps * b)))));
	end
	return tmp
end

Wolfram

code[a_, b_, eps_] := N[(N[(eps * N[(N[Exp[N[(N[(a + b), $MachinePrecision] * eps), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[Exp[N[(a * eps), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision] * N[(N[Exp[N[(b * eps), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[a_, b_, eps_] := Block[{t$95$0 = N[(eps * N[(a + b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(eps * N[(N[Exp[t$95$0], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[Exp[N[(eps * a), $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision] * N[(N[Exp[N[(eps * b), $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 0.0]], $MachinePrecision]], N[(N[(1.0 / b), $MachinePrecision] + N[(1.0 / a), $MachinePrecision]), $MachinePrecision], N[(eps * N[(N[(Exp[t$95$0] - 1), $MachinePrecision] / N[(N[(Exp[N[(eps * a), $MachinePrecision]] - 1), $MachinePrecision] * N[(Exp[N[(eps * b), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Target

Original	60.5
Target	15.0
Herbie	0.9

\[\frac{a + b}{a \cdot b} \]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1))) < -inf.0 or -0.0 < (/.f64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1)))

   1. Initial program 63.0

      \[\frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]

   2. Simplified 42.3

      \[\leadsto \color{blue}{\varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
      Proof

      [Start] 63.0	\[ \frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      associate-*r/ [<=] 63.0	\[ \color{blue}{\varepsilon \cdot \frac{e^{\left(a + b\right) \cdot \varepsilon} - 1}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)}} \]
      expm1-def [=>] 63.0	\[ \varepsilon \cdot \frac{\color{blue}{\mathsf{expm1}\left(\left(a + b\right) \cdot \varepsilon\right)}}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      *-commutative [=>] 63.0	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\color{blue}{\varepsilon \cdot \left(a + b\right)}\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      expm1-def [=>] 57.6	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\color{blue}{\mathsf{expm1}\left(a \cdot \varepsilon\right)} \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      *-commutative [=>] 57.6	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\color{blue}{\varepsilon \cdot a}\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      expm1-def [=>] 42.3	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \color{blue}{\mathsf{expm1}\left(b \cdot \varepsilon\right)}} \]
      *-commutative [=>] 42.3	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\color{blue}{\varepsilon \cdot b}\right)} \]

   3. Taylor expanded in eps around 0 14.4

      \[\leadsto \color{blue}{\frac{a + b}{a \cdot b}} \]

   4. Taylor expanded in a around 0 0.9

      \[\leadsto \color{blue}{\frac{1}{b} + \frac{1}{a}} \]

   if -inf.0 < (/.f64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1))) < -0.0

   1. Initial program 2.2

      \[\frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]

   2. Simplified 0.1

      \[\leadsto \color{blue}{\varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
      Proof

      [Start] 2.2	\[ \frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      associate-*r/ [<=] 2.2	\[ \color{blue}{\varepsilon \cdot \frac{e^{\left(a + b\right) \cdot \varepsilon} - 1}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)}} \]
      expm1-def [=>] 2.2	\[ \varepsilon \cdot \frac{\color{blue}{\mathsf{expm1}\left(\left(a + b\right) \cdot \varepsilon\right)}}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      *-commutative [=>] 2.2	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\color{blue}{\varepsilon \cdot \left(a + b\right)}\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      expm1-def [=>] 1.2	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\color{blue}{\mathsf{expm1}\left(a \cdot \varepsilon\right)} \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      *-commutative [=>] 1.2	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\color{blue}{\varepsilon \cdot a}\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)} \]
      expm1-def [=>] 0.1	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \color{blue}{\mathsf{expm1}\left(b \cdot \varepsilon\right)}} \]
      *-commutative [=>] 0.1	\[ \varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\color{blue}{\varepsilon \cdot b}\right)} \]

3. Recombined 2 regimes into one program.

4. Final simplification 0.9

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\varepsilon \cdot \left(e^{\varepsilon \cdot \left(a + b\right)} + -1\right)}{\left(e^{\varepsilon \cdot a} + -1\right) \cdot \left(e^{\varepsilon \cdot b} + -1\right)} \leq -\infty \lor \neg \left(\frac{\varepsilon \cdot \left(e^{\varepsilon \cdot \left(a + b\right)} + -1\right)}{\left(e^{\varepsilon \cdot a} + -1\right) \cdot \left(e^{\varepsilon \cdot b} + -1\right)} \leq 0\right):\\ \;\;\;\;\frac{1}{b} + \frac{1}{a}\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}\\ \end{array} \]

Alternatives

Alternative 1
Error	2.9
Cost	704

\[\left(\frac{1}{b} + \frac{1}{a}\right) + \varepsilon \cdot -0.5 \]

Alternative 2
Error	25.8
Cost	452

\[\begin{array}{l} \mathbf{if}\;b \leq 2.5 \cdot 10^{-51}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\varepsilon}{a}}{\varepsilon}\\ \end{array} \]

Alternative 3
Error	3.1
Cost	448

\[\frac{1}{b} + \frac{1}{a} \]

Alternative 4
Error	25.2
Cost	324

\[\begin{array}{l} \mathbf{if}\;b \leq 8.3 \cdot 10^{-53}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \]

Alternative 5
Error	62.0
Cost	192

\[\varepsilon \cdot -0.5 \]

Alternative 6
Error	33.4
Cost	192

\[\frac{1}{a} \]

Reproduce

herbie shell --seed 2023027 
(FPCore (a b eps)
  :name "expq3 (problem 3.4.2)"
  :precision binary64
  :pre (and (< -1.0 eps) (< eps 1.0))

  :herbie-target
  (/ (+ a b) (* a b))

  (/ (* eps (- (exp (* (+ a b) eps)) 1.0)) (* (- (exp (* a eps)) 1.0) (- (exp (* b eps)) 1.0))))