Kahan's exp quotient

Percentage Accurate: 53.7% → 100.0%

Time: 9.6s

Alternatives: 14

Speedup: 8.8×

• 25.0% 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: 53.7% 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, 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 60.6%

   \[\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 2: 70.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ (+ (exp x) -1.0) x) 2.0)
   (+ 1.0 (/ x (fma x (fma x 0.05555555555555555 -0.6666666666666666) 2.0)))
   (fma
    x
    (fma x (/ (* 7.233796296296296e-5 (* x (* x x))) 0.027777777777777776) 0.5)
    1.0)))

C

double code(double x) {
	double tmp;
	if (((exp(x) + -1.0) / x) <= 2.0) {
		tmp = 1.0 + (x / fma(x, fma(x, 0.05555555555555555, -0.6666666666666666), 2.0));
	} else {
		tmp = fma(x, fma(x, ((7.233796296296296e-5 * (x * (x * x))) / 0.027777777777777776), 0.5), 1.0);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0)
		tmp = Float64(1.0 + Float64(x / fma(x, fma(x, 0.05555555555555555, -0.6666666666666666), 2.0)));
	else
		tmp = fma(x, fma(x, Float64(Float64(7.233796296296296e-5 * Float64(x * Float64(x * x))) / 0.027777777777777776), 0.5), 1.0);
	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[(x / N[(x * N[(x * 0.05555555555555555 + -0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(x * N[(N[(7.233796296296296e-5 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 0.027777777777777776), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 38.3%

      \[\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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 65.9

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

   5. Applied rewrites 65.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right), 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 65.9%

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

   8. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(x, \frac{1}{2 + \color{blue}{x \cdot \left(\frac{1}{18} \cdot x - \frac{2}{3}\right)}}, 1\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 67.3%

       \[\leadsto \mathsf{fma}\left(x, \frac{1}{\mathsf{fma}\left(x, \color{blue}{\mathsf{fma}\left(x, 0.05555555555555555, -0.6666666666666666\right)}, 2\right)}, 1\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 67.3%

       \[\leadsto \frac{x}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.05555555555555555, -0.6666666666666666\right), 2\right)} + \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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 67.4

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

   5. Applied rewrites 67.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right), 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.9%

      \[\leadsto \mathsf{fma}\left(x, \mathsf{fma}\left(x, \frac{\mathsf{fma}\left(x \cdot \left(x \cdot x\right), 7.233796296296296 \cdot 10^{-5}, 0.004629629629629629\right)}{\color{blue}{0.027777777777777776 + \mathsf{fma}\left(x, -0.006944444444444444, \left(x \cdot x\right) \cdot 0.001736111111111111\right)}}, 0.5\right), 1\right) \]

   8. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(x, \mathsf{fma}\left(x, \frac{\mathsf{fma}\left(x \cdot \left(x \cdot x\right), \frac{1}{13824}, \frac{1}{216}\right)}{\frac{1}{36}}, \frac{1}{2}\right), 1\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 80.9%

       \[\leadsto \mathsf{fma}\left(x, \mathsf{fma}\left(x, \frac{\mathsf{fma}\left(x \cdot \left(x \cdot x\right), 7.233796296296296 \cdot 10^{-5}, 0.004629629629629629\right)}{0.027777777777777776}, 0.5\right), 1\right) \]

   11. Taylor expanded in x around inf

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

   13. Applied rewrites 80.9%

       \[\leadsto \mathsf{fma}\left(x, \mathsf{fma}\left(x, \frac{\left(x \cdot \left(x \cdot x\right)\right) \cdot 7.233796296296296 \cdot 10^{-5}}{0.027777777777777776}, 0.5\right), 1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.7%

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

Developer Target 1: 53.2% 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 2024227 
(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))