
(FPCore (x y) :precision binary64 (* x (exp (* y y))))
double code(double x, double y) {
return x * exp((y * y));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * exp((y * y))
end function
public static double code(double x, double y) {
return x * Math.exp((y * y));
}
def code(x, y): return x * math.exp((y * y))
function code(x, y) return Float64(x * exp(Float64(y * y))) end
function tmp = code(x, y) tmp = x * exp((y * y)); end
code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot e^{y \cdot y}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (* x (exp (* y y))))
double code(double x, double y) {
return x * exp((y * y));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * exp((y * y))
end function
public static double code(double x, double y) {
return x * Math.exp((y * y));
}
def code(x, y): return x * math.exp((y * y))
function code(x, y) return Float64(x * exp(Float64(y * y))) end
function tmp = code(x, y) tmp = x * exp((y * y)); end
code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot e^{y \cdot y}
\end{array}
(FPCore (x y) :precision binary64 (* x (exp (* y y))))
double code(double x, double y) {
return x * exp((y * y));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * exp((y * y))
end function
public static double code(double x, double y) {
return x * Math.exp((y * y));
}
def code(x, y): return x * math.exp((y * y))
function code(x, y) return Float64(x * exp(Float64(y * y))) end
function tmp = code(x, y) tmp = x * exp((y * y)); end
code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot e^{y \cdot y}
\end{array}
Initial program 100.0%
(FPCore (x y)
:precision binary64
(let* ((t_0 (fma (* y y) 0.16666666666666666 0.5)))
(if (<= (* y y) 4e+141)
(*
x
(fma
(* (* y y) (fma (* y y) (* (* y y) (* t_0 t_0)) -1.0))
(/ 1.0 (fma (* y y) t_0 -1.0))
1.0))
(* x (* y (* 0.5 (* y (* y y))))))))
double code(double x, double y) {
double t_0 = fma((y * y), 0.16666666666666666, 0.5);
double tmp;
if ((y * y) <= 4e+141) {
tmp = x * fma(((y * y) * fma((y * y), ((y * y) * (t_0 * t_0)), -1.0)), (1.0 / fma((y * y), t_0, -1.0)), 1.0);
} else {
tmp = x * (y * (0.5 * (y * (y * y))));
}
return tmp;
}
function code(x, y) t_0 = fma(Float64(y * y), 0.16666666666666666, 0.5) tmp = 0.0 if (Float64(y * y) <= 4e+141) tmp = Float64(x * fma(Float64(Float64(y * y) * fma(Float64(y * y), Float64(Float64(y * y) * Float64(t_0 * t_0)), -1.0)), Float64(1.0 / fma(Float64(y * y), t_0, -1.0)), 1.0)); else tmp = Float64(x * Float64(y * Float64(0.5 * Float64(y * Float64(y * y))))); end return tmp end
code[x_, y_] := Block[{t$95$0 = N[(N[(y * y), $MachinePrecision] * 0.16666666666666666 + 0.5), $MachinePrecision]}, If[LessEqual[N[(y * y), $MachinePrecision], 4e+141], N[(x * N[(N[(N[(y * y), $MachinePrecision] * N[(N[(y * y), $MachinePrecision] * N[(N[(y * y), $MachinePrecision] * N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(y * y), $MachinePrecision] * t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(0.5 * N[(y * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(y \cdot y, 0.16666666666666666, 0.5\right)\\
\mathbf{if}\;y \cdot y \leq 4 \cdot 10^{+141}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(\left(y \cdot y\right) \cdot \mathsf{fma}\left(y \cdot y, \left(y \cdot y\right) \cdot \left(t\_0 \cdot t\_0\right), -1\right), \frac{1}{\mathsf{fma}\left(y \cdot y, t\_0, -1\right)}, 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot \left(0.5 \cdot \left(y \cdot \left(y \cdot y\right)\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 y y) < 4.00000000000000007e141Initial program 99.9%
Taylor expanded in y around 0
Simplified89.2%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
div-invN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr92.9%
if 4.00000000000000007e141 < (*.f64 y y) Initial program 100.0%
Taylor expanded in y around 0
distribute-rgt-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
distribute-lft-outN/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified100.0%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
unpow3N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
Final simplification95.6%
(FPCore (x y) :precision binary64 (* x (exp y)))
double code(double x, double y) {
return x * exp(y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * exp(y)
end function
public static double code(double x, double y) {
return x * Math.exp(y);
}
def code(x, y): return x * math.exp(y)
function code(x, y) return Float64(x * exp(y)) end
function tmp = code(x, y) tmp = x * exp(y); end
code[x_, y_] := N[(x * N[Exp[y], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot e^{y}
\end{array}
Initial program 100.0%
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
+-inversesN/A
difference-of-squaresN/A
+-inversesN/A
flip-+N/A
count-2N/A
associate-*r/N/A
Applied egg-rr75.8%
(FPCore (x y) :precision binary64 (* x (fma (* y y) (fma y (* y (* (* y y) (/ -1.0 (+ -6.0 (/ 18.0 (* y y)))))) 1.0) 1.0)))
double code(double x, double y) {
return x * fma((y * y), fma(y, (y * ((y * y) * (-1.0 / (-6.0 + (18.0 / (y * y)))))), 1.0), 1.0);
}
function code(x, y) return Float64(x * fma(Float64(y * y), fma(y, Float64(y * Float64(Float64(y * y) * Float64(-1.0 / Float64(-6.0 + Float64(18.0 / Float64(y * y)))))), 1.0), 1.0)) end
code[x_, y_] := N[(x * N[(N[(y * y), $MachinePrecision] * N[(y * N[(y * N[(N[(y * y), $MachinePrecision] * N[(-1.0 / N[(-6.0 + N[(18.0 / N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(y \cdot y, \mathsf{fma}\left(y, y \cdot \left(\left(y \cdot y\right) \cdot \frac{-1}{-6 + \frac{18}{y \cdot y}}\right), 1\right), 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
Simplified93.4%
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-*.f6493.4
Applied egg-rr93.4%
Taylor expanded in y around inf
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
metadata-evalN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6493.4
Simplified93.4%
associate-/r/N/A
*-lowering-*.f64N/A
frac-2negN/A
metadata-evalN/A
/-lowering-/.f64N/A
distribute-neg-inN/A
frac-2negN/A
distribute-frac-neg2N/A
remove-double-negN/A
+-lowering-+.f64N/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
*-lowering-*.f6493.4
Applied egg-rr93.4%
Final simplification93.4%
(FPCore (x y) :precision binary64 (* x (fma (* y y) (fma y (* y (fma y (* y 0.16666666666666666) 0.5)) 1.0) 1.0)))
double code(double x, double y) {
return x * fma((y * y), fma(y, (y * fma(y, (y * 0.16666666666666666), 0.5)), 1.0), 1.0);
}
function code(x, y) return Float64(x * fma(Float64(y * y), fma(y, Float64(y * fma(y, Float64(y * 0.16666666666666666), 0.5)), 1.0), 1.0)) end
code[x_, y_] := N[(x * N[(N[(y * y), $MachinePrecision] * N[(y * N[(y * N[(y * N[(y * 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(y \cdot y, \mathsf{fma}\left(y, y \cdot \mathsf{fma}\left(y, y \cdot 0.16666666666666666, 0.5\right), 1\right), 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
Simplified93.4%
(FPCore (x y) :precision binary64 (if (<= (* y y) 5e-8) (* x (fma y y 1.0)) (* x (* y (* y (fma y (* y 0.5) 1.0))))))
double code(double x, double y) {
double tmp;
if ((y * y) <= 5e-8) {
tmp = x * fma(y, y, 1.0);
} else {
tmp = x * (y * (y * fma(y, (y * 0.5), 1.0)));
}
return tmp;
}
function code(x, y) tmp = 0.0 if (Float64(y * y) <= 5e-8) tmp = Float64(x * fma(y, y, 1.0)); else tmp = Float64(x * Float64(y * Float64(y * fma(y, Float64(y * 0.5), 1.0)))); end return tmp end
code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e-8], N[(x * N[(y * y + 1.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(y * N[(y * N[(y * 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-8}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(y, y, 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot \left(y \cdot \mathsf{fma}\left(y, y \cdot 0.5, 1\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 y y) < 4.9999999999999998e-8Initial program 100.0%
Taylor expanded in y around 0
*-rgt-identityN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64100.0
Simplified100.0%
if 4.9999999999999998e-8 < (*.f64 y y) Initial program 99.9%
Taylor expanded in y around 0
distribute-rgt-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
distribute-lft-outN/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified84.1%
Taylor expanded in y around inf
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
unpow2N/A
+-commutativeN/A
distribute-rgt-inN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6484.1
Simplified84.1%
(FPCore (x y) :precision binary64 (* x (fma (* y y) (fma y (* y (* (* y y) 0.16666666666666666)) 1.0) 1.0)))
double code(double x, double y) {
return x * fma((y * y), fma(y, (y * ((y * y) * 0.16666666666666666)), 1.0), 1.0);
}
function code(x, y) return Float64(x * fma(Float64(y * y), fma(y, Float64(y * Float64(Float64(y * y) * 0.16666666666666666)), 1.0), 1.0)) end
code[x_, y_] := N[(x * N[(N[(y * y), $MachinePrecision] * N[(y * N[(y * N[(N[(y * y), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(y \cdot y, \mathsf{fma}\left(y, y \cdot \left(\left(y \cdot y\right) \cdot 0.16666666666666666\right), 1\right), 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
Simplified93.4%
Taylor expanded in y around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6493.4
Simplified93.4%
Final simplification93.4%
(FPCore (x y) :precision binary64 (if (<= (* y y) 5e-8) (* x (fma y y 1.0)) (* x (* y (* 0.5 (* y (* y y)))))))
double code(double x, double y) {
double tmp;
if ((y * y) <= 5e-8) {
tmp = x * fma(y, y, 1.0);
} else {
tmp = x * (y * (0.5 * (y * (y * y))));
}
return tmp;
}
function code(x, y) tmp = 0.0 if (Float64(y * y) <= 5e-8) tmp = Float64(x * fma(y, y, 1.0)); else tmp = Float64(x * Float64(y * Float64(0.5 * Float64(y * Float64(y * y))))); end return tmp end
code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e-8], N[(x * N[(y * y + 1.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(0.5 * N[(y * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-8}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(y, y, 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot \left(0.5 \cdot \left(y \cdot \left(y \cdot y\right)\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 y y) < 4.9999999999999998e-8Initial program 100.0%
Taylor expanded in y around 0
*-rgt-identityN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64100.0
Simplified100.0%
if 4.9999999999999998e-8 < (*.f64 y y) Initial program 99.9%
Taylor expanded in y around 0
distribute-rgt-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
distribute-lft-outN/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified84.1%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
unpow3N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6484.0
Simplified84.0%
(FPCore (x y) :precision binary64 (* x (fma (* y y) (fma y (* y 0.5) 1.0) 1.0)))
double code(double x, double y) {
return x * fma((y * y), fma(y, (y * 0.5), 1.0), 1.0);
}
function code(x, y) return Float64(x * fma(Float64(y * y), fma(y, Float64(y * 0.5), 1.0), 1.0)) end
code[x_, y_] := N[(x * N[(N[(y * y), $MachinePrecision] * N[(y * N[(y * 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(y \cdot y, \mathsf{fma}\left(y, y \cdot 0.5, 1\right), 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
distribute-rgt-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
distribute-lft-outN/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified92.2%
(FPCore (x y) :precision binary64 (* x (fma (* y y) (* y (* y 0.5)) 1.0)))
double code(double x, double y) {
return x * fma((y * y), (y * (y * 0.5)), 1.0);
}
function code(x, y) return Float64(x * fma(Float64(y * y), Float64(y * Float64(y * 0.5)), 1.0)) end
code[x_, y_] := N[(x * N[(N[(y * y), $MachinePrecision] * N[(y * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(y \cdot y, y \cdot \left(y \cdot 0.5\right), 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
distribute-rgt-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
distribute-lft-outN/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified92.2%
Taylor expanded in y around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6491.9
Simplified91.9%
(FPCore (x y) :precision binary64 (fma x (* y (fma y (fma y 0.16666666666666666 0.5) 1.0)) x))
double code(double x, double y) {
return fma(x, (y * fma(y, fma(y, 0.16666666666666666, 0.5), 1.0)), x);
}
function code(x, y) return fma(x, Float64(y * fma(y, fma(y, 0.16666666666666666, 0.5), 1.0)), x) end
code[x_, y_] := N[(x * N[(y * N[(y * N[(y * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, y \cdot \mathsf{fma}\left(y, \mathsf{fma}\left(y, 0.16666666666666666, 0.5\right), 1\right), x\right)
\end{array}
Initial program 100.0%
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
+-inversesN/A
difference-of-squaresN/A
+-inversesN/A
flip-+N/A
count-2N/A
associate-*r/N/A
Applied egg-rr75.8%
Taylor expanded in y around 0
Simplified71.3%
(FPCore (x y) :precision binary64 (if (<= (* y y) 5e-8) x (* x (* y y))))
double code(double x, double y) {
double tmp;
if ((y * y) <= 5e-8) {
tmp = x;
} else {
tmp = x * (y * y);
}
return tmp;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if ((y * y) <= 5d-8) then
tmp = x
else
tmp = x * (y * y)
end if
code = tmp
end function
public static double code(double x, double y) {
double tmp;
if ((y * y) <= 5e-8) {
tmp = x;
} else {
tmp = x * (y * y);
}
return tmp;
}
def code(x, y): tmp = 0 if (y * y) <= 5e-8: tmp = x else: tmp = x * (y * y) return tmp
function code(x, y) tmp = 0.0 if (Float64(y * y) <= 5e-8) tmp = x; else tmp = Float64(x * Float64(y * y)); end return tmp end
function tmp_2 = code(x, y) tmp = 0.0; if ((y * y) <= 5e-8) tmp = x; else tmp = x * (y * y); end tmp_2 = tmp; end
code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e-8], x, N[(x * N[(y * y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-8}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot y\right)\\
\end{array}
\end{array}
if (*.f64 y y) < 4.9999999999999998e-8Initial program 100.0%
Taylor expanded in y around 0
Simplified99.3%
if 4.9999999999999998e-8 < (*.f64 y y) Initial program 99.9%
Taylor expanded in y around 0
*-rgt-identityN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f6469.5
Simplified69.5%
Taylor expanded in y around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.5
Simplified69.5%
(FPCore (x y) :precision binary64 (if (<= (* y y) 5e-8) x (* x y)))
double code(double x, double y) {
double tmp;
if ((y * y) <= 5e-8) {
tmp = x;
} else {
tmp = x * y;
}
return tmp;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if ((y * y) <= 5d-8) then
tmp = x
else
tmp = x * y
end if
code = tmp
end function
public static double code(double x, double y) {
double tmp;
if ((y * y) <= 5e-8) {
tmp = x;
} else {
tmp = x * y;
}
return tmp;
}
def code(x, y): tmp = 0 if (y * y) <= 5e-8: tmp = x else: tmp = x * y return tmp
function code(x, y) tmp = 0.0 if (Float64(y * y) <= 5e-8) tmp = x; else tmp = Float64(x * y); end return tmp end
function tmp_2 = code(x, y) tmp = 0.0; if ((y * y) <= 5e-8) tmp = x; else tmp = x * y; end tmp_2 = tmp; end
code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e-8], x, N[(x * y), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-8}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;x \cdot y\\
\end{array}
\end{array}
if (*.f64 y y) < 4.9999999999999998e-8Initial program 100.0%
Taylor expanded in y around 0
Simplified99.3%
if 4.9999999999999998e-8 < (*.f64 y y) Initial program 99.9%
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
+-inversesN/A
difference-of-squaresN/A
+-inversesN/A
flip-+N/A
count-2N/A
associate-*r/N/A
Applied egg-rr52.1%
Taylor expanded in y around 0
+-commutativeN/A
accelerator-lowering-fma.f6416.5
Simplified16.5%
Taylor expanded in y around inf
*-commutativeN/A
*-lowering-*.f6416.5
Simplified16.5%
Final simplification58.9%
(FPCore (x y) :precision binary64 (* x (fma y y 1.0)))
double code(double x, double y) {
return x * fma(y, y, 1.0);
}
function code(x, y) return Float64(x * fma(y, y, 1.0)) end
code[x_, y_] := N[(x * N[(y * y + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(y, y, 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
*-rgt-identityN/A
distribute-lft-inN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f6485.1
Simplified85.1%
(FPCore (x y) :precision binary64 (* x (+ y 1.0)))
double code(double x, double y) {
return x * (y + 1.0);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * (y + 1.0d0)
end function
public static double code(double x, double y) {
return x * (y + 1.0);
}
def code(x, y): return x * (y + 1.0)
function code(x, y) return Float64(x * Float64(y + 1.0)) end
function tmp = code(x, y) tmp = x * (y + 1.0); end
code[x_, y_] := N[(x * N[(y + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \left(y + 1\right)
\end{array}
Initial program 100.0%
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
+-inversesN/A
difference-of-squaresN/A
+-inversesN/A
flip-+N/A
count-2N/A
associate-*r/N/A
Applied egg-rr75.8%
Taylor expanded in y around 0
+-commutativeN/A
+-lowering-+.f6458.4
Simplified58.4%
(FPCore (x y) :precision binary64 (fma x y x))
double code(double x, double y) {
return fma(x, y, x);
}
function code(x, y) return fma(x, y, x) end
code[x_, y_] := N[(x * y + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, y, x\right)
\end{array}
Initial program 100.0%
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
flip-+N/A
+-inversesN/A
+-inversesN/A
associate-*r/N/A
*-rgt-identityN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
div-invN/A
div-invN/A
+-inversesN/A
difference-of-squaresN/A
+-inversesN/A
flip-+N/A
count-2N/A
associate-*r/N/A
Applied egg-rr75.8%
Taylor expanded in y around 0
+-commutativeN/A
accelerator-lowering-fma.f6458.4
Simplified58.4%
(FPCore (x y) :precision binary64 x)
double code(double x, double y) {
return x;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x
end function
public static double code(double x, double y) {
return x;
}
def code(x, y): return x
function code(x, y) return x end
function tmp = code(x, y) tmp = x; end
code[x_, y_] := x
\begin{array}{l}
\\
x
\end{array}
Initial program 100.0%
Taylor expanded in y around 0
Simplified52.8%
(FPCore (x y) :precision binary64 (* x (pow (exp y) y)))
double code(double x, double y) {
return x * pow(exp(y), y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * (exp(y) ** y)
end function
public static double code(double x, double y) {
return x * Math.pow(Math.exp(y), y);
}
def code(x, y): return x * math.pow(math.exp(y), y)
function code(x, y) return Float64(x * (exp(y) ^ y)) end
function tmp = code(x, y) tmp = x * (exp(y) ^ y); end
code[x_, y_] := N[(x * N[Power[N[Exp[y], $MachinePrecision], y], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot {\left(e^{y}\right)}^{y}
\end{array}
herbie shell --seed 2024198
(FPCore (x y)
:name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"
:precision binary64
:alt
(! :herbie-platform default (* x (pow (exp y) y)))
(* x (exp (* y y))))