
(FPCore (x)
:precision binary64
(let* ((t_0 (* (* (fabs x) (fabs x)) (fabs x)))
(t_1 (* (* t_0 (fabs x)) (fabs x))))
(fabs
(*
(/ 1.0 (sqrt PI))
(+
(+ (+ (* 2.0 (fabs x)) (* (/ 2.0 3.0) t_0)) (* (/ 1.0 5.0) t_1))
(* (/ 1.0 21.0) (* (* t_1 (fabs x)) (fabs x))))))))
double code(double x) {
double t_0 = (fabs(x) * fabs(x)) * fabs(x);
double t_1 = (t_0 * fabs(x)) * fabs(x);
return fabs(((1.0 / sqrt(((double) M_PI))) * ((((2.0 * fabs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * fabs(x)) * fabs(x))))));
}
public static double code(double x) {
double t_0 = (Math.abs(x) * Math.abs(x)) * Math.abs(x);
double t_1 = (t_0 * Math.abs(x)) * Math.abs(x);
return Math.abs(((1.0 / Math.sqrt(Math.PI)) * ((((2.0 * Math.abs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * Math.abs(x)) * Math.abs(x))))));
}
def code(x): t_0 = (math.fabs(x) * math.fabs(x)) * math.fabs(x) t_1 = (t_0 * math.fabs(x)) * math.fabs(x) return math.fabs(((1.0 / math.sqrt(math.pi)) * ((((2.0 * math.fabs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * math.fabs(x)) * math.fabs(x))))))
function code(x) t_0 = Float64(Float64(abs(x) * abs(x)) * abs(x)) t_1 = Float64(Float64(t_0 * abs(x)) * abs(x)) return abs(Float64(Float64(1.0 / sqrt(pi)) * Float64(Float64(Float64(Float64(2.0 * abs(x)) + Float64(Float64(2.0 / 3.0) * t_0)) + Float64(Float64(1.0 / 5.0) * t_1)) + Float64(Float64(1.0 / 21.0) * Float64(Float64(t_1 * abs(x)) * abs(x)))))) end
function tmp = code(x) t_0 = (abs(x) * abs(x)) * abs(x); t_1 = (t_0 * abs(x)) * abs(x); tmp = abs(((1.0 / sqrt(pi)) * ((((2.0 * abs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * abs(x)) * abs(x)))))); end
code[x_] := Block[{t$95$0 = N[(N[(N[Abs[x], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * N[Abs[x], $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]}, N[Abs[N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(2.0 * N[Abs[x], $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 / 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / 5.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / 21.0), $MachinePrecision] * N[(N[(t$95$1 * N[Abs[x], $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\left|x\right| \cdot \left|x\right|\right) \cdot \left|x\right|\\
t_1 := \left(t\_0 \cdot \left|x\right|\right) \cdot \left|x\right|\\
\left|\frac{1}{\sqrt{\pi}} \cdot \left(\left(\left(2 \cdot \left|x\right| + \frac{2}{3} \cdot t\_0\right) + \frac{1}{5} \cdot t\_1\right) + \frac{1}{21} \cdot \left(\left(t\_1 \cdot \left|x\right|\right) \cdot \left|x\right|\right)\right)\right|
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x)
:precision binary64
(let* ((t_0 (* (* (fabs x) (fabs x)) (fabs x)))
(t_1 (* (* t_0 (fabs x)) (fabs x))))
(fabs
(*
(/ 1.0 (sqrt PI))
(+
(+ (+ (* 2.0 (fabs x)) (* (/ 2.0 3.0) t_0)) (* (/ 1.0 5.0) t_1))
(* (/ 1.0 21.0) (* (* t_1 (fabs x)) (fabs x))))))))
double code(double x) {
double t_0 = (fabs(x) * fabs(x)) * fabs(x);
double t_1 = (t_0 * fabs(x)) * fabs(x);
return fabs(((1.0 / sqrt(((double) M_PI))) * ((((2.0 * fabs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * fabs(x)) * fabs(x))))));
}
public static double code(double x) {
double t_0 = (Math.abs(x) * Math.abs(x)) * Math.abs(x);
double t_1 = (t_0 * Math.abs(x)) * Math.abs(x);
return Math.abs(((1.0 / Math.sqrt(Math.PI)) * ((((2.0 * Math.abs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * Math.abs(x)) * Math.abs(x))))));
}
def code(x): t_0 = (math.fabs(x) * math.fabs(x)) * math.fabs(x) t_1 = (t_0 * math.fabs(x)) * math.fabs(x) return math.fabs(((1.0 / math.sqrt(math.pi)) * ((((2.0 * math.fabs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * math.fabs(x)) * math.fabs(x))))))
function code(x) t_0 = Float64(Float64(abs(x) * abs(x)) * abs(x)) t_1 = Float64(Float64(t_0 * abs(x)) * abs(x)) return abs(Float64(Float64(1.0 / sqrt(pi)) * Float64(Float64(Float64(Float64(2.0 * abs(x)) + Float64(Float64(2.0 / 3.0) * t_0)) + Float64(Float64(1.0 / 5.0) * t_1)) + Float64(Float64(1.0 / 21.0) * Float64(Float64(t_1 * abs(x)) * abs(x)))))) end
function tmp = code(x) t_0 = (abs(x) * abs(x)) * abs(x); t_1 = (t_0 * abs(x)) * abs(x); tmp = abs(((1.0 / sqrt(pi)) * ((((2.0 * abs(x)) + ((2.0 / 3.0) * t_0)) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * ((t_1 * abs(x)) * abs(x)))))); end
code[x_] := Block[{t$95$0 = N[(N[(N[Abs[x], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * N[Abs[x], $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]}, N[Abs[N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(2.0 * N[Abs[x], $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 / 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / 5.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / 21.0), $MachinePrecision] * N[(N[(t$95$1 * N[Abs[x], $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\left|x\right| \cdot \left|x\right|\right) \cdot \left|x\right|\\
t_1 := \left(t\_0 \cdot \left|x\right|\right) \cdot \left|x\right|\\
\left|\frac{1}{\sqrt{\pi}} \cdot \left(\left(\left(2 \cdot \left|x\right| + \frac{2}{3} \cdot t\_0\right) + \frac{1}{5} \cdot t\_1\right) + \frac{1}{21} \cdot \left(\left(t\_1 \cdot \left|x\right|\right) \cdot \left|x\right|\right)\right)\right|
\end{array}
\end{array}
(FPCore (x)
:precision binary64
(*
(fabs x)
(*
(/ 1.0 (sqrt PI))
(fma
x
(*
x
(fma x (* x (fma (* x x) 0.047619047619047616 0.2)) 0.6666666666666666))
2.0))))
double code(double x) {
return fabs(x) * ((1.0 / sqrt(((double) M_PI))) * fma(x, (x * fma(x, (x * fma((x * x), 0.047619047619047616, 0.2)), 0.6666666666666666)), 2.0));
}
function code(x) return Float64(abs(x) * Float64(Float64(1.0 / sqrt(pi)) * fma(x, Float64(x * fma(x, Float64(x * fma(Float64(x * x), 0.047619047619047616, 0.2)), 0.6666666666666666)), 2.0))) end
code[x_] := N[(N[Abs[x], $MachinePrecision] * N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(x * N[(x * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.047619047619047616 + 0.2), $MachinePrecision]), $MachinePrecision] + 0.6666666666666666), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left|x\right| \cdot \left(\frac{1}{\sqrt{\pi}} \cdot \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, 0.047619047619047616, 0.2\right), 0.6666666666666666\right), 2\right)\right)
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Applied egg-rr99.9%
Taylor expanded in x around 0
Simplified99.9%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
*-lowering-*.f64N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr99.9%
(FPCore (x)
:precision binary64
(let* ((t_0 (* x (* x x))) (t_1 (* (fabs x) (fabs (* x t_0)))))
(if (<=
(+
(+
(+ (* (fabs x) 2.0) (* (/ 2.0 3.0) (fabs t_0)))
(* (/ 1.0 5.0) t_1))
(* (/ 1.0 21.0) (* (fabs x) (* (fabs x) t_1))))
4e-5)
(fabs
(* (/ 1.0 (sqrt PI)) (* (fabs x) (fma x (* x 0.6666666666666666) 2.0))))
(fabs
(/
(* x (* (fma x (* x 0.2) 0.6666666666666666) (* x (fabs x))))
(sqrt PI))))))
double code(double x) {
double t_0 = x * (x * x);
double t_1 = fabs(x) * fabs((x * t_0));
double tmp;
if (((((fabs(x) * 2.0) + ((2.0 / 3.0) * fabs(t_0))) + ((1.0 / 5.0) * t_1)) + ((1.0 / 21.0) * (fabs(x) * (fabs(x) * t_1)))) <= 4e-5) {
tmp = fabs(((1.0 / sqrt(((double) M_PI))) * (fabs(x) * fma(x, (x * 0.6666666666666666), 2.0))));
} else {
tmp = fabs(((x * (fma(x, (x * 0.2), 0.6666666666666666) * (x * fabs(x)))) / sqrt(((double) M_PI))));
}
return tmp;
}
function code(x) t_0 = Float64(x * Float64(x * x)) t_1 = Float64(abs(x) * abs(Float64(x * t_0))) tmp = 0.0 if (Float64(Float64(Float64(Float64(abs(x) * 2.0) + Float64(Float64(2.0 / 3.0) * abs(t_0))) + Float64(Float64(1.0 / 5.0) * t_1)) + Float64(Float64(1.0 / 21.0) * Float64(abs(x) * Float64(abs(x) * t_1)))) <= 4e-5) tmp = abs(Float64(Float64(1.0 / sqrt(pi)) * Float64(abs(x) * fma(x, Float64(x * 0.6666666666666666), 2.0)))); else tmp = abs(Float64(Float64(x * Float64(fma(x, Float64(x * 0.2), 0.6666666666666666) * Float64(x * abs(x)))) / sqrt(pi))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Abs[x], $MachinePrecision] * N[Abs[N[(x * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[Abs[x], $MachinePrecision] * 2.0), $MachinePrecision] + N[(N[(2.0 / 3.0), $MachinePrecision] * N[Abs[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / 5.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / 21.0), $MachinePrecision] * N[(N[Abs[x], $MachinePrecision] * N[(N[Abs[x], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e-5], N[Abs[N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(N[Abs[x], $MachinePrecision] * N[(x * N[(x * 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(x * N[(N[(x * N[(x * 0.2), $MachinePrecision] + 0.6666666666666666), $MachinePrecision] * N[(x * N[Abs[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := x \cdot \left(x \cdot x\right)\\
t_1 := \left|x\right| \cdot \left|x \cdot t\_0\right|\\
\mathbf{if}\;\left(\left(\left|x\right| \cdot 2 + \frac{2}{3} \cdot \left|t\_0\right|\right) + \frac{1}{5} \cdot t\_1\right) + \frac{1}{21} \cdot \left(\left|x\right| \cdot \left(\left|x\right| \cdot t\_1\right)\right) \leq 4 \cdot 10^{-5}:\\
\;\;\;\;\left|\frac{1}{\sqrt{\pi}} \cdot \left(\left|x\right| \cdot \mathsf{fma}\left(x, x \cdot 0.6666666666666666, 2\right)\right)\right|\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{x \cdot \left(\mathsf{fma}\left(x, x \cdot 0.2, 0.6666666666666666\right) \cdot \left(x \cdot \left|x\right|\right)\right)}{\sqrt{\pi}}\right|\\
\end{array}
\end{array}
if (+.f64 (+.f64 (+.f64 (*.f64 #s(literal 2 binary64) (fabs.f64 x)) (*.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) (*.f64 (*.f64 (fabs.f64 x) (fabs.f64 x)) (fabs.f64 x)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 5 binary64)) (*.f64 (*.f64 (*.f64 (*.f64 (fabs.f64 x) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 21 binary64)) (*.f64 (*.f64 (*.f64 (*.f64 (*.f64 (*.f64 (fabs.f64 x) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)))) < 4.00000000000000033e-5Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.9
Simplified99.9%
if 4.00000000000000033e-5 < (+.f64 (+.f64 (+.f64 (*.f64 #s(literal 2 binary64) (fabs.f64 x)) (*.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) (*.f64 (*.f64 (fabs.f64 x) (fabs.f64 x)) (fabs.f64 x)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 5 binary64)) (*.f64 (*.f64 (*.f64 (*.f64 (fabs.f64 x) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 21 binary64)) (*.f64 (*.f64 (*.f64 (*.f64 (*.f64 (*.f64 (fabs.f64 x) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)) (fabs.f64 x)))) Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
distribute-rgt-inN/A
associate-+l+N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
Simplified84.6%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r/N/A
associate-*l/N/A
associate-/l*N/A
metadata-evalN/A
pow-sqrN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
Simplified84.6%
Final simplification93.4%
(FPCore (x)
:precision binary64
(if (<= (fabs x) 2e-5)
(fabs
(* (/ 1.0 (sqrt PI)) (* (fabs x) (fma x (* x 0.6666666666666666) 2.0))))
(fabs
(*
(* (fabs (/ x (sqrt PI))) (* x (* x (* x x))))
(fma 0.047619047619047616 (* x x) 0.2)))))
double code(double x) {
double tmp;
if (fabs(x) <= 2e-5) {
tmp = fabs(((1.0 / sqrt(((double) M_PI))) * (fabs(x) * fma(x, (x * 0.6666666666666666), 2.0))));
} else {
tmp = fabs(((fabs((x / sqrt(((double) M_PI)))) * (x * (x * (x * x)))) * fma(0.047619047619047616, (x * x), 0.2)));
}
return tmp;
}
function code(x) tmp = 0.0 if (abs(x) <= 2e-5) tmp = abs(Float64(Float64(1.0 / sqrt(pi)) * Float64(abs(x) * fma(x, Float64(x * 0.6666666666666666), 2.0)))); else tmp = abs(Float64(Float64(abs(Float64(x / sqrt(pi))) * Float64(x * Float64(x * Float64(x * x)))) * fma(0.047619047619047616, Float64(x * x), 0.2))); end return tmp end
code[x_] := If[LessEqual[N[Abs[x], $MachinePrecision], 2e-5], N[Abs[N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(N[Abs[x], $MachinePrecision] * N[(x * N[(x * 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(N[Abs[N[(x / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.047619047619047616 * N[(x * x), $MachinePrecision] + 0.2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left|x\right| \leq 2 \cdot 10^{-5}:\\
\;\;\;\;\left|\frac{1}{\sqrt{\pi}} \cdot \left(\left|x\right| \cdot \mathsf{fma}\left(x, x \cdot 0.6666666666666666, 2\right)\right)\right|\\
\mathbf{else}:\\
\;\;\;\;\left|\left(\left|\frac{x}{\sqrt{\pi}}\right| \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right) \cdot \mathsf{fma}\left(0.047619047619047616, x \cdot x, 0.2\right)\right|\\
\end{array}
\end{array}
if (fabs.f64 x) < 2.00000000000000016e-5Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.9
Simplified99.9%
if 2.00000000000000016e-5 < (fabs.f64 x) Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around inf
Simplified99.3%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
add-sqr-sqrtN/A
rem-sqrt-squareN/A
div-fabsN/A
fabs-lowering-fabs.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f6499.3
Applied egg-rr99.3%
Final simplification99.6%
(FPCore (x)
:precision binary64
(/
(*
(fabs x)
(fma
x
(*
x
(fma x (* x (fma (* x x) 0.047619047619047616 0.2)) 0.6666666666666666))
2.0))
(sqrt PI)))
double code(double x) {
return (fabs(x) * fma(x, (x * fma(x, (x * fma((x * x), 0.047619047619047616, 0.2)), 0.6666666666666666)), 2.0)) / sqrt(((double) M_PI));
}
function code(x) return Float64(Float64(abs(x) * fma(x, Float64(x * fma(x, Float64(x * fma(Float64(x * x), 0.047619047619047616, 0.2)), 0.6666666666666666)), 2.0)) / sqrt(pi)) end
code[x_] := N[(N[(N[Abs[x], $MachinePrecision] * N[(x * N[(x * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.047619047619047616 + 0.2), $MachinePrecision]), $MachinePrecision] + 0.6666666666666666), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left|x\right| \cdot \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, 0.047619047619047616, 0.2\right), 0.6666666666666666\right), 2\right)}{\sqrt{\pi}}
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Applied egg-rr99.9%
Taylor expanded in x around 0
Simplified99.9%
associate-*l*N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
Applied egg-rr99.5%
(FPCore (x)
:precision binary64
(*
(fma
x
(*
x
(fma x (* x (fma (* x x) 0.047619047619047616 0.2)) 0.6666666666666666))
2.0)
(fabs (/ x (sqrt PI)))))
double code(double x) {
return fma(x, (x * fma(x, (x * fma((x * x), 0.047619047619047616, 0.2)), 0.6666666666666666)), 2.0) * fabs((x / sqrt(((double) M_PI))));
}
function code(x) return Float64(fma(x, Float64(x * fma(x, Float64(x * fma(Float64(x * x), 0.047619047619047616, 0.2)), 0.6666666666666666)), 2.0) * abs(Float64(x / sqrt(pi)))) end
code[x_] := N[(N[(x * N[(x * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.047619047619047616 + 0.2), $MachinePrecision]), $MachinePrecision] + 0.6666666666666666), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] * N[Abs[N[(x / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, 0.047619047619047616, 0.2\right), 0.6666666666666666\right), 2\right) \cdot \left|\frac{x}{\sqrt{\pi}}\right|
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Applied egg-rr99.9%
Taylor expanded in x around 0
Simplified99.9%
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/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
*-commutativeN/A
sqrt-divN/A
Applied egg-rr99.5%
(FPCore (x)
:precision binary64
(if (<= (fabs x) 2e-5)
(fabs
(* (/ 1.0 (sqrt PI)) (* (fabs x) (fma x (* x 0.6666666666666666) 2.0))))
(* x (* x (/ (* 0.2 (* x (* x x))) (sqrt PI))))))
double code(double x) {
double tmp;
if (fabs(x) <= 2e-5) {
tmp = fabs(((1.0 / sqrt(((double) M_PI))) * (fabs(x) * fma(x, (x * 0.6666666666666666), 2.0))));
} else {
tmp = x * (x * ((0.2 * (x * (x * x))) / sqrt(((double) M_PI))));
}
return tmp;
}
function code(x) tmp = 0.0 if (abs(x) <= 2e-5) tmp = abs(Float64(Float64(1.0 / sqrt(pi)) * Float64(abs(x) * fma(x, Float64(x * 0.6666666666666666), 2.0)))); else tmp = Float64(x * Float64(x * Float64(Float64(0.2 * Float64(x * Float64(x * x))) / sqrt(pi)))); end return tmp end
code[x_] := If[LessEqual[N[Abs[x], $MachinePrecision], 2e-5], N[Abs[N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(N[Abs[x], $MachinePrecision] * N[(x * N[(x * 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(x * N[(x * N[(N[(0.2 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left|x\right| \leq 2 \cdot 10^{-5}:\\
\;\;\;\;\left|\frac{1}{\sqrt{\pi}} \cdot \left(\left|x\right| \cdot \mathsf{fma}\left(x, x \cdot 0.6666666666666666, 2\right)\right)\right|\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot \frac{0.2 \cdot \left(x \cdot \left(x \cdot x\right)\right)}{\sqrt{\pi}}\right)\\
\end{array}
\end{array}
if (fabs.f64 x) < 2.00000000000000016e-5Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.9
Simplified99.9%
if 2.00000000000000016e-5 < (fabs.f64 x) Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
distribute-rgt-inN/A
associate-+l+N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
Simplified84.6%
Taylor expanded in x around inf
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6484.6
Simplified84.6%
fabs-divN/A
rem-sqrt-squareN/A
add-sqr-sqrtN/A
Applied egg-rr0.1%
Final simplification57.8%
(FPCore (x) :precision binary64 (fabs (/ (* (fabs x) (fma (* x x) (fma x (* x 0.2) 0.6666666666666666) 2.0)) (sqrt PI))))
double code(double x) {
return fabs(((fabs(x) * fma((x * x), fma(x, (x * 0.2), 0.6666666666666666), 2.0)) / sqrt(((double) M_PI))));
}
function code(x) return abs(Float64(Float64(abs(x) * fma(Float64(x * x), fma(x, Float64(x * 0.2), 0.6666666666666666), 2.0)) / sqrt(pi))) end
code[x_] := N[Abs[N[(N[(N[Abs[x], $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.2), $MachinePrecision] + 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\left|\frac{\left|x\right| \cdot \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.2, 0.6666666666666666\right), 2\right)}{\sqrt{\pi}}\right|
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Taylor expanded in x around 0
+-commutativeN/A
distribute-rgt-inN/A
associate-+l+N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
Simplified93.0%
(FPCore (x) :precision binary64 (fabs (/ (* (fabs x) (fma (* x x) (* (* x x) 0.2) 2.0)) (sqrt PI))))
double code(double x) {
return fabs(((fabs(x) * fma((x * x), ((x * x) * 0.2), 2.0)) / sqrt(((double) M_PI))));
}
function code(x) return abs(Float64(Float64(abs(x) * fma(Float64(x * x), Float64(Float64(x * x) * 0.2), 2.0)) / sqrt(pi))) end
code[x_] := N[Abs[N[(N[(N[Abs[x], $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * 0.2), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\left|\frac{\left|x\right| \cdot \mathsf{fma}\left(x \cdot x, \left(x \cdot x\right) \cdot 0.2, 2\right)}{\sqrt{\pi}}\right|
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Taylor expanded in x around 0
+-commutativeN/A
distribute-rgt-inN/A
associate-+l+N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
Simplified93.0%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6492.8
Simplified92.8%
(FPCore (x) :precision binary64 (fabs (* (/ 1.0 (sqrt PI)) (* (fabs x) (fma x (* x 0.6666666666666666) 2.0)))))
double code(double x) {
return fabs(((1.0 / sqrt(((double) M_PI))) * (fabs(x) * fma(x, (x * 0.6666666666666666), 2.0))));
}
function code(x) return abs(Float64(Float64(1.0 / sqrt(pi)) * Float64(abs(x) * fma(x, Float64(x * 0.6666666666666666), 2.0)))) end
code[x_] := N[Abs[N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[(N[Abs[x], $MachinePrecision] * N[(x * N[(x * 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\left|\frac{1}{\sqrt{\pi}} \cdot \left(\left|x\right| \cdot \mathsf{fma}\left(x, x \cdot 0.6666666666666666, 2\right)\right)\right|
\end{array}
Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6488.9
Simplified88.9%
Final simplification88.9%
(FPCore (x) :precision binary64 (if (<= (fabs x) 2e-5) (* (fabs x) (/ 2.0 (sqrt PI))) (* 0.6666666666666666 (/ (* x (* x x)) (sqrt PI)))))
double code(double x) {
double tmp;
if (fabs(x) <= 2e-5) {
tmp = fabs(x) * (2.0 / sqrt(((double) M_PI)));
} else {
tmp = 0.6666666666666666 * ((x * (x * x)) / sqrt(((double) M_PI)));
}
return tmp;
}
public static double code(double x) {
double tmp;
if (Math.abs(x) <= 2e-5) {
tmp = Math.abs(x) * (2.0 / Math.sqrt(Math.PI));
} else {
tmp = 0.6666666666666666 * ((x * (x * x)) / Math.sqrt(Math.PI));
}
return tmp;
}
def code(x): tmp = 0 if math.fabs(x) <= 2e-5: tmp = math.fabs(x) * (2.0 / math.sqrt(math.pi)) else: tmp = 0.6666666666666666 * ((x * (x * x)) / math.sqrt(math.pi)) return tmp
function code(x) tmp = 0.0 if (abs(x) <= 2e-5) tmp = Float64(abs(x) * Float64(2.0 / sqrt(pi))); else tmp = Float64(0.6666666666666666 * Float64(Float64(x * Float64(x * x)) / sqrt(pi))); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (abs(x) <= 2e-5) tmp = abs(x) * (2.0 / sqrt(pi)); else tmp = 0.6666666666666666 * ((x * (x * x)) / sqrt(pi)); end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[Abs[x], $MachinePrecision], 2e-5], N[(N[Abs[x], $MachinePrecision] * N[(2.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.6666666666666666 * N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left|x\right| \leq 2 \cdot 10^{-5}:\\
\;\;\;\;\left|x\right| \cdot \frac{2}{\sqrt{\pi}}\\
\mathbf{else}:\\
\;\;\;\;0.6666666666666666 \cdot \frac{x \cdot \left(x \cdot x\right)}{\sqrt{\pi}}\\
\end{array}
\end{array}
if (fabs.f64 x) < 2.00000000000000016e-5Initial program 99.9%
Applied egg-rr99.2%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6498.8
Simplified98.8%
fabs-divN/A
rem-sqrt-squareN/A
add-sqr-sqrtN/A
fabs-mulN/A
fabs-fabsN/A
metadata-evalN/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f64N/A
fabs-lowering-fabs.f6499.5
Applied egg-rr99.5%
if 2.00000000000000016e-5 < (fabs.f64 x) Initial program 99.9%
Applied egg-rr99.9%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6473.9
Simplified73.9%
Taylor expanded in x around inf
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6473.9
Simplified73.9%
fabs-divN/A
*-commutativeN/A
fabs-mulN/A
fabs-mulN/A
metadata-evalN/A
fabs-fabsN/A
fabs-sqrN/A
associate-*l*N/A
fabs-sqrN/A
fabs-mulN/A
cube-unmultN/A
sqr-powN/A
fabs-sqrN/A
sqr-powN/A
cube-unmultN/A
rem-sqrt-squareN/A
add-sqr-sqrtN/A
*-lft-identityN/A
times-fracN/A
Applied egg-rr0.1%
Final simplification57.6%
(FPCore (x) :precision binary64 (* (fabs x) (fabs (/ (fma x (* x 0.6666666666666666) 2.0) (sqrt PI)))))
double code(double x) {
return fabs(x) * fabs((fma(x, (x * 0.6666666666666666), 2.0) / sqrt(((double) M_PI))));
}
function code(x) return Float64(abs(x) * abs(Float64(fma(x, Float64(x * 0.6666666666666666), 2.0) / sqrt(pi)))) end
code[x_] := N[(N[Abs[x], $MachinePrecision] * N[Abs[N[(N[(x * N[(x * 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left|x\right| \cdot \left|\frac{\mathsf{fma}\left(x, x \cdot 0.6666666666666666, 2\right)}{\sqrt{\pi}}\right|
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6488.5
Simplified88.5%
associate-/l*N/A
*-commutativeN/A
fabs-mulN/A
fabs-fabsN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f64N/A
fabs-lowering-fabs.f6488.9
Applied egg-rr88.9%
Final simplification88.9%
(FPCore (x) :precision binary64 (fabs (/ (* (fabs x) (fma x (* x 0.6666666666666666) 2.0)) (sqrt PI))))
double code(double x) {
return fabs(((fabs(x) * fma(x, (x * 0.6666666666666666), 2.0)) / sqrt(((double) M_PI))));
}
function code(x) return abs(Float64(Float64(abs(x) * fma(x, Float64(x * 0.6666666666666666), 2.0)) / sqrt(pi))) end
code[x_] := N[Abs[N[(N[(N[Abs[x], $MachinePrecision] * N[(x * N[(x * 0.6666666666666666), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\left|\frac{\left|x\right| \cdot \mathsf{fma}\left(x, x \cdot 0.6666666666666666, 2\right)}{\sqrt{\pi}}\right|
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6488.5
Simplified88.5%
(FPCore (x) :precision binary64 (* (fabs x) (/ 2.0 (sqrt PI))))
double code(double x) {
return fabs(x) * (2.0 / sqrt(((double) M_PI)));
}
public static double code(double x) {
return Math.abs(x) * (2.0 / Math.sqrt(Math.PI));
}
def code(x): return math.fabs(x) * (2.0 / math.sqrt(math.pi))
function code(x) return Float64(abs(x) * Float64(2.0 / sqrt(pi))) end
function tmp = code(x) tmp = abs(x) * (2.0 / sqrt(pi)); end
code[x_] := N[(N[Abs[x], $MachinePrecision] * N[(2.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left|x\right| \cdot \frac{2}{\sqrt{\pi}}
\end{array}
Initial program 99.9%
Applied egg-rr99.5%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6459.7
Simplified59.7%
fabs-divN/A
rem-sqrt-squareN/A
add-sqr-sqrtN/A
fabs-mulN/A
fabs-fabsN/A
metadata-evalN/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f64N/A
fabs-lowering-fabs.f6460.1
Applied egg-rr60.1%
Final simplification60.1%
herbie shell --seed 2024204
(FPCore (x)
:name "Jmat.Real.erfi, branch x less than or equal to 0.5"
:precision binary64
:pre (<= x 0.5)
(fabs (* (/ 1.0 (sqrt PI)) (+ (+ (+ (* 2.0 (fabs x)) (* (/ 2.0 3.0) (* (* (fabs x) (fabs x)) (fabs x)))) (* (/ 1.0 5.0) (* (* (* (* (fabs x) (fabs x)) (fabs x)) (fabs x)) (fabs x)))) (* (/ 1.0 21.0) (* (* (* (* (* (* (fabs x) (fabs x)) (fabs x)) (fabs x)) (fabs x)) (fabs x)) (fabs x)))))))