expq3 (problem 3.4.2)

Percentage Accurate: 6.1% → 99.2%

Time: 11.8s

Alternatives: 5

Speedup: 107.0×

• could not determine a ground truth

  1. a = -2.00000000000000007e154
  2. b = 1.9999999999999999e-154
  3. eps = -1.9999999999999999e-77

Specification

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

Math

\[\begin{array}{l} \\ \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)} \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))))

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));
}

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    code = (eps * (exp(((a + b) * eps)) - 1.0d0)) / ((exp((a * eps)) - 1.0d0) * (exp((b * eps)) - 1.0d0))
end function

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));
}

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))

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

MATLAB

function tmp = code(a, b, eps)
	tmp = (eps * (exp(((a + b) * eps)) - 1.0)) / ((exp((a * eps)) - 1.0) * (exp((b * eps)) - 1.0));
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]

Initial Program: 6.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \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)} \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))))

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));
}

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    code = (eps * (exp(((a + b) * eps)) - 1.0d0)) / ((exp((a * eps)) - 1.0d0) * (exp((b * eps)) - 1.0d0))
end function

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));
}

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))

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

MATLAB

function tmp = code(a, b, eps)
	tmp = (eps * (exp(((a + b) * eps)) - 1.0)) / ((exp((a * eps)) - 1.0) * (exp((b * eps)) - 1.0));
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]

Alternative 1: 99.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \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 5 \cdot 10^{-77}\right):\\ \;\;\;\;\frac{1}{b} + \frac{1}{a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{expm1}\left(t_0\right) \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(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 5e-77)))
     (+ (/ 1.0 b) (/ 1.0 a))
     (* (expm1 t_0) (/ eps (* (expm1 (* eps a)) (expm1 (* eps b))))))))

C

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 <= 5e-77)) {
		tmp = (1.0 / b) + (1.0 / a);
	} else {
		tmp = expm1(t_0) * (eps / (expm1((eps * a)) * expm1((eps * b))));
	}
	return tmp;
}

Java

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 <= 5e-77)) {
		tmp = (1.0 / b) + (1.0 / a);
	} else {
		tmp = Math.expm1(t_0) * (eps / (Math.expm1((eps * a)) * Math.expm1((eps * b))));
	}
	return tmp;
}

Python

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 <= 5e-77):
		tmp = (1.0 / b) + (1.0 / a)
	else:
		tmp = math.expm1(t_0) * (eps / (math.expm1((eps * a)) * math.expm1((eps * b))))
	return tmp

Julia

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 <= 5e-77))
		tmp = Float64(Float64(1.0 / b) + Float64(1.0 / a));
	else
		tmp = Float64(expm1(t_0) * Float64(eps / Float64(expm1(Float64(eps * a)) * expm1(Float64(eps * b)))));
	end
	return tmp
end

Wolfram

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, 5e-77]], $MachinePrecision]], N[(N[(1.0 / b), $MachinePrecision] + N[(1.0 / a), $MachinePrecision]), $MachinePrecision], N[(N[(Exp[t$95$0] - 1), $MachinePrecision] * N[(eps / N[(N[(Exp[N[(eps * a), $MachinePrecision]] - 1), $MachinePrecision] * N[(Exp[N[(eps * b), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

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 4.99999999999999963e-77 < (/.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 0.5%

      \[\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. Step-by-step derivation

      1. associate-*l/ 0.5%

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

      2. *-commutative 0.5%

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

      3. expm1-def 2.3%

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

      4. *-commutative 2.3%

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

      5. expm1-def 10.6%

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

      6. *-commutative 10.6%

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

      7. expm1-def 35.2%

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

      8. *-commutative 35.2%

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

   3. Simplified 35.2%

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

   4. Taylor expanded in eps around 0 80.5%

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

   5. Taylor expanded in a around 0 100.0%

      \[\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))) < 4.99999999999999963e-77

   1. Initial program 97.3%

      \[\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. Step-by-step derivation

      1. associate-*l/ 97.3%

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

      2. *-commutative 97.3%

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

      3. expm1-def 97.3%

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

      4. *-commutative 97.3%

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

      5. expm1-def 97.3%

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

      6. *-commutative 97.3%

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

      7. expm1-def 100.0%

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

      8. *-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right) \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\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 5 \cdot 10^{-77}\right):\\ \;\;\;\;\frac{1}{b} + \frac{1}{a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right) \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}\\ \end{array} \]

Alternative 2: 59.3% accurate, 34.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.5 \cdot 10^{-15} \lor \neg \left(a \leq -3.2 \cdot 10^{-46}\right) \land a \leq -1.4 \cdot 10^{-115}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b eps)
 :precision binary64
 (if (or (<= a -1.5e-15) (and (not (<= a -3.2e-46)) (<= a -1.4e-115)))
   (/ 1.0 b)
   (/ 1.0 a)))

C

double code(double a, double b, double eps) {
	double tmp;
	if ((a <= -1.5e-15) || (!(a <= -3.2e-46) && (a <= -1.4e-115))) {
		tmp = 1.0 / b;
	} else {
		tmp = 1.0 / a;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((a <= (-1.5d-15)) .or. (.not. (a <= (-3.2d-46))) .and. (a <= (-1.4d-115))) then
        tmp = 1.0d0 / b
    else
        tmp = 1.0d0 / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double eps) {
	double tmp;
	if ((a <= -1.5e-15) || (!(a <= -3.2e-46) && (a <= -1.4e-115))) {
		tmp = 1.0 / b;
	} else {
		tmp = 1.0 / a;
	}
	return tmp;
}

Python

def code(a, b, eps):
	tmp = 0
	if (a <= -1.5e-15) or (not (a <= -3.2e-46) and (a <= -1.4e-115)):
		tmp = 1.0 / b
	else:
		tmp = 1.0 / a
	return tmp

Julia

function code(a, b, eps)
	tmp = 0.0
	if ((a <= -1.5e-15) || (!(a <= -3.2e-46) && (a <= -1.4e-115)))
		tmp = Float64(1.0 / b);
	else
		tmp = Float64(1.0 / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, eps)
	tmp = 0.0;
	if ((a <= -1.5e-15) || (~((a <= -3.2e-46)) && (a <= -1.4e-115)))
		tmp = 1.0 / b;
	else
		tmp = 1.0 / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, eps_] := If[Or[LessEqual[a, -1.5e-15], And[N[Not[LessEqual[a, -3.2e-46]], $MachinePrecision], LessEqual[a, -1.4e-115]]], N[(1.0 / b), $MachinePrecision], N[(1.0 / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.5e-15 or -3.1999999999999999e-46 < a < -1.39999999999999994e-115

   1. Initial program 8.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. Step-by-step derivation

      1. associate-*l/ 8.2%

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

      2. *-commutative 8.2%

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

      3. expm1-def 9.8%

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

      4. *-commutative 9.8%

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

      5. expm1-def 15.4%

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

      6. *-commutative 15.4%

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

      7. expm1-def 45.1%

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

      8. *-commutative 45.1%

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

   3. Simplified 45.1%

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

   4. Taylor expanded in b around 0 69.9%

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

   if -1.5e-15 < a < -3.1999999999999999e-46 or -1.39999999999999994e-115 < a

   1. Initial program 5.9%

      \[\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. Step-by-step derivation

      1. associate-*l/ 5.9%

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

      2. *-commutative 5.9%

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

      3. expm1-def 7.5%

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

      4. *-commutative 7.5%

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

      5. expm1-def 16.3%

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

      6. *-commutative 16.3%

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

      7. expm1-def 36.7%

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

      8. *-commutative 36.7%

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

   3. Simplified 36.7%

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

   4. Taylor expanded in a around 0 57.4%

      \[\leadsto \color{blue}{\frac{1}{a}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.5 \cdot 10^{-15} \lor \neg \left(a \leq -3.2 \cdot 10^{-46}\right) \land a \leq -1.4 \cdot 10^{-115}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \]

Alternative 3: 94.4% accurate, 35.4× speedup

Math

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

FPCore

(FPCore (a b eps)
 :precision binary64
 (if (<= a -5.5e+217) (/ (+ a b) (* a b)) (+ (/ 1.0 b) (/ 1.0 a))))

C

double code(double a, double b, double eps) {
	double tmp;
	if (a <= -5.5e+217) {
		tmp = (a + b) / (a * b);
	} else {
		tmp = (1.0 / b) + (1.0 / a);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    real(8) :: tmp
    if (a <= (-5.5d+217)) then
        tmp = (a + b) / (a * b)
    else
        tmp = (1.0d0 / b) + (1.0d0 / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double eps) {
	double tmp;
	if (a <= -5.5e+217) {
		tmp = (a + b) / (a * b);
	} else {
		tmp = (1.0 / b) + (1.0 / a);
	}
	return tmp;
}

Python

def code(a, b, eps):
	tmp = 0
	if a <= -5.5e+217:
		tmp = (a + b) / (a * b)
	else:
		tmp = (1.0 / b) + (1.0 / a)
	return tmp

Julia

function code(a, b, eps)
	tmp = 0.0
	if (a <= -5.5e+217)
		tmp = Float64(Float64(a + b) / Float64(a * b));
	else
		tmp = Float64(Float64(1.0 / b) + Float64(1.0 / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, eps)
	tmp = 0.0;
	if (a <= -5.5e+217)
		tmp = (a + b) / (a * b);
	else
		tmp = (1.0 / b) + (1.0 / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, eps_] := If[LessEqual[a, -5.5e+217], N[(N[(a + b), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / b), $MachinePrecision] + N[(1.0 / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -5.5e217

   1. Initial program 31.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. Step-by-step derivation

      1. associate-*l/ 31.2%

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

      2. *-commutative 31.2%

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

      3. expm1-def 32.1%

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

      4. *-commutative 32.1%

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

      5. expm1-def 32.1%

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

      6. *-commutative 32.1%

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

      7. expm1-def 52.9%

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

      8. *-commutative 52.9%

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

   3. Simplified 52.9%

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

   4. Taylor expanded in eps around 0 99.7%

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

   if -5.5e217 < a

   1. Initial program 5.6%

      \[\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. Step-by-step derivation

      1. associate-*l/ 5.6%

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

      2. *-commutative 5.6%

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

      3. expm1-def 7.3%

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

      4. *-commutative 7.3%

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

      5. expm1-def 15.4%

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

      6. *-commutative 15.4%

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

      7. expm1-def 38.7%

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

      8. *-commutative 38.7%

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

   3. Simplified 38.7%

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

   4. Taylor expanded in eps around 0 78.5%

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

   5. Taylor expanded in a around 0 95.3%

      \[\leadsto \color{blue}{\frac{1}{b} + \frac{1}{a}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -5.5 \cdot 10^{+217}:\\ \;\;\;\;\frac{a + b}{a \cdot b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{b} + \frac{1}{a}\\ \end{array} \]

Alternative 4: 95.1% accurate, 45.9× speedup

Math

\[\begin{array}{l} \\ \frac{1}{b} + \frac{1}{a} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    code = (1.0d0 / b) + (1.0d0 / a)
end function

Java

public static double code(double a, double b, double eps) {
	return (1.0 / b) + (1.0 / a);
}

Python

def code(a, b, eps):
	return (1.0 / b) + (1.0 / a)

Julia

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

MATLAB

function tmp = code(a, b, eps)
	tmp = (1.0 / b) + (1.0 / a);
end

Wolfram

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

Derivation

1. Initial program 6.6%

   \[\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. Step-by-step derivation

   1. associate-*l/ 6.6%

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

   2. *-commutative 6.6%

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

   3. expm1-def 8.2%

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

   4. *-commutative 8.2%

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

   5. expm1-def 16.0%

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

   6. *-commutative 16.0%

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

   7. expm1-def 39.2%

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

   8. *-commutative 39.2%

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

3. Simplified 39.2%

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

4. Taylor expanded in eps around 0 79.3%

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

5. Taylor expanded in a around 0 94.4%

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

6. Final simplification 94.4%

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

Alternative 5: 48.5% accurate, 107.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{a} \end{array} \]

FPCore

(FPCore (a b eps) :precision binary64 (/ 1.0 a))

C

double code(double a, double b, double eps) {
	return 1.0 / a;
}

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    code = 1.0d0 / a
end function

Java

public static double code(double a, double b, double eps) {
	return 1.0 / a;
}

Python

def code(a, b, eps):
	return 1.0 / a

Julia

function code(a, b, eps)
	return Float64(1.0 / a)
end

MATLAB

function tmp = code(a, b, eps)
	tmp = 1.0 / a;
end

Wolfram

code[a_, b_, eps_] := N[(1.0 / a), $MachinePrecision]

Derivation

1. Initial program 6.6%

   \[\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. Step-by-step derivation

   1. associate-*l/ 6.6%

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

   2. *-commutative 6.6%

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

   3. expm1-def 8.2%

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

   4. *-commutative 8.2%

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

   5. expm1-def 16.0%

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

   6. *-commutative 16.0%

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

   7. expm1-def 39.2%

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

   8. *-commutative 39.2%

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

3. Simplified 39.2%

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

4. Taylor expanded in a around 0 47.6%

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

5. Final simplification 47.6%

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

Developer target: 77.7% accurate, 45.9× speedup

Math

\[\begin{array}{l} \\ \frac{a + b}{a \cdot b} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(a, b, eps)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: eps
    code = (a + b) / (a * b)
end function

Java

public static double code(double a, double b, double eps) {
	return (a + b) / (a * b);
}

Python

def code(a, b, eps):
	return (a + b) / (a * b)

Julia

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

MATLAB

function tmp = code(a, b, eps)
	tmp = (a + b) / (a * b);
end

Wolfram

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

Reproduce

herbie shell --seed 2023192 
(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))))