
(FPCore (x y z) :precision binary64 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))
double code(double x, double y, double z) {
return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function
public static double code(double x, double y, double z) {
return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}
def code(x, y, z): return (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) end
function tmp = code(x, y, z) tmp = (((x * x) + (y * y)) - (z * z)) / (y * 2.0); end
code[x_, y_, z_] := N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))
double code(double x, double y, double z) {
return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function
public static double code(double x, double y, double z) {
return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}
def code(x, y, z): return (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) end
function tmp = code(x, y, z) tmp = (((x * x) + (y * y)) - (z * z)) / (y * 2.0); end
code[x_, y_, z_] := N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}
\end{array}
(FPCore (x y z) :precision binary64 (* 0.5 (fma (- x z) (* (/ 1.0 y) (+ x z)) y)))
double code(double x, double y, double z) {
return 0.5 * fma((x - z), ((1.0 / y) * (x + z)), y);
}
function code(x, y, z) return Float64(0.5 * fma(Float64(x - z), Float64(Float64(1.0 / y) * Float64(x + z)), y)) end
code[x_, y_, z_] := N[(0.5 * N[(N[(x - z), $MachinePrecision] * N[(N[(1.0 / y), $MachinePrecision] * N[(x + z), $MachinePrecision]), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \mathsf{fma}\left(x - z, \frac{1}{y} \cdot \left(x + z\right), y\right)
\end{array}
Initial program 70.7%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Applied rewrites100.0%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
(if (<= t_0 0.0)
(* z (* z (/ -0.5 y)))
(if (<= t_0 2e+153)
(* y 0.5)
(if (<= t_0 INFINITY) (* (/ 0.5 y) (* x x)) (* z (* -0.5 (/ z y))))))))
double code(double x, double y, double z) {
double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_0 <= 0.0) {
tmp = z * (z * (-0.5 / y));
} else if (t_0 <= 2e+153) {
tmp = y * 0.5;
} else if (t_0 <= ((double) INFINITY)) {
tmp = (0.5 / y) * (x * x);
} else {
tmp = z * (-0.5 * (z / y));
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_0 <= 0.0) {
tmp = z * (z * (-0.5 / y));
} else if (t_0 <= 2e+153) {
tmp = y * 0.5;
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (0.5 / y) * (x * x);
} else {
tmp = z * (-0.5 * (z / y));
}
return tmp;
}
def code(x, y, z): t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0) tmp = 0 if t_0 <= 0.0: tmp = z * (z * (-0.5 / y)) elif t_0 <= 2e+153: tmp = y * 0.5 elif t_0 <= math.inf: tmp = (0.5 / y) * (x * x) else: tmp = z * (-0.5 * (z / y)) return tmp
function code(x, y, z) t_0 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(z * Float64(z * Float64(-0.5 / y))); elseif (t_0 <= 2e+153) tmp = Float64(y * 0.5); elseif (t_0 <= Inf) tmp = Float64(Float64(0.5 / y) * Float64(x * x)); else tmp = Float64(z * Float64(-0.5 * Float64(z / y))); end return tmp end
function tmp_2 = code(x, y, z) t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0); tmp = 0.0; if (t_0 <= 0.0) tmp = z * (z * (-0.5 / y)); elseif (t_0 <= 2e+153) tmp = y * 0.5; elseif (t_0 <= Inf) tmp = (0.5 / y) * (x * x); else tmp = z * (-0.5 * (z / y)); end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(z * N[(z * N[(-0.5 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+153], N[(y * 0.5), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[(0.5 / y), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision], N[(z * N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y}\right)\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+153}:\\
\;\;\;\;y \cdot 0.5\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{0.5}{y} \cdot \left(x \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(-0.5 \cdot \frac{z}{y}\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0Initial program 80.7%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in z around inf
unpow2N/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6434.6
Applied rewrites34.6%
Applied rewrites34.7%
Applied rewrites34.7%
if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 2e153Initial program 97.2%
Taylor expanded in y around inf
lower-*.f6471.9
Applied rewrites71.9%
if 2e153 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0Initial program 68.5%
Taylor expanded in x around inf
unpow2N/A
lower-*.f6433.4
Applied rewrites33.4%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
lower-/.f6433.4
Applied rewrites33.4%
if +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) Initial program 0.0%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites100.0%
Taylor expanded in z around inf
unpow2N/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6454.3
Applied rewrites54.3%
Final simplification40.2%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* 0.5 (fma z (/ z (- y)) y)))
(t_1 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
(if (<= t_1 2e-98)
t_0
(if (<= t_1 INFINITY) (* 0.5 (fma x (* x (/ 1.0 y)) y)) t_0))))
double code(double x, double y, double z) {
double t_0 = 0.5 * fma(z, (z / -y), y);
double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_1 <= 2e-98) {
tmp = t_0;
} else if (t_1 <= ((double) INFINITY)) {
tmp = 0.5 * fma(x, (x * (1.0 / y)), y);
} else {
tmp = t_0;
}
return tmp;
}
function code(x, y, z) t_0 = Float64(0.5 * fma(z, Float64(z / Float64(-y)), y)) t_1 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) tmp = 0.0 if (t_1 <= 2e-98) tmp = t_0; elseif (t_1 <= Inf) tmp = Float64(0.5 * fma(x, Float64(x * Float64(1.0 / y)), y)); else tmp = t_0; end return tmp end
code[x_, y_, z_] := Block[{t$95$0 = N[(0.5 * N[(z * N[(z / (-y)), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-98], t$95$0, If[LessEqual[t$95$1, Infinity], N[(0.5 * N[(x * N[(x * N[(1.0 / y), $MachinePrecision]), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 \cdot \mathsf{fma}\left(z, \frac{z}{-y}, y\right)\\
t_1 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\
\mathbf{if}\;t\_1 \leq 2 \cdot 10^{-98}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;0.5 \cdot \mathsf{fma}\left(x, x \cdot \frac{1}{y}, y\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 1.99999999999999988e-98 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) Initial program 67.3%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
div-subN/A
sub-negN/A
mul-1-negN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unpow2N/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6470.1
Applied rewrites70.1%
if 1.99999999999999988e-98 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0Initial program 75.1%
Taylor expanded in z around 0
*-lft-identityN/A
*-inversesN/A
associate-*l/N/A
associate-*r/N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*l/N/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
distribute-lft-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-/r/N/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
Applied rewrites66.2%
Applied rewrites66.2%
Final simplification68.4%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* 0.5 (fma z (/ z (- y)) y)))
(t_1 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
(if (<= t_1 2e-98)
t_0
(if (<= t_1 INFINITY) (* 0.5 (fma x (/ x y) y)) t_0))))
double code(double x, double y, double z) {
double t_0 = 0.5 * fma(z, (z / -y), y);
double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_1 <= 2e-98) {
tmp = t_0;
} else if (t_1 <= ((double) INFINITY)) {
tmp = 0.5 * fma(x, (x / y), y);
} else {
tmp = t_0;
}
return tmp;
}
function code(x, y, z) t_0 = Float64(0.5 * fma(z, Float64(z / Float64(-y)), y)) t_1 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) tmp = 0.0 if (t_1 <= 2e-98) tmp = t_0; elseif (t_1 <= Inf) tmp = Float64(0.5 * fma(x, Float64(x / y), y)); else tmp = t_0; end return tmp end
code[x_, y_, z_] := Block[{t$95$0 = N[(0.5 * N[(z * N[(z / (-y)), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-98], t$95$0, If[LessEqual[t$95$1, Infinity], N[(0.5 * N[(x * N[(x / y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 \cdot \mathsf{fma}\left(z, \frac{z}{-y}, y\right)\\
t_1 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\
\mathbf{if}\;t\_1 \leq 2 \cdot 10^{-98}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;0.5 \cdot \mathsf{fma}\left(x, \frac{x}{y}, y\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 1.99999999999999988e-98 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) Initial program 67.3%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
div-subN/A
sub-negN/A
mul-1-negN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unpow2N/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6470.1
Applied rewrites70.1%
if 1.99999999999999988e-98 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0Initial program 75.1%
Taylor expanded in z around 0
*-lft-identityN/A
*-inversesN/A
associate-*l/N/A
associate-*r/N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*l/N/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
distribute-lft-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-/r/N/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
Applied rewrites66.2%
Final simplification68.4%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
(if (<= t_0 0.0)
(* z (* z (/ -0.5 y)))
(if (<= t_0 INFINITY) (* y 0.5) (* z (* -0.5 (/ z y)))))))
double code(double x, double y, double z) {
double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_0 <= 0.0) {
tmp = z * (z * (-0.5 / y));
} else if (t_0 <= ((double) INFINITY)) {
tmp = y * 0.5;
} else {
tmp = z * (-0.5 * (z / y));
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_0 <= 0.0) {
tmp = z * (z * (-0.5 / y));
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = y * 0.5;
} else {
tmp = z * (-0.5 * (z / y));
}
return tmp;
}
def code(x, y, z): t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0) tmp = 0 if t_0 <= 0.0: tmp = z * (z * (-0.5 / y)) elif t_0 <= math.inf: tmp = y * 0.5 else: tmp = z * (-0.5 * (z / y)) return tmp
function code(x, y, z) t_0 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(z * Float64(z * Float64(-0.5 / y))); elseif (t_0 <= Inf) tmp = Float64(y * 0.5); else tmp = Float64(z * Float64(-0.5 * Float64(z / y))); end return tmp end
function tmp_2 = code(x, y, z) t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0); tmp = 0.0; if (t_0 <= 0.0) tmp = z * (z * (-0.5 / y)); elseif (t_0 <= Inf) tmp = y * 0.5; else tmp = z * (-0.5 * (z / y)); end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(z * N[(z * N[(-0.5 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(y * 0.5), $MachinePrecision], N[(z * N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y}\right)\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;y \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(-0.5 \cdot \frac{z}{y}\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0Initial program 80.7%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in z around inf
unpow2N/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6434.6
Applied rewrites34.6%
Applied rewrites34.7%
Applied rewrites34.7%
if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0Initial program 75.4%
Taylor expanded in y around inf
lower-*.f6439.9
Applied rewrites39.9%
if +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) Initial program 0.0%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites100.0%
Taylor expanded in z around inf
unpow2N/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6454.3
Applied rewrites54.3%
Final simplification38.9%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* z (* -0.5 (/ z y))))
(t_1 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
(if (<= t_1 0.0) t_0 (if (<= t_1 INFINITY) (* y 0.5) t_0))))
double code(double x, double y, double z) {
double t_0 = z * (-0.5 * (z / y));
double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_1 <= 0.0) {
tmp = t_0;
} else if (t_1 <= ((double) INFINITY)) {
tmp = y * 0.5;
} else {
tmp = t_0;
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = z * (-0.5 * (z / y));
double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
double tmp;
if (t_1 <= 0.0) {
tmp = t_0;
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = y * 0.5;
} else {
tmp = t_0;
}
return tmp;
}
def code(x, y, z): t_0 = z * (-0.5 * (z / y)) t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0) tmp = 0 if t_1 <= 0.0: tmp = t_0 elif t_1 <= math.inf: tmp = y * 0.5 else: tmp = t_0 return tmp
function code(x, y, z) t_0 = Float64(z * Float64(-0.5 * Float64(z / y))) t_1 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) tmp = 0.0 if (t_1 <= 0.0) tmp = t_0; elseif (t_1 <= Inf) tmp = Float64(y * 0.5); else tmp = t_0; end return tmp end
function tmp_2 = code(x, y, z) t_0 = z * (-0.5 * (z / y)); t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0); tmp = 0.0; if (t_1 <= 0.0) tmp = t_0; elseif (t_1 <= Inf) tmp = y * 0.5; else tmp = t_0; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, Infinity], N[(y * 0.5), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := z \cdot \left(-0.5 \cdot \frac{z}{y}\right)\\
t_1 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\
\mathbf{if}\;t\_1 \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;y \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) Initial program 66.9%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in z around inf
unpow2N/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6438.0
Applied rewrites38.0%
if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0Initial program 75.4%
Taylor expanded in y around inf
lower-*.f6439.9
Applied rewrites39.9%
Final simplification38.9%
(FPCore (x y z) :precision binary64 (if (<= (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)) 0.0) (* z (* z (/ -0.5 y))) (* 0.5 (fma x (/ x y) y))))
double code(double x, double y, double z) {
double tmp;
if (((((x * x) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0) {
tmp = z * (z * (-0.5 / y));
} else {
tmp = 0.5 * fma(x, (x / y), y);
}
return tmp;
}
function code(x, y, z) tmp = 0.0 if (Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) <= 0.0) tmp = Float64(z * Float64(z * Float64(-0.5 / y))); else tmp = Float64(0.5 * fma(x, Float64(x / y), y)); end return tmp end
code[x_, y_, z_] := If[LessEqual[N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision], 0.0], N[(z * N[(z * N[(-0.5 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(x / y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq 0:\\
\;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \mathsf{fma}\left(x, \frac{x}{y}, y\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0Initial program 80.7%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in z around inf
unpow2N/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6434.6
Applied rewrites34.6%
Applied rewrites34.7%
Applied rewrites34.7%
if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) Initial program 62.5%
Taylor expanded in z around 0
*-lft-identityN/A
*-inversesN/A
associate-*l/N/A
associate-*r/N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-*l/N/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
distribute-lft-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-/r/N/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
Applied rewrites62.9%
Final simplification50.1%
(FPCore (x y z) :precision binary64 (* 0.5 (fma (+ x z) (/ (- x z) y) y)))
double code(double x, double y, double z) {
return 0.5 * fma((x + z), ((x - z) / y), y);
}
function code(x, y, z) return Float64(0.5 * fma(Float64(x + z), Float64(Float64(x - z) / y), y)) end
code[x_, y_, z_] := N[(0.5 * N[(N[(x + z), $MachinePrecision] * N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \mathsf{fma}\left(x + z, \frac{x - z}{y}, y\right)
\end{array}
Initial program 70.7%
Taylor expanded in x around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
div-subN/A
sub-negN/A
+-commutativeN/A
unpow2N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
associate-+r+N/A
sub-negN/A
div-subN/A
unpow2N/A
unpow2N/A
difference-of-squaresN/A
associate-/l*N/A
lower-fma.f64N/A
Applied rewrites99.9%
Final simplification99.9%
(FPCore (x y z) :precision binary64 (* y 0.5))
double code(double x, double y, double z) {
return y * 0.5;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = y * 0.5d0
end function
public static double code(double x, double y, double z) {
return y * 0.5;
}
def code(x, y, z): return y * 0.5
function code(x, y, z) return Float64(y * 0.5) end
function tmp = code(x, y, z) tmp = y * 0.5; end
code[x_, y_, z_] := N[(y * 0.5), $MachinePrecision]
\begin{array}{l}
\\
y \cdot 0.5
\end{array}
Initial program 70.7%
Taylor expanded in y around inf
lower-*.f6436.0
Applied rewrites36.0%
Final simplification36.0%
(FPCore (x y z) :precision binary64 (- (* y 0.5) (* (* (/ 0.5 y) (+ z x)) (- z x))))
double code(double x, double y, double z) {
return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (y * 0.5d0) - (((0.5d0 / y) * (z + x)) * (z - x))
end function
public static double code(double x, double y, double z) {
return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x));
}
def code(x, y, z): return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x))
function code(x, y, z) return Float64(Float64(y * 0.5) - Float64(Float64(Float64(0.5 / y) * Float64(z + x)) * Float64(z - x))) end
function tmp = code(x, y, z) tmp = (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x)); end
code[x_, y_, z_] := N[(N[(y * 0.5), $MachinePrecision] - N[(N[(N[(0.5 / y), $MachinePrecision] * N[(z + x), $MachinePrecision]), $MachinePrecision] * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
y \cdot 0.5 - \left(\frac{0.5}{y} \cdot \left(z + x\right)\right) \cdot \left(z - x\right)
\end{array}
herbie shell --seed 2024219
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A"
:precision binary64
:alt
(! :herbie-platform default (- (* y 1/2) (* (* (/ 1/2 y) (+ z x)) (- z x))))
(/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))