
(FPCore (a b_2 c) :precision binary64 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))
double code(double a, double b_2, double c) {
return (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function
public static double code(double a, double b_2, double c) {
return (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}
def code(a, b_2, c): return (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a
function code(a, b_2, c) return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a) end
function tmp = code(a, b_2, c) tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a; end
code[a_, b$95$2_, c_] := N[(N[((-b$95$2) + N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b_2 c) :precision binary64 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))
double code(double a, double b_2, double c) {
return (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function
public static double code(double a, double b_2, double c) {
return (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}
def code(a, b_2, c): return (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a
function code(a, b_2, c) return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a) end
function tmp = code(a, b_2, c) tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a; end
code[a_, b$95$2_, c_] := N[(N[((-b$95$2) + N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}
\end{array}
(FPCore (a b_2 c)
:precision binary64
(if (<= b_2 -1.06e+61)
(/ (* -2.0 b_2) a)
(if (<= b_2 1.15e-37)
(fma (/ 1.0 a) (sqrt (fma (- c) a (* b_2 b_2))) (/ (- b_2) a))
(* -0.5 (/ c b_2)))))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -1.06e+61) {
tmp = (-2.0 * b_2) / a;
} else if (b_2 <= 1.15e-37) {
tmp = fma((1.0 / a), sqrt(fma(-c, a, (b_2 * b_2))), (-b_2 / a));
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -1.06e+61) tmp = Float64(Float64(-2.0 * b_2) / a); elseif (b_2 <= 1.15e-37) tmp = fma(Float64(1.0 / a), sqrt(fma(Float64(-c), a, Float64(b_2 * b_2))), Float64(Float64(-b_2) / a)); else tmp = Float64(-0.5 * Float64(c / b_2)); end return tmp end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.06e+61], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1.15e-37], N[(N[(1.0 / a), $MachinePrecision] * N[Sqrt[N[((-c) * a + N[(b$95$2 * b$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[((-b$95$2) / a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -1.06 \cdot 10^{+61}:\\
\;\;\;\;\frac{-2 \cdot b\_2}{a}\\
\mathbf{elif}\;b\_2 \leq 1.15 \cdot 10^{-37}:\\
\;\;\;\;\mathsf{fma}\left(\frac{1}{a}, \sqrt{\mathsf{fma}\left(-c, a, b\_2 \cdot b\_2\right)}, \frac{-b\_2}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\
\end{array}
\end{array}
if b_2 < -1.0599999999999999e61Initial program 59.7%
Taylor expanded in b_2 around -inf
lower-*.f6495.2
Applied rewrites95.2%
if -1.0599999999999999e61 < b_2 < 1.15e-37Initial program 77.8%
Taylor expanded in b_2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6438.0
lift-+.f64N/A
+-commutativeN/A
lift-neg.f64N/A
unsub-negN/A
lower--.f6438.0
Applied rewrites39.2%
Taylor expanded in a around 0
Applied rewrites77.6%
lift-*.f64N/A
lift--.f64N/A
sub-negN/A
lift-neg.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
lower-fma.f6477.8
Applied rewrites77.8%
if 1.15e-37 < b_2 Initial program 21.6%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f6488.4
Applied rewrites88.4%
Final simplification85.1%
(FPCore (a b_2 c)
:precision binary64
(if (<= b_2 -1.06e+61)
(/ (* -2.0 b_2) a)
(if (<= b_2 1.15e-37)
(/ (- (sqrt (fma (- c) a (* b_2 b_2))) b_2) a)
(* -0.5 (/ c b_2)))))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -1.06e+61) {
tmp = (-2.0 * b_2) / a;
} else if (b_2 <= 1.15e-37) {
tmp = (sqrt(fma(-c, a, (b_2 * b_2))) - b_2) / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -1.06e+61) tmp = Float64(Float64(-2.0 * b_2) / a); elseif (b_2 <= 1.15e-37) tmp = Float64(Float64(sqrt(fma(Float64(-c), a, Float64(b_2 * b_2))) - b_2) / a); else tmp = Float64(-0.5 * Float64(c / b_2)); end return tmp end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.06e+61], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1.15e-37], N[(N[(N[Sqrt[N[((-c) * a + N[(b$95$2 * b$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -1.06 \cdot 10^{+61}:\\
\;\;\;\;\frac{-2 \cdot b\_2}{a}\\
\mathbf{elif}\;b\_2 \leq 1.15 \cdot 10^{-37}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-c, a, b\_2 \cdot b\_2\right)} - b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\
\end{array}
\end{array}
if b_2 < -1.0599999999999999e61Initial program 59.7%
Taylor expanded in b_2 around -inf
lower-*.f6495.2
Applied rewrites95.2%
if -1.0599999999999999e61 < b_2 < 1.15e-37Initial program 77.8%
Taylor expanded in b_2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6438.0
lift-+.f64N/A
+-commutativeN/A
lift-neg.f64N/A
unsub-negN/A
lower--.f6438.0
Applied rewrites39.2%
Taylor expanded in a around 0
Applied rewrites77.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6477.8
Applied rewrites77.8%
if 1.15e-37 < b_2 Initial program 21.6%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f6488.4
Applied rewrites88.4%
Final simplification85.1%
(FPCore (a b_2 c) :precision binary64 (if (<= b_2 -7.6e-124) (/ (* -2.0 b_2) a) (if (<= b_2 5.9e-38) (/ (- (sqrt (* (- a) c)) b_2) a) (* -0.5 (/ c b_2)))))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -7.6e-124) {
tmp = (-2.0 * b_2) / a;
} else if (b_2 <= 5.9e-38) {
tmp = (sqrt((-a * c)) - b_2) / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
real(8) :: tmp
if (b_2 <= (-7.6d-124)) then
tmp = ((-2.0d0) * b_2) / a
else if (b_2 <= 5.9d-38) then
tmp = (sqrt((-a * c)) - b_2) / a
else
tmp = (-0.5d0) * (c / b_2)
end if
code = tmp
end function
public static double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -7.6e-124) {
tmp = (-2.0 * b_2) / a;
} else if (b_2 <= 5.9e-38) {
tmp = (Math.sqrt((-a * c)) - b_2) / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
def code(a, b_2, c): tmp = 0 if b_2 <= -7.6e-124: tmp = (-2.0 * b_2) / a elif b_2 <= 5.9e-38: tmp = (math.sqrt((-a * c)) - b_2) / a else: tmp = -0.5 * (c / b_2) return tmp
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -7.6e-124) tmp = Float64(Float64(-2.0 * b_2) / a); elseif (b_2 <= 5.9e-38) tmp = Float64(Float64(sqrt(Float64(Float64(-a) * c)) - b_2) / a); else tmp = Float64(-0.5 * Float64(c / b_2)); end return tmp end
function tmp_2 = code(a, b_2, c) tmp = 0.0; if (b_2 <= -7.6e-124) tmp = (-2.0 * b_2) / a; elseif (b_2 <= 5.9e-38) tmp = (sqrt((-a * c)) - b_2) / a; else tmp = -0.5 * (c / b_2); end tmp_2 = tmp; end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -7.6e-124], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 5.9e-38], N[(N[(N[Sqrt[N[((-a) * c), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -7.6 \cdot 10^{-124}:\\
\;\;\;\;\frac{-2 \cdot b\_2}{a}\\
\mathbf{elif}\;b\_2 \leq 5.9 \cdot 10^{-38}:\\
\;\;\;\;\frac{\sqrt{\left(-a\right) \cdot c} - b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\
\end{array}
\end{array}
if b_2 < -7.60000000000000025e-124Initial program 69.1%
Taylor expanded in b_2 around -inf
lower-*.f6480.5
Applied rewrites80.5%
if -7.60000000000000025e-124 < b_2 < 5.89999999999999983e-38Initial program 74.8%
Taylor expanded in b_2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6419.4
Applied rewrites19.4%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6419.4
lift-+.f64N/A
+-commutativeN/A
lift-neg.f64N/A
unsub-negN/A
lower--.f6419.4
Applied rewrites21.2%
Taylor expanded in a around inf
Applied rewrites70.3%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6470.3
Applied rewrites70.3%
if 5.89999999999999983e-38 < b_2 Initial program 21.6%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f6488.4
Applied rewrites88.4%
Final simplification79.7%
(FPCore (a b_2 c) :precision binary64 (if (<= b_2 -5e-310) (/ (* -2.0 b_2) a) (* -0.5 (/ c b_2))))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = (-2.0 * b_2) / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
real(8) :: tmp
if (b_2 <= (-5d-310)) then
tmp = ((-2.0d0) * b_2) / a
else
tmp = (-0.5d0) * (c / b_2)
end if
code = tmp
end function
public static double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = (-2.0 * b_2) / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
def code(a, b_2, c): tmp = 0 if b_2 <= -5e-310: tmp = (-2.0 * b_2) / a else: tmp = -0.5 * (c / b_2) return tmp
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -5e-310) tmp = Float64(Float64(-2.0 * b_2) / a); else tmp = Float64(-0.5 * Float64(c / b_2)); end return tmp end
function tmp_2 = code(a, b_2, c) tmp = 0.0; if (b_2 <= -5e-310) tmp = (-2.0 * b_2) / a; else tmp = -0.5 * (c / b_2); end tmp_2 = tmp; end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-310], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{-2 \cdot b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\
\end{array}
\end{array}
if b_2 < -4.999999999999985e-310Initial program 72.9%
Taylor expanded in b_2 around -inf
lower-*.f6463.6
Applied rewrites63.6%
if -4.999999999999985e-310 < b_2 Initial program 39.1%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f6465.2
Applied rewrites65.2%
Final simplification64.4%
(FPCore (a b_2 c) :precision binary64 (if (<= b_2 -5e-310) (/ (- b_2) a) (* -0.5 (/ c b_2))))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = -b_2 / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
real(8) :: tmp
if (b_2 <= (-5d-310)) then
tmp = -b_2 / a
else
tmp = (-0.5d0) * (c / b_2)
end if
code = tmp
end function
public static double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = -b_2 / a;
} else {
tmp = -0.5 * (c / b_2);
}
return tmp;
}
def code(a, b_2, c): tmp = 0 if b_2 <= -5e-310: tmp = -b_2 / a else: tmp = -0.5 * (c / b_2) return tmp
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -5e-310) tmp = Float64(Float64(-b_2) / a); else tmp = Float64(-0.5 * Float64(c / b_2)); end return tmp end
function tmp_2 = code(a, b_2, c) tmp = 0.0; if (b_2 <= -5e-310) tmp = -b_2 / a; else tmp = -0.5 * (c / b_2); end tmp_2 = tmp; end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-310], N[((-b$95$2) / a), $MachinePrecision], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{-b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\
\end{array}
\end{array}
if b_2 < -4.999999999999985e-310Initial program 72.9%
Applied rewrites18.9%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6418.9
lift-+.f64N/A
+-commutativeN/A
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
sqrt-prodN/A
Applied rewrites27.5%
Taylor expanded in b_2 around inf
associate-*r/N/A
mul-1-negN/A
lower-/.f64N/A
lower-neg.f6424.2
Applied rewrites24.2%
if -4.999999999999985e-310 < b_2 Initial program 39.1%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f6465.2
Applied rewrites65.2%
Final simplification44.4%
(FPCore (a b_2 c) :precision binary64 (if (<= b_2 -5e-310) (/ (- b_2) a) (* (/ -0.5 b_2) c)))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = -b_2 / a;
} else {
tmp = (-0.5 / b_2) * c;
}
return tmp;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
real(8) :: tmp
if (b_2 <= (-5d-310)) then
tmp = -b_2 / a
else
tmp = ((-0.5d0) / b_2) * c
end if
code = tmp
end function
public static double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = -b_2 / a;
} else {
tmp = (-0.5 / b_2) * c;
}
return tmp;
}
def code(a, b_2, c): tmp = 0 if b_2 <= -5e-310: tmp = -b_2 / a else: tmp = (-0.5 / b_2) * c return tmp
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -5e-310) tmp = Float64(Float64(-b_2) / a); else tmp = Float64(Float64(-0.5 / b_2) * c); end return tmp end
function tmp_2 = code(a, b_2, c) tmp = 0.0; if (b_2 <= -5e-310) tmp = -b_2 / a; else tmp = (-0.5 / b_2) * c; end tmp_2 = tmp; end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-310], N[((-b$95$2) / a), $MachinePrecision], N[(N[(-0.5 / b$95$2), $MachinePrecision] * c), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{-b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{-0.5}{b\_2} \cdot c\\
\end{array}
\end{array}
if b_2 < -4.999999999999985e-310Initial program 72.9%
Applied rewrites18.9%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6418.9
lift-+.f64N/A
+-commutativeN/A
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
sqrt-prodN/A
Applied rewrites27.5%
Taylor expanded in b_2 around inf
associate-*r/N/A
mul-1-negN/A
lower-/.f64N/A
lower-neg.f6424.2
Applied rewrites24.2%
if -4.999999999999985e-310 < b_2 Initial program 39.1%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f6465.2
Applied rewrites65.2%
Applied rewrites65.0%
Final simplification44.3%
(FPCore (a b_2 c) :precision binary64 (if (<= b_2 -5e-310) (/ (- b_2) a) 0.0))
double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = -b_2 / a;
} else {
tmp = 0.0;
}
return tmp;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
real(8) :: tmp
if (b_2 <= (-5d-310)) then
tmp = -b_2 / a
else
tmp = 0.0d0
end if
code = tmp
end function
public static double code(double a, double b_2, double c) {
double tmp;
if (b_2 <= -5e-310) {
tmp = -b_2 / a;
} else {
tmp = 0.0;
}
return tmp;
}
def code(a, b_2, c): tmp = 0 if b_2 <= -5e-310: tmp = -b_2 / a else: tmp = 0.0 return tmp
function code(a, b_2, c) tmp = 0.0 if (b_2 <= -5e-310) tmp = Float64(Float64(-b_2) / a); else tmp = 0.0; end return tmp end
function tmp_2 = code(a, b_2, c) tmp = 0.0; if (b_2 <= -5e-310) tmp = -b_2 / a; else tmp = 0.0; end tmp_2 = tmp; end
code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-310], N[((-b$95$2) / a), $MachinePrecision], 0.0]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{-b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if b_2 < -4.999999999999985e-310Initial program 72.9%
Applied rewrites18.9%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6418.9
lift-+.f64N/A
+-commutativeN/A
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
sqrt-prodN/A
Applied rewrites27.5%
Taylor expanded in b_2 around inf
associate-*r/N/A
mul-1-negN/A
lower-/.f64N/A
lower-neg.f6424.2
Applied rewrites24.2%
if -4.999999999999985e-310 < b_2 Initial program 39.1%
Taylor expanded in b_2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6421.9
Applied rewrites21.9%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6422.0
lift-+.f64N/A
+-commutativeN/A
lift-neg.f64N/A
unsub-negN/A
lower--.f6422.0
Applied rewrites22.4%
lift-*.f64N/A
lift--.f64N/A
sub-negN/A
lift-neg.f64N/A
distribute-lft-inN/A
lower-fma.f64N/A
Applied rewrites15.5%
Taylor expanded in c around 0
distribute-lft1-inN/A
metadata-evalN/A
mul0-lft19.7
Applied rewrites19.7%
(FPCore (a b_2 c) :precision binary64 0.0)
double code(double a, double b_2, double c) {
return 0.0;
}
real(8) function code(a, b_2, c)
real(8), intent (in) :: a
real(8), intent (in) :: b_2
real(8), intent (in) :: c
code = 0.0d0
end function
public static double code(double a, double b_2, double c) {
return 0.0;
}
def code(a, b_2, c): return 0.0
function code(a, b_2, c) return 0.0 end
function tmp = code(a, b_2, c) tmp = 0.0; end
code[a_, b$95$2_, c_] := 0.0
\begin{array}{l}
\\
0
\end{array}
Initial program 56.3%
Taylor expanded in b_2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6437.6
Applied rewrites37.6%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6437.6
lift-+.f64N/A
+-commutativeN/A
lift-neg.f64N/A
unsub-negN/A
lower--.f6437.6
Applied rewrites38.1%
lift-*.f64N/A
lift--.f64N/A
sub-negN/A
lift-neg.f64N/A
distribute-lft-inN/A
lower-fma.f64N/A
Applied rewrites34.7%
Taylor expanded in c around 0
distribute-lft1-inN/A
metadata-evalN/A
mul0-lft11.0
Applied rewrites11.0%
(FPCore (a b_2 c)
:precision binary64
(let* ((t_0 (* (sqrt (fabs a)) (sqrt (fabs c))))
(t_1
(if (== (copysign a c) a)
(* (sqrt (- (fabs b_2) t_0)) (sqrt (+ (fabs b_2) t_0)))
(hypot b_2 t_0))))
(if (< b_2 0.0) (/ (- t_1 b_2) a) (/ (- c) (+ b_2 t_1)))))
double code(double a, double b_2, double c) {
double t_0 = sqrt(fabs(a)) * sqrt(fabs(c));
double tmp;
if (copysign(a, c) == a) {
tmp = sqrt((fabs(b_2) - t_0)) * sqrt((fabs(b_2) + t_0));
} else {
tmp = hypot(b_2, t_0);
}
double t_1 = tmp;
double tmp_1;
if (b_2 < 0.0) {
tmp_1 = (t_1 - b_2) / a;
} else {
tmp_1 = -c / (b_2 + t_1);
}
return tmp_1;
}
public static double code(double a, double b_2, double c) {
double t_0 = Math.sqrt(Math.abs(a)) * Math.sqrt(Math.abs(c));
double tmp;
if (Math.copySign(a, c) == a) {
tmp = Math.sqrt((Math.abs(b_2) - t_0)) * Math.sqrt((Math.abs(b_2) + t_0));
} else {
tmp = Math.hypot(b_2, t_0);
}
double t_1 = tmp;
double tmp_1;
if (b_2 < 0.0) {
tmp_1 = (t_1 - b_2) / a;
} else {
tmp_1 = -c / (b_2 + t_1);
}
return tmp_1;
}
def code(a, b_2, c): t_0 = math.sqrt(math.fabs(a)) * math.sqrt(math.fabs(c)) tmp = 0 if math.copysign(a, c) == a: tmp = math.sqrt((math.fabs(b_2) - t_0)) * math.sqrt((math.fabs(b_2) + t_0)) else: tmp = math.hypot(b_2, t_0) t_1 = tmp tmp_1 = 0 if b_2 < 0.0: tmp_1 = (t_1 - b_2) / a else: tmp_1 = -c / (b_2 + t_1) return tmp_1
function code(a, b_2, c) t_0 = Float64(sqrt(abs(a)) * sqrt(abs(c))) tmp = 0.0 if (copysign(a, c) == a) tmp = Float64(sqrt(Float64(abs(b_2) - t_0)) * sqrt(Float64(abs(b_2) + t_0))); else tmp = hypot(b_2, t_0); end t_1 = tmp tmp_1 = 0.0 if (b_2 < 0.0) tmp_1 = Float64(Float64(t_1 - b_2) / a); else tmp_1 = Float64(Float64(-c) / Float64(b_2 + t_1)); end return tmp_1 end
function tmp_3 = code(a, b_2, c) t_0 = sqrt(abs(a)) * sqrt(abs(c)); tmp = 0.0; if ((sign(c) * abs(a)) == a) tmp = sqrt((abs(b_2) - t_0)) * sqrt((abs(b_2) + t_0)); else tmp = hypot(b_2, t_0); end t_1 = tmp; tmp_2 = 0.0; if (b_2 < 0.0) tmp_2 = (t_1 - b_2) / a; else tmp_2 = -c / (b_2 + t_1); end tmp_3 = tmp_2; end
code[a_, b$95$2_, c_] := Block[{t$95$0 = N[(N[Sqrt[N[Abs[a], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[c], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = If[Equal[N[With[{TMP1 = Abs[a], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], a], N[(N[Sqrt[N[(N[Abs[b$95$2], $MachinePrecision] - t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[Abs[b$95$2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[b$95$2 ^ 2 + t$95$0 ^ 2], $MachinePrecision]]}, If[Less[b$95$2, 0.0], N[(N[(t$95$1 - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[((-c) / N[(b$95$2 + t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sqrt{\left|a\right|} \cdot \sqrt{\left|c\right|}\\
t_1 := \begin{array}{l}
\mathbf{if}\;\mathsf{copysign}\left(a, c\right) = a:\\
\;\;\;\;\sqrt{\left|b\_2\right| - t\_0} \cdot \sqrt{\left|b\_2\right| + t\_0}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(b\_2, t\_0\right)\\
\end{array}\\
\mathbf{if}\;b\_2 < 0:\\
\;\;\;\;\frac{t\_1 - b\_2}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{-c}{b\_2 + t\_1}\\
\end{array}
\end{array}
herbie shell --seed 2024236
(FPCore (a b_2 c)
:name "quad2p (problem 3.2.1, positive)"
:precision binary64
:herbie-expected 10
:alt
(! :herbie-platform default (let ((sqtD (let ((x (* (sqrt (fabs a)) (sqrt (fabs c))))) (if (== (copysign a c) a) (* (sqrt (- (fabs b_2) x)) (sqrt (+ (fabs b_2) x))) (hypot b_2 x))))) (if (< b_2 0) (/ (- sqtD b_2) a) (/ (- c) (+ b_2 sqtD)))))
(/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))