
(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 10 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 (* 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}
Initial program 57.9%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
(FPCore (a x)
:precision binary64
(let* ((t_0 (+ 0.5 (* a (* x 0.16666666666666666)))))
(if (<= (* a x) -10.0)
(+ (/ 1.0 (+ 1.0 (* a (- (* a (* x x)) x)))) -1.0)
(/
(* (* a x) (- 1.0 (* t_0 (* t_0 (* a (* x (* a x)))))))
(- 1.0 (* a (* x t_0)))))))
double code(double a, double x) {
double t_0 = 0.5 + (a * (x * 0.16666666666666666));
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0;
} else {
tmp = ((a * x) * (1.0 - (t_0 * (t_0 * (a * (x * (a * x))))))) / (1.0 - (a * (x * t_0)));
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: t_0
real(8) :: tmp
t_0 = 0.5d0 + (a * (x * 0.16666666666666666d0))
if ((a * x) <= (-10.0d0)) then
tmp = (1.0d0 / (1.0d0 + (a * ((a * (x * x)) - x)))) + (-1.0d0)
else
tmp = ((a * x) * (1.0d0 - (t_0 * (t_0 * (a * (x * (a * x))))))) / (1.0d0 - (a * (x * t_0)))
end if
code = tmp
end function
public static double code(double a, double x) {
double t_0 = 0.5 + (a * (x * 0.16666666666666666));
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0;
} else {
tmp = ((a * x) * (1.0 - (t_0 * (t_0 * (a * (x * (a * x))))))) / (1.0 - (a * (x * t_0)));
}
return tmp;
}
def code(a, x): t_0 = 0.5 + (a * (x * 0.16666666666666666)) tmp = 0 if (a * x) <= -10.0: tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0 else: tmp = ((a * x) * (1.0 - (t_0 * (t_0 * (a * (x * (a * x))))))) / (1.0 - (a * (x * t_0))) return tmp
function code(a, x) t_0 = Float64(0.5 + Float64(a * Float64(x * 0.16666666666666666))) tmp = 0.0 if (Float64(a * x) <= -10.0) tmp = Float64(Float64(1.0 / Float64(1.0 + Float64(a * Float64(Float64(a * Float64(x * x)) - x)))) + -1.0); else tmp = Float64(Float64(Float64(a * x) * Float64(1.0 - Float64(t_0 * Float64(t_0 * Float64(a * Float64(x * Float64(a * x))))))) / Float64(1.0 - Float64(a * Float64(x * t_0)))); end return tmp end
function tmp_2 = code(a, x) t_0 = 0.5 + (a * (x * 0.16666666666666666)); tmp = 0.0; if ((a * x) <= -10.0) tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0; else tmp = ((a * x) * (1.0 - (t_0 * (t_0 * (a * (x * (a * x))))))) / (1.0 - (a * (x * t_0))); end tmp_2 = tmp; end
code[a_, x_] := Block[{t$95$0 = N[(0.5 + N[(a * N[(x * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * x), $MachinePrecision], -10.0], N[(N[(1.0 / N[(1.0 + N[(a * N[(N[(a * N[(x * x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(a * x), $MachinePrecision] * N[(1.0 - N[(t$95$0 * N[(t$95$0 * N[(a * N[(x * N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 - N[(a * N[(x * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 + a \cdot \left(x \cdot 0.16666666666666666\right)\\
\mathbf{if}\;a \cdot x \leq -10:\\
\;\;\;\;\frac{1}{1 + a \cdot \left(a \cdot \left(x \cdot x\right) - x\right)} + -1\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(a \cdot x\right) \cdot \left(1 - t\_0 \cdot \left(t\_0 \cdot \left(a \cdot \left(x \cdot \left(a \cdot x\right)\right)\right)\right)\right)}{1 - a \cdot \left(x \cdot t\_0\right)}\\
\end{array}
\end{array}
if (*.f64 a x) < -10Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f645.2%
Simplified5.2%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval4.2%
Applied egg-rr4.2%
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
+-lowering-+.f64N/A
distribute-rgt-inN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-lft-inN/A
Simplified98.9%
if -10 < (*.f64 a x) Initial program 36.7%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
+-commutativeN/A
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
unpow3N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
distribute-lft1-inN/A
distribute-rgt-outN/A
Simplified99.3%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr99.3%
Final simplification99.2%
(FPCore (a x) :precision binary64 (if (<= (* a x) -10.0) (+ (/ 1.0 (+ 1.0 (* a (- (* a (* x x)) x)))) -1.0) (* (* a x) (+ 1.0 (* (* a x) (+ 0.5 (* (* a x) 0.16666666666666666)))))))
double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0;
} else {
tmp = (a * x) * (1.0 + ((a * x) * (0.5 + ((a * x) * 0.16666666666666666))));
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-10.0d0)) then
tmp = (1.0d0 / (1.0d0 + (a * ((a * (x * x)) - x)))) + (-1.0d0)
else
tmp = (a * x) * (1.0d0 + ((a * x) * (0.5d0 + ((a * x) * 0.16666666666666666d0))))
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0;
} else {
tmp = (a * x) * (1.0 + ((a * x) * (0.5 + ((a * x) * 0.16666666666666666))));
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -10.0: tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0 else: tmp = (a * x) * (1.0 + ((a * x) * (0.5 + ((a * x) * 0.16666666666666666)))) return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -10.0) tmp = Float64(Float64(1.0 / Float64(1.0 + Float64(a * Float64(Float64(a * Float64(x * x)) - x)))) + -1.0); else tmp = Float64(Float64(a * x) * Float64(1.0 + Float64(Float64(a * x) * Float64(0.5 + Float64(Float64(a * x) * 0.16666666666666666))))); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -10.0) tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0; else tmp = (a * x) * (1.0 + ((a * x) * (0.5 + ((a * x) * 0.16666666666666666)))); end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -10.0], N[(N[(1.0 / N[(1.0 + N[(a * N[(N[(a * N[(x * x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * x), $MachinePrecision] * N[(1.0 + N[(N[(a * x), $MachinePrecision] * N[(0.5 + N[(N[(a * x), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -10:\\
\;\;\;\;\frac{1}{1 + a \cdot \left(a \cdot \left(x \cdot x\right) - x\right)} + -1\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot x\right) \cdot \left(1 + \left(a \cdot x\right) \cdot \left(0.5 + \left(a \cdot x\right) \cdot 0.16666666666666666\right)\right)\\
\end{array}
\end{array}
if (*.f64 a x) < -10Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f645.2%
Simplified5.2%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval4.2%
Applied egg-rr4.2%
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
+-lowering-+.f64N/A
distribute-rgt-inN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-lft-inN/A
Simplified98.9%
if -10 < (*.f64 a x) Initial program 36.7%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
+-commutativeN/A
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
unpow3N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
distribute-lft1-inN/A
distribute-rgt-outN/A
Simplified99.3%
Final simplification99.2%
(FPCore (a x) :precision binary64 (if (<= (* a x) -10.0) (+ (/ 1.0 (+ 1.0 (* a (- (* a (* x x)) x)))) -1.0) (* x (* a (+ 1.0 (* a (* x 0.5)))))))
double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0;
} else {
tmp = x * (a * (1.0 + (a * (x * 0.5))));
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-10.0d0)) then
tmp = (1.0d0 / (1.0d0 + (a * ((a * (x * x)) - x)))) + (-1.0d0)
else
tmp = x * (a * (1.0d0 + (a * (x * 0.5d0))))
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0;
} else {
tmp = x * (a * (1.0 + (a * (x * 0.5))));
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -10.0: tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0 else: tmp = x * (a * (1.0 + (a * (x * 0.5)))) return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -10.0) tmp = Float64(Float64(1.0 / Float64(1.0 + Float64(a * Float64(Float64(a * Float64(x * x)) - x)))) + -1.0); else tmp = Float64(x * Float64(a * Float64(1.0 + Float64(a * Float64(x * 0.5))))); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -10.0) tmp = (1.0 / (1.0 + (a * ((a * (x * x)) - x)))) + -1.0; else tmp = x * (a * (1.0 + (a * (x * 0.5)))); end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -10.0], N[(N[(1.0 / N[(1.0 + N[(a * N[(N[(a * N[(x * x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(x * N[(a * N[(1.0 + N[(a * N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -10:\\
\;\;\;\;\frac{1}{1 + a \cdot \left(a \cdot \left(x \cdot x\right) - x\right)} + -1\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(a \cdot \left(1 + a \cdot \left(x \cdot 0.5\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 a x) < -10Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f645.2%
Simplified5.2%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval4.2%
Applied egg-rr4.2%
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
+-lowering-+.f64N/A
distribute-rgt-inN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-lft-inN/A
Simplified98.9%
if -10 < (*.f64 a x) Initial program 36.7%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6498.8%
Simplified98.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.7%
Applied egg-rr98.7%
Final simplification98.8%
(FPCore (a x) :precision binary64 (if (<= (* a x) -10.0) (+ (/ 1.0 (- 1.0 (* a x))) -1.0) (* x (* a (+ 1.0 (* a (* x 0.5)))))))
double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = x * (a * (1.0 + (a * (x * 0.5))));
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-10.0d0)) then
tmp = (1.0d0 / (1.0d0 - (a * x))) + (-1.0d0)
else
tmp = x * (a * (1.0d0 + (a * (x * 0.5d0))))
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = x * (a * (1.0 + (a * (x * 0.5))));
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -10.0: tmp = (1.0 / (1.0 - (a * x))) + -1.0 else: tmp = x * (a * (1.0 + (a * (x * 0.5)))) return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -10.0) tmp = Float64(Float64(1.0 / Float64(1.0 - Float64(a * x))) + -1.0); else tmp = Float64(x * Float64(a * Float64(1.0 + Float64(a * Float64(x * 0.5))))); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -10.0) tmp = (1.0 / (1.0 - (a * x))) + -1.0; else tmp = x * (a * (1.0 + (a * (x * 0.5)))); end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -10.0], N[(N[(1.0 / N[(1.0 - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(x * N[(a * N[(1.0 + N[(a * N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -10:\\
\;\;\;\;\frac{1}{1 - a \cdot x} + -1\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(a \cdot \left(1 + a \cdot \left(x \cdot 0.5\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 a x) < -10Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f645.2%
Simplified5.2%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval4.2%
Applied egg-rr4.2%
Taylor expanded in a around 0
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
*-lowering-*.f6497.6%
Simplified97.6%
if -10 < (*.f64 a x) Initial program 36.7%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6498.8%
Simplified98.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.7%
Applied egg-rr98.7%
Final simplification98.3%
(FPCore (a x) :precision binary64 (if (<= (* a x) -10.0) (+ (/ 1.0 (- 1.0 (* a x))) -1.0) (* a (+ x (* x (* a (* x 0.5)))))))
double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = a * (x + (x * (a * (x * 0.5))));
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-10.0d0)) then
tmp = (1.0d0 / (1.0d0 - (a * x))) + (-1.0d0)
else
tmp = a * (x + (x * (a * (x * 0.5d0))))
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = a * (x + (x * (a * (x * 0.5))));
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -10.0: tmp = (1.0 / (1.0 - (a * x))) + -1.0 else: tmp = a * (x + (x * (a * (x * 0.5)))) return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -10.0) tmp = Float64(Float64(1.0 / Float64(1.0 - Float64(a * x))) + -1.0); else tmp = Float64(a * Float64(x + Float64(x * Float64(a * Float64(x * 0.5))))); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -10.0) tmp = (1.0 / (1.0 - (a * x))) + -1.0; else tmp = a * (x + (x * (a * (x * 0.5)))); end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -10.0], N[(N[(1.0 / N[(1.0 - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(x + N[(x * N[(a * N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -10:\\
\;\;\;\;\frac{1}{1 - a \cdot x} + -1\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(x + x \cdot \left(a \cdot \left(x \cdot 0.5\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 a x) < -10Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f645.2%
Simplified5.2%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval4.2%
Applied egg-rr4.2%
Taylor expanded in a around 0
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
*-lowering-*.f6497.6%
Simplified97.6%
if -10 < (*.f64 a x) Initial program 36.7%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6498.8%
Simplified98.8%
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.8%
Applied egg-rr98.8%
Final simplification98.4%
(FPCore (a x) :precision binary64 (if (<= (* a x) -10.0) (+ (/ 1.0 (- 1.0 (* a x))) -1.0) (* a (* x (+ 1.0 (* (* a x) 0.5))))))
double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = a * (x * (1.0 + ((a * x) * 0.5)));
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-10.0d0)) then
tmp = (1.0d0 / (1.0d0 - (a * x))) + (-1.0d0)
else
tmp = a * (x * (1.0d0 + ((a * x) * 0.5d0)))
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -10.0) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = a * (x * (1.0 + ((a * x) * 0.5)));
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -10.0: tmp = (1.0 / (1.0 - (a * x))) + -1.0 else: tmp = a * (x * (1.0 + ((a * x) * 0.5))) return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -10.0) tmp = Float64(Float64(1.0 / Float64(1.0 - Float64(a * x))) + -1.0); else tmp = Float64(a * Float64(x * Float64(1.0 + Float64(Float64(a * x) * 0.5)))); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -10.0) tmp = (1.0 / (1.0 - (a * x))) + -1.0; else tmp = a * (x * (1.0 + ((a * x) * 0.5))); end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -10.0], N[(N[(1.0 / N[(1.0 - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(x * N[(1.0 + N[(N[(a * x), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -10:\\
\;\;\;\;\frac{1}{1 - a \cdot x} + -1\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(x \cdot \left(1 + \left(a \cdot x\right) \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if (*.f64 a x) < -10Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f645.2%
Simplified5.2%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval4.2%
Applied egg-rr4.2%
Taylor expanded in a around 0
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
*-lowering-*.f6497.6%
Simplified97.6%
if -10 < (*.f64 a x) Initial program 36.7%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6498.8%
Simplified98.8%
Final simplification98.4%
(FPCore (a x) :precision binary64 (if (<= (* a x) -0.0001) (+ (/ 1.0 (- 1.0 (* a x))) -1.0) (* a x)))
double code(double a, double x) {
double tmp;
if ((a * x) <= -0.0001) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = a * x;
}
return tmp;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
real(8) :: tmp
if ((a * x) <= (-0.0001d0)) then
tmp = (1.0d0 / (1.0d0 - (a * x))) + (-1.0d0)
else
tmp = a * x
end if
code = tmp
end function
public static double code(double a, double x) {
double tmp;
if ((a * x) <= -0.0001) {
tmp = (1.0 / (1.0 - (a * x))) + -1.0;
} else {
tmp = a * x;
}
return tmp;
}
def code(a, x): tmp = 0 if (a * x) <= -0.0001: tmp = (1.0 / (1.0 - (a * x))) + -1.0 else: tmp = a * x return tmp
function code(a, x) tmp = 0.0 if (Float64(a * x) <= -0.0001) tmp = Float64(Float64(1.0 / Float64(1.0 - Float64(a * x))) + -1.0); else tmp = Float64(a * x); end return tmp end
function tmp_2 = code(a, x) tmp = 0.0; if ((a * x) <= -0.0001) tmp = (1.0 / (1.0 - (a * x))) + -1.0; else tmp = a * x; end tmp_2 = tmp; end
code[a_, x_] := If[LessEqual[N[(a * x), $MachinePrecision], -0.0001], N[(N[(1.0 / N[(1.0 - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot x \leq -0.0001:\\
\;\;\;\;\frac{1}{1 - a \cdot x} + -1\\
\mathbf{else}:\\
\;\;\;\;a \cdot x\\
\end{array}
\end{array}
if (*.f64 a x) < -1.00000000000000005e-4Initial program 99.7%
Taylor expanded in a around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f646.0%
Simplified6.0%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval5.0%
Applied egg-rr5.0%
Taylor expanded in a around 0
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
*-lowering-*.f6496.3%
Simplified96.3%
if -1.00000000000000005e-4 < (*.f64 a x) Initial program 36.1%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
*-lowering-*.f6498.1%
Simplified98.1%
Final simplification97.5%
(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}
Initial program 57.9%
expm1-defineN/A
expm1-lowering-expm1.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in a around 0
*-lowering-*.f6466.4%
Simplified66.4%
(FPCore (a x) :precision binary64 0.0)
double code(double a, double x) {
return 0.0;
}
real(8) function code(a, x)
real(8), intent (in) :: a
real(8), intent (in) :: x
code = 0.0d0
end function
public static double code(double a, double x) {
return 0.0;
}
def code(a, x): return 0.0
function code(a, x) return 0.0 end
function tmp = code(a, x) tmp = 0.0; end
code[a_, x_] := 0.0
\begin{array}{l}
\\
0
\end{array}
Initial program 57.9%
Taylor expanded in a around 0
Simplified22.5%
metadata-eval22.5%
Applied egg-rr22.5%
(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 2024170
(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))