expq3 (problem 3.4.2)

Percentage Accurate: 0.0% → 99.8%

Time: 42.0s

Alternatives: 4

Speedup: 107.0×

Specification

\[\left(\left|a\right| \leq 710 \land \left|b\right| \leq 710\right) \land \left(10^{-27} \cdot \mathsf{min}\left(\left|a\right|, \left|b\right|\right) \leq \varepsilon \land \varepsilon \leq \mathsf{min}\left(\left|a\right|, \left|b\right|\right)\right)\]

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: 0.0% 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.8% accurate, 45.9× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \frac{1 + \frac{b}{a}}{b} \end{array} \]

FPCore

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
(FPCore (a b eps) :precision binary64 (/ (+ 1.0 (/ b a)) b))

C

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

Fortran

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
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 / a)) / b
end function

Java

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

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	return (1.0 + (b / a)) / b

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	return Float64(Float64(1.0 + Float64(b / a)) / b)
end

MATLAB

a, b, eps = num2cell(sort([a, b, eps])){:}
function tmp = code(a, b, eps)
	tmp = (1.0 + (b / a)) / b;
end

Wolfram

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
code[a_, b_, eps_] := N[(N[(1.0 + N[(b / a), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]

Derivation

1. Initial program 0.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. *-commutative 0.2%

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

   2. times-frac 0.2%

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

   3. expm1-define 0.2%

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

   4. *-commutative 0.2%

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

   5. expm1-define 1.6%

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

   6. *-commutative 1.6%

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

   7. expm1-define 29.9%

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

   8. *-commutative 29.9%

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

3. Simplified 29.9%

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

5. Taylor expanded in eps around 0 45.2%

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

6. Taylor expanded in eps around 0 64.9%

   \[\leadsto \color{blue}{\frac{a + b}{a \cdot b}} \]
7. Step-by-step derivation

   1. associate-/r* 99.8%

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

   2. +-commutative 99.8%

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

   3. *-lft-identity 99.8%

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

   4. associate-*l/ 99.8%

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

   5. +-commutative 99.8%

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

   6. distribute-rgt-in 99.8%

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

   7. rgt-mult-inverse 99.9%

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

   8. associate-*r/ 99.8%

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

   9. *-rgt-identity 99.8%

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

8. Simplified 99.8%

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

9. Final simplification 99.8%

   \[\leadsto \frac{1 + \frac{b}{a}}{b} \]
10. Add Preprocessing

Alternative 2: 81.0% accurate, 40.0× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -5.1 \cdot 10^{-194}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
(FPCore (a b eps)
 :precision binary64
 (if (<= a -5.1e-194) (/ 1.0 b) (/ 1.0 a)))

C

assert(a < b && b < eps);
double code(double a, double b, double eps) {
	double tmp;
	if (a <= -5.1e-194) {
		tmp = 1.0 / b;
	} else {
		tmp = 1.0 / a;
	}
	return tmp;
}

Fortran

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
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.1d-194)) then
        tmp = 1.0d0 / b
    else
        tmp = 1.0d0 / a
    end if
    code = tmp
end function

Java

assert a < b && b < eps;
public static double code(double a, double b, double eps) {
	double tmp;
	if (a <= -5.1e-194) {
		tmp = 1.0 / b;
	} else {
		tmp = 1.0 / a;
	}
	return tmp;
}

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	tmp = 0
	if a <= -5.1e-194:
		tmp = 1.0 / b
	else:
		tmp = 1.0 / a
	return tmp

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	tmp = 0.0
	if (a <= -5.1e-194)
		tmp = Float64(1.0 / b);
	else
		tmp = Float64(1.0 / a);
	end
	return tmp
end

MATLAB

a, b, eps = num2cell(sort([a, b, eps])){:}
function tmp_2 = code(a, b, eps)
	tmp = 0.0;
	if (a <= -5.1e-194)
		tmp = 1.0 / b;
	else
		tmp = 1.0 / a;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
code[a_, b_, eps_] := If[LessEqual[a, -5.1e-194], N[(1.0 / b), $MachinePrecision], N[(1.0 / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -5.0999999999999998e-194

   1. Initial program 0.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. *-commutative 0.6%

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

      2. associate-/l* 0.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-define 2.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 2.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-define 2.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 2.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-define 18.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 18.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 18.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. Add Preprocessing

   5. Taylor expanded in b around 0 68.3%

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

   if -5.0999999999999998e-194 < a

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

      1. *-commutative 0.0%

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

      2. associate-/l* 0.0%

         \[\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-define 1.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 1.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-define 1.2%

         \[\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 1.2%

         \[\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-define 8.3%

         \[\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 8.3%

         \[\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 8.3%

      \[\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. Add Preprocessing

   5. Taylor expanded in a around 0 61.3%

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

4. Final simplification 63.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -5.1 \cdot 10^{-194}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 45.9× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \frac{1 + \frac{a}{b}}{a} \end{array} \]

FPCore

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
(FPCore (a b eps) :precision binary64 (/ (+ 1.0 (/ a b)) a))

C

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

Fortran

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
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 / b)) / a
end function

Java

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

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	return (1.0 + (a / b)) / a

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	return Float64(Float64(1.0 + Float64(a / b)) / a)
end

MATLAB

a, b, eps = num2cell(sort([a, b, eps])){:}
function tmp = code(a, b, eps)
	tmp = (1.0 + (a / b)) / a;
end

Wolfram

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
code[a_, b_, eps_] := N[(N[(1.0 + N[(a / b), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Derivation

1. Initial program 0.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. *-commutative 0.2%

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

   2. associate-/l* 0.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-define 1.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 1.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-define 1.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 1.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-define 11.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 11.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 11.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. Add Preprocessing

5. Taylor expanded in eps around 0 64.9%

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

6. Taylor expanded in a around 0 99.8%

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

7. Final simplification 99.8%

   \[\leadsto \frac{1 + \frac{a}{b}}{a} \]
8. Add Preprocessing

Alternative 4: 49.8% accurate, 107.0× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \frac{1}{a} \end{array} \]

FPCore

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
(FPCore (a b eps) :precision binary64 (/ 1.0 a))

C

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

Fortran

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
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

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

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	return 1.0 / a

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	return Float64(1.0 / a)
end

MATLAB

a, b, eps = num2cell(sort([a, b, eps])){:}
function tmp = code(a, b, eps)
	tmp = 1.0 / a;
end

Wolfram

NOTE: a, b, and eps should be sorted in increasing order before calling this function.
code[a_, b_, eps_] := N[(1.0 / a), $MachinePrecision]

Derivation

1. Initial program 0.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. *-commutative 0.2%

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

   2. associate-/l* 0.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-define 1.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 1.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-define 1.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 1.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-define 11.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 11.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 11.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. Add Preprocessing

5. Taylor expanded in a around 0 49.3%

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

6. Final simplification 49.3%

   \[\leadsto \frac{1}{a} \]
7. Add Preprocessing

Developer target: 100.0% accurate, 45.9× speedup

Math

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

FPCore

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

C

double code(double a, double b, double eps) {
	return (1.0 / a) + (1.0 / 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 = (1.0d0 / a) + (1.0d0 / b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024077 
(FPCore (a b eps)
  :name "expq3 (problem 3.4.2)"
  :precision binary64
  :pre (and (and (<= (fabs a) 710.0) (<= (fabs b) 710.0)) (and (<= (* 1e-27 (fmin (fabs a) (fabs b))) eps) (<= eps (fmin (fabs a) (fabs b)))))

  :alt
  (+ (/ 1.0 a) (/ 1.0 b))

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