expq3 (problem 3.4.2)

Percentage Accurate: 0.1% → 99.9%

Time: 27.3s

Alternatives: 4

Speedup: 29.1×

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.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.9% accurate, 13.4× 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 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. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{/.f64}\left(\left(a + b\right), \color{blue}{\left(a \cdot b\right)}\right) \]

   2. +-commutative N/A

      \[\leadsto \mathsf{/.f64}\left(\left(b + a\right), \left(\color{blue}{a} \cdot b\right)\right) \]

   3. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{/.f64}\left(\mathsf{+.f64}\left(b, a\right), \left(\color{blue}{a} \cdot b\right)\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{/.f64}\left(\mathsf{+.f64}\left(b, a\right), \left(b \cdot \color{blue}{a}\right)\right) \]

   5. *-lowering-*.f64 61.5%

      \[\leadsto \mathsf{/.f64}\left(\mathsf{+.f64}\left(b, a\right), \mathsf{*.f64}\left(b, \color{blue}{a}\right)\right) \]

5. Simplified 61.5%

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

   1. +-commutative N/A

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

   2. *-rgt-identity N/A

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

   3. *-commutative N/A

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

   4. *-lft-identity N/A

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

   5. *-commutative N/A

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

   6. frac-add N/A

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

   7. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{1}{b}\right), \color{blue}{\left(\frac{1}{a}\right)}\right) \]

   8. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{/.f64}\left(1, b\right), \left(\frac{\color{blue}{1}}{a}\right)\right) \]

   9. /-lowering-/.f64 99.9%

      \[\leadsto \mathsf{+.f64}\left(\mathsf{/.f64}\left(1, b\right), \mathsf{/.f64}\left(1, \color{blue}{a}\right)\right) \]

7. Applied egg-rr 99.9%

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

Alternative 2: 60.2% accurate, 13.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -6.8 \cdot 10^{-75}:\\ \;\;\;\;\frac{b + a}{b \cdot a}\\ \mathbf{elif}\;a \leq -6.5 \cdot 10^{-210}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b eps)
 :precision binary64
 (if (<= a -6.8e-75)
   (/ (+ b a) (* b a))
   (if (<= a -6.5e-210) (/ 1.0 b) (/ 1.0 a))))

C

double code(double a, double b, double eps) {
	double tmp;
	if (a <= -6.8e-75) {
		tmp = (b + a) / (b * a);
	} else if (a <= -6.5e-210) {
		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 <= (-6.8d-75)) then
        tmp = (b + a) / (b * a)
    else if (a <= (-6.5d-210)) 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 <= -6.8e-75) {
		tmp = (b + a) / (b * a);
	} else if (a <= -6.5e-210) {
		tmp = 1.0 / b;
	} else {
		tmp = 1.0 / a;
	}
	return tmp;
}

Python

def code(a, b, eps):
	tmp = 0
	if a <= -6.8e-75:
		tmp = (b + a) / (b * a)
	elif a <= -6.5e-210:
		tmp = 1.0 / b
	else:
		tmp = 1.0 / a
	return tmp

Julia

function code(a, b, eps)
	tmp = 0.0
	if (a <= -6.8e-75)
		tmp = Float64(Float64(b + a) / Float64(b * a));
	elseif (a <= -6.5e-210)
		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 <= -6.8e-75)
		tmp = (b + a) / (b * a);
	elseif (a <= -6.5e-210)
		tmp = 1.0 / b;
	else
		tmp = 1.0 / a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -6.8000000000000003e-75

   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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(a + b\right), \color{blue}{\left(a \cdot b\right)}\right) \]

      2. +-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(\left(b + a\right), \left(\color{blue}{a} \cdot b\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{+.f64}\left(b, a\right), \left(\color{blue}{a} \cdot b\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{+.f64}\left(b, a\right), \left(b \cdot \color{blue}{a}\right)\right) \]

      5. *-lowering-*.f64 93.3%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{+.f64}\left(b, a\right), \mathsf{*.f64}\left(b, \color{blue}{a}\right)\right) \]

   5. Simplified 93.3%

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

   if -6.8000000000000003e-75 < a < -6.49999999999999961e-210

   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. /-lowering-/.f64 51.2%

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{b}\right) \]

   5. Simplified 51.2%

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

   if -6.49999999999999961e-210 < 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. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. /-lowering-/.f64 49.9%

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{a}\right) \]

   5. Simplified 49.9%

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

Alternative 3: 59.1% accurate, 19.4× speedup

Math

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

FPCore

(FPCore (a b eps)
 :precision binary64
 (if (<= a -6.5e-210) (/ 1.0 b) (/ 1.0 a)))

C

double code(double a, double b, double eps) {
	double tmp;
	if (a <= -6.5e-210) {
		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 <= (-6.5d-210)) 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 <= -6.5e-210) {
		tmp = 1.0 / b;
	} else {
		tmp = 1.0 / a;
	}
	return tmp;
}

Python

def code(a, b, eps):
	tmp = 0
	if a <= -6.5e-210:
		tmp = 1.0 / b
	else:
		tmp = 1.0 / a
	return tmp

Julia

function code(a, b, eps)
	tmp = 0.0
	if (a <= -6.5e-210)
		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 <= -6.5e-210)
		tmp = 1.0 / b;
	else
		tmp = 1.0 / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, eps_] := If[LessEqual[a, -6.5e-210], N[(1.0 / b), $MachinePrecision], N[(1.0 / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -6.49999999999999961e-210

   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. /-lowering-/.f64 62.7%

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{b}\right) \]

   5. Simplified 62.7%

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

   if -6.49999999999999961e-210 < 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. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. /-lowering-/.f64 49.9%

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{a}\right) \]

   5. Simplified 49.9%

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

Alternative 4: 48.9% accurate, 29.1× 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 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. /-lowering-/.f64 44.9%

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{a}\right) \]

5. Simplified 44.9%

   \[\leadsto \color{blue}{\frac{1}{a}} \]
6. 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 2024193 
(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))))