
(FPCore (x y z) :precision binary64 (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))
double code(double x, double y, double z) {
return (1.0 / 2.0) * (x + (y * sqrt(z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / 2.0d0) * (x + (y * sqrt(z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / 2.0) * (x + (y * Math.sqrt(z)));
}
def code(x, y, z): return (1.0 / 2.0) * (x + (y * math.sqrt(z)))
function code(x, y, z) return Float64(Float64(1.0 / 2.0) * Float64(x + Float64(y * sqrt(z)))) end
function tmp = code(x, y, z) tmp = (1.0 / 2.0) * (x + (y * sqrt(z))); end
code[x_, y_, z_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(x + N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))
double code(double x, double y, double z) {
return (1.0 / 2.0) * (x + (y * sqrt(z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / 2.0d0) * (x + (y * sqrt(z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / 2.0) * (x + (y * Math.sqrt(z)));
}
def code(x, y, z): return (1.0 / 2.0) * (x + (y * math.sqrt(z)))
function code(x, y, z) return Float64(Float64(1.0 / 2.0) * Float64(x + Float64(y * sqrt(z)))) end
function tmp = code(x, y, z) tmp = (1.0 / 2.0) * (x + (y * sqrt(z))); end
code[x_, y_, z_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(x + N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
\end{array}
(FPCore (x y z) :precision binary64 (* 0.5 (fma y (sqrt z) x)))
double code(double x, double y, double z) {
return 0.5 * fma(y, sqrt(z), x);
}
function code(x, y, z) return Float64(0.5 * fma(y, sqrt(z), x)) end
code[x_, y_, z_] := N[(0.5 * N[(y * N[Sqrt[z], $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \mathsf{fma}\left(y, \sqrt{z}, x\right)
\end{array}
Initial program 99.8%
metadata-eval99.8%
+-commutative99.8%
fma-define99.8%
Simplified99.8%
Final simplification99.8%
(FPCore (x y z) :precision binary64 (if (<= x -2e-91) (* 0.5 x) (if (<= x 8e+77) (* 0.5 (* y (sqrt z))) (* 0.5 (fabs x)))))
double code(double x, double y, double z) {
double tmp;
if (x <= -2e-91) {
tmp = 0.5 * x;
} else if (x <= 8e+77) {
tmp = 0.5 * (y * sqrt(z));
} else {
tmp = 0.5 * fabs(x);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (x <= (-2d-91)) then
tmp = 0.5d0 * x
else if (x <= 8d+77) then
tmp = 0.5d0 * (y * sqrt(z))
else
tmp = 0.5d0 * abs(x)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if (x <= -2e-91) {
tmp = 0.5 * x;
} else if (x <= 8e+77) {
tmp = 0.5 * (y * Math.sqrt(z));
} else {
tmp = 0.5 * Math.abs(x);
}
return tmp;
}
def code(x, y, z): tmp = 0 if x <= -2e-91: tmp = 0.5 * x elif x <= 8e+77: tmp = 0.5 * (y * math.sqrt(z)) else: tmp = 0.5 * math.fabs(x) return tmp
function code(x, y, z) tmp = 0.0 if (x <= -2e-91) tmp = Float64(0.5 * x); elseif (x <= 8e+77) tmp = Float64(0.5 * Float64(y * sqrt(z))); else tmp = Float64(0.5 * abs(x)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if (x <= -2e-91) tmp = 0.5 * x; elseif (x <= 8e+77) tmp = 0.5 * (y * sqrt(z)); else tmp = 0.5 * abs(x); end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[x, -2e-91], N[(0.5 * x), $MachinePrecision], If[LessEqual[x, 8e+77], N[(0.5 * N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Abs[x], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2 \cdot 10^{-91}:\\
\;\;\;\;0.5 \cdot x\\
\mathbf{elif}\;x \leq 8 \cdot 10^{+77}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \sqrt{z}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left|x\right|\\
\end{array}
\end{array}
if x < -2.00000000000000004e-91Initial program 99.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in x around inf 75.1%
if -2.00000000000000004e-91 < x < 7.99999999999999986e77Initial program 99.6%
metadata-eval99.6%
Simplified99.6%
+-commutative99.6%
*-commutative99.6%
add-sqr-sqrt99.3%
associate-*l*99.4%
fma-define99.4%
pow1/299.4%
sqrt-pow199.5%
metadata-eval99.5%
pow1/299.5%
sqrt-pow199.4%
metadata-eval99.4%
Applied egg-rr99.4%
Taylor expanded in z around inf 79.7%
if 7.99999999999999986e77 < x Initial program 99.9%
metadata-eval99.9%
Simplified99.9%
+-commutative99.9%
*-commutative99.9%
add-sqr-sqrt99.9%
associate-*l*99.9%
fma-define99.9%
pow1/299.9%
sqrt-pow199.9%
metadata-eval99.9%
pow1/299.9%
sqrt-pow199.9%
metadata-eval99.9%
Applied egg-rr99.9%
fma-undefine99.9%
associate-*r*99.9%
pow-prod-up99.9%
metadata-eval99.9%
pow1/299.9%
*-commutative99.9%
+-commutative99.9%
flip-+28.4%
unpow228.4%
swap-sqr26.2%
unpow226.2%
add-sqr-sqrt26.2%
*-commutative26.2%
clear-num26.0%
clear-num26.1%
Applied egg-rr99.7%
Taylor expanded in x around inf 83.3%
remove-double-div83.4%
add-sqr-sqrt82.8%
sqrt-unprod27.4%
pow227.4%
Applied egg-rr27.4%
unpow227.4%
rem-sqrt-square83.4%
Simplified83.4%
Final simplification78.9%
(FPCore (x y z) :precision binary64 (* 0.5 (+ x (* y (sqrt z)))))
double code(double x, double y, double z) {
return 0.5 * (x + (y * sqrt(z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 0.5d0 * (x + (y * sqrt(z)))
end function
public static double code(double x, double y, double z) {
return 0.5 * (x + (y * Math.sqrt(z)));
}
def code(x, y, z): return 0.5 * (x + (y * math.sqrt(z)))
function code(x, y, z) return Float64(0.5 * Float64(x + Float64(y * sqrt(z)))) end
function tmp = code(x, y, z) tmp = 0.5 * (x + (y * sqrt(z))); end
code[x_, y_, z_] := N[(0.5 * N[(x + N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \left(x + y \cdot \sqrt{z}\right)
\end{array}
Initial program 99.8%
metadata-eval99.8%
Simplified99.8%
Final simplification99.8%
(FPCore (x y z) :precision binary64 (* 0.5 x))
double code(double x, double y, double z) {
return 0.5 * x;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 0.5d0 * x
end function
public static double code(double x, double y, double z) {
return 0.5 * x;
}
def code(x, y, z): return 0.5 * x
function code(x, y, z) return Float64(0.5 * x) end
function tmp = code(x, y, z) tmp = 0.5 * x; end
code[x_, y_, z_] := N[(0.5 * x), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot x
\end{array}
Initial program 99.8%
metadata-eval99.8%
Simplified99.8%
Taylor expanded in x around inf 49.5%
Final simplification49.5%
herbie shell --seed 2024073
(FPCore (x y z)
:name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
:precision binary64
(* (/ 1.0 2.0) (+ x (* y (sqrt z)))))