
(FPCore (x) :precision binary64 (/ (- (exp x) (exp (- x))) 2.0))
double code(double x) {
return (exp(x) - exp(-x)) / 2.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (exp(x) - exp(-x)) / 2.0d0
end function
public static double code(double x) {
return (Math.exp(x) - Math.exp(-x)) / 2.0;
}
def code(x): return (math.exp(x) - math.exp(-x)) / 2.0
function code(x) return Float64(Float64(exp(x) - exp(Float64(-x))) / 2.0) end
function tmp = code(x) tmp = (exp(x) - exp(-x)) / 2.0; end
code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x} - e^{-x}}{2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (/ (- (exp x) (exp (- x))) 2.0))
double code(double x) {
return (exp(x) - exp(-x)) / 2.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (exp(x) - exp(-x)) / 2.0d0
end function
public static double code(double x) {
return (Math.exp(x) - Math.exp(-x)) / 2.0;
}
def code(x): return (math.exp(x) - math.exp(-x)) / 2.0
function code(x) return Float64(Float64(exp(x) - exp(Float64(-x))) / 2.0) end
function tmp = code(x) tmp = (exp(x) - exp(-x)) / 2.0; end
code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x} - e^{-x}}{2}
\end{array}
(FPCore (x) :precision binary64 (sinh x))
double code(double x) {
return sinh(x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = sinh(x)
end function
public static double code(double x) {
return Math.sinh(x);
}
def code(x): return math.sinh(x)
function code(x) return sinh(x) end
function tmp = code(x) tmp = sinh(x); end
code[x_] := N[Sinh[x], $MachinePrecision]
\begin{array}{l}
\\
\sinh x
\end{array}
Initial program 56.4%
sinh-defN/A
sinh-lowering-sinh.f64100.0
Applied egg-rr100.0%
(FPCore (x) :precision binary64 (if (<= (- (exp x) (exp (- x))) 0.5) (* x (fma x (* x 0.16666666666666666) 1.0)) (* (* x (* x x)) (fma x (* x 0.008333333333333333) 0.16666666666666666))))
double code(double x) {
double tmp;
if ((exp(x) - exp(-x)) <= 0.5) {
tmp = x * fma(x, (x * 0.16666666666666666), 1.0);
} else {
tmp = (x * (x * x)) * fma(x, (x * 0.008333333333333333), 0.16666666666666666);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(exp(x) - exp(Float64(-x))) <= 0.5) tmp = Float64(x * fma(x, Float64(x * 0.16666666666666666), 1.0)); else tmp = Float64(Float64(x * Float64(x * x)) * fma(x, Float64(x * 0.008333333333333333), 0.16666666666666666)); end return tmp end
code[x_] := If[LessEqual[N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 0.5], N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] * N[(x * N[(x * 0.008333333333333333), $MachinePrecision] + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} - e^{-x} \leq 0.5:\\
\;\;\;\;x \cdot \mathsf{fma}\left(x, x \cdot 0.16666666666666666, 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \left(x \cdot x\right)\right) \cdot \mathsf{fma}\left(x, x \cdot 0.008333333333333333, 0.16666666666666666\right)\\
\end{array}
\end{array}
if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 0.5Initial program 40.9%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6494.9
Simplified94.9%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip-+N/A
/-lowering-/.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6494.9
Applied egg-rr94.9%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6488.7
Simplified88.7%
if 0.5 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) Initial program 100.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6476.1
Simplified76.1%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f6474.4
Simplified74.4%
Taylor expanded in x around inf
distribute-lft-inN/A
metadata-evalN/A
pow-plusN/A
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
unpow2N/A
unpow3N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
metadata-evalN/A
associate-*r/N/A
associate-*l/N/A
Simplified74.4%
(FPCore (x) :precision binary64 (if (<= (- (exp x) (exp (- x))) 0.5) (* x (fma x (* x 0.16666666666666666) 1.0)) (* 0.008333333333333333 (* x (* x (* x (* x x)))))))
double code(double x) {
double tmp;
if ((exp(x) - exp(-x)) <= 0.5) {
tmp = x * fma(x, (x * 0.16666666666666666), 1.0);
} else {
tmp = 0.008333333333333333 * (x * (x * (x * (x * x))));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(exp(x) - exp(Float64(-x))) <= 0.5) tmp = Float64(x * fma(x, Float64(x * 0.16666666666666666), 1.0)); else tmp = Float64(0.008333333333333333 * Float64(x * Float64(x * Float64(x * Float64(x * x))))); end return tmp end
code[x_] := If[LessEqual[N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 0.5], N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(0.008333333333333333 * N[(x * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} - e^{-x} \leq 0.5:\\
\;\;\;\;x \cdot \mathsf{fma}\left(x, x \cdot 0.16666666666666666, 1\right)\\
\mathbf{else}:\\
\;\;\;\;0.008333333333333333 \cdot \left(x \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right)\\
\end{array}
\end{array}
if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 0.5Initial program 40.9%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6494.9
Simplified94.9%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip-+N/A
/-lowering-/.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6494.9
Applied egg-rr94.9%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6488.7
Simplified88.7%
if 0.5 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6474.4
Simplified74.4%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6474.4
Simplified74.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6474.4
Simplified74.4%
(FPCore (x) :precision binary64 (if (<= (- (exp x) (exp (- x))) 0.5) x (* 0.16666666666666666 (* x (* x x)))))
double code(double x) {
double tmp;
if ((exp(x) - exp(-x)) <= 0.5) {
tmp = x;
} else {
tmp = 0.16666666666666666 * (x * (x * x));
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if ((exp(x) - exp(-x)) <= 0.5d0) then
tmp = x
else
tmp = 0.16666666666666666d0 * (x * (x * x))
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if ((Math.exp(x) - Math.exp(-x)) <= 0.5) {
tmp = x;
} else {
tmp = 0.16666666666666666 * (x * (x * x));
}
return tmp;
}
def code(x): tmp = 0 if (math.exp(x) - math.exp(-x)) <= 0.5: tmp = x else: tmp = 0.16666666666666666 * (x * (x * x)) return tmp
function code(x) tmp = 0.0 if (Float64(exp(x) - exp(Float64(-x))) <= 0.5) tmp = x; else tmp = Float64(0.16666666666666666 * Float64(x * Float64(x * x))); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if ((exp(x) - exp(-x)) <= 0.5) tmp = x; else tmp = 0.16666666666666666 * (x * (x * x)); end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 0.5], x, N[(0.16666666666666666 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} - e^{-x} \leq 0.5:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;0.16666666666666666 \cdot \left(x \cdot \left(x \cdot x\right)\right)\\
\end{array}
\end{array}
if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 0.5Initial program 40.9%
Taylor expanded in x around 0
Simplified66.5%
if 0.5 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*l*N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6460.4
Simplified60.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6460.4
Simplified60.4%
(FPCore (x)
:precision binary64
(let* ((t_0 (* x (* x x)))
(t_1 (fma x (* x 0.0001984126984126984) 0.008333333333333333))
(t_2 (* x t_1)))
(if (<= x 5.0)
(fma
(*
x
(fma
(- x)
(/ x (fma x (* x 2.857142857142857) -120.0))
0.16666666666666666))
(* x x)
x)
(if (<= x 1e+61)
(/
(* t_0 (fma t_2 (* (* x x) t_2) -0.027777777777777776))
(fma (* x x) t_1 -0.16666666666666666))
(* 0.008333333333333333 (* x (* x t_0)))))))
double code(double x) {
double t_0 = x * (x * x);
double t_1 = fma(x, (x * 0.0001984126984126984), 0.008333333333333333);
double t_2 = x * t_1;
double tmp;
if (x <= 5.0) {
tmp = fma((x * fma(-x, (x / fma(x, (x * 2.857142857142857), -120.0)), 0.16666666666666666)), (x * x), x);
} else if (x <= 1e+61) {
tmp = (t_0 * fma(t_2, ((x * x) * t_2), -0.027777777777777776)) / fma((x * x), t_1, -0.16666666666666666);
} else {
tmp = 0.008333333333333333 * (x * (x * t_0));
}
return tmp;
}
function code(x) t_0 = Float64(x * Float64(x * x)) t_1 = fma(x, Float64(x * 0.0001984126984126984), 0.008333333333333333) t_2 = Float64(x * t_1) tmp = 0.0 if (x <= 5.0) tmp = fma(Float64(x * fma(Float64(-x), Float64(x / fma(x, Float64(x * 2.857142857142857), -120.0)), 0.16666666666666666)), Float64(x * x), x); elseif (x <= 1e+61) tmp = Float64(Float64(t_0 * fma(t_2, Float64(Float64(x * x) * t_2), -0.027777777777777776)) / fma(Float64(x * x), t_1, -0.16666666666666666)); else tmp = Float64(0.008333333333333333 * Float64(x * Float64(x * t_0))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x * N[(x * 0.0001984126984126984), $MachinePrecision] + 0.008333333333333333), $MachinePrecision]}, Block[{t$95$2 = N[(x * t$95$1), $MachinePrecision]}, If[LessEqual[x, 5.0], N[(N[(x * N[((-x) * N[(x / N[(x * N[(x * 2.857142857142857), $MachinePrecision] + -120.0), $MachinePrecision]), $MachinePrecision] + 0.16666666666666666), $MachinePrecision]), $MachinePrecision] * N[(x * x), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[x, 1e+61], N[(N[(t$95$0 * N[(t$95$2 * N[(N[(x * x), $MachinePrecision] * t$95$2), $MachinePrecision] + -0.027777777777777776), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] * t$95$1 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(0.008333333333333333 * N[(x * N[(x * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := x \cdot \left(x \cdot x\right)\\
t_1 := \mathsf{fma}\left(x, x \cdot 0.0001984126984126984, 0.008333333333333333\right)\\
t_2 := x \cdot t\_1\\
\mathbf{if}\;x \leq 5:\\
\;\;\;\;\mathsf{fma}\left(x \cdot \mathsf{fma}\left(-x, \frac{x}{\mathsf{fma}\left(x, x \cdot 2.857142857142857, -120\right)}, 0.16666666666666666\right), x \cdot x, x\right)\\
\mathbf{elif}\;x \leq 10^{+61}:\\
\;\;\;\;\frac{t\_0 \cdot \mathsf{fma}\left(t\_2, \left(x \cdot x\right) \cdot t\_2, -0.027777777777777776\right)}{\mathsf{fma}\left(x \cdot x, t\_1, -0.16666666666666666\right)}\\
\mathbf{else}:\\
\;\;\;\;0.008333333333333333 \cdot \left(x \cdot \left(x \cdot t\_0\right)\right)\\
\end{array}
\end{array}
if x < 5Initial program 40.9%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6494.9
Simplified94.9%
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.9
Applied egg-rr94.9%
remove-double-divN/A
un-div-invN/A
remove-double-negN/A
neg-mul-1N/A
times-fracN/A
div-invN/A
metadata-evalN/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr94.9%
Taylor expanded in x around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-eval82.5
Simplified82.5%
if 5 < x < 9.99999999999999949e60Initial program 100.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6411.1
Simplified11.1%
Taylor expanded in x around inf
Simplified11.1%
Applied egg-rr57.5%
if 9.99999999999999949e60 < x Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
(FPCore (x)
:precision binary64
(let* ((t_0 (* x (fma (* x x) 0.008333333333333333 0.16666666666666666))))
(if (<= x 1e+61)
(/ (* x (fma (* (* x x) t_0) t_0 -1.0)) (fma x t_0 -1.0))
(* 0.008333333333333333 (* x (* x (* x (* x x))))))))
double code(double x) {
double t_0 = x * fma((x * x), 0.008333333333333333, 0.16666666666666666);
double tmp;
if (x <= 1e+61) {
tmp = (x * fma(((x * x) * t_0), t_0, -1.0)) / fma(x, t_0, -1.0);
} else {
tmp = 0.008333333333333333 * (x * (x * (x * (x * x))));
}
return tmp;
}
function code(x) t_0 = Float64(x * fma(Float64(x * x), 0.008333333333333333, 0.16666666666666666)) tmp = 0.0 if (x <= 1e+61) tmp = Float64(Float64(x * fma(Float64(Float64(x * x) * t_0), t_0, -1.0)) / fma(x, t_0, -1.0)); else tmp = Float64(0.008333333333333333 * Float64(x * Float64(x * Float64(x * Float64(x * x))))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(N[(x * x), $MachinePrecision] * 0.008333333333333333 + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1e+61], N[(N[(x * N[(N[(N[(x * x), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision] / N[(x * t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision], N[(0.008333333333333333 * N[(x * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := x \cdot \mathsf{fma}\left(x \cdot x, 0.008333333333333333, 0.16666666666666666\right)\\
\mathbf{if}\;x \leq 10^{+61}:\\
\;\;\;\;\frac{x \cdot \mathsf{fma}\left(\left(x \cdot x\right) \cdot t\_0, t\_0, -1\right)}{\mathsf{fma}\left(x, t\_0, -1\right)}\\
\mathbf{else}:\\
\;\;\;\;0.008333333333333333 \cdot \left(x \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right)\\
\end{array}
\end{array}
if x < 9.99999999999999949e60Initial program 46.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6487.6
Simplified87.6%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f6485.6
Simplified85.6%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr65.9%
if 9.99999999999999949e60 < x Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
Final simplification72.4%
(FPCore (x)
:precision binary64
(fma
(*
x
(fma
(* x x)
(fma (* x x) 0.0001984126984126984 0.008333333333333333)
0.16666666666666666))
(* x x)
x))
double code(double x) {
return fma((x * fma((x * x), fma((x * x), 0.0001984126984126984, 0.008333333333333333), 0.16666666666666666)), (x * x), x);
}
function code(x) return fma(Float64(x * fma(Float64(x * x), fma(Float64(x * x), 0.0001984126984126984, 0.008333333333333333), 0.16666666666666666)), Float64(x * x), x) end
code[x_] := N[(N[(x * N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * 0.0001984126984126984 + 0.008333333333333333), $MachinePrecision] + 0.16666666666666666), $MachinePrecision]), $MachinePrecision] * N[(x * x), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x \cdot \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x \cdot x, 0.0001984126984126984, 0.008333333333333333\right), 0.16666666666666666\right), x \cdot x, x\right)
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.0
Simplified90.0%
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.0
Applied egg-rr90.0%
(FPCore (x)
:precision binary64
(*
x
(fma
(* x x)
(fma
x
(* x (fma x (* x 0.0001984126984126984) 0.008333333333333333))
0.16666666666666666)
1.0)))
double code(double x) {
return x * fma((x * x), fma(x, (x * fma(x, (x * 0.0001984126984126984), 0.008333333333333333)), 0.16666666666666666), 1.0);
}
function code(x) return Float64(x * fma(Float64(x * x), fma(x, Float64(x * fma(x, Float64(x * 0.0001984126984126984), 0.008333333333333333)), 0.16666666666666666), 1.0)) end
code[x_] := N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(x * N[(x * 0.0001984126984126984), $MachinePrecision] + 0.008333333333333333), $MachinePrecision]), $MachinePrecision] + 0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, x \cdot 0.0001984126984126984, 0.008333333333333333\right), 0.16666666666666666\right), 1\right)
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.0
Simplified90.0%
(FPCore (x) :precision binary64 (fma (* (* x x) (* x (fma (* x x) 0.0001984126984126984 0.008333333333333333))) (* x x) x))
double code(double x) {
return fma(((x * x) * (x * fma((x * x), 0.0001984126984126984, 0.008333333333333333))), (x * x), x);
}
function code(x) return fma(Float64(Float64(x * x) * Float64(x * fma(Float64(x * x), 0.0001984126984126984, 0.008333333333333333))), Float64(x * x), x) end
code[x_] := N[(N[(N[(x * x), $MachinePrecision] * N[(x * N[(N[(x * x), $MachinePrecision] * 0.0001984126984126984 + 0.008333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x * x), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\left(x \cdot x\right) \cdot \left(x \cdot \mathsf{fma}\left(x \cdot x, 0.0001984126984126984, 0.008333333333333333\right)\right), x \cdot x, x\right)
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.0
Simplified90.0%
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.0
Applied egg-rr90.0%
Taylor expanded in x around inf
distribute-rgt-inN/A
+-commutativeN/A
associate-*l*N/A
associate-*l/N/A
*-lft-identityN/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
pow-sqrN/A
associate-/l*N/A
*-rgt-identityN/A
associate-*r/N/A
rgt-mult-inverseN/A
*-rgt-identityN/A
unpow2N/A
cube-multN/A
unpow3N/A
unpow2N/A
associate-*r*N/A
Simplified89.6%
(FPCore (x) :precision binary64 (* x (fma (* x x) (fma x (* x 0.008333333333333333) 0.16666666666666666) 1.0)))
double code(double x) {
return x * fma((x * x), fma(x, (x * 0.008333333333333333), 0.16666666666666666), 1.0);
}
function code(x) return Float64(x * fma(Float64(x * x), fma(x, Float64(x * 0.008333333333333333), 0.16666666666666666), 1.0)) end
code[x_] := N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.008333333333333333), $MachinePrecision] + 0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.008333333333333333, 0.16666666666666666\right), 1\right)
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.0
Simplified90.0%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f6488.4
Simplified88.4%
(FPCore (x) :precision binary64 (fma (* x x) (* (* x (* x x)) 0.008333333333333333) x))
double code(double x) {
return fma((x * x), ((x * (x * x)) * 0.008333333333333333), x);
}
function code(x) return fma(Float64(x * x), Float64(Float64(x * Float64(x * x)) * 0.008333333333333333), x) end
code[x_] := N[(N[(x * x), $MachinePrecision] * N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] * 0.008333333333333333), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x \cdot x, \left(x \cdot \left(x \cdot x\right)\right) \cdot 0.008333333333333333, x\right)
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6488.4
Simplified88.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6488.1
Simplified88.1%
Final simplification88.1%
(FPCore (x) :precision binary64 (* x (fma x (* x 0.16666666666666666) 1.0)))
double code(double x) {
return x * fma(x, (x * 0.16666666666666666), 1.0);
}
function code(x) return Float64(x * fma(x, Float64(x * 0.16666666666666666), 1.0)) end
code[x_] := N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(x, x \cdot 0.16666666666666666, 1\right)
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.0
Simplified90.0%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip-+N/A
/-lowering-/.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.0
Applied egg-rr90.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6481.3
Simplified81.3%
(FPCore (x) :precision binary64 x)
double code(double x) {
return x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = x
end function
public static double code(double x) {
return x;
}
def code(x): return x
function code(x) return x end
function tmp = code(x) tmp = x; end
code[x_] := x
\begin{array}{l}
\\
x
\end{array}
Initial program 56.4%
Taylor expanded in x around 0
Simplified50.5%
herbie shell --seed 2024203
(FPCore (x)
:name "Hyperbolic sine"
:precision binary64
(/ (- (exp x) (exp (- x))) 2.0))