
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* F t_0))
(t_2 (fma -4.0 (* A C) (pow B_m 2.0)))
(t_3 (- t_0))
(t_4 (* (* 4.0 A) C))
(t_5
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_4) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_4 (pow B_m 2.0)))))
(if (<= t_5 (- INFINITY))
(-
(pow
(sqrt (sqrt (* 2.0 (* F (/ (+ C (+ A (hypot B_m (- A C)))) t_2)))))
2.0))
(if (<= t_5 -5e-217)
(/ (* (sqrt (* 2.0 t_1)) (sqrt (+ A (+ C (hypot (- A C) B_m))))) t_3)
(if (<= t_5 1e+134)
(/ (sqrt (* t_1 (- (* 4.0 C) (/ (pow B_m 2.0) A)))) t_3)
(if (<= t_5 INFINITY)
(* 0.5 (/ (sqrt (* F (/ t_2 C))) A))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = F * t_0;
double t_2 = fma(-4.0, (A * C), pow(B_m, 2.0));
double t_3 = -t_0;
double t_4 = (4.0 * A) * C;
double t_5 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_4) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_4 - pow(B_m, 2.0));
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = -pow(sqrt(sqrt((2.0 * (F * ((C + (A + hypot(B_m, (A - C)))) / t_2))))), 2.0);
} else if (t_5 <= -5e-217) {
tmp = (sqrt((2.0 * t_1)) * sqrt((A + (C + hypot((A - C), B_m))))) / t_3;
} else if (t_5 <= 1e+134) {
tmp = sqrt((t_1 * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / t_3;
} else if (t_5 <= ((double) INFINITY)) {
tmp = 0.5 * (sqrt((F * (t_2 / C))) / A);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(F * t_0) t_2 = fma(-4.0, Float64(A * C), (B_m ^ 2.0)) t_3 = Float64(-t_0) t_4 = Float64(Float64(4.0 * A) * C) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_4) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_4 - (B_m ^ 2.0))) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(-(sqrt(sqrt(Float64(2.0 * Float64(F * Float64(Float64(C + Float64(A + hypot(B_m, Float64(A - C)))) / t_2))))) ^ 2.0)); elseif (t_5 <= -5e-217) tmp = Float64(Float64(sqrt(Float64(2.0 * t_1)) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / t_3); elseif (t_5 <= 1e+134) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(4.0 * C) - Float64((B_m ^ 2.0) / A)))) / t_3); elseif (t_5 <= Inf) tmp = Float64(0.5 * Float64(sqrt(Float64(F * Float64(t_2 / C))) / A)); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, Block[{t$95$4 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$4), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$4 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], (-N[Power[N[Sqrt[N[Sqrt[N[(2.0 * N[(F * N[(N[(C + N[(A + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), If[LessEqual[t$95$5, -5e-217], N[(N[(N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, 1e+134], N[(N[Sqrt[N[(t$95$1 * N[(N[(4.0 * C), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(0.5 * N[(N[Sqrt[N[(F * N[(t$95$2 / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := F \cdot t\_0\\
t_2 := \mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)\\
t_3 := -t\_0\\
t_4 := \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_4\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_4 - {B\_m}^{2}}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;-{\left(\sqrt{\sqrt{2 \cdot \left(F \cdot \frac{C + \left(A + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{t\_2}\right)}}\right)}^{2}\\
\mathbf{elif}\;t\_5 \leq -5 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{2 \cdot t\_1} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq 10^{+134}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(4 \cdot C - \frac{{B\_m}^{2}}{A}\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;0.5 \cdot \frac{\sqrt{F \cdot \frac{t\_2}{C}}}{A}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
Taylor expanded in F around 0 25.4%
Simplified61.7%
add-sqr-sqrt61.3%
pow261.3%
sqrt-unprod61.5%
associate-+l+63.5%
Applied egg-rr63.5%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-217Initial program 95.3%
Simplified95.4%
associate-*r*95.4%
associate-+r+95.3%
hypot-undefine95.3%
unpow295.3%
unpow295.3%
+-commutative95.3%
sqrt-prod97.3%
*-commutative97.3%
associate-+l+97.4%
Applied egg-rr97.4%
if -5.0000000000000002e-217 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.99999999999999921e133Initial program 20.1%
Simplified22.4%
Taylor expanded in A around -inf 43.5%
associate-*r/43.5%
Applied egg-rr43.5%
mul-1-neg43.5%
distribute-neg-frac43.5%
distribute-neg-frac243.5%
Simplified43.5%
if 9.99999999999999921e133 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 3.6%
Simplified37.8%
Taylor expanded in A around -inf 15.3%
*-commutative15.3%
Simplified15.3%
Taylor expanded in B around 0 15.3%
associate-*r*15.3%
Simplified15.3%
Taylor expanded in F around 0 32.8%
associate-*l/32.8%
*-lft-identity32.8%
associate-/l*44.0%
fma-define44.0%
Simplified44.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf 18.2%
mul-1-neg18.2%
*-commutative18.2%
Simplified18.2%
sqrt-div22.4%
Applied egg-rr22.4%
associate-*r/22.3%
pow1/222.3%
pow1/222.3%
pow-prod-down22.4%
Applied egg-rr22.4%
unpow1/222.4%
*-commutative22.4%
Simplified22.4%
Final simplification44.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.15e-168)
(* (sqrt (* t_0 (* F (* 4.0 C)))) (/ -1.0 t_0))
(if (<= B_m 4.7e+109)
(/
(* (sqrt (* 2.0 (* F t_0))) (sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- t_0))
(- (* (sqrt (* 2.0 F)) (pow B_m -0.5)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.15e-168) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) * (-1.0 / t_0);
} else if (B_m <= 4.7e+109) {
tmp = (sqrt((2.0 * (F * t_0))) * sqrt((A + (C + hypot((A - C), B_m))))) / -t_0;
} else {
tmp = -(sqrt((2.0 * F)) * pow(B_m, -0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 1.15e-168) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) * Float64(-1.0 / t_0)); elseif (B_m <= 4.7e+109) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-t_0)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) * (B_m ^ -0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.15e-168], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.7e+109], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 1.15 \cdot 10^{-168}:\\
\;\;\;\;\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;B\_m \leq 4.7 \cdot 10^{+109}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot F} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if B < 1.14999999999999993e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
div-inv20.7%
associate-*l*20.8%
Applied egg-rr20.8%
if 1.14999999999999993e-168 < B < 4.69999999999999998e109Initial program 23.2%
Simplified31.8%
associate-*r*31.8%
associate-+r+30.6%
hypot-undefine23.2%
unpow223.2%
unpow223.2%
+-commutative23.2%
sqrt-prod31.4%
*-commutative31.4%
associate-+l+32.0%
Applied egg-rr44.5%
if 4.69999999999999998e109 < B Initial program 7.3%
Taylor expanded in B around inf 53.9%
mul-1-neg53.9%
*-commutative53.9%
Simplified53.9%
sqrt-div71.6%
Applied egg-rr71.6%
associate-*r/71.5%
pow1/271.5%
pow1/271.5%
pow-prod-down71.8%
Applied egg-rr71.8%
unpow1/271.8%
*-commutative71.8%
Simplified71.8%
div-inv71.7%
pow1/271.7%
pow-flip71.7%
metadata-eval71.7%
Applied egg-rr71.7%
Final simplification34.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.55e-168)
(* (sqrt (* t_0 (* F (* 4.0 C)))) (/ -1.0 t_0))
(if (<= B_m 1.85e+109)
(*
(sqrt (* 2.0 (* F t_0)))
(/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) (- t_0)))
(- (* (sqrt (* 2.0 F)) (pow B_m -0.5)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.55e-168) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) * (-1.0 / t_0);
} else if (B_m <= 1.85e+109) {
tmp = sqrt((2.0 * (F * t_0))) * (sqrt(((A + C) + hypot((A - C), B_m))) / -t_0);
} else {
tmp = -(sqrt((2.0 * F)) * pow(B_m, -0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 1.55e-168) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) * Float64(-1.0 / t_0)); elseif (B_m <= 1.85e+109) tmp = Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / Float64(-t_0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) * (B_m ^ -0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.55e-168], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.85e+109], N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 1.55 \cdot 10^{-168}:\\
\;\;\;\;\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;B\_m \leq 1.85 \cdot 10^{+109}:\\
\;\;\;\;\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot F} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if B < 1.55e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
div-inv20.7%
associate-*l*20.8%
Applied egg-rr20.8%
if 1.55e-168 < B < 1.8500000000000001e109Initial program 23.2%
Simplified31.8%
associate-*r*31.8%
associate-+r+30.6%
hypot-undefine23.2%
unpow223.2%
unpow223.2%
+-commutative23.2%
sqrt-prod31.4%
*-commutative31.4%
associate-+l+32.0%
Applied egg-rr44.5%
associate-/l*44.6%
*-commutative44.6%
*-commutative44.6%
*-commutative44.6%
associate-+r+43.5%
Applied egg-rr43.5%
if 1.8500000000000001e109 < B Initial program 7.3%
Taylor expanded in B around inf 53.9%
mul-1-neg53.9%
*-commutative53.9%
Simplified53.9%
sqrt-div71.6%
Applied egg-rr71.6%
associate-*r/71.5%
pow1/271.5%
pow1/271.5%
pow-prod-down71.8%
Applied egg-rr71.8%
unpow1/271.8%
*-commutative71.8%
Simplified71.8%
div-inv71.7%
pow1/271.7%
pow-flip71.7%
metadata-eval71.7%
Applied egg-rr71.7%
Final simplification34.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 5e+57)
(* 0.5 (/ (sqrt (* F (/ (fma -4.0 (* A C) (pow B_m 2.0)) C))) A))
(if (<= (pow B_m 2.0) 1e+143)
(- (sqrt (/ F (- A))))
(- (* (sqrt (* 2.0 F)) (pow B_m -0.5))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e+57) {
tmp = 0.5 * (sqrt((F * (fma(-4.0, (A * C), pow(B_m, 2.0)) / C))) / A);
} else if (pow(B_m, 2.0) <= 1e+143) {
tmp = -sqrt((F / -A));
} else {
tmp = -(sqrt((2.0 * F)) * pow(B_m, -0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+57) tmp = Float64(0.5 * Float64(sqrt(Float64(F * Float64(fma(-4.0, Float64(A * C), (B_m ^ 2.0)) / C))) / A)); elseif ((B_m ^ 2.0) <= 1e+143) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) * (B_m ^ -0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+57], N[(0.5 * N[(N[Sqrt[N[(F * N[(N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+143], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+57}:\\
\;\;\;\;0.5 \cdot \frac{\sqrt{F \cdot \frac{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}{C}}}{A}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+143}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot F} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999972e57Initial program 19.3%
Simplified27.6%
Taylor expanded in A around -inf 29.0%
*-commutative29.0%
Simplified29.0%
Taylor expanded in B around 0 26.2%
associate-*r*26.2%
Simplified26.2%
Taylor expanded in F around 0 22.0%
associate-*l/22.0%
*-lft-identity22.0%
associate-/l*27.3%
fma-define27.3%
Simplified27.3%
if 4.99999999999999972e57 < (pow.f64 B #s(literal 2 binary64)) < 1e143Initial program 32.5%
Simplified33.4%
Taylor expanded in A around -inf 7.1%
Taylor expanded in F around 0 13.6%
Taylor expanded in B around 0 13.6%
mul-1-neg13.6%
Simplified13.6%
if 1e143 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.3%
Taylor expanded in B around inf 29.5%
mul-1-neg29.5%
*-commutative29.5%
Simplified29.5%
sqrt-div35.6%
Applied egg-rr35.6%
associate-*r/35.6%
pow1/235.6%
pow1/235.6%
pow-prod-down35.7%
Applied egg-rr35.7%
unpow1/235.7%
*-commutative35.7%
Simplified35.7%
div-inv35.7%
pow1/235.7%
pow-flip35.7%
metadata-eval35.7%
Applied egg-rr35.7%
Final simplification29.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.55e-142)
(/ -1.0 (/ t_0 (sqrt (* t_0 (* F (* 4.0 C))))))
(if (<= B_m 1.85e+72)
(- (sqrt (/ F (- A))))
(- (* (sqrt (* 2.0 F)) (pow B_m -0.5)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.55e-142) {
tmp = -1.0 / (t_0 / sqrt((t_0 * (F * (4.0 * C)))));
} else if (B_m <= 1.85e+72) {
tmp = -sqrt((F / -A));
} else {
tmp = -(sqrt((2.0 * F)) * pow(B_m, -0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 1.55e-142) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))))); elseif (B_m <= 1.85e+72) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) * (B_m ^ -0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.55e-142], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.85e+72], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 1.55 \cdot 10^{-142}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}}\\
\mathbf{elif}\;B\_m \leq 1.85 \cdot 10^{+72}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot F} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if B < 1.55e-142Initial program 17.7%
Simplified22.7%
Taylor expanded in A around -inf 21.4%
*-commutative21.4%
Simplified21.4%
clear-num21.3%
inv-pow21.3%
associate-*l*21.4%
Applied egg-rr21.4%
unpow-121.4%
Simplified21.4%
if 1.55e-142 < B < 1.8500000000000001e72Initial program 23.2%
Simplified33.8%
Taylor expanded in A around -inf 17.6%
Taylor expanded in F around 0 14.4%
Taylor expanded in B around 0 14.2%
mul-1-neg14.2%
Simplified14.2%
if 1.8500000000000001e72 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
sqrt-div69.2%
Applied egg-rr69.2%
associate-*r/69.1%
pow1/269.1%
pow1/269.1%
pow-prod-down69.4%
Applied egg-rr69.4%
unpow1/269.4%
*-commutative69.4%
Simplified69.4%
div-inv69.3%
pow1/269.3%
pow-flip69.3%
metadata-eval69.3%
Applied egg-rr69.3%
Final simplification29.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2e-168)
(/
(sqrt (* (* F (fma B_m B_m (* A (* C -4.0)))) (* 4.0 C)))
(* (* 4.0 A) C))
(if (<= B_m 7.2e+72)
(- (sqrt (/ F (- A))))
(- (* (sqrt (* 2.0 F)) (pow B_m -0.5))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2e-168) {
tmp = sqrt(((F * fma(B_m, B_m, (A * (C * -4.0)))) * (4.0 * C))) / ((4.0 * A) * C);
} else if (B_m <= 7.2e+72) {
tmp = -sqrt((F / -A));
} else {
tmp = -(sqrt((2.0 * F)) * pow(B_m, -0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2e-168) tmp = Float64(sqrt(Float64(Float64(F * fma(B_m, B_m, Float64(A * Float64(C * -4.0)))) * Float64(4.0 * C))) / Float64(Float64(4.0 * A) * C)); elseif (B_m <= 7.2e+72) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) * (B_m ^ -0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2e-168], N[(N[Sqrt[N[(N[(F * N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 7.2e+72], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2 \cdot 10^{-168}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\right) \cdot \left(4 \cdot C\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 7.2 \cdot 10^{+72}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot F} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if B < 2.0000000000000001e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
Taylor expanded in B around 0 19.8%
associate-*r*19.8%
Simplified19.8%
if 2.0000000000000001e-168 < B < 7.20000000000000069e72Initial program 23.1%
Simplified32.6%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 15.2%
Taylor expanded in B around 0 15.1%
mul-1-neg15.1%
Simplified15.1%
if 7.20000000000000069e72 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
sqrt-div69.2%
Applied egg-rr69.2%
associate-*r/69.1%
pow1/269.1%
pow1/269.1%
pow-prod-down69.4%
Applied egg-rr69.4%
unpow1/269.4%
*-commutative69.4%
Simplified69.4%
div-inv69.3%
pow1/269.3%
pow-flip69.3%
metadata-eval69.3%
Applied egg-rr69.3%
Final simplification29.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.2e-168)
(/ (sqrt (* (* 4.0 C) (* (* A -4.0) (* C F)))) (* (* 4.0 A) C))
(if (<= B_m 4.3e+72)
(- (sqrt (/ F (- A))))
(- (* (sqrt (* 2.0 F)) (pow B_m -0.5))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.2e-168) {
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 4.3e+72) {
tmp = -sqrt((F / -A));
} else {
tmp = -(sqrt((2.0 * F)) * pow(B_m, -0.5));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.2d-168) then
tmp = sqrt(((4.0d0 * c) * ((a * (-4.0d0)) * (c * f)))) / ((4.0d0 * a) * c)
else if (b_m <= 4.3d+72) then
tmp = -sqrt((f / -a))
else
tmp = -(sqrt((2.0d0 * f)) * (b_m ** (-0.5d0)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.2e-168) {
tmp = Math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 4.3e+72) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -(Math.sqrt((2.0 * F)) * Math.pow(B_m, -0.5));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.2e-168: tmp = math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C) elif B_m <= 4.3e+72: tmp = -math.sqrt((F / -A)) else: tmp = -(math.sqrt((2.0 * F)) * math.pow(B_m, -0.5)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.2e-168) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(Float64(A * -4.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); elseif (B_m <= 4.3e+72) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) * (B_m ^ -0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.2e-168)
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
elseif (B_m <= 4.3e+72)
tmp = -sqrt((F / -A));
else
tmp = -(sqrt((2.0 * F)) * (B_m ^ -0.5));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.2e-168], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(N[(A * -4.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.3e+72], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.2 \cdot 10^{-168}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(\left(A \cdot -4\right) \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 4.3 \cdot 10^{+72}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot F} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if B < 3.20000000000000006e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
Taylor expanded in B around 0 19.8%
associate-*r*19.8%
Simplified19.8%
Taylor expanded in B around 0 19.6%
associate-*r*19.6%
Simplified19.6%
if 3.20000000000000006e-168 < B < 4.3000000000000001e72Initial program 23.1%
Simplified32.6%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 15.2%
Taylor expanded in B around 0 15.1%
mul-1-neg15.1%
Simplified15.1%
if 4.3000000000000001e72 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
sqrt-div69.2%
Applied egg-rr69.2%
associate-*r/69.1%
pow1/269.1%
pow1/269.1%
pow-prod-down69.4%
Applied egg-rr69.4%
unpow1/269.4%
*-commutative69.4%
Simplified69.4%
div-inv69.3%
pow1/269.3%
pow-flip69.3%
metadata-eval69.3%
Applied egg-rr69.3%
Final simplification28.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1.65e-168)
(/ (sqrt (* (* 4.0 C) (* (* A -4.0) (* C F)))) (* (* 4.0 A) C))
(if (<= B_m 4.4e+71)
(- (sqrt (/ F (- A))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.65e-168) {
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 4.4e+71) {
tmp = -sqrt((F / -A));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 1.65d-168) then
tmp = sqrt(((4.0d0 * c) * ((a * (-4.0d0)) * (c * f)))) / ((4.0d0 * a) * c)
else if (b_m <= 4.4d+71) then
tmp = -sqrt((f / -a))
else
tmp = sqrt((2.0d0 * f)) / -sqrt(b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.65e-168) {
tmp = Math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 4.4e+71) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 1.65e-168: tmp = math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C) elif B_m <= 4.4e+71: tmp = -math.sqrt((F / -A)) else: tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.65e-168) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(Float64(A * -4.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); elseif (B_m <= 4.4e+71) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 1.65e-168)
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
elseif (B_m <= 4.4e+71)
tmp = -sqrt((F / -A));
else
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.65e-168], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(N[(A * -4.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.4e+71], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.65 \cdot 10^{-168}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(\left(A \cdot -4\right) \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 4.4 \cdot 10^{+71}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.6500000000000001e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
Taylor expanded in B around 0 19.8%
associate-*r*19.8%
Simplified19.8%
Taylor expanded in B around 0 19.6%
associate-*r*19.6%
Simplified19.6%
if 1.6500000000000001e-168 < B < 4.39999999999999989e71Initial program 23.1%
Simplified32.6%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 15.2%
Taylor expanded in B around 0 15.1%
mul-1-neg15.1%
Simplified15.1%
if 4.39999999999999989e71 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
sqrt-div69.2%
Applied egg-rr69.2%
associate-*r/69.1%
pow1/269.1%
pow1/269.1%
pow-prod-down69.4%
Applied egg-rr69.4%
unpow1/269.4%
*-commutative69.4%
Simplified69.4%
Final simplification28.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.45e-168)
(/ (sqrt (* (* 4.0 C) (* (* A -4.0) (* C F)))) (* (* 4.0 A) C))
(if (<= B_m 4.3e+71)
(- (sqrt (/ F (- A))))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.45e-168) {
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 4.3e+71) {
tmp = -sqrt((F / -A));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.45d-168) then
tmp = sqrt(((4.0d0 * c) * ((a * (-4.0d0)) * (c * f)))) / ((4.0d0 * a) * c)
else if (b_m <= 4.3d+71) then
tmp = -sqrt((f / -a))
else
tmp = sqrt((2.0d0 / b_m)) * -sqrt(f)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.45e-168) {
tmp = Math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 4.3e+71) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.45e-168: tmp = math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C) elif B_m <= 4.3e+71: tmp = -math.sqrt((F / -A)) else: tmp = math.sqrt((2.0 / B_m)) * -math.sqrt(F) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.45e-168) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(Float64(A * -4.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); elseif (B_m <= 4.3e+71) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.45e-168)
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
elseif (B_m <= 4.3e+71)
tmp = -sqrt((F / -A));
else
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.45e-168], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(N[(A * -4.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.3e+71], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.45 \cdot 10^{-168}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(\left(A \cdot -4\right) \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 4.3 \cdot 10^{+71}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 3.45e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
Taylor expanded in B around 0 19.8%
associate-*r*19.8%
Simplified19.8%
Taylor expanded in B around 0 19.6%
associate-*r*19.6%
Simplified19.6%
if 3.45e-168 < B < 4.29999999999999984e71Initial program 23.1%
Simplified32.6%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 15.2%
Taylor expanded in B around 0 15.1%
mul-1-neg15.1%
Simplified15.1%
if 4.29999999999999984e71 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
sqrt-div69.2%
Applied egg-rr69.2%
associate-*r/69.1%
pow1/269.1%
pow1/269.1%
pow-prod-down69.4%
Applied egg-rr69.4%
unpow1/269.4%
*-commutative69.4%
Simplified69.4%
sqrt-undiv55.0%
associate-*r/55.0%
*-commutative55.0%
sqrt-prod69.3%
Applied egg-rr69.3%
Final simplification28.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.55e-168)
(/ (sqrt (* (* 4.0 C) (* (* A -4.0) (* C F)))) (* (* 4.0 A) C))
(if (<= B_m 1.45e+72)
(- (sqrt (/ F (- A))))
(- (sqrt (* 2.0 (fabs (/ F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.55e-168) {
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 1.45e+72) {
tmp = -sqrt((F / -A));
} else {
tmp = -sqrt((2.0 * fabs((F / B_m))));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 2.55d-168) then
tmp = sqrt(((4.0d0 * c) * ((a * (-4.0d0)) * (c * f)))) / ((4.0d0 * a) * c)
else if (b_m <= 1.45d+72) then
tmp = -sqrt((f / -a))
else
tmp = -sqrt((2.0d0 * abs((f / b_m))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.55e-168) {
tmp = Math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 1.45e+72) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -Math.sqrt((2.0 * Math.abs((F / B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 2.55e-168: tmp = math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C) elif B_m <= 1.45e+72: tmp = -math.sqrt((F / -A)) else: tmp = -math.sqrt((2.0 * math.fabs((F / B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.55e-168) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(Float64(A * -4.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); elseif (B_m <= 1.45e+72) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-sqrt(Float64(2.0 * abs(Float64(F / B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 2.55e-168)
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
elseif (B_m <= 1.45e+72)
tmp = -sqrt((F / -A));
else
tmp = -sqrt((2.0 * abs((F / B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.55e-168], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(N[(A * -4.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.45e+72], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[Abs[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.55 \cdot 10^{-168}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(\left(A \cdot -4\right) \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 1.45 \cdot 10^{+72}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot \left|\frac{F}{B\_m}\right|}\\
\end{array}
\end{array}
if B < 2.5499999999999998e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
Taylor expanded in B around 0 19.8%
associate-*r*19.8%
Simplified19.8%
Taylor expanded in B around 0 19.6%
associate-*r*19.6%
Simplified19.6%
if 2.5499999999999998e-168 < B < 1.45000000000000009e72Initial program 23.1%
Simplified32.6%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 15.2%
Taylor expanded in B around 0 15.1%
mul-1-neg15.1%
Simplified15.1%
if 1.45000000000000009e72 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
*-commutative54.7%
pow1/254.7%
pow1/254.7%
pow-prod-down55.0%
Applied egg-rr55.0%
unpow1/255.0%
Simplified55.0%
add-sqr-sqrt54.9%
pow1/254.9%
pow1/254.9%
pow-prod-down38.8%
pow238.8%
Applied egg-rr38.8%
unpow1/238.8%
unpow238.8%
rem-sqrt-square55.0%
Simplified55.0%
Final simplification26.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.6e-168) (/ (sqrt (* (* 4.0 C) (* (* A -4.0) (* C F)))) (* (* 4.0 A) C)) (if (<= B_m 1.1e+72) (- (sqrt (/ F (- A)))) (- (sqrt (* 2.0 (/ F B_m)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.6e-168) {
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 1.1e+72) {
tmp = -sqrt((F / -A));
} else {
tmp = -sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 1.6d-168) then
tmp = sqrt(((4.0d0 * c) * ((a * (-4.0d0)) * (c * f)))) / ((4.0d0 * a) * c)
else if (b_m <= 1.1d+72) then
tmp = -sqrt((f / -a))
else
tmp = -sqrt((2.0d0 * (f / b_m)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.6e-168) {
tmp = Math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
} else if (B_m <= 1.1e+72) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -Math.sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 1.6e-168: tmp = math.sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C) elif B_m <= 1.1e+72: tmp = -math.sqrt((F / -A)) else: tmp = -math.sqrt((2.0 * (F / B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.6e-168) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(Float64(A * -4.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); elseif (B_m <= 1.1e+72) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 1.6e-168)
tmp = sqrt(((4.0 * C) * ((A * -4.0) * (C * F)))) / ((4.0 * A) * C);
elseif (B_m <= 1.1e+72)
tmp = -sqrt((F / -A));
else
tmp = -sqrt((2.0 * (F / B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.6e-168], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(N[(A * -4.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.1e+72], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.6 \cdot 10^{-168}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(\left(A \cdot -4\right) \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 1.1 \cdot 10^{+72}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if B < 1.60000000000000003e-168Initial program 17.6%
Simplified22.7%
Taylor expanded in A around -inf 21.3%
*-commutative21.3%
Simplified21.3%
Taylor expanded in B around 0 19.8%
associate-*r*19.8%
Simplified19.8%
Taylor expanded in B around 0 19.6%
associate-*r*19.6%
Simplified19.6%
if 1.60000000000000003e-168 < B < 1.1e72Initial program 23.1%
Simplified32.6%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 15.2%
Taylor expanded in B around 0 15.1%
mul-1-neg15.1%
Simplified15.1%
if 1.1e72 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
*-commutative54.7%
pow1/254.7%
pow1/254.7%
pow-prod-down55.0%
Applied egg-rr55.0%
unpow1/255.0%
Simplified55.0%
Final simplification26.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.05e+72) (- (sqrt (/ F (- A)))) (- (sqrt (* 2.0 (/ F B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.05e+72) {
tmp = -sqrt((F / -A));
} else {
tmp = -sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.05d+72) then
tmp = -sqrt((f / -a))
else
tmp = -sqrt((2.0d0 * (f / b_m)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.05e+72) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -Math.sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.05e+72: tmp = -math.sqrt((F / -A)) else: tmp = -math.sqrt((2.0 * (F / B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.05e+72) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.05e+72)
tmp = -sqrt((F / -A));
else
tmp = -sqrt((2.0 * (F / B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.05e+72], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.05 \cdot 10^{+72}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if B < 3.04999999999999996e72Initial program 18.9%
Simplified25.0%
Taylor expanded in A around -inf 19.4%
Taylor expanded in F around 0 12.7%
Taylor expanded in B around 0 17.8%
mul-1-neg17.8%
Simplified17.8%
if 3.04999999999999996e72 < B Initial program 10.1%
Taylor expanded in B around inf 54.7%
mul-1-neg54.7%
*-commutative54.7%
Simplified54.7%
*-commutative54.7%
pow1/254.7%
pow1/254.7%
pow-prod-down55.0%
Applied egg-rr55.0%
unpow1/255.0%
Simplified55.0%
Final simplification25.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 17.1%
Taylor expanded in B around inf 14.6%
mul-1-neg14.6%
*-commutative14.6%
Simplified14.6%
*-commutative14.6%
pow1/214.9%
pow1/214.9%
pow-prod-down14.9%
Applied egg-rr14.9%
unpow1/214.7%
Simplified14.7%
Taylor expanded in F around 0 14.7%
associate-*r/14.7%
*-commutative14.7%
associate-/l*14.7%
Simplified14.7%
herbie shell --seed 2024143
(FPCore (A B C F)
:name "ABCF->ab-angle a"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))