expax (section 3.5)

Percentage Accurate: 54.5% → 100.0%
Time: 5.9s
Alternatives: 6
Speedup: 18.2×

Specification

?
\[710 > a \cdot x\]
\[\begin{array}{l} \\ e^{a \cdot x} - 1 \end{array} \]
(FPCore (a x) :precision binary64 (- (exp (* a x)) 1.0))
double code(double a, double x) {
	return exp((a * x)) - 1.0;
}
real(8) function code(a, x)
    real(8), intent (in) :: a
    real(8), intent (in) :: x
    code = exp((a * x)) - 1.0d0
end function
public static double code(double a, double x) {
	return Math.exp((a * x)) - 1.0;
}
def code(a, x):
	return math.exp((a * x)) - 1.0
function code(a, x)
	return Float64(exp(Float64(a * x)) - 1.0)
end
function tmp = code(a, x)
	tmp = exp((a * x)) - 1.0;
end
code[a_, x_] := N[(N[Exp[N[(a * x), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}

\\
e^{a \cdot x} - 1
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 54.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ e^{a \cdot x} - 1 \end{array} \]
(FPCore (a x) :precision binary64 (- (exp (* a x)) 1.0))
double code(double a, double x) {
	return exp((a * x)) - 1.0;
}
real(8) function code(a, x)
    real(8), intent (in) :: a
    real(8), intent (in) :: x
    code = exp((a * x)) - 1.0d0
end function
public static double code(double a, double x) {
	return Math.exp((a * x)) - 1.0;
}
def code(a, x):
	return math.exp((a * x)) - 1.0
function code(a, x)
	return Float64(exp(Float64(a * x)) - 1.0)
end
function tmp = code(a, x)
	tmp = exp((a * x)) - 1.0;
end
code[a_, x_] := N[(N[Exp[N[(a * x), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}

\\
e^{a \cdot x} - 1
\end{array}

Alternative 1: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \mathsf{expm1}\left(a \cdot x\right) \end{array} \]
(FPCore (a x) :precision binary64 (expm1 (* a x)))
double code(double a, double x) {
	return expm1((a * x));
}
public static double code(double a, double x) {
	return Math.expm1((a * x));
}
def code(a, x):
	return math.expm1((a * x))
function code(a, x)
	return expm1(Float64(a * x))
end
code[a_, x_] := N[(Exp[N[(a * x), $MachinePrecision]] - 1), $MachinePrecision]
\begin{array}{l}

\\
\mathsf{expm1}\left(a \cdot x\right)
\end{array}
Derivation
  1. Initial program 52.6%

    \[e^{a \cdot x} - 1 \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift--.f64N/A

      \[\leadsto \color{blue}{e^{a \cdot x} - 1} \]
    2. lift-exp.f64N/A

      \[\leadsto \color{blue}{e^{a \cdot x}} - 1 \]
    3. lower-expm1.f64100.0

      \[\leadsto \color{blue}{\mathsf{expm1}\left(a \cdot x\right)} \]
    4. lift-*.f64N/A

      \[\leadsto \mathsf{expm1}\left(\color{blue}{a \cdot x}\right) \]
    5. *-commutativeN/A

      \[\leadsto \mathsf{expm1}\left(\color{blue}{x \cdot a}\right) \]
    6. lower-*.f64100.0

      \[\leadsto \mathsf{expm1}\left(\color{blue}{x \cdot a}\right) \]
  4. Applied rewrites100.0%

    \[\leadsto \color{blue}{\mathsf{expm1}\left(x \cdot a\right)} \]
  5. Final simplification100.0%

    \[\leadsto \mathsf{expm1}\left(a \cdot x\right) \]
  6. Add Preprocessing

Alternative 2: 67.6% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot x \leq -5:\\ \;\;\;\;\left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot x - 1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664 \cdot x, a, 0.16666666666666666\right), a \cdot x, 0.5\right) \cdot x, a, 1\right) \cdot \left(a \cdot x\right)\\ \end{array} \end{array} \]
(FPCore (a x)
 :precision binary64
 (if (<= (* a x) -5.0)
   (- (* (* (* (* a a) x) 0.5) x) 1.0)
   (*
    (fma
     (*
      (fma (fma (* 0.041666666666666664 x) a 0.16666666666666666) (* a x) 0.5)
      x)
     a
     1.0)
    (* a x))))
double code(double a, double x) {
	double tmp;
	if ((a * x) <= -5.0) {
		tmp = ((((a * a) * x) * 0.5) * x) - 1.0;
	} else {
		tmp = fma((fma(fma((0.041666666666666664 * x), a, 0.16666666666666666), (a * x), 0.5) * x), a, 1.0) * (a * x);
	}
	return tmp;
}
function code(a, x)
	tmp = 0.0
	if (Float64(a * x) <= -5.0)
		tmp = Float64(Float64(Float64(Float64(Float64(a * a) * x) * 0.5) * x) - 1.0);
	else
		tmp = Float64(fma(Float64(fma(fma(Float64(0.041666666666666664 * x), a, 0.16666666666666666), Float64(a * x), 0.5) * x), a, 1.0) * Float64(a * x));
	end
	return tmp
end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -5.0], N[(N[(N[(N[(N[(a * a), $MachinePrecision] * x), $MachinePrecision] * 0.5), $MachinePrecision] * x), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(N[(N[(0.041666666666666664 * x), $MachinePrecision] * a + 0.16666666666666666), $MachinePrecision] * N[(a * x), $MachinePrecision] + 0.5), $MachinePrecision] * x), $MachinePrecision] * a + 1.0), $MachinePrecision] * N[(a * x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -5:\\
\;\;\;\;\left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot x - 1\\

\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664 \cdot x, a, 0.16666666666666666\right), a \cdot x, 0.5\right) \cdot x, a, 1\right) \cdot \left(a \cdot x\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (*.f64 a x) < -5

    1. Initial program 100.0%

      \[e^{a \cdot x} - 1 \]
    2. Add Preprocessing
    3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(1 + a \cdot \left(x + \frac{1}{2} \cdot \left(a \cdot {x}^{2}\right)\right)\right)} - 1 \]
    4. Step-by-step derivation
      1. distribute-lft-inN/A

        \[\leadsto \left(1 + \color{blue}{\left(a \cdot x + a \cdot \left(\frac{1}{2} \cdot \left(a \cdot {x}^{2}\right)\right)\right)}\right) - 1 \]
      2. associate-*r*N/A

        \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot {x}^{2}\right)}\right)\right) - 1 \]
      3. unpow2N/A

        \[\leadsto \left(1 + \left(a \cdot x + a \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot \color{blue}{\left(x \cdot x\right)}\right)\right)\right) - 1 \]
      4. associate-*r*N/A

        \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(\left(\left(\frac{1}{2} \cdot a\right) \cdot x\right) \cdot x\right)}\right)\right) - 1 \]
      5. *-commutativeN/A

        \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(x \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot x\right)\right)}\right)\right) - 1 \]
      6. associate-*r*N/A

        \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(a \cdot x\right) \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot x\right)}\right)\right) - 1 \]
      7. *-commutativeN/A

        \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot x\right) \cdot \left(a \cdot x\right)}\right)\right) - 1 \]
      8. distribute-rgt1-inN/A

        \[\leadsto \left(1 + \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot x + 1\right) \cdot \left(a \cdot x\right)}\right) - 1 \]
      9. *-commutativeN/A

        \[\leadsto \left(1 + \left(\color{blue}{x \cdot \left(\frac{1}{2} \cdot a\right)} + 1\right) \cdot \left(a \cdot x\right)\right) - 1 \]
      10. associate-*r*N/A

        \[\leadsto \left(1 + \left(\color{blue}{\left(x \cdot \frac{1}{2}\right) \cdot a} + 1\right) \cdot \left(a \cdot x\right)\right) - 1 \]
      11. distribute-rgt1-inN/A

        \[\leadsto \left(1 + \color{blue}{\left(a \cdot x + \left(\left(x \cdot \frac{1}{2}\right) \cdot a\right) \cdot \left(a \cdot x\right)\right)}\right) - 1 \]
      12. associate-*r*N/A

        \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(x \cdot \frac{1}{2}\right) \cdot \left(a \cdot \left(a \cdot x\right)\right)}\right)\right) - 1 \]
      13. associate-*l*N/A

        \[\leadsto \left(1 + \left(a \cdot x + \left(x \cdot \frac{1}{2}\right) \cdot \color{blue}{\left(\left(a \cdot a\right) \cdot x\right)}\right)\right) - 1 \]
      14. unpow2N/A

        \[\leadsto \left(1 + \left(a \cdot x + \left(x \cdot \frac{1}{2}\right) \cdot \left(\color{blue}{{a}^{2}} \cdot x\right)\right)\right) - 1 \]
      15. associate-*r*N/A

        \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{x \cdot \left(\frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)}\right)\right) - 1 \]
      16. *-commutativeN/A

        \[\leadsto \left(1 + \left(\color{blue}{x \cdot a} + x \cdot \left(\frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)\right)\right) - 1 \]
      17. distribute-lft-inN/A

        \[\leadsto \left(1 + \color{blue}{x \cdot \left(a + \frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)}\right) - 1 \]
      18. *-rgt-identityN/A

        \[\leadsto \left(1 + \color{blue}{\left(x \cdot \left(a + \frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)\right) \cdot 1}\right) - 1 \]
    5. Applied rewrites1.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\left(a \cdot a\right) \cdot x, 0.5, a\right), x, 1\right)} - 1 \]
    6. Taylor expanded in a around inf

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left({a}^{2} \cdot {x}^{2}\right)} - 1 \]
    7. Step-by-step derivation
      1. Applied rewrites10.5%

        \[\leadsto \left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot \color{blue}{x} - 1 \]

      if -5 < (*.f64 a x)

      1. Initial program 29.4%

        \[e^{a \cdot x} - 1 \]
      2. Add Preprocessing
      3. Taylor expanded in a around 0

        \[\leadsto \color{blue}{a \cdot \left(x + a \cdot \left(\frac{1}{2} \cdot {x}^{2} + a \cdot \left(\frac{1}{24} \cdot \left(a \cdot {x}^{4}\right) + \frac{1}{6} \cdot {x}^{3}\right)\right)\right)} \]
      4. Applied rewrites98.9%

        \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664 \cdot x, a, 0.16666666666666666\right), x \cdot a, 0.5\right) \cdot x, a, 1\right) \cdot \left(x \cdot a\right)} \]
    8. Recombined 2 regimes into one program.
    9. Final simplification69.9%

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

    Alternative 3: 67.4% accurate, 2.5× speedup?

    \[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot x \leq -2000000:\\ \;\;\;\;\left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot x - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot x, a, 0.5\right) \cdot a, x, 1\right) \cdot x\right) \cdot a\\ \end{array} \end{array} \]
    (FPCore (a x)
     :precision binary64
     (if (<= (* a x) -2000000.0)
       (- (* (* (* (* a a) x) 0.5) x) 1.0)
       (* (* (fma (* (fma (* 0.16666666666666666 x) a 0.5) a) x 1.0) x) a)))
    double code(double a, double x) {
    	double tmp;
    	if ((a * x) <= -2000000.0) {
    		tmp = ((((a * a) * x) * 0.5) * x) - 1.0;
    	} else {
    		tmp = (fma((fma((0.16666666666666666 * x), a, 0.5) * a), x, 1.0) * x) * a;
    	}
    	return tmp;
    }
    
    function code(a, x)
    	tmp = 0.0
    	if (Float64(a * x) <= -2000000.0)
    		tmp = Float64(Float64(Float64(Float64(Float64(a * a) * x) * 0.5) * x) - 1.0);
    	else
    		tmp = Float64(Float64(fma(Float64(fma(Float64(0.16666666666666666 * x), a, 0.5) * a), x, 1.0) * x) * a);
    	end
    	return tmp
    end
    
    code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -2000000.0], N[(N[(N[(N[(N[(a * a), $MachinePrecision] * x), $MachinePrecision] * 0.5), $MachinePrecision] * x), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(N[(N[(0.16666666666666666 * x), $MachinePrecision] * a + 0.5), $MachinePrecision] * a), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision] * a), $MachinePrecision]]
    
    \begin{array}{l}
    
    \\
    \begin{array}{l}
    \mathbf{if}\;a \cdot x \leq -2000000:\\
    \;\;\;\;\left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot x - 1\\
    
    \mathbf{else}:\\
    \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot x, a, 0.5\right) \cdot a, x, 1\right) \cdot x\right) \cdot a\\
    
    
    \end{array}
    \end{array}
    
    Derivation
    1. Split input into 2 regimes
    2. if (*.f64 a x) < -2e6

      1. Initial program 100.0%

        \[e^{a \cdot x} - 1 \]
      2. Add Preprocessing
      3. Taylor expanded in a around 0

        \[\leadsto \color{blue}{\left(1 + a \cdot \left(x + \frac{1}{2} \cdot \left(a \cdot {x}^{2}\right)\right)\right)} - 1 \]
      4. Step-by-step derivation
        1. distribute-lft-inN/A

          \[\leadsto \left(1 + \color{blue}{\left(a \cdot x + a \cdot \left(\frac{1}{2} \cdot \left(a \cdot {x}^{2}\right)\right)\right)}\right) - 1 \]
        2. associate-*r*N/A

          \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot {x}^{2}\right)}\right)\right) - 1 \]
        3. unpow2N/A

          \[\leadsto \left(1 + \left(a \cdot x + a \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot \color{blue}{\left(x \cdot x\right)}\right)\right)\right) - 1 \]
        4. associate-*r*N/A

          \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(\left(\left(\frac{1}{2} \cdot a\right) \cdot x\right) \cdot x\right)}\right)\right) - 1 \]
        5. *-commutativeN/A

          \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(x \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot x\right)\right)}\right)\right) - 1 \]
        6. associate-*r*N/A

          \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(a \cdot x\right) \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot x\right)}\right)\right) - 1 \]
        7. *-commutativeN/A

          \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot x\right) \cdot \left(a \cdot x\right)}\right)\right) - 1 \]
        8. distribute-rgt1-inN/A

          \[\leadsto \left(1 + \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot x + 1\right) \cdot \left(a \cdot x\right)}\right) - 1 \]
        9. *-commutativeN/A

          \[\leadsto \left(1 + \left(\color{blue}{x \cdot \left(\frac{1}{2} \cdot a\right)} + 1\right) \cdot \left(a \cdot x\right)\right) - 1 \]
        10. associate-*r*N/A

          \[\leadsto \left(1 + \left(\color{blue}{\left(x \cdot \frac{1}{2}\right) \cdot a} + 1\right) \cdot \left(a \cdot x\right)\right) - 1 \]
        11. distribute-rgt1-inN/A

          \[\leadsto \left(1 + \color{blue}{\left(a \cdot x + \left(\left(x \cdot \frac{1}{2}\right) \cdot a\right) \cdot \left(a \cdot x\right)\right)}\right) - 1 \]
        12. associate-*r*N/A

          \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(x \cdot \frac{1}{2}\right) \cdot \left(a \cdot \left(a \cdot x\right)\right)}\right)\right) - 1 \]
        13. associate-*l*N/A

          \[\leadsto \left(1 + \left(a \cdot x + \left(x \cdot \frac{1}{2}\right) \cdot \color{blue}{\left(\left(a \cdot a\right) \cdot x\right)}\right)\right) - 1 \]
        14. unpow2N/A

          \[\leadsto \left(1 + \left(a \cdot x + \left(x \cdot \frac{1}{2}\right) \cdot \left(\color{blue}{{a}^{2}} \cdot x\right)\right)\right) - 1 \]
        15. associate-*r*N/A

          \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{x \cdot \left(\frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)}\right)\right) - 1 \]
        16. *-commutativeN/A

          \[\leadsto \left(1 + \left(\color{blue}{x \cdot a} + x \cdot \left(\frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)\right)\right) - 1 \]
        17. distribute-lft-inN/A

          \[\leadsto \left(1 + \color{blue}{x \cdot \left(a + \frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)}\right) - 1 \]
        18. *-rgt-identityN/A

          \[\leadsto \left(1 + \color{blue}{\left(x \cdot \left(a + \frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)\right) \cdot 1}\right) - 1 \]
      5. Applied rewrites1.3%

        \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\left(a \cdot a\right) \cdot x, 0.5, a\right), x, 1\right)} - 1 \]
      6. Taylor expanded in a around inf

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left({a}^{2} \cdot {x}^{2}\right)} - 1 \]
      7. Step-by-step derivation
        1. Applied rewrites9.3%

          \[\leadsto \left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot \color{blue}{x} - 1 \]

        if -2e6 < (*.f64 a x)

        1. Initial program 30.6%

          \[e^{a \cdot x} - 1 \]
        2. Add Preprocessing
        3. Taylor expanded in a around 0

          \[\leadsto \color{blue}{a \cdot \left(x + a \cdot \left(\frac{1}{6} \cdot \left(a \cdot {x}^{3}\right) + \frac{1}{2} \cdot {x}^{2}\right)\right)} \]
        4. Applied rewrites97.2%

          \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot x, a, 0.5\right) \cdot a, x, 1\right) \cdot \left(x \cdot a\right)} \]
        5. Step-by-step derivation
          1. Applied rewrites97.2%

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

        Alternative 4: 67.3% accurate, 3.1× speedup?

        \[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot x \leq -5:\\ \;\;\;\;\left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot x - 1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5 \cdot a, x, 1\right) \cdot \left(a \cdot x\right)\\ \end{array} \end{array} \]
        (FPCore (a x)
         :precision binary64
         (if (<= (* a x) -5.0)
           (- (* (* (* (* a a) x) 0.5) x) 1.0)
           (* (fma (* 0.5 a) x 1.0) (* a x))))
        double code(double a, double x) {
        	double tmp;
        	if ((a * x) <= -5.0) {
        		tmp = ((((a * a) * x) * 0.5) * x) - 1.0;
        	} else {
        		tmp = fma((0.5 * a), x, 1.0) * (a * x);
        	}
        	return tmp;
        }
        
        function code(a, x)
        	tmp = 0.0
        	if (Float64(a * x) <= -5.0)
        		tmp = Float64(Float64(Float64(Float64(Float64(a * a) * x) * 0.5) * x) - 1.0);
        	else
        		tmp = Float64(fma(Float64(0.5 * a), x, 1.0) * Float64(a * x));
        	end
        	return tmp
        end
        
        code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -5.0], N[(N[(N[(N[(N[(a * a), $MachinePrecision] * x), $MachinePrecision] * 0.5), $MachinePrecision] * x), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(0.5 * a), $MachinePrecision] * x + 1.0), $MachinePrecision] * N[(a * x), $MachinePrecision]), $MachinePrecision]]
        
        \begin{array}{l}
        
        \\
        \begin{array}{l}
        \mathbf{if}\;a \cdot x \leq -5:\\
        \;\;\;\;\left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot x - 1\\
        
        \mathbf{else}:\\
        \;\;\;\;\mathsf{fma}\left(0.5 \cdot a, x, 1\right) \cdot \left(a \cdot x\right)\\
        
        
        \end{array}
        \end{array}
        
        Derivation
        1. Split input into 2 regimes
        2. if (*.f64 a x) < -5

          1. Initial program 100.0%

            \[e^{a \cdot x} - 1 \]
          2. Add Preprocessing
          3. Taylor expanded in a around 0

            \[\leadsto \color{blue}{\left(1 + a \cdot \left(x + \frac{1}{2} \cdot \left(a \cdot {x}^{2}\right)\right)\right)} - 1 \]
          4. Step-by-step derivation
            1. distribute-lft-inN/A

              \[\leadsto \left(1 + \color{blue}{\left(a \cdot x + a \cdot \left(\frac{1}{2} \cdot \left(a \cdot {x}^{2}\right)\right)\right)}\right) - 1 \]
            2. associate-*r*N/A

              \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot {x}^{2}\right)}\right)\right) - 1 \]
            3. unpow2N/A

              \[\leadsto \left(1 + \left(a \cdot x + a \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot \color{blue}{\left(x \cdot x\right)}\right)\right)\right) - 1 \]
            4. associate-*r*N/A

              \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(\left(\left(\frac{1}{2} \cdot a\right) \cdot x\right) \cdot x\right)}\right)\right) - 1 \]
            5. *-commutativeN/A

              \[\leadsto \left(1 + \left(a \cdot x + a \cdot \color{blue}{\left(x \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot x\right)\right)}\right)\right) - 1 \]
            6. associate-*r*N/A

              \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(a \cdot x\right) \cdot \left(\left(\frac{1}{2} \cdot a\right) \cdot x\right)}\right)\right) - 1 \]
            7. *-commutativeN/A

              \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot x\right) \cdot \left(a \cdot x\right)}\right)\right) - 1 \]
            8. distribute-rgt1-inN/A

              \[\leadsto \left(1 + \color{blue}{\left(\left(\frac{1}{2} \cdot a\right) \cdot x + 1\right) \cdot \left(a \cdot x\right)}\right) - 1 \]
            9. *-commutativeN/A

              \[\leadsto \left(1 + \left(\color{blue}{x \cdot \left(\frac{1}{2} \cdot a\right)} + 1\right) \cdot \left(a \cdot x\right)\right) - 1 \]
            10. associate-*r*N/A

              \[\leadsto \left(1 + \left(\color{blue}{\left(x \cdot \frac{1}{2}\right) \cdot a} + 1\right) \cdot \left(a \cdot x\right)\right) - 1 \]
            11. distribute-rgt1-inN/A

              \[\leadsto \left(1 + \color{blue}{\left(a \cdot x + \left(\left(x \cdot \frac{1}{2}\right) \cdot a\right) \cdot \left(a \cdot x\right)\right)}\right) - 1 \]
            12. associate-*r*N/A

              \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{\left(x \cdot \frac{1}{2}\right) \cdot \left(a \cdot \left(a \cdot x\right)\right)}\right)\right) - 1 \]
            13. associate-*l*N/A

              \[\leadsto \left(1 + \left(a \cdot x + \left(x \cdot \frac{1}{2}\right) \cdot \color{blue}{\left(\left(a \cdot a\right) \cdot x\right)}\right)\right) - 1 \]
            14. unpow2N/A

              \[\leadsto \left(1 + \left(a \cdot x + \left(x \cdot \frac{1}{2}\right) \cdot \left(\color{blue}{{a}^{2}} \cdot x\right)\right)\right) - 1 \]
            15. associate-*r*N/A

              \[\leadsto \left(1 + \left(a \cdot x + \color{blue}{x \cdot \left(\frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)}\right)\right) - 1 \]
            16. *-commutativeN/A

              \[\leadsto \left(1 + \left(\color{blue}{x \cdot a} + x \cdot \left(\frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)\right)\right) - 1 \]
            17. distribute-lft-inN/A

              \[\leadsto \left(1 + \color{blue}{x \cdot \left(a + \frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)}\right) - 1 \]
            18. *-rgt-identityN/A

              \[\leadsto \left(1 + \color{blue}{\left(x \cdot \left(a + \frac{1}{2} \cdot \left({a}^{2} \cdot x\right)\right)\right) \cdot 1}\right) - 1 \]
          5. Applied rewrites1.6%

            \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\left(a \cdot a\right) \cdot x, 0.5, a\right), x, 1\right)} - 1 \]
          6. Taylor expanded in a around inf

            \[\leadsto \frac{1}{2} \cdot \color{blue}{\left({a}^{2} \cdot {x}^{2}\right)} - 1 \]
          7. Step-by-step derivation
            1. Applied rewrites10.5%

              \[\leadsto \left(\left(\left(a \cdot a\right) \cdot x\right) \cdot 0.5\right) \cdot \color{blue}{x} - 1 \]

            if -5 < (*.f64 a x)

            1. Initial program 29.4%

              \[e^{a \cdot x} - 1 \]
            2. Add Preprocessing
            3. Taylor expanded in a around 0

              \[\leadsto \color{blue}{a \cdot \left(x + a \cdot \left(\frac{1}{6} \cdot \left(a \cdot {x}^{3}\right) + \frac{1}{2} \cdot {x}^{2}\right)\right)} \]
            4. Applied rewrites98.7%

              \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot x, a, 0.5\right) \cdot a, x, 1\right) \cdot \left(x \cdot a\right)} \]
            5. Taylor expanded in a around 0

              \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot a, x, 1\right) \cdot \left(x \cdot a\right) \]
            6. Step-by-step derivation
              1. Applied rewrites98.2%

                \[\leadsto \mathsf{fma}\left(0.5 \cdot a, x, 1\right) \cdot \left(x \cdot a\right) \]
            7. Recombined 2 regimes into one program.
            8. Final simplification69.4%

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

            Alternative 5: 66.3% accurate, 18.2× speedup?

            \[\begin{array}{l} \\ a \cdot x \end{array} \]
            (FPCore (a x) :precision binary64 (* a x))
            double code(double a, double x) {
            	return a * x;
            }
            
            real(8) function code(a, x)
                real(8), intent (in) :: a
                real(8), intent (in) :: x
                code = a * x
            end function
            
            public static double code(double a, double x) {
            	return a * x;
            }
            
            def code(a, x):
            	return a * x
            
            function code(a, x)
            	return Float64(a * x)
            end
            
            function tmp = code(a, x)
            	tmp = a * x;
            end
            
            code[a_, x_] := N[(a * x), $MachinePrecision]
            
            \begin{array}{l}
            
            \\
            a \cdot x
            \end{array}
            
            Derivation
            1. Initial program 52.6%

              \[e^{a \cdot x} - 1 \]
            2. Add Preprocessing
            3. Taylor expanded in a around 0

              \[\leadsto \color{blue}{a \cdot x} \]
            4. Step-by-step derivation
              1. *-commutativeN/A

                \[\leadsto \color{blue}{x \cdot a} \]
              2. lower-*.f6467.0

                \[\leadsto \color{blue}{x \cdot a} \]
            5. Applied rewrites67.0%

              \[\leadsto \color{blue}{x \cdot a} \]
            6. Final simplification67.0%

              \[\leadsto a \cdot x \]
            7. Add Preprocessing

            Alternative 6: 19.5% accurate, 27.3× speedup?

            \[\begin{array}{l} \\ 1 - 1 \end{array} \]
            (FPCore (a x) :precision binary64 (- 1.0 1.0))
            double code(double a, double x) {
            	return 1.0 - 1.0;
            }
            
            real(8) function code(a, x)
                real(8), intent (in) :: a
                real(8), intent (in) :: x
                code = 1.0d0 - 1.0d0
            end function
            
            public static double code(double a, double x) {
            	return 1.0 - 1.0;
            }
            
            def code(a, x):
            	return 1.0 - 1.0
            
            function code(a, x)
            	return Float64(1.0 - 1.0)
            end
            
            function tmp = code(a, x)
            	tmp = 1.0 - 1.0;
            end
            
            code[a_, x_] := N[(1.0 - 1.0), $MachinePrecision]
            
            \begin{array}{l}
            
            \\
            1 - 1
            \end{array}
            
            Derivation
            1. Initial program 52.6%

              \[e^{a \cdot x} - 1 \]
            2. Add Preprocessing
            3. Taylor expanded in a around 0

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

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

              Developer Target 1: 100.0% accurate, 1.0× speedup?

              \[\begin{array}{l} \\ \mathsf{expm1}\left(a \cdot x\right) \end{array} \]
              (FPCore (a x) :precision binary64 (expm1 (* a x)))
              double code(double a, double x) {
              	return expm1((a * x));
              }
              
              public static double code(double a, double x) {
              	return Math.expm1((a * x));
              }
              
              def code(a, x):
              	return math.expm1((a * x))
              
              function code(a, x)
              	return expm1(Float64(a * x))
              end
              
              code[a_, x_] := N[(Exp[N[(a * x), $MachinePrecision]] - 1), $MachinePrecision]
              
              \begin{array}{l}
              
              \\
              \mathsf{expm1}\left(a \cdot x\right)
              \end{array}
              

              Reproduce

              ?
              herbie shell --seed 2024276 
              (FPCore (a x)
                :name "expax (section 3.5)"
                :precision binary64
                :pre (> 710.0 (* a x))
              
                :alt
                (! :herbie-platform default (expm1 (* a x)))
              
                (- (exp (* a x)) 1.0))