
(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))
double code(double x) {
return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function
def code(x): return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
function code(x) return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))
double code(double x) {
return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function
def code(x): return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
function code(x) return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}
\end{array}
(FPCore (x) :precision binary64 (+ 1.0 (fabs (+ (fmod (exp x) (fma x (* x -0.25) 1.0)) -1.0))))
double code(double x) {
return 1.0 + fabs((fmod(exp(x), fma(x, (x * -0.25), 1.0)) + -1.0));
}
function code(x) return Float64(1.0 + abs(Float64(rem(exp(x), fma(x, Float64(x * -0.25), 1.0)) + -1.0))) end
code[x_] := N[(1.0 + N[Abs[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(x * N[(x * -0.25), $MachinePrecision] + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] + -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 + \left|\left(\left(e^{x}\right) \bmod \left(\mathsf{fma}\left(x, x \cdot -0.25, 1\right)\right)\right) + -1\right|
\end{array}
Initial program 6.3%
exp-neg6.3%
associate-*r/6.3%
*-rgt-identity6.3%
Simplified6.3%
expm1-log1p-u6.3%
expm1-udef6.3%
log1p-udef6.3%
add-exp-log6.3%
Applied egg-rr6.3%
associate--l+6.3%
Simplified6.3%
Taylor expanded in x around 0 5.8%
*-commutative5.8%
unpow25.8%
Simplified5.8%
add-sqr-sqrt2.0%
sqrt-unprod10.5%
pow210.5%
Applied egg-rr9.9%
unpow29.9%
rem-sqrt-square9.9%
fma-def9.9%
*-commutative9.9%
fma-def9.9%
Simplified9.9%
Taylor expanded in x around 0 9.9%
Final simplification9.9%
(FPCore (x) :precision binary64 (+ 1.0 (+ (/ (fmod (exp x) (+ 1.0 (* -0.25 (* x x)))) (exp x)) -1.0)))
double code(double x) {
return 1.0 + ((fmod(exp(x), (1.0 + (-0.25 * (x * x)))) / exp(x)) + -1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 + ((mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x)))) / exp(x)) + (-1.0d0))
end function
def code(x): return 1.0 + ((math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x)))) / math.exp(x)) + -1.0)
function code(x) return Float64(1.0 + Float64(Float64(rem(exp(x), Float64(1.0 + Float64(-0.25 * Float64(x * x)))) / exp(x)) + -1.0)) end
code[x_] := N[(1.0 + N[(N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(1.0 + N[(-0.25 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 + \left(\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)}{e^{x}} + -1\right)
\end{array}
Initial program 6.3%
exp-neg6.3%
associate-*r/6.3%
*-rgt-identity6.3%
Simplified6.3%
expm1-log1p-u6.3%
expm1-udef6.3%
log1p-udef6.3%
add-exp-log6.3%
Applied egg-rr6.3%
associate--l+6.3%
Simplified6.3%
Taylor expanded in x around 0 5.8%
*-commutative5.8%
unpow25.8%
Simplified5.8%
Final simplification5.8%
(FPCore (x) :precision binary64 (/ (fmod (exp x) (+ 1.0 (* -0.25 (* x x)))) (exp x)))
double code(double x) {
return fmod(exp(x), (1.0 + (-0.25 * (x * x)))) / exp(x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x)))) / exp(x)
end function
def code(x): return math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x)))) / math.exp(x)
function code(x) return Float64(rem(exp(x), Float64(1.0 + Float64(-0.25 * Float64(x * x)))) / exp(x)) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(1.0 + N[(-0.25 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)}{e^{x}}
\end{array}
Initial program 6.3%
exp-neg6.3%
associate-*r/6.3%
*-rgt-identity6.3%
Simplified6.3%
Taylor expanded in x around 0 5.8%
*-commutative5.8%
unpow25.8%
Simplified5.8%
Final simplification5.8%
(FPCore (x) :precision binary64 (/ 1.0 (/ (exp x) (fmod (exp x) 1.0))))
double code(double x) {
return 1.0 / (exp(x) / fmod(exp(x), 1.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 / (exp(x) / mod(exp(x), 1.0d0))
end function
def code(x): return 1.0 / (math.exp(x) / math.fmod(math.exp(x), 1.0))
function code(x) return Float64(1.0 / Float64(exp(x) / rem(exp(x), 1.0))) end
code[x_] := N[(1.0 / N[(N[Exp[x], $MachinePrecision] / N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{e^{x}}{\left(\left(e^{x}\right) \bmod 1\right)}}
\end{array}
Initial program 6.3%
exp-neg6.3%
associate-*r/6.3%
*-rgt-identity6.3%
Simplified6.3%
expm1-log1p-u6.3%
expm1-udef6.3%
log1p-udef6.3%
add-exp-log6.3%
Applied egg-rr6.3%
associate--l+6.3%
Simplified6.3%
associate-+r-6.3%
add-exp-log6.3%
log1p-udef6.3%
expm1-udef6.3%
expm1-log1p-u6.3%
clear-num6.3%
Applied egg-rr6.3%
Taylor expanded in x around 0 5.6%
Final simplification5.6%
(FPCore (x) :precision binary64 (/ (fmod (exp x) 1.0) (exp x)))
double code(double x) {
return fmod(exp(x), 1.0) / exp(x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), 1.0d0) / exp(x)
end function
def code(x): return math.fmod(math.exp(x), 1.0) / math.exp(x)
function code(x) return Float64(rem(exp(x), 1.0) / exp(x)) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}
\end{array}
Initial program 6.3%
exp-neg6.3%
associate-*r/6.3%
*-rgt-identity6.3%
Simplified6.3%
Taylor expanded in x around 0 5.6%
Final simplification5.6%
(FPCore (x) :precision binary64 (fmod (exp x) 1.0))
double code(double x) {
return fmod(exp(x), 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), 1.0d0)
end function
def code(x): return math.fmod(math.exp(x), 1.0)
function code(x) return rem(exp(x), 1.0) end
code[x_] := N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod 1\right)
\end{array}
Initial program 6.3%
exp-neg6.3%
associate-*r/6.3%
*-rgt-identity6.3%
Simplified6.3%
Taylor expanded in x around 0 5.6%
Taylor expanded in x around 0 4.8%
Final simplification4.8%
herbie shell --seed 2023274
(FPCore (x)
:name "expfmod (used to be hard to sample)"
:precision binary64
(* (fmod (exp x) (sqrt (cos x))) (exp (- x))))