
(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 16 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 57.9%
sinh-defN/A
sinh-lowering-sinh.f64100.0
Applied egg-rr100.0%
(FPCore (x) :precision binary64 (if (<= (- (exp x) (exp (- x))) 2e-5) (fma x (* x (* x 0.16666666666666666)) x) (* 0.0001984126984126984 (* x (* (* x x) (* x (* x (* x x))))))))
double code(double x) {
double tmp;
if ((exp(x) - exp(-x)) <= 2e-5) {
tmp = fma(x, (x * (x * 0.16666666666666666)), x);
} else {
tmp = 0.0001984126984126984 * (x * ((x * x) * (x * (x * (x * x)))));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(exp(x) - exp(Float64(-x))) <= 2e-5) tmp = fma(x, Float64(x * Float64(x * 0.16666666666666666)), x); else tmp = Float64(0.0001984126984126984 * Float64(x * Float64(Float64(x * 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], 2e-5], N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(0.0001984126984126984 * N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} - e^{-x} \leq 2 \cdot 10^{-5}:\\
\;\;\;\;\mathsf{fma}\left(x, x \cdot \left(x \cdot 0.16666666666666666\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;0.0001984126984126984 \cdot \left(x \cdot \left(\left(x \cdot x\right) \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right)\right)\\
\end{array}
\end{array}
if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 2.00000000000000016e-5Initial program 45.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-*.f6495.2
Simplified95.2%
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-*.f6495.2
Applied egg-rr95.2%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6489.9
Simplified89.9%
if 2.00000000000000016e-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-*.f6490.6
Simplified90.6%
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.6
Applied egg-rr90.6%
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
metadata-evalN/A
pow-plusN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/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-*.f6490.6
Simplified90.6%
(FPCore (x) :precision binary64 (if (<= (- (exp x) (exp (- x))) 2e-5) (fma x (* x (* x 0.16666666666666666)) x) (* (* x (* x x)) (fma (* x x) 0.008333333333333333 0.16666666666666666))))
double code(double x) {
double tmp;
if ((exp(x) - exp(-x)) <= 2e-5) {
tmp = fma(x, (x * (x * 0.16666666666666666)), x);
} 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))) <= 2e-5) tmp = fma(x, Float64(x * Float64(x * 0.16666666666666666)), x); else tmp = Float64(Float64(x * Float64(x * x)) * fma(Float64(x * x), 0.008333333333333333, 0.16666666666666666)); end return tmp end
code[x_] := If[LessEqual[N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2e-5], N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * 0.008333333333333333 + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} - e^{-x} \leq 2 \cdot 10^{-5}:\\
\;\;\;\;\mathsf{fma}\left(x, x \cdot \left(x \cdot 0.16666666666666666\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \left(x \cdot x\right)\right) \cdot \mathsf{fma}\left(x \cdot x, 0.008333333333333333, 0.16666666666666666\right)\\
\end{array}
\end{array}
if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 2.00000000000000016e-5Initial program 45.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-*.f6495.2
Simplified95.2%
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-*.f6495.2
Applied egg-rr95.2%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6489.9
Simplified89.9%
if 2.00000000000000016e-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-*.f6482.8
Simplified82.8%
Taylor expanded in x around inf
Simplified82.8%
Final simplification88.2%
(FPCore (x) :precision binary64 (if (<= (- (exp x) (exp (- x))) 2e-5) (fma x (* x (* x 0.16666666666666666)) x) (* 0.008333333333333333 (* x (* x (* x (* x x)))))))
double code(double x) {
double tmp;
if ((exp(x) - exp(-x)) <= 2e-5) {
tmp = fma(x, (x * (x * 0.16666666666666666)), x);
} else {
tmp = 0.008333333333333333 * (x * (x * (x * (x * x))));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(exp(x) - exp(Float64(-x))) <= 2e-5) tmp = fma(x, Float64(x * Float64(x * 0.16666666666666666)), x); 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], 2e-5], N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + x), $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 2 \cdot 10^{-5}:\\
\;\;\;\;\mathsf{fma}\left(x, x \cdot \left(x \cdot 0.16666666666666666\right), x\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))) < 2.00000000000000016e-5Initial program 45.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-*.f6495.2
Simplified95.2%
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-*.f6495.2
Applied egg-rr95.2%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6489.9
Simplified89.9%
if 2.00000000000000016e-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-*.f6482.8
Simplified82.8%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6482.8
Simplified82.8%
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6482.8
Applied egg-rr82.8%
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-*.f6482.8
Simplified82.8%
(FPCore (x)
:precision binary64
(let* ((t_0 (* (* x x) (* x x))))
(if (<= x 1.75e+31)
(fma
(*
x
(fma
(* x x)
(fma (* x x) 0.0001984126984126984 0.008333333333333333)
0.16666666666666666))
(* x x)
x)
(if (<= x 5e+61)
(/
(- (* t_0 (* 6.944444444444444e-5 (* (* x x) t_0))) (* x x))
(fma (* x x) (* x (* x (* x 0.008333333333333333))) (- x)))
(* 0.008333333333333333 (* x (* x (* x (* x x)))))))))
double code(double x) {
double t_0 = (x * x) * (x * x);
double tmp;
if (x <= 1.75e+31) {
tmp = fma((x * fma((x * x), fma((x * x), 0.0001984126984126984, 0.008333333333333333), 0.16666666666666666)), (x * x), x);
} else if (x <= 5e+61) {
tmp = ((t_0 * (6.944444444444444e-5 * ((x * x) * t_0))) - (x * x)) / fma((x * x), (x * (x * (x * 0.008333333333333333))), -x);
} else {
tmp = 0.008333333333333333 * (x * (x * (x * (x * x))));
}
return tmp;
}
function code(x) t_0 = Float64(Float64(x * x) * Float64(x * x)) tmp = 0.0 if (x <= 1.75e+31) tmp = fma(Float64(x * fma(Float64(x * x), fma(Float64(x * x), 0.0001984126984126984, 0.008333333333333333), 0.16666666666666666)), Float64(x * x), x); elseif (x <= 5e+61) tmp = Float64(Float64(Float64(t_0 * Float64(6.944444444444444e-5 * Float64(Float64(x * x) * t_0))) - Float64(x * x)) / fma(Float64(x * x), Float64(x * Float64(x * Float64(x * 0.008333333333333333))), Float64(-x))); 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[(N[(x * x), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.75e+31], 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], If[LessEqual[x, 5e+61], N[(N[(N[(t$95$0 * N[(6.944444444444444e-5 * N[(N[(x * x), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x * x), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(x * 0.008333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + (-x)), $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 := \left(x \cdot x\right) \cdot \left(x \cdot x\right)\\
\mathbf{if}\;x \leq 1.75 \cdot 10^{+31}:\\
\;\;\;\;\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)\\
\mathbf{elif}\;x \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\frac{t\_0 \cdot \left(6.944444444444444 \cdot 10^{-5} \cdot \left(\left(x \cdot x\right) \cdot t\_0\right)\right) - x \cdot x}{\mathsf{fma}\left(x \cdot x, x \cdot \left(x \cdot \left(x \cdot 0.008333333333333333\right)\right), -x\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 < 1.75e31Initial program 45.6%
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.3
Simplified94.3%
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.3
Applied egg-rr94.3%
if 1.75e31 < x < 5.00000000000000018e61Initial 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-*.f646.4
Simplified6.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f646.4
Simplified6.4%
flip-+N/A
/-lowering-/.f64N/A
Applied egg-rr100.0%
if 5.00000000000000018e61 < 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
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64100.0
Applied egg-rr100.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 (* x x))))
(if (<= x 5e+61)
(fma
(* t_0 (fma t_0 (* t_0 5.787037037037037e-7) 0.004629629629629629))
(/
1.0
(-
(fma (* x x) (* (* x x) 6.944444444444444e-5) 0.027777777777777776)
(* (* x x) 0.001388888888888889)))
x)
(* 0.008333333333333333 (* x (* x t_0))))))
double code(double x) {
double t_0 = x * (x * x);
double tmp;
if (x <= 5e+61) {
tmp = fma((t_0 * fma(t_0, (t_0 * 5.787037037037037e-7), 0.004629629629629629)), (1.0 / (fma((x * x), ((x * x) * 6.944444444444444e-5), 0.027777777777777776) - ((x * x) * 0.001388888888888889))), x);
} else {
tmp = 0.008333333333333333 * (x * (x * t_0));
}
return tmp;
}
function code(x) t_0 = Float64(x * Float64(x * x)) tmp = 0.0 if (x <= 5e+61) tmp = fma(Float64(t_0 * fma(t_0, Float64(t_0 * 5.787037037037037e-7), 0.004629629629629629)), Float64(1.0 / Float64(fma(Float64(x * x), Float64(Float64(x * x) * 6.944444444444444e-5), 0.027777777777777776) - Float64(Float64(x * x) * 0.001388888888888889))), x); 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]}, If[LessEqual[x, 5e+61], N[(N[(t$95$0 * N[(t$95$0 * N[(t$95$0 * 5.787037037037037e-7), $MachinePrecision] + 0.004629629629629629), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * 6.944444444444444e-5), $MachinePrecision] + 0.027777777777777776), $MachinePrecision] - N[(N[(x * x), $MachinePrecision] * 0.001388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $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)\\
\mathbf{if}\;x \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\mathsf{fma}\left(t\_0 \cdot \mathsf{fma}\left(t\_0, t\_0 \cdot 5.787037037037037 \cdot 10^{-7}, 0.004629629629629629\right), \frac{1}{\mathsf{fma}\left(x \cdot x, \left(x \cdot x\right) \cdot 6.944444444444444 \cdot 10^{-5}, 0.027777777777777776\right) - \left(x \cdot x\right) \cdot 0.001388888888888889}, x\right)\\
\mathbf{else}:\\
\;\;\;\;0.008333333333333333 \cdot \left(x \cdot \left(x \cdot t\_0\right)\right)\\
\end{array}
\end{array}
if x < 5.00000000000000018e61Initial program 48.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-*.f6489.1
Simplified89.1%
associate-*r*N/A
pow3N/A
flip3-+N/A
associate-*r/N/A
div-invN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr64.5%
if 5.00000000000000018e61 < 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
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64100.0
Applied egg-rr100.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
(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 57.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.2
Simplified94.2%
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.2
Applied egg-rr94.2%
(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 57.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.2
Simplified94.2%
(FPCore (x) :precision binary64 (* x (fma (* (* x x) (* x x)) (fma (* x x) 0.0001984126984126984 0.008333333333333333) 1.0)))
double code(double x) {
return x * fma(((x * x) * (x * x)), fma((x * x), 0.0001984126984126984, 0.008333333333333333), 1.0);
}
function code(x) return Float64(x * fma(Float64(Float64(x * x) * Float64(x * x)), fma(Float64(x * x), 0.0001984126984126984, 0.008333333333333333), 1.0)) end
code[x_] := N[(x * N[(N[(N[(x * x), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * 0.0001984126984126984 + 0.008333333333333333), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(\left(x \cdot x\right) \cdot \left(x \cdot x\right), \mathsf{fma}\left(x \cdot x, 0.0001984126984126984, 0.008333333333333333\right), 1\right)
\end{array}
Initial program 57.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.2
Simplified94.2%
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.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-*.f6494.2
Applied egg-rr94.2%
Taylor expanded in x around 0
Simplified93.9%
(FPCore (x) :precision binary64 (* x (fma (* (* x x) (* x (* x x))) (* x 0.0001984126984126984) 1.0)))
double code(double x) {
return x * fma(((x * x) * (x * (x * x))), (x * 0.0001984126984126984), 1.0);
}
function code(x) return Float64(x * fma(Float64(Float64(x * x) * Float64(x * Float64(x * x))), Float64(x * 0.0001984126984126984), 1.0)) end
code[x_] := N[(x * N[(N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x * 0.0001984126984126984), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(\left(x \cdot x\right) \cdot \left(x \cdot \left(x \cdot x\right)\right), x \cdot 0.0001984126984126984, 1\right)
\end{array}
Initial program 57.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.2
Simplified94.2%
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.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-*.f6494.2
Applied egg-rr94.2%
distribute-rgt-inN/A
associate-+l+N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr94.2%
Taylor expanded in x around 0
Simplified93.9%
(FPCore (x) :precision binary64 (fma x (* (* x x) (fma (* x x) 0.008333333333333333 0.16666666666666666)) x))
double code(double x) {
return fma(x, ((x * x) * fma((x * x), 0.008333333333333333, 0.16666666666666666)), x);
}
function code(x) return fma(x, Float64(Float64(x * x) * fma(Float64(x * x), 0.008333333333333333, 0.16666666666666666)), x) end
code[x_] := N[(x * N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * 0.008333333333333333 + 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, \left(x \cdot x\right) \cdot \mathsf{fma}\left(x \cdot x, 0.008333333333333333, 0.16666666666666666\right), x\right)
\end{array}
Initial program 57.9%
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-*.f6491.2
Simplified91.2%
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.2
Applied egg-rr91.2%
Final simplification91.2%
(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 57.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.2
Simplified94.2%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f6491.2
Simplified91.2%
(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 57.9%
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-*.f6491.2
Simplified91.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6490.9
Simplified90.9%
Final simplification90.9%
(FPCore (x) :precision binary64 (if (<= x 2.4) x (* (* x (* x x)) 0.16666666666666666)))
double code(double x) {
double tmp;
if (x <= 2.4) {
tmp = x;
} else {
tmp = (x * (x * x)) * 0.16666666666666666;
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if (x <= 2.4d0) then
tmp = x
else
tmp = (x * (x * x)) * 0.16666666666666666d0
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if (x <= 2.4) {
tmp = x;
} else {
tmp = (x * (x * x)) * 0.16666666666666666;
}
return tmp;
}
def code(x): tmp = 0 if x <= 2.4: tmp = x else: tmp = (x * (x * x)) * 0.16666666666666666 return tmp
function code(x) tmp = 0.0 if (x <= 2.4) tmp = x; else tmp = Float64(Float64(x * Float64(x * x)) * 0.16666666666666666); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= 2.4) tmp = x; else tmp = (x * (x * x)) * 0.16666666666666666; end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, 2.4], x, N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2.4:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \left(x \cdot x\right)\right) \cdot 0.16666666666666666\\
\end{array}
\end{array}
if x < 2.39999999999999991Initial program 45.0%
Taylor expanded in x around 0
Simplified61.1%
if 2.39999999999999991 < 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-*.f6468.5
Simplified68.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6468.5
Simplified68.5%
Final simplification62.8%
(FPCore (x) :precision binary64 (fma x (* x (* x 0.16666666666666666)) x))
double code(double x) {
return fma(x, (x * (x * 0.16666666666666666)), x);
}
function code(x) return fma(x, Float64(x * Float64(x * 0.16666666666666666)), x) end
code[x_] := N[(x * N[(x * N[(x * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, x \cdot \left(x \cdot 0.16666666666666666\right), x\right)
\end{array}
Initial program 57.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.2
Simplified94.2%
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.2
Applied egg-rr94.2%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6484.9
Simplified84.9%
(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 57.9%
Taylor expanded in x around 0
Simplified48.1%
herbie shell --seed 2024198
(FPCore (x)
:name "Hyperbolic sine"
:precision binary64
(/ (- (exp x) (exp (- x))) 2.0))