
(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:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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}
(FPCore (a x) :precision binary64 (expm1 (* x a)))
double code(double a, double x) {
return expm1((x * a));
}
public static double code(double a, double x) {
return Math.expm1((x * a));
}
def code(a, x): return math.expm1((x * a))
function code(a, x) return expm1(Float64(x * a)) end
code[a_, x_] := N[(Exp[N[(x * a), $MachinePrecision]] - 1), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{expm1}\left(x \cdot a\right)
\end{array}
Initial program 54.2%
lift--.f64N/A
lift-exp.f64N/A
lower-expm1.f64100.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
(FPCore (a x)
:precision binary64
(if (<= (exp (* a x)) 0.0)
(- (* (* (/ (pow a -1.0) a) a) a) 1.0)
(*
(fma
(*
(fma (fma (* 0.041666666666666664 x) a 0.16666666666666666) (* x a) 0.5)
x)
a
1.0)
(* x a))))
double code(double a, double x) {
double tmp;
if (exp((a * x)) <= 0.0) {
tmp = (((pow(a, -1.0) / a) * a) * a) - 1.0;
} else {
tmp = fma((fma(fma((0.041666666666666664 * x), a, 0.16666666666666666), (x * a), 0.5) * x), a, 1.0) * (x * a);
}
return tmp;
}
function code(a, x) tmp = 0.0 if (exp(Float64(a * x)) <= 0.0) tmp = Float64(Float64(Float64(Float64((a ^ -1.0) / a) * a) * a) - 1.0); else tmp = Float64(fma(Float64(fma(fma(Float64(0.041666666666666664 * x), a, 0.16666666666666666), Float64(x * a), 0.5) * x), a, 1.0) * Float64(x * a)); end return tmp end
code[a_, x_] := If[LessEqual[N[Exp[N[(a * x), $MachinePrecision]], $MachinePrecision], 0.0], N[(N[(N[(N[(N[Power[a, -1.0], $MachinePrecision] / a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(N[(N[(0.041666666666666664 * x), $MachinePrecision] * a + 0.16666666666666666), $MachinePrecision] * N[(x * a), $MachinePrecision] + 0.5), $MachinePrecision] * x), $MachinePrecision] * a + 1.0), $MachinePrecision] * N[(x * a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{a \cdot x} \leq 0:\\
\;\;\;\;\left(\frac{{a}^{-1}}{a} \cdot a\right) \cdot a - 1\\
\mathbf{else}:\\
\;\;\;\;\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)\\
\end{array}
\end{array}
if (exp.f64 (*.f64 a x)) < 0.0Initial program 100.0%
Taylor expanded in a around 0
distribute-lft-inN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
associate-*l*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
Applied rewrites1.2%
Applied rewrites0.6%
Taylor expanded in a around -inf
Applied rewrites8.7%
Taylor expanded in a around 0
Applied rewrites50.5%
if 0.0 < (exp.f64 (*.f64 a x)) Initial program 34.1%
Taylor expanded in a around 0
Applied rewrites99.6%
Final simplification84.6%
(FPCore (a x) :precision binary64 (if (<= (exp (* a x)) 0.0) (- (* (* (/ (pow a -1.0) a) a) a) 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 (exp((a * x)) <= 0.0) {
tmp = (((pow(a, -1.0) / a) * a) * a) - 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 (exp(Float64(a * x)) <= 0.0) tmp = Float64(Float64(Float64(Float64((a ^ -1.0) / a) * a) * a) - 1.0); else tmp = Float64(fma(Float64(fma(Float64(0.16666666666666666 * x), a, 0.5) * a), x, 1.0) * Float64(x * a)); end return tmp end
code[a_, x_] := If[LessEqual[N[Exp[N[(a * x), $MachinePrecision]], $MachinePrecision], 0.0], N[(N[(N[(N[(N[Power[a, -1.0], $MachinePrecision] / a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(N[(0.16666666666666666 * x), $MachinePrecision] * a + 0.5), $MachinePrecision] * a), $MachinePrecision] * x + 1.0), $MachinePrecision] * N[(x * a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{a \cdot x} \leq 0:\\
\;\;\;\;\left(\frac{{a}^{-1}}{a} \cdot a\right) \cdot a - 1\\
\mathbf{else}:\\
\;\;\;\;\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)\\
\end{array}
\end{array}
if (exp.f64 (*.f64 a x)) < 0.0Initial program 100.0%
Taylor expanded in a around 0
distribute-lft-inN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
associate-*l*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
Applied rewrites1.2%
Applied rewrites0.6%
Taylor expanded in a around -inf
Applied rewrites8.7%
Taylor expanded in a around 0
Applied rewrites50.5%
if 0.0 < (exp.f64 (*.f64 a x)) Initial program 34.1%
Taylor expanded in a around 0
Applied rewrites99.5%
Final simplification84.6%
(FPCore (a x) :precision binary64 (pow (- (pow (* x a) -1.0) 0.5) -1.0))
double code(double a, double x) {
return pow((pow((x * a), -1.0) - 0.5), -1.0);
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
code = (((x * a) ** (-1.0d0)) - 0.5d0) ** (-1.0d0)
end function
public static double code(double a, double x) {
return Math.pow((Math.pow((x * a), -1.0) - 0.5), -1.0);
}
def code(a, x): return math.pow((math.pow((x * a), -1.0) - 0.5), -1.0)
function code(a, x) return Float64((Float64(x * a) ^ -1.0) - 0.5) ^ -1.0 end
function tmp = code(a, x) tmp = (((x * a) ^ -1.0) - 0.5) ^ -1.0; end
code[a_, x_] := N[Power[N[(N[Power[N[(x * a), $MachinePrecision], -1.0], $MachinePrecision] - 0.5), $MachinePrecision], -1.0], $MachinePrecision]
\begin{array}{l}
\\
{\left({\left(x \cdot a\right)}^{-1} - 0.5\right)}^{-1}
\end{array}
Initial program 54.2%
Taylor expanded in a around 0
distribute-lft-inN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
associate-*l*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
Applied rewrites23.4%
lift--.f64N/A
flip3--N/A
clear-numN/A
lower-/.f64N/A
Applied rewrites23.4%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f6473.3
Applied rewrites73.3%
Taylor expanded in a around inf
Applied rewrites73.5%
Final simplification73.5%
(FPCore (a x) :precision binary64 (if (<= (* a x) -50000000.0) (pow -0.5 -1.0) (* (* (fma 0.5 (* a x) 1.0) a) x)))
double code(double a, double x) {
double tmp;
if ((a * x) <= -50000000.0) {
tmp = pow(-0.5, -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) <= -50000000.0) tmp = -0.5 ^ -1.0; else tmp = Float64(Float64(fma(0.5, Float64(a * x), 1.0) * a) * x); end return tmp end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -50000000.0], N[Power[-0.5, -1.0], $MachinePrecision], N[(N[(N[(0.5 * N[(a * x), $MachinePrecision] + 1.0), $MachinePrecision] * a), $MachinePrecision] * x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -50000000:\\
\;\;\;\;{-0.5}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\left(\mathsf{fma}\left(0.5, a \cdot x, 1\right) \cdot a\right) \cdot x\\
\end{array}
\end{array}
if (*.f64 a x) < -5e7Initial program 100.0%
Taylor expanded in a around 0
distribute-lft-inN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
associate-*l*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
Applied rewrites1.2%
lift--.f64N/A
flip3--N/A
clear-numN/A
lower-/.f64N/A
Applied rewrites1.2%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f6418.8
Applied rewrites18.8%
Taylor expanded in a around inf
Applied rewrites18.8%
if -5e7 < (*.f64 a x) Initial program 34.1%
lift--.f64N/A
lift-exp.f64N/A
lower-expm1.f64100.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
Taylor expanded in a around 0
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
unpow2N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-inN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites99.2%
Final simplification74.7%
(FPCore (a x) :precision binary64 (if (<= (* a x) -50000000.0) (pow -0.5 -1.0) (* x a)))
double code(double a, double x) {
double tmp;
if ((a * x) <= -50000000.0) {
tmp = pow(-0.5, -1.0);
} else {
tmp = x * a;
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-50000000.0d0)) then
tmp = (-0.5d0) ** (-1.0d0)
else
tmp = x * a
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -50000000.0) {
tmp = Math.pow(-0.5, -1.0);
} else {
tmp = x * a;
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -50000000.0: tmp = math.pow(-0.5, -1.0) else: tmp = x * a return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -50000000.0) tmp = -0.5 ^ -1.0; else tmp = Float64(x * a); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -50000000.0) tmp = -0.5 ^ -1.0; else tmp = x * a; end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -50000000.0], N[Power[-0.5, -1.0], $MachinePrecision], N[(x * a), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -50000000:\\
\;\;\;\;{-0.5}^{-1}\\
\mathbf{else}:\\
\;\;\;\;x \cdot a\\
\end{array}
\end{array}
if (*.f64 a x) < -5e7Initial program 100.0%
Taylor expanded in a around 0
distribute-lft-inN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
associate-*l*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
Applied rewrites1.2%
lift--.f64N/A
flip3--N/A
clear-numN/A
lower-/.f64N/A
Applied rewrites1.2%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f6418.8
Applied rewrites18.8%
Taylor expanded in a around inf
Applied rewrites18.8%
if -5e7 < (*.f64 a x) Initial program 34.1%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f6498.4
Applied rewrites98.4%
Final simplification74.1%
(FPCore (a x) :precision binary64 (* x a))
double code(double a, double x) {
return x * a;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
code = x * a
end function
public static double code(double a, double x) {
return x * a;
}
def code(a, x): return x * a
function code(a, x) return Float64(x * a) end
function tmp = code(a, x) tmp = x * a; end
code[a_, x_] := N[(x * a), $MachinePrecision]
\begin{array}{l}
\\
x \cdot a
\end{array}
Initial program 54.2%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f6470.0
Applied rewrites70.0%
Final simplification70.0%
(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}
Initial program 54.2%
Taylor expanded in a around 0
Applied rewrites22.9%
(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}
herbie shell --seed 2024318
(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))