expq3 (problem 3.4.2)

Percentage Accurate: 0.0% → 99.9%

Time: 26.8s

Alternatives: 6

Speedup: 13.4×

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.9% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

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 = ((b / (b + a)) * a) ** (-1.0d0)
end function

Java

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

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	return math.pow(((b / (b + a)) * a), -1.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

3. Taylor expanded in eps around 0

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

   1. *-commutative N/A

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

   2. associate-/r* N/A

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

   3. lower-/.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 99.8

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

5. Applied rewrites 99.8%

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

7. Applied rewrites 99.8%

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

8. Final simplification 99.8%

   \[\leadsto {\left(\frac{b}{b + a} \cdot a\right)}^{-1} \]
9. Add Preprocessing

Alternative 2: 80.7% accurate, 3.1× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq 9.5 \cdot 10^{-227}:\\ \;\;\;\;{b}^{-1}\\ \mathbf{elif}\;b \leq 1.38 \cdot 10^{-89}:\\ \;\;\;\;{a}^{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{b + a}{b \cdot 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 (<= b 9.5e-227)
   (pow b -1.0)
   (if (<= b 1.38e-89) (pow a -1.0) (/ (+ b a) (* b a)))))

C

assert(a < b && b < eps);
double code(double a, double b, double eps) {
	double tmp;
	if (b <= 9.5e-227) {
		tmp = pow(b, -1.0);
	} else if (b <= 1.38e-89) {
		tmp = pow(a, -1.0);
	} else {
		tmp = (b + a) / (b * 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 (b <= 9.5d-227) then
        tmp = b ** (-1.0d0)
    else if (b <= 1.38d-89) then
        tmp = a ** (-1.0d0)
    else
        tmp = (b + a) / (b * 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 (b <= 9.5e-227) {
		tmp = Math.pow(b, -1.0);
	} else if (b <= 1.38e-89) {
		tmp = Math.pow(a, -1.0);
	} else {
		tmp = (b + a) / (b * a);
	}
	return tmp;
}

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	tmp = 0
	if b <= 9.5e-227:
		tmp = math.pow(b, -1.0)
	elif b <= 1.38e-89:
		tmp = math.pow(a, -1.0)
	else:
		tmp = (b + a) / (b * a)
	return tmp

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	tmp = 0.0
	if (b <= 9.5e-227)
		tmp = b ^ -1.0;
	elseif (b <= 1.38e-89)
		tmp = a ^ -1.0;
	else
		tmp = Float64(Float64(b + a) / Float64(b * 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 (b <= 9.5e-227)
		tmp = b ^ -1.0;
	elseif (b <= 1.38e-89)
		tmp = a ^ -1.0;
	else
		tmp = (b + a) / (b * 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[b, 9.5e-227], N[Power[b, -1.0], $MachinePrecision], If[LessEqual[b, 1.38e-89], N[Power[a, -1.0], $MachinePrecision], N[(N[(b + a), $MachinePrecision] / N[(b * a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < 9.49999999999999953e-227

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

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\frac{1}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 56.8

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

   5. Applied rewrites 56.8%

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

   if 9.49999999999999953e-227 < b < 1.38000000000000005e-89

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{a}} \]
   4. Step-by-step derivation

      1. lower-/.f64 55.8

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

   5. Applied rewrites 55.8%

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

   if 1.38000000000000005e-89 < b

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

   3. Taylor expanded in eps around 0

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

      1. *-commutative N/A

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

      2. associate-/r* N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 99.9

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 93.6%

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

4. Final simplification 62.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 9.5 \cdot 10^{-227}:\\ \;\;\;\;{b}^{-1}\\ \mathbf{elif}\;b \leq 1.38 \cdot 10^{-89}:\\ \;\;\;\;{a}^{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{b + a}{b \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 80.2% accurate, 3.2× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq 9.5 \cdot 10^{-227}:\\ \;\;\;\;{b}^{-1}\\ \mathbf{else}:\\ \;\;\;\;{a}^{-1}\\ \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 (<= b 9.5e-227) (pow b -1.0) (pow a -1.0)))

C

assert(a < b && b < eps);
double code(double a, double b, double eps) {
	double tmp;
	if (b <= 9.5e-227) {
		tmp = pow(b, -1.0);
	} else {
		tmp = pow(a, -1.0);
	}
	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 (b <= 9.5d-227) then
        tmp = b ** (-1.0d0)
    else
        tmp = a ** (-1.0d0)
    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 (b <= 9.5e-227) {
		tmp = Math.pow(b, -1.0);
	} else {
		tmp = Math.pow(a, -1.0);
	}
	return tmp;
}

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	tmp = 0
	if b <= 9.5e-227:
		tmp = math.pow(b, -1.0)
	else:
		tmp = math.pow(a, -1.0)
	return tmp

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	tmp = 0.0
	if (b <= 9.5e-227)
		tmp = b ^ -1.0;
	else
		tmp = a ^ -1.0;
	end
	return tmp
end

MATLAB

a, b, eps = num2cell(sort([a, b, eps])){:}
function tmp_2 = code(a, b, eps)
	tmp = 0.0;
	if (b <= 9.5e-227)
		tmp = b ^ -1.0;
	else
		tmp = a ^ -1.0;
	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[b, 9.5e-227], N[Power[b, -1.0], $MachinePrecision], N[Power[a, -1.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 9.49999999999999953e-227

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

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\frac{1}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 56.8

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

   5. Applied rewrites 56.8%

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

   if 9.49999999999999953e-227 < b

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{a}} \]
   4. Step-by-step derivation

      1. lower-/.f64 65.1

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

   5. Applied rewrites 65.1%

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

4. Final simplification 60.0%

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

Alternative 4: 49.9% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

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 = a ** (-1.0d0)
end function

Java

assert a < b && b < eps;
public static double code(double a, double b, double eps) {
	return Math.pow(a, -1.0);
}

Python

[a, b, eps] = sort([a, b, eps])
def code(a, b, eps):
	return math.pow(a, -1.0)

Julia

a, b, eps = sort([a, b, eps])
function code(a, b, eps)
	return a ^ -1.0
end

MATLAB

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

Wolfram

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

Derivation

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

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\frac{1}{a}} \]
4. Step-by-step derivation

   1. lower-/.f64 51.0

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

5. Applied rewrites 51.0%

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

6. Final simplification 51.0%

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

Alternative 5: 99.8% accurate, 13.4× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \frac{\frac{a}{b} + 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 (/ (+ (/ a b) 1.0) a))

C

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

Java

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

Python

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

Julia

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

MATLAB

a, b, eps = num2cell(sort([a, b, eps])){:}
function tmp = code(a, b, eps)
	tmp = ((a / b) + 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[(N[(N[(a / b), $MachinePrecision] + 1.0), $MachinePrecision] / a), $MachinePrecision]

Derivation

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

3. Taylor expanded in eps around 0

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

   1. *-commutative N/A

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

   2. associate-/r* N/A

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

   3. lower-/.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 99.8

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

5. Applied rewrites 99.8%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 99.8%

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

Alternative 6: 99.8% accurate, 13.4× speedup

Math

\[\begin{array}{l} [a, b, eps] = \mathsf{sort}([a, b, eps])\\ \\ \frac{\frac{b}{a} + 1}{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 (/ (+ (/ b a) 1.0) b))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

3. Taylor expanded in eps around 0

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

   1. *-commutative N/A

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

   2. associate-/r* N/A

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

   3. lower-/.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 99.8

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

5. Applied rewrites 99.8%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 99.8%

   \[\leadsto \frac{\frac{b}{a} + 1}{\color{blue}{b}} \]
9. Add Preprocessing

Developer Target 1: 99.9% accurate, 13.4× 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 2024308 
(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
  (! :herbie-platform default (+ (/ 1 a) (/ 1 b)))

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