
(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 10 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
(if (<= x -1.55e-162)
(*
(fmod
(exp x)
(*
(* x x)
(+
(sqrt 0.041666666666666664)
(/ -0.25 (* (* x x) (sqrt 0.041666666666666664))))))
(fma x (fma x (fma x -0.16666666666666666 0.5) -1.0) 1.0))
(fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -1.55e-162) {
tmp = fmod(exp(x), ((x * x) * (sqrt(0.041666666666666664) + (-0.25 / ((x * x) * sqrt(0.041666666666666664)))))) * fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0);
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -1.55e-162) tmp = Float64(rem(exp(x), Float64(Float64(x * x) * Float64(sqrt(0.041666666666666664) + Float64(-0.25 / Float64(Float64(x * x) * sqrt(0.041666666666666664)))))) * fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0)); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -1.55e-162], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(N[(x * x), $MachinePrecision] * N[(N[Sqrt[0.041666666666666664], $MachinePrecision] + N[(-0.25 / N[(N[(x * x), $MachinePrecision] * N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(x * N[(x * N[(x * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.55 \cdot 10^{-162}:\\
\;\;\;\;\left(\left(e^{x}\right) \bmod \left(\left(x \cdot x\right) \cdot \left(\sqrt{0.041666666666666664} + \frac{-0.25}{\left(x \cdot x\right) \cdot \sqrt{0.041666666666666664}}\right)\right)\right) \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.16666666666666666, 0.5\right), -1\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -1.5499999999999999e-162Initial program 17.8%
Taylor expanded in x around 0
Simplified16.4%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6416.4
Simplified16.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
associate-*r/N/A
metadata-evalN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6498.5
Simplified98.5%
if -1.5499999999999999e-162 < x Initial program 6.0%
Taylor expanded in x around 0
Simplified4.5%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.4
Simplified4.4%
Taylor expanded in x around 0
+-lowering-+.f6432.4
Simplified32.4%
Taylor expanded in x around inf
Simplified71.8%
(FPCore (x)
:precision binary64
(if (<= x -1.55e-162)
(*
(fma x (fma x (fma x -0.16666666666666666 0.5) -1.0) 1.0)
(fmod
(fma x (fma x (fma x 0.16666666666666666 0.5) 1.0) 1.0)
(*
(* x x)
(-
(sqrt 0.041666666666666664)
(/ 0.25 (* x (* x (sqrt 0.041666666666666664))))))))
(fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -1.55e-162) {
tmp = fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0) * fmod(fma(x, fma(x, fma(x, 0.16666666666666666, 0.5), 1.0), 1.0), ((x * x) * (sqrt(0.041666666666666664) - (0.25 / (x * (x * sqrt(0.041666666666666664)))))));
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -1.55e-162) tmp = Float64(fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0) * rem(fma(x, fma(x, fma(x, 0.16666666666666666, 0.5), 1.0), 1.0), Float64(Float64(x * x) * Float64(sqrt(0.041666666666666664) - Float64(0.25 / Float64(x * Float64(x * sqrt(0.041666666666666664)))))))); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -1.55e-162], N[(N[(x * N[(x * N[(x * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision] * N[With[{TMP1 = N[(x * N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision], TMP2 = N[(N[(x * x), $MachinePrecision] * N[(N[Sqrt[0.041666666666666664], $MachinePrecision] - N[(0.25 / N[(x * N[(x * N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.55 \cdot 10^{-162}:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.16666666666666666, 0.5\right), -1\right), 1\right) \cdot \left(\left(\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right), 1\right)\right) \bmod \left(\left(x \cdot x\right) \cdot \left(\sqrt{0.041666666666666664} - \frac{0.25}{x \cdot \left(x \cdot \sqrt{0.041666666666666664}\right)}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -1.5499999999999999e-162Initial program 17.8%
Taylor expanded in x around 0
Simplified16.4%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6416.4
Simplified16.4%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6416.2
Simplified16.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6498.3
Simplified98.3%
if -1.5499999999999999e-162 < x Initial program 6.0%
Taylor expanded in x around 0
Simplified4.5%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.4
Simplified4.4%
Taylor expanded in x around 0
+-lowering-+.f6432.4
Simplified32.4%
Taylor expanded in x around inf
Simplified71.8%
Final simplification77.9%
(FPCore (x)
:precision binary64
(if (<= x -4e-310)
(*
(fma x (fma x (fma x -0.16666666666666666 0.5) -1.0) 1.0)
(fmod
(fma x (fma x 0.5 1.0) 1.0)
(sqrt (fma (* x x) (fma x (* x 0.041666666666666664) -0.5) 1.0))))
(fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -4e-310) {
tmp = fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0) * fmod(fma(x, fma(x, 0.5, 1.0), 1.0), sqrt(fma((x * x), fma(x, (x * 0.041666666666666664), -0.5), 1.0)));
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -4e-310) tmp = Float64(fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0) * rem(fma(x, fma(x, 0.5, 1.0), 1.0), sqrt(fma(Float64(x * x), fma(x, Float64(x * 0.041666666666666664), -0.5), 1.0)))); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -4e-310], N[(N[(x * N[(x * N[(x * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision] * N[With[{TMP1 = N[(x * N[(x * 0.5 + 1.0), $MachinePrecision] + 1.0), $MachinePrecision], TMP2 = N[Sqrt[N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.16666666666666666, 0.5\right), -1\right), 1\right) \cdot \left(\left(\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.5, 1\right), 1\right)\right) \bmod \left(\sqrt{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.041666666666666664, -0.5\right), 1\right)}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -3.999999999999988e-310Initial program 10.9%
Taylor expanded in x around 0
Simplified10.2%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6410.2
Simplified10.2%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6410.2
Simplified10.2%
if -3.999999999999988e-310 < x Initial program 7.0%
Taylor expanded in x around 0
Simplified4.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.8
Simplified4.8%
Taylor expanded in x around 0
+-lowering-+.f6442.9
Simplified42.9%
Taylor expanded in x around inf
Simplified96.6%
Final simplification59.1%
(FPCore (x)
:precision binary64
(if (<= x -4e-310)
(*
(fma x (fma x (fma x -0.16666666666666666 0.5) -1.0) 1.0)
(fmod (fma x (fma x (fma x 0.16666666666666666 0.5) 1.0) 1.0) 1.0))
(fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -4e-310) {
tmp = fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0) * fmod(fma(x, fma(x, fma(x, 0.16666666666666666, 0.5), 1.0), 1.0), 1.0);
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -4e-310) tmp = Float64(fma(x, fma(x, fma(x, -0.16666666666666666, 0.5), -1.0), 1.0) * rem(fma(x, fma(x, fma(x, 0.16666666666666666, 0.5), 1.0), 1.0), 1.0)); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -4e-310], N[(N[(x * N[(x * N[(x * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision] * N[With[{TMP1 = N[(x * N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.16666666666666666, 0.5\right), -1\right), 1\right) \cdot \left(\left(\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right), 1\right)\right) \bmod 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -3.999999999999988e-310Initial program 10.9%
Taylor expanded in x around 0
Simplified10.2%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6410.2
Simplified10.2%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6410.1
Simplified10.1%
Taylor expanded in x around 0
Simplified10.1%
if -3.999999999999988e-310 < x Initial program 7.0%
Taylor expanded in x around 0
Simplified4.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.8
Simplified4.8%
Taylor expanded in x around 0
+-lowering-+.f6442.9
Simplified42.9%
Taylor expanded in x around inf
Simplified96.6%
Final simplification59.1%
(FPCore (x) :precision binary64 (if (<= x -4e-310) (* (fmod (fma x (fma x 0.5 1.0) 1.0) (fma x (* x -0.25) 1.0)) (- 1.0 x)) (fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -4e-310) {
tmp = fmod(fma(x, fma(x, 0.5, 1.0), 1.0), fma(x, (x * -0.25), 1.0)) * (1.0 - x);
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -4e-310) tmp = Float64(rem(fma(x, fma(x, 0.5, 1.0), 1.0), fma(x, Float64(x * -0.25), 1.0)) * Float64(1.0 - x)); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -4e-310], N[(N[With[{TMP1 = N[(x * N[(x * 0.5 + 1.0), $MachinePrecision] + 1.0), $MachinePrecision], TMP2 = N[(x * N[(x * -0.25), $MachinePrecision] + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.5, 1\right), 1\right)\right) \bmod \left(\mathsf{fma}\left(x, x \cdot -0.25, 1\right)\right)\right) \cdot \left(1 - x\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -3.999999999999988e-310Initial program 10.9%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6410.9
Simplified10.9%
Taylor expanded in x around 0
neg-mul-1N/A
unsub-negN/A
--lowering--.f6410.0
Simplified10.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6410.0
Simplified10.0%
if -3.999999999999988e-310 < x Initial program 7.0%
Taylor expanded in x around 0
Simplified4.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.8
Simplified4.8%
Taylor expanded in x around 0
+-lowering-+.f6442.9
Simplified42.9%
Taylor expanded in x around inf
Simplified96.6%
(FPCore (x) :precision binary64 (if (<= x -4e-310) (* (- 1.0 x) (fmod (+ x 1.0) (fma x (* x -0.25) 1.0))) (fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -4e-310) {
tmp = (1.0 - x) * fmod((x + 1.0), fma(x, (x * -0.25), 1.0));
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -4e-310) tmp = Float64(Float64(1.0 - x) * rem(Float64(x + 1.0), fma(x, Float64(x * -0.25), 1.0))); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -4e-310], N[(N[(1.0 - x), $MachinePrecision] * N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = N[(x * N[(x * -0.25), $MachinePrecision] + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(1 - x\right) \cdot \left(\left(x + 1\right) \bmod \left(\mathsf{fma}\left(x, x \cdot -0.25, 1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -3.999999999999988e-310Initial program 10.9%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6410.9
Simplified10.9%
Taylor expanded in x around 0
neg-mul-1N/A
unsub-negN/A
--lowering--.f6410.0
Simplified10.0%
Taylor expanded in x around 0
+-lowering-+.f649.9
Simplified9.9%
if -3.999999999999988e-310 < x Initial program 7.0%
Taylor expanded in x around 0
Simplified4.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.8
Simplified4.8%
Taylor expanded in x around 0
+-lowering-+.f6442.9
Simplified42.9%
Taylor expanded in x around inf
Simplified96.6%
Final simplification59.0%
(FPCore (x) :precision binary64 (if (<= x -4e-310) (fmod (fma x (fma x 0.5 1.0) 1.0) 1.0) (fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -4e-310) {
tmp = fmod(fma(x, fma(x, 0.5, 1.0), 1.0), 1.0);
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -4e-310) tmp = rem(fma(x, fma(x, 0.5, 1.0), 1.0), 1.0); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -4e-310], N[With[{TMP1 = N[(x * N[(x * 0.5 + 1.0), $MachinePrecision] + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.5, 1\right), 1\right)\right) \bmod 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -3.999999999999988e-310Initial program 10.9%
Taylor expanded in x around 0
Simplified10.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f648.8
Simplified8.8%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f648.9
Simplified8.9%
if -3.999999999999988e-310 < x Initial program 7.0%
Taylor expanded in x around 0
Simplified4.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.8
Simplified4.8%
Taylor expanded in x around 0
+-lowering-+.f6442.9
Simplified42.9%
Taylor expanded in x around inf
Simplified96.6%
(FPCore (x) :precision binary64 (if (<= x -4e-310) (fmod (+ x 1.0) 1.0) (fmod x 1.0)))
double code(double x) {
double tmp;
if (x <= -4e-310) {
tmp = fmod((x + 1.0), 1.0);
} else {
tmp = fmod(x, 1.0);
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if (x <= (-4d-310)) then
tmp = mod((x + 1.0d0), 1.0d0)
else
tmp = mod(x, 1.0d0)
end if
code = tmp
end function
def code(x): tmp = 0 if x <= -4e-310: tmp = math.fmod((x + 1.0), 1.0) else: tmp = math.fmod(x, 1.0) return tmp
function code(x) tmp = 0.0 if (x <= -4e-310) tmp = rem(Float64(x + 1.0), 1.0); else tmp = rem(x, 1.0); end return tmp end
code[x_] := If[LessEqual[x, -4e-310], N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\left(\left(x + 1\right) \bmod 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \bmod 1\right)\\
\end{array}
\end{array}
if x < -3.999999999999988e-310Initial program 10.9%
Taylor expanded in x around 0
Simplified10.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f648.8
Simplified8.8%
Taylor expanded in x around 0
+-lowering-+.f648.7
Simplified8.7%
if -3.999999999999988e-310 < x Initial program 7.0%
Taylor expanded in x around 0
Simplified4.9%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f644.8
Simplified4.8%
Taylor expanded in x around 0
+-lowering-+.f6442.9
Simplified42.9%
Taylor expanded in x around inf
Simplified96.6%
Final simplification58.5%
(FPCore (x) :precision binary64 (fmod x 1.0))
double code(double x) {
return fmod(x, 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(x, 1.0d0)
end function
def code(x): return math.fmod(x, 1.0)
function code(x) return rem(x, 1.0) end
code[x_] := N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]
\begin{array}{l}
\\
\left(x \bmod 1\right)
\end{array}
Initial program 8.7%
Taylor expanded in x around 0
Simplified7.5%
Taylor expanded in x around 0
fmod-lowering-fmod.f64N/A
exp-lowering-exp.f646.6
Simplified6.6%
Taylor expanded in x around 0
+-lowering-+.f6428.1
Simplified28.1%
Taylor expanded in x around inf
Simplified55.7%
(FPCore (x) :precision binary64 (fmod 1.0 1.0))
double code(double x) {
return fmod(1.0, 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(1.0d0, 1.0d0)
end function
def code(x): return math.fmod(1.0, 1.0)
function code(x) return rem(1.0, 1.0) end
code[x_] := N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]
\begin{array}{l}
\\
\left(1 \bmod 1\right)
\end{array}
Initial program 8.7%
Taylor expanded in x around 0
Simplified25.4%
Taylor expanded in x around 0
Simplified25.1%
Taylor expanded in x around 0
fmod-lowering-fmod.f6425.1
Simplified25.1%
herbie shell --seed 2024199
(FPCore (x)
:name "expfmod (used to be hard to sample)"
:precision binary64
(* (fmod (exp x) (sqrt (cos x))) (exp (- x))))