expax (section 3.5)

Percentage Accurate: 53.9% → 100.0%
Time: 9.0s
Alternatives: 7
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 7 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: 53.9% 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.4%

    \[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.f6499.9

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

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

Alternative 2: 99.0% accurate, 2.3× speedup?

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

\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -2:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(a, x \cdot \mathsf{fma}\left(a, x \cdot 0.5, -1\right), 1\right)} + -1\\

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


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

    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 + a \cdot \left(\frac{1}{6} \cdot \left(a \cdot {x}^{3}\right) + \frac{1}{2} \cdot {x}^{2}\right)\right)\right)} - 1 \]
    4. Step-by-step derivation
      1. +-commutativeN/A

        \[\leadsto \color{blue}{\left(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) + 1\right)} - 1 \]
      2. lower-fma.f64N/A

        \[\leadsto \color{blue}{\mathsf{fma}\left(a, x + a \cdot \left(\frac{1}{6} \cdot \left(a \cdot {x}^{3}\right) + \frac{1}{2} \cdot {x}^{2}\right), 1\right)} - 1 \]
    5. Applied rewrites3.8%

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

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

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

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

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

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

          if -2 < (*.f64 a x)

          1. Initial program 30.8%

            \[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. Step-by-step derivation
            1. lower-*.f64N/A

              \[\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)} \]
            2. +-commutativeN/A

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

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

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

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

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

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

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

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

              \[\leadsto a \cdot \left(\left(a \cdot {x}^{2}\right) \cdot \color{blue}{\left(\left(\frac{1}{6} \cdot a\right) \cdot x + \frac{1}{2}\right)} + x\right) \]
            11. lower-fma.f64N/A

              \[\leadsto a \cdot \color{blue}{\mathsf{fma}\left(a \cdot {x}^{2}, \left(\frac{1}{6} \cdot a\right) \cdot x + \frac{1}{2}, x\right)} \]
          5. Applied rewrites92.7%

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

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

            \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot x \leq -2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(a, x \cdot \mathsf{fma}\left(a, x \cdot 0.5, -1\right), 1\right)} + -1\\ \mathbf{else}:\\ \;\;\;\;a \cdot \mathsf{fma}\left(x \cdot \mathsf{fma}\left(a \cdot x, 0.16666666666666666, 0.5\right), a \cdot x, x\right)\\ \end{array} \]
          9. 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 2024223 
          (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))