Kahan's exp quotient

Percentage Accurate: 54.2% → 100.0%

Time: 7.6s

Alternatives: 14

Speedup: 8.8×

• 25.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{e^{x} - 1}{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (exp x) 1.0) x))

C

double code(double x) {
	return (exp(x) - 1.0) / x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (exp(x) - 1.0d0) / x
end function

Java

public static double code(double x) {
	return (Math.exp(x) - 1.0) / x;
}

Python

def code(x):
	return (math.exp(x) - 1.0) / x

Julia

function code(x)
	return Float64(Float64(exp(x) - 1.0) / x)
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - 1.0) / x;
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision]

Initial Program: 54.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x} - 1}{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (exp x) 1.0) x))

C

double code(double x) {
	return (exp(x) - 1.0) / x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (exp(x) - 1.0d0) / x
end function

Java

public static double code(double x) {
	return (Math.exp(x) - 1.0) / x;
}

Python

def code(x):
	return (math.exp(x) - 1.0) / x

Julia

function code(x)
	return Float64(Float64(exp(x) - 1.0) / x)
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - 1.0) / x;
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (/ x (expm1 x))))

C

double code(double x) {
	return 1.0 / (x / expm1(x));
}

Java

public static double code(double x) {
	return 1.0 / (x / Math.expm1(x));
}

Python

def code(x):
	return 1.0 / (x / math.expm1(x))

Julia

function code(x)
	return Float64(1.0 / Float64(x / expm1(x)))
end

Wolfram

code[x_] := N[(1.0 / N[(x / N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 45.2%

   \[\frac{e^{x} - 1}{x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

   2. clear-num N/A

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

   3. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

   4. lower-/.f64 45.2

      \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

   5. lift--.f64 N/A

      \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

   6. lift-exp.f64 N/A

      \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

   7. lower-expm1.f64 100.0

      \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]
5. Add Preprocessing

Alternative 2: 72.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 10^{-5}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(-0.5, x, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{x}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x \cdot x, x\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 1e-5)
   (/ 1.0 (fma -0.5 x 1.0))
   (/
    1.0
    (/
     x
     (fma
      (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5)
      (* x x)
      x)))))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 1e-5) {
		tmp = 1.0 / fma(-0.5, x, 1.0);
	} else {
		tmp = 1.0 / (x / fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), (x * x), x));
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 1e-5)
		tmp = Float64(1.0 / fma(-0.5, x, 1.0));
	else
		tmp = Float64(1.0 / Float64(x / fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), Float64(x * x), x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 1e-5], N[(1.0 / N[(-0.5 * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x / N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 1.00000000000000008e-5

   1. Initial program 29.9%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

      2. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      4. lower-/.f64 29.9

         \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

      5. lift--.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

      6. lift-exp.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

      7. lower-expm1.f64 100.0

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\color{blue}{1 + \frac{-1}{2} \cdot x}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{-1}{2} \cdot x + 1}} \]

      2. lower-fma.f64 77.5

         \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   7. Applied rewrites 77.5%

      \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   if 1.00000000000000008e-5 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 98.8%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

      2. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      4. lower-/.f64 98.8

         \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

      5. lift--.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

      6. lift-exp.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

      7. lower-expm1.f64 100.0

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\frac{x}{\color{blue}{x \cdot \left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right)}}} \]

   7. Applied rewrites 82.0%

      \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x \cdot x, x\right)}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 72.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 10^{-5}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(-0.5, x, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right) \cdot x}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 1e-5)
   (/ 1.0 (fma -0.5 x 1.0))
   (/
    (*
     (fma (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5) x 1.0)
     x)
    x)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 1e-5) {
		tmp = 1.0 / fma(-0.5, x, 1.0);
	} else {
		tmp = (fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) / x;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 1e-5)
		tmp = Float64(1.0 / fma(-0.5, x, 1.0));
	else
		tmp = Float64(Float64(fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) / x);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 1e-5], N[(1.0 / N[(-0.5 * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision] / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 1.00000000000000008e-5

   1. Initial program 29.9%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

      2. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      4. lower-/.f64 29.9

         \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

      5. lift--.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

      6. lift-exp.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

      7. lower-expm1.f64 100.0

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\color{blue}{1 + \frac{-1}{2} \cdot x}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{-1}{2} \cdot x + 1}} \]

      2. lower-fma.f64 77.5

         \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   7. Applied rewrites 77.5%

      \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   if 1.00000000000000008e-5 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 98.8%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{x \cdot \left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right)}}{x} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right) \cdot x}}{x} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right) \cdot x}}{x} \]

      3. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1\right)} \cdot x}{x} \]

      4. *-commutative N/A

         \[\leadsto \frac{\left(\color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1\right) \cdot x}{x} \]

      5. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \cdot x}{x} \]

      6. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \cdot x}{x} \]

      7. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \cdot x}{x} \]

      8. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \cdot x}{x} \]

      9. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \cdot x}{x} \]

      10. lower-fma.f64 82.0

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \cdot x}{x} \]

   5. Applied rewrites 82.0%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right) \cdot x}}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 72.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(-0.5, x, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(x \cdot x\right) \cdot \mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)\right) \cdot x}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 2.0)
   (/ 1.0 (fma -0.5 x 1.0))
   (/ (* (* (* x x) (fma 0.041666666666666664 x 0.16666666666666666)) x) x)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0 / fma(-0.5, x, 1.0);
	} else {
		tmp = (((x * x) * fma(0.041666666666666664, x, 0.16666666666666666)) * x) / x;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 2.0)
		tmp = Float64(1.0 / fma(-0.5, x, 1.0));
	else
		tmp = Float64(Float64(Float64(Float64(x * x) * fma(0.041666666666666664, x, 0.16666666666666666)) * x) / x);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(1.0 / N[(-0.5 * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x * x), $MachinePrecision] * N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2

   1. Initial program 30.3%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

      2. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      4. lower-/.f64 30.3

         \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

      5. lift--.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

      6. lift-exp.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

      7. lower-expm1.f64 100.0

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\color{blue}{1 + \frac{-1}{2} \cdot x}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{-1}{2} \cdot x + 1}} \]

      2. lower-fma.f64 77.4

         \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   7. Applied rewrites 77.4%

      \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 100.0%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{x \cdot \left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right)}}{x} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right) \cdot x}}{x} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right) \cdot x}}{x} \]

      3. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1\right)} \cdot x}{x} \]

      4. *-commutative N/A

         \[\leadsto \frac{\left(\color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1\right) \cdot x}{x} \]

      5. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \cdot x}{x} \]

      6. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \cdot x}{x} \]

      7. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \cdot x}{x} \]

      8. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \cdot x}{x} \]

      9. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \cdot x}{x} \]

      10. lower-fma.f64 82.6

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \cdot x}{x} \]

   5. Applied rewrites 82.6%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right) \cdot x}}{x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\left({x}^{3} \cdot \left(\frac{1}{24} + \frac{1}{6} \cdot \frac{1}{x}\right)\right) \cdot x}{x} \]
   7. Step-by-step derivation

   8. Applied rewrites 82.6%

      \[\leadsto \frac{\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right) \cdot \left(x \cdot x\right)\right) \cdot x}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 78.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(-0.5, x, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(x \cdot x\right) \cdot \mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)\right) \cdot x}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 70.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 10^{-5}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(-0.5, x, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 1e-5)
   (/ 1.0 (fma -0.5 x 1.0))
   (fma (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5) x 1.0)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 1e-5) {
		tmp = 1.0 / fma(-0.5, x, 1.0);
	} else {
		tmp = fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 1e-5)
		tmp = Float64(1.0 / fma(-0.5, x, 1.0));
	else
		tmp = fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 1e-5], N[(1.0 / N[(-0.5 * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 1.00000000000000008e-5

   1. Initial program 29.9%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

      2. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      4. lower-/.f64 29.9

         \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

      5. lift--.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

      6. lift-exp.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

      7. lower-expm1.f64 100.0

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\color{blue}{1 + \frac{-1}{2} \cdot x}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{-1}{2} \cdot x + 1}} \]

      2. lower-fma.f64 77.5

         \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   7. Applied rewrites 77.5%

      \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   if 1.00000000000000008e-5 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 98.8%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \]

      8. lower-fma.f64 78.8

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \]

   5. Applied rewrites 78.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 70.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(-0.5, x, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 2.0)
   (/ 1.0 (fma -0.5 x 1.0))
   (* (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5) x)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0 / fma(-0.5, x, 1.0);
	} else {
		tmp = fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5) * x;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 2.0)
		tmp = Float64(1.0 / fma(-0.5, x, 1.0));
	else
		tmp = Float64(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5) * x);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(1.0 / N[(-0.5 * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2

   1. Initial program 30.3%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{e^{x} - 1}{x}} \]

      2. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x}{e^{x} - 1}}} \]

      4. lower-/.f64 30.3

         \[\leadsto \frac{1}{\color{blue}{\frac{x}{e^{x} - 1}}} \]

      5. lift--.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x} - 1}}} \]

      6. lift-exp.f64 N/A

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{e^{x}} - 1}} \]

      7. lower-expm1.f64 100.0

         \[\leadsto \frac{1}{\frac{x}{\color{blue}{\mathsf{expm1}\left(x\right)}}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x}{\mathsf{expm1}\left(x\right)}}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\color{blue}{1 + \frac{-1}{2} \cdot x}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{-1}{2} \cdot x + 1}} \]

      2. lower-fma.f64 77.4

         \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   7. Applied rewrites 77.4%

      \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(-0.5, x, 1\right)}} \]

   if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 100.0%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \]

      8. lower-fma.f64 79.2

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \]

   5. Applied rewrites 79.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto {x}^{3} \cdot \color{blue}{\left(\frac{1}{24} + \left(\frac{\frac{1}{2}}{{x}^{2}} + \frac{1}{6} \cdot \frac{1}{x}\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 79.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right) \cdot \color{blue}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 66.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right) \cdot x\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 2.0)
   1.0
   (* (* (fma 0.041666666666666664 x 0.16666666666666666) x) x)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = (fma(0.041666666666666664, x, 0.16666666666666666) * x) * x;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(Float64(fma(0.041666666666666664, x, 0.16666666666666666) * x) * x);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], 1.0, N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2

   1. Initial program 30.3%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 73.6%

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

   if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 100.0%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \]

      8. lower-fma.f64 79.2

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \]

   5. Applied rewrites 79.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto {x}^{3} \cdot \color{blue}{\left(\frac{1}{24} + \left(\frac{\frac{1}{2}}{{x}^{2}} + \frac{1}{6} \cdot \frac{1}{x}\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 79.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right) \cdot \color{blue}{x} \]

   9. Taylor expanded in x around inf

      \[\leadsto \left({x}^{2} \cdot \left(\frac{1}{24} + \frac{1}{6} \cdot \frac{1}{x}\right)\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 79.2%

       \[\leadsto \left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right) \cdot x\right) \cdot x \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 66.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(0.041666666666666664 \cdot x\right) \cdot x\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 2.0)
   1.0
   (* (* (* 0.041666666666666664 x) x) x)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = ((0.041666666666666664 * x) * x) * x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (((exp(x) - 1.0d0) / x) <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = ((0.041666666666666664d0 * x) * x) * x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (((Math.exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = ((0.041666666666666664 * x) * x) * x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if ((math.exp(x) - 1.0) / x) <= 2.0:
		tmp = 1.0
	else:
		tmp = ((0.041666666666666664 * x) * x) * x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(Float64(Float64(0.041666666666666664 * x) * x) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((exp(x) - 1.0) / x) <= 2.0)
		tmp = 1.0;
	else
		tmp = ((0.041666666666666664 * x) * x) * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], 1.0, N[(N[(N[(0.041666666666666664 * x), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2

   1. Initial program 30.3%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 73.6%

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

   if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 100.0%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \]

      8. lower-fma.f64 79.2

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \]

   5. Applied rewrites 79.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto {x}^{3} \cdot \color{blue}{\left(\frac{1}{24} + \left(\frac{\frac{1}{2}}{{x}^{2}} + \frac{1}{6} \cdot \frac{1}{x}\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 79.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right) \cdot \color{blue}{x} \]

   9. Taylor expanded in x around inf

      \[\leadsto \left(\frac{1}{24} \cdot {x}^{2}\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 79.2%

       \[\leadsto \left(\left(x \cdot x\right) \cdot 0.041666666666666664\right) \cdot x \]
   12. Step-by-step derivation

   13. Applied rewrites 79.2%

       \[\leadsto \color{blue}{\left(\left(0.041666666666666664 \cdot x\right) \cdot x\right) \cdot x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 62.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.16666666666666666, x, 0.5\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 2.0) 1.0 (* (fma 0.16666666666666666 x 0.5) x)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = fma(0.16666666666666666, x, 0.5) * x;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(fma(0.16666666666666666, x, 0.5) * x);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], 1.0, N[(N[(0.16666666666666666 * x + 0.5), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2

   1. Initial program 30.3%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 73.6%

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

   if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 100.0%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot x\right) \cdot x} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot x, x, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot x + \frac{1}{2}}, x, 1\right) \]

      5. lower-fma.f64 64.0

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, x, 0.5\right)}, x, 1\right) \]

   5. Applied rewrites 64.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto {x}^{2} \cdot \color{blue}{\left(\frac{1}{6} + \frac{1}{2} \cdot \frac{1}{x}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 64.0%

      \[\leadsto \mathsf{fma}\left(0.16666666666666666, x, 0.5\right) \cdot \color{blue}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 62.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{x} - 1}{x} \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot x\right) \cdot 0.16666666666666666\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (- (exp x) 1.0) x) 2.0) 1.0 (* (* x x) 0.16666666666666666)))

C

double code(double x) {
	double tmp;
	if (((exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = (x * x) * 0.16666666666666666;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (((exp(x) - 1.0d0) / x) <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = (x * x) * 0.16666666666666666d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (((Math.exp(x) - 1.0) / x) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = (x * x) * 0.16666666666666666;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if ((math.exp(x) - 1.0) / x) <= 2.0:
		tmp = 1.0
	else:
		tmp = (x * x) * 0.16666666666666666
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 1.0) / x) <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(Float64(x * x) * 0.16666666666666666);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((exp(x) - 1.0) / x) <= 2.0)
		tmp = 1.0;
	else
		tmp = (x * x) * 0.16666666666666666;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], 1.0, N[(N[(x * x), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2

   1. Initial program 30.3%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 73.6%

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

   if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x)

   1. Initial program 100.0%

      \[\frac{e^{x} - 1}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot x\right) \cdot x} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot x, x, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot x + \frac{1}{2}}, x, 1\right) \]

      5. lower-fma.f64 64.0

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, x, 0.5\right)}, x, 1\right) \]

   5. Applied rewrites 64.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{1}{6} \cdot \color{blue}{{x}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 64.0%

      \[\leadsto \left(x \cdot x\right) \cdot \color{blue}{0.16666666666666666} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{expm1}\left(x\right)}{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (expm1 x) x))

C

double code(double x) {
	return expm1(x) / x;
}

Java

public static double code(double x) {
	return Math.expm1(x) / x;
}

Python

def code(x):
	return math.expm1(x) / x

Julia

function code(x)
	return Float64(expm1(x) / x)
end

Wolfram

code[x_] := N[(N[(Exp[x] - 1), $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 45.2%

   \[\frac{e^{x} - 1}{x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \frac{\color{blue}{e^{x} - 1}}{x} \]

   2. lift-exp.f64 N/A

      \[\leadsto \frac{\color{blue}{e^{x}} - 1}{x} \]

   3. lower-expm1.f64 100.0

      \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(x\right)}}{x} \]

4. Applied rewrites 100.0%

   \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(x\right)}}{x} \]
5. Add Preprocessing

Alternative 12: 65.6% accurate, 6.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\left(x \cdot x\right) \cdot 0.041666666666666664, x, 1\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma (* (* x x) 0.041666666666666664) x 1.0))

C

double code(double x) {
	return fma(((x * x) * 0.041666666666666664), x, 1.0);
}

Julia

function code(x)
	return fma(Float64(Float64(x * x) * 0.041666666666666664), x, 1.0)
end

Wolfram

code[x_] := N[(N[(N[(x * x), $MachinePrecision] * 0.041666666666666664), $MachinePrecision] * x + 1.0), $MachinePrecision]

Derivation

1. Initial program 45.2%

   \[\frac{e^{x} - 1}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) + 1} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right) \cdot x} + 1 \]

   3. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right), x, 1\right)} \]

   4. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right) + \frac{1}{2}}, x, 1\right) \]

   5. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} + \frac{1}{24} \cdot x\right) \cdot x} + \frac{1}{2}, x, 1\right) \]

   6. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6} + \frac{1}{24} \cdot x, x, \frac{1}{2}\right)}, x, 1\right) \]

   7. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{24} \cdot x + \frac{1}{6}}, x, \frac{1}{2}\right), x, 1\right) \]

   8. lower-fma.f64 74.0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right)}, x, 0.5\right), x, 1\right) \]

5. Applied rewrites 74.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right)} \]

6. Taylor expanded in x around inf

   \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {x}^{2}, x, 1\right) \]
7. Step-by-step derivation

8. Applied rewrites 74.0%

   \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot 0.041666666666666664, x, 1\right) \]
9. Add Preprocessing

Alternative 13: 62.6% accurate, 8.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma (fma 0.16666666666666666 x 0.5) x 1.0))

C

double code(double x) {
	return fma(fma(0.16666666666666666, x, 0.5), x, 1.0);
}

Julia

function code(x)
	return fma(fma(0.16666666666666666, x, 0.5), x, 1.0)
end

Wolfram

code[x_] := N[(N[(0.16666666666666666 * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision]

Derivation

1. Initial program 45.2%

   \[\frac{e^{x} - 1}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{1 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right) + 1} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot x\right) \cdot x} + 1 \]

   3. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot x, x, 1\right)} \]

   4. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot x + \frac{1}{2}}, x, 1\right) \]

   5. lower-fma.f64 71.1

      \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, x, 0.5\right)}, x, 1\right) \]

5. Applied rewrites 71.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right)} \]
6. Add Preprocessing

Alternative 14: 50.1% accurate, 115.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 1.0)

C

double code(double x) {
	return 1.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0
end function

Java

public static double code(double x) {
	return 1.0;
}

Python

def code(x):
	return 1.0

Julia

function code(x)
	return 1.0
end

MATLAB

function tmp = code(x)
	tmp = 1.0;
end

Wolfram

code[x_] := 1.0

Derivation

1. Initial program 45.2%

   \[\frac{e^{x} - 1}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 58.4%

   \[\leadsto \color{blue}{1} \]
6. Add Preprocessing

Developer Target 1: 53.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{x} - 1\\ \mathbf{if}\;x < 1 \land x > -1:\\ \;\;\;\;\frac{t\_0}{\log \left(e^{x}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_0}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (exp x) 1.0)))
   (if (and (< x 1.0) (> x -1.0)) (/ t_0 (log (exp x))) (/ t_0 x))))

C

double code(double x) {
	double t_0 = exp(x) - 1.0;
	double tmp;
	if ((x < 1.0) && (x > -1.0)) {
		tmp = t_0 / log(exp(x));
	} else {
		tmp = t_0 / x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = exp(x) - 1.0d0
    if ((x < 1.0d0) .and. (x > (-1.0d0))) then
        tmp = t_0 / log(exp(x))
    else
        tmp = t_0 / x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double t_0 = Math.exp(x) - 1.0;
	double tmp;
	if ((x < 1.0) && (x > -1.0)) {
		tmp = t_0 / Math.log(Math.exp(x));
	} else {
		tmp = t_0 / x;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.exp(x) - 1.0
	tmp = 0
	if (x < 1.0) and (x > -1.0):
		tmp = t_0 / math.log(math.exp(x))
	else:
		tmp = t_0 / x
	return tmp

Julia

function code(x)
	t_0 = Float64(exp(x) - 1.0)
	tmp = 0.0
	if ((x < 1.0) && (x > -1.0))
		tmp = Float64(t_0 / log(exp(x)));
	else
		tmp = Float64(t_0 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = exp(x) - 1.0;
	tmp = 0.0;
	if ((x < 1.0) && (x > -1.0))
		tmp = t_0 / log(exp(x));
	else
		tmp = t_0 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]}, If[And[Less[x, 1.0], Greater[x, -1.0]], N[(t$95$0 / N[Log[N[Exp[x], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 / x), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024270 
(FPCore (x)
  :name "Kahan's exp quotient"
  :precision binary64

  :alt
  (! :herbie-platform default (if (and (< x 1) (> x -1)) (/ (- (exp x) 1) (log (exp x))) (/ (- (exp x) 1) x)))

  (/ (- (exp x) 1.0) x))