
(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 18 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 (* 2.0 t_0))
(t_2 (- t_0))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 -1e-208)
(* (* (sqrt t_1) (sqrt F)) (/ (sqrt (+ (+ A C) (hypot B_m (- A C)))) t_2))
(if (<= t_4 INFINITY)
(*
(sqrt (* F t_1))
(/ (sqrt (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))) t_2))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ C (hypot C 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 = 2.0 * t_0;
double t_2 = -t_0;
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= -1e-208) {
tmp = (sqrt(t_1) * sqrt(F)) * (sqrt(((A + C) + hypot(B_m, (A - C)))) / t_2);
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((F * t_1)) * (sqrt(((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C))) / t_2);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((C + hypot(C, 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(2.0 * t_0) t_2 = Float64(-t_0) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= -1e-208) tmp = Float64(Float64(sqrt(t_1) * sqrt(F)) * Float64(sqrt(Float64(Float64(A + C) + hypot(B_m, Float64(A - C)))) / t_2)); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(F * t_1)) * Float64(sqrt(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C))) / t_2)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(C + hypot(C, 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[(2.0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $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$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -1e-208], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := 2 \cdot t\_0\\
t_2 := -t\_0\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{-208}:\\
\;\;\;\;\left(\sqrt{t\_1} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{F \cdot t\_1} \cdot \frac{\sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right)\right)\\
\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))) < -1.0000000000000001e-208Initial program 42.4%
Simplified54.6%
pow1/254.7%
associate-*r*54.7%
associate-+r+53.8%
hypot-undefine42.4%
unpow242.4%
unpow242.4%
+-commutative42.4%
unpow-prod-down50.5%
*-commutative50.5%
pow1/250.5%
Applied egg-rr72.0%
unpow1/272.0%
associate-*l*72.0%
hypot-undefine50.5%
unpow250.5%
unpow250.5%
+-commutative50.5%
unpow250.5%
unpow250.5%
hypot-undefine72.0%
Simplified72.0%
associate-/l*72.0%
associate-+r+71.0%
Applied egg-rr71.0%
pow1/271.0%
*-commutative71.0%
unpow-prod-down84.0%
pow1/284.0%
pow1/284.0%
Applied egg-rr84.0%
if -1.0000000000000001e-208 < (/.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 20.1%
Simplified27.4%
pow1/227.4%
associate-*r*27.4%
associate-+r+26.1%
hypot-undefine20.1%
unpow220.1%
unpow220.1%
+-commutative20.1%
unpow-prod-down23.6%
*-commutative23.6%
pow1/223.6%
Applied egg-rr35.4%
unpow1/235.4%
associate-*l*35.4%
hypot-undefine25.1%
unpow225.1%
unpow225.1%
+-commutative25.1%
unpow225.1%
unpow225.1%
hypot-undefine35.4%
Simplified35.4%
associate-/l*35.4%
associate-+r+34.0%
Applied egg-rr34.0%
Taylor expanded in A around -inf 32.1%
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 A around 0 1.6%
mul-1-neg1.6%
unpow21.6%
unpow21.6%
hypot-define16.9%
Simplified16.9%
sqrt-prod24.9%
Applied egg-rr24.9%
*-commutative24.9%
hypot-undefine1.6%
unpow21.6%
unpow21.6%
+-commutative1.6%
unpow21.6%
unpow21.6%
hypot-define24.9%
Simplified24.9%
Final simplification48.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
(let* ((t_0 (/ (sqrt 2.0) B_m))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (- t_1))
(t_3 (sqrt (* F (* 2.0 t_1)))))
(if (<= (pow B_m 2.0) 6e-318)
(* t_3 (/ (sqrt (* 2.0 C)) t_2))
(if (<= (pow B_m 2.0) 20000000.0)
(* (/ (sqrt (+ (+ A C) (hypot B_m (- A C)))) t_2) t_3)
(if (<= (pow B_m 2.0) 2e+24)
(* t_0 (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) A))))))
(* t_0 (* (sqrt F) (- (sqrt (+ C (hypot C 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 = sqrt(2.0) / B_m;
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = -t_1;
double t_3 = sqrt((F * (2.0 * t_1)));
double tmp;
if (pow(B_m, 2.0) <= 6e-318) {
tmp = t_3 * (sqrt((2.0 * C)) / t_2);
} else if (pow(B_m, 2.0) <= 20000000.0) {
tmp = (sqrt(((A + C) + hypot(B_m, (A - C)))) / t_2) * t_3;
} else if (pow(B_m, 2.0) <= 2e+24) {
tmp = t_0 * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / A))));
} else {
tmp = t_0 * (sqrt(F) * -sqrt((C + hypot(C, 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 = Float64(sqrt(2.0) / B_m) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(-t_1) t_3 = sqrt(Float64(F * Float64(2.0 * t_1))) tmp = 0.0 if ((B_m ^ 2.0) <= 6e-318) tmp = Float64(t_3 * Float64(sqrt(Float64(2.0 * C)) / t_2)); elseif ((B_m ^ 2.0) <= 20000000.0) tmp = Float64(Float64(sqrt(Float64(Float64(A + C) + hypot(B_m, Float64(A - C)))) / t_2) * t_3); elseif ((B_m ^ 2.0) <= 2e+24) tmp = Float64(t_0 * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / A)))))); else tmp = Float64(t_0 * Float64(sqrt(F) * Float64(-sqrt(Float64(C + hypot(C, 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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 6e-318], N[(t$95$3 * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 20000000.0], N[(N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+24], N[(t$95$0 * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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}
t_0 := \frac{\sqrt{2}}{B\_m}\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := -t\_1\\
t_3 := \sqrt{F \cdot \left(2 \cdot t\_1\right)}\\
\mathbf{if}\;{B\_m}^{2} \leq 6 \cdot 10^{-318}:\\
\;\;\;\;t\_3 \cdot \frac{\sqrt{2 \cdot C}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 20000000:\\
\;\;\;\;\frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}}{t\_2} \cdot t\_3\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+24}:\\
\;\;\;\;t\_0 \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\sqrt{F} \cdot \left(-\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 6.0000024e-318Initial program 18.3%
Simplified29.5%
pow1/229.5%
associate-*r*29.5%
associate-+r+27.8%
hypot-undefine18.4%
unpow218.4%
unpow218.4%
+-commutative18.4%
unpow-prod-down19.7%
*-commutative19.7%
pow1/219.7%
Applied egg-rr37.6%
unpow1/237.6%
associate-*l*37.6%
hypot-undefine21.1%
unpow221.1%
unpow221.1%
+-commutative21.1%
unpow221.1%
unpow221.1%
hypot-undefine37.6%
Simplified37.6%
associate-/l*37.6%
associate-+r+35.8%
Applied egg-rr35.8%
Taylor expanded in A around -inf 28.3%
*-commutative28.3%
Simplified28.3%
if 6.0000024e-318 < (pow.f64 B #s(literal 2 binary64)) < 2e7Initial program 38.6%
Simplified47.1%
pow1/247.1%
associate-*r*47.1%
associate-+r+46.3%
hypot-undefine38.8%
unpow238.8%
unpow238.8%
+-commutative38.8%
unpow-prod-down44.3%
*-commutative44.3%
pow1/244.3%
Applied egg-rr59.5%
unpow1/259.5%
associate-*l*59.5%
hypot-undefine44.2%
unpow244.2%
unpow244.2%
+-commutative44.2%
unpow244.2%
unpow244.2%
hypot-undefine59.5%
Simplified59.5%
associate-/l*59.6%
associate-+r+59.0%
Applied egg-rr59.0%
if 2e7 < (pow.f64 B #s(literal 2 binary64)) < 2e24Initial program 1.8%
Taylor expanded in C around 0 2.7%
mul-1-neg2.7%
+-commutative2.7%
unpow22.7%
unpow22.7%
hypot-define3.7%
Simplified3.7%
Taylor expanded in A around -inf 0.4%
if 2e24 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.8%
Taylor expanded in A around 0 11.4%
mul-1-neg11.4%
unpow211.4%
unpow211.4%
hypot-define24.1%
Simplified24.1%
sqrt-prod34.3%
Applied egg-rr34.3%
*-commutative34.3%
hypot-undefine13.9%
unpow213.9%
unpow213.9%
+-commutative13.9%
unpow213.9%
unpow213.9%
hypot-define34.3%
Simplified34.3%
Final simplification38.2%
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 (<= (pow B_m 2.0) 2e+25)
(* (sqrt (* F (* 2.0 t_0))) (/ (sqrt (* 2.0 C)) (- t_0)))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ C (hypot C 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 tmp;
if (pow(B_m, 2.0) <= 2e+25) {
tmp = sqrt((F * (2.0 * t_0))) * (sqrt((2.0 * C)) / -t_0);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((C + hypot(C, 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))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+25) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * Float64(sqrt(Float64(2.0 * C)) / Float64(-t_0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(C + hypot(C, 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+25], N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+25}:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \frac{\sqrt{2 \cdot C}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000018e25Initial program 27.5%
Simplified37.7%
pow1/237.7%
associate-*r*37.7%
associate-+r+36.5%
hypot-undefine27.7%
unpow227.7%
unpow227.7%
+-commutative27.7%
unpow-prod-down30.9%
*-commutative30.9%
pow1/230.9%
Applied egg-rr47.5%
unpow1/247.5%
associate-*l*47.5%
hypot-undefine31.5%
unpow231.5%
unpow231.5%
+-commutative31.5%
unpow231.5%
unpow231.5%
hypot-undefine47.5%
Simplified47.5%
associate-/l*47.6%
associate-+r+46.3%
Applied egg-rr46.3%
Taylor expanded in A around -inf 26.5%
*-commutative26.5%
Simplified26.5%
if 2.00000000000000018e25 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.0%
Taylor expanded in A around 0 11.5%
mul-1-neg11.5%
unpow211.5%
unpow211.5%
hypot-define24.3%
Simplified24.3%
sqrt-prod34.6%
Applied egg-rr34.6%
*-commutative34.6%
hypot-undefine14.0%
unpow214.0%
unpow214.0%
+-commutative14.0%
unpow214.0%
unpow214.0%
hypot-define34.6%
Simplified34.6%
Final simplification30.1%
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-28)
(*
(sqrt (* F (* 2.0 (fma B_m B_m (* A (* C -4.0))))))
(* (* 0.25 (/ (sqrt 2.0) A)) (sqrt (/ 1.0 C))))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ C (hypot C 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 (pow(B_m, 2.0) <= 5e-28) {
tmp = sqrt((F * (2.0 * fma(B_m, B_m, (A * (C * -4.0)))))) * ((0.25 * (sqrt(2.0) / A)) * sqrt((1.0 / C)));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((C + hypot(C, 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.0) <= 5e-28) tmp = Float64(sqrt(Float64(F * Float64(2.0 * fma(B_m, B_m, Float64(A * Float64(C * -4.0)))))) * Float64(Float64(0.25 * Float64(sqrt(2.0) / A)) * sqrt(Float64(1.0 / C)))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(C + hypot(C, 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_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-28], N[(N[Sqrt[N[(F * N[(2.0 * N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(0.25 * N[(N[Sqrt[2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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}^{2} \leq 5 \cdot 10^{-28}:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\right)} \cdot \left(\left(0.25 \cdot \frac{\sqrt{2}}{A}\right) \cdot \sqrt{\frac{1}{C}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-28Initial program 26.6%
Simplified37.1%
pow1/237.1%
associate-*r*37.1%
associate-+r+35.7%
hypot-undefine26.7%
unpow226.7%
unpow226.7%
+-commutative26.7%
unpow-prod-down29.5%
*-commutative29.5%
pow1/229.5%
Applied egg-rr47.1%
unpow1/247.1%
associate-*l*47.1%
hypot-undefine30.2%
unpow230.2%
unpow230.2%
+-commutative30.2%
unpow230.2%
unpow230.2%
hypot-undefine47.1%
Simplified47.1%
associate-/l*47.2%
associate-+r+45.9%
Applied egg-rr45.9%
Taylor expanded in A around -inf 25.3%
associate-*r*25.3%
Simplified25.3%
if 5.0000000000000002e-28 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.7%
Taylor expanded in A around 0 12.9%
mul-1-neg12.9%
unpow212.9%
unpow212.9%
hypot-define24.4%
Simplified24.4%
sqrt-prod34.3%
Applied egg-rr34.3%
*-commutative34.3%
hypot-undefine15.9%
unpow215.9%
unpow215.9%
+-commutative15.9%
unpow215.9%
unpow215.9%
hypot-define34.3%
Simplified34.3%
Final simplification29.8%
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 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 5e-28)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ C (hypot C 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 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 5e-28) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((C + hypot(C, B_m))));
}
return tmp;
}
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 t_0 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-28) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * -Math.sqrt((C + Math.hypot(C, 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): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 5e-28: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt(F) * -math.sqrt((C + math.hypot(C, 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 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-28) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(C + hypot(C, 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)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-28)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((C + hypot(C, 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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-28], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-28}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-28Initial program 26.6%
Taylor expanded in A around -inf 21.1%
if 5.0000000000000002e-28 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.7%
Taylor expanded in A around 0 12.9%
mul-1-neg12.9%
unpow212.9%
unpow212.9%
hypot-define24.4%
Simplified24.4%
sqrt-prod34.3%
Applied egg-rr34.3%
*-commutative34.3%
hypot-undefine15.9%
unpow215.9%
unpow215.9%
+-commutative15.9%
unpow215.9%
unpow215.9%
hypot-define34.3%
Simplified34.3%
Final simplification27.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 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 5e+74)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ B_m C))))))))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 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 5e+74) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
}
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) :: t_0
real(8) :: tmp
t_0 = (4.0d0 * a) * c
if ((b_m ** 2.0d0) <= 5d+74) then
tmp = sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * (2.0d0 * c))) / (t_0 - (b_m ** 2.0d0))
else
tmp = (sqrt(2.0d0) / b_m) * (sqrt(f) * -sqrt((b_m + c)))
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 t_0 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 5e+74) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * -Math.sqrt((B_m + C)));
}
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): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 5e+74: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt(F) * -math.sqrt((B_m + C))) 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 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+74) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C))))); 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)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e+74)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+74], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $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}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+74}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m + C}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999963e74Initial program 27.5%
Taylor expanded in A around -inf 21.4%
if 4.99999999999999963e74 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.5%
Taylor expanded in A around 0 10.9%
mul-1-neg10.9%
unpow210.9%
unpow210.9%
hypot-define24.2%
Simplified24.2%
sqrt-prod34.8%
Applied egg-rr34.8%
*-commutative34.8%
hypot-undefine13.5%
unpow213.5%
unpow213.5%
+-commutative13.5%
unpow213.5%
unpow213.5%
hypot-define34.8%
Simplified34.8%
Taylor expanded in C around 0 31.5%
Final simplification25.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
(if (<= (pow B_m 2.0) 5e+23)
(*
(sqrt (* -16.0 (* F (* A (pow C 2.0)))))
(/ -1.0 (fma B_m B_m (* A (* C -4.0)))))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ B_m C)))))))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+23) {
tmp = sqrt((-16.0 * (F * (A * pow(C, 2.0))))) * (-1.0 / fma(B_m, B_m, (A * (C * -4.0))));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
}
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+23) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(A * (C ^ 2.0))))) * Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C))))); 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+23], N[(N[Sqrt[N[(-16.0 * N[(F * N[(A * N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $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}^{2} \leq 5 \cdot 10^{+23}:\\
\;\;\;\;\sqrt{-16 \cdot \left(F \cdot \left(A \cdot {C}^{2}\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m + C}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e23Initial program 27.2%
Simplified36.8%
div-inv36.3%
Applied egg-rr35.3%
associate-*r*35.3%
hypot-undefine26.6%
unpow226.6%
unpow226.6%
+-commutative26.6%
unpow226.6%
unpow226.6%
hypot-undefine35.3%
Simplified35.3%
Taylor expanded in A around -inf 17.5%
associate-*r*17.4%
Simplified17.4%
if 4.9999999999999999e23 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.7%
Taylor expanded in A around 0 11.4%
mul-1-neg11.4%
unpow211.4%
unpow211.4%
hypot-define24.0%
Simplified24.0%
sqrt-prod34.1%
Applied egg-rr34.1%
*-commutative34.1%
hypot-undefine13.9%
unpow213.9%
unpow213.9%
+-commutative13.9%
unpow213.9%
unpow213.9%
hypot-define34.1%
Simplified34.1%
Taylor expanded in C around 0 30.1%
Final simplification23.1%
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+23)
(*
(/ -1.0 (fma B_m B_m (* A (* C -4.0))))
(sqrt (* -16.0 (* A (* F (pow C 2.0))))))
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ B_m C)))))))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+23) {
tmp = (-1.0 / fma(B_m, B_m, (A * (C * -4.0)))) * sqrt((-16.0 * (A * (F * pow(C, 2.0)))));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
}
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+23) tmp = Float64(Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0)))) * sqrt(Float64(-16.0 * Float64(A * Float64(F * (C ^ 2.0)))))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C))))); 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+23], N[(N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-16.0 * N[(A * N[(F * N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $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}^{2} \leq 5 \cdot 10^{+23}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{-16 \cdot \left(A \cdot \left(F \cdot {C}^{2}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m + C}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e23Initial program 27.2%
Simplified36.8%
div-inv36.3%
Applied egg-rr35.3%
associate-*r*35.3%
hypot-undefine26.6%
unpow226.6%
unpow226.6%
+-commutative26.6%
unpow226.6%
unpow226.6%
hypot-undefine35.3%
Simplified35.3%
Taylor expanded in A around -inf 17.5%
if 4.9999999999999999e23 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.7%
Taylor expanded in A around 0 11.4%
mul-1-neg11.4%
unpow211.4%
unpow211.4%
hypot-define24.0%
Simplified24.0%
sqrt-prod34.1%
Applied egg-rr34.1%
*-commutative34.1%
hypot-undefine13.9%
unpow213.9%
unpow213.9%
+-commutative13.9%
unpow213.9%
unpow213.9%
hypot-define34.1%
Simplified34.1%
Taylor expanded in C around 0 30.1%
Final simplification23.2%
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 (/ (sqrt 2.0) B_m)))
(if (<= A -6.5e+119)
(* t_0 (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) A))))))
(* t_0 (* (sqrt F) (- (sqrt (+ B_m C))))))))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 = sqrt(2.0) / B_m;
double tmp;
if (A <= -6.5e+119) {
tmp = t_0 * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / A))));
} else {
tmp = t_0 * (sqrt(F) * -sqrt((B_m + C)));
}
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) :: t_0
real(8) :: tmp
t_0 = sqrt(2.0d0) / b_m
if (a <= (-6.5d+119)) then
tmp = t_0 * -sqrt((f * ((-0.5d0) * ((b_m ** 2.0d0) / a))))
else
tmp = t_0 * (sqrt(f) * -sqrt((b_m + c)))
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 t_0 = Math.sqrt(2.0) / B_m;
double tmp;
if (A <= -6.5e+119) {
tmp = t_0 * -Math.sqrt((F * (-0.5 * (Math.pow(B_m, 2.0) / A))));
} else {
tmp = t_0 * (Math.sqrt(F) * -Math.sqrt((B_m + C)));
}
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): t_0 = math.sqrt(2.0) / B_m tmp = 0 if A <= -6.5e+119: tmp = t_0 * -math.sqrt((F * (-0.5 * (math.pow(B_m, 2.0) / A)))) else: tmp = t_0 * (math.sqrt(F) * -math.sqrt((B_m + C))) 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 = Float64(sqrt(2.0) / B_m) tmp = 0.0 if (A <= -6.5e+119) tmp = Float64(t_0 * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / A)))))); else tmp = Float64(t_0 * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C))))); 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)
t_0 = sqrt(2.0) / B_m;
tmp = 0.0;
if (A <= -6.5e+119)
tmp = t_0 * -sqrt((F * (-0.5 * ((B_m ^ 2.0) / A))));
else
tmp = t_0 * (sqrt(F) * -sqrt((B_m + C)));
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_] := Block[{t$95$0 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, If[LessEqual[A, -6.5e+119], N[(t$95$0 * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $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}
t_0 := \frac{\sqrt{2}}{B\_m}\\
\mathbf{if}\;A \leq -6.5 \cdot 10^{+119}:\\
\;\;\;\;t\_0 \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m + C}\right)\right)\\
\end{array}
\end{array}
if A < -6.4999999999999997e119Initial program 1.2%
Taylor expanded in C around 0 5.0%
mul-1-neg5.0%
+-commutative5.0%
unpow25.0%
unpow25.0%
hypot-define7.3%
Simplified7.3%
Taylor expanded in A around -inf 8.0%
if -6.4999999999999997e119 < A Initial program 23.2%
Taylor expanded in A around 0 9.8%
mul-1-neg9.8%
unpow29.8%
unpow29.8%
hypot-define16.3%
Simplified16.3%
sqrt-prod22.6%
Applied egg-rr22.6%
*-commutative22.6%
hypot-undefine12.2%
unpow212.2%
unpow212.2%
+-commutative12.2%
unpow212.2%
unpow212.2%
hypot-define22.6%
Simplified22.6%
Taylor expanded in C around 0 19.3%
Final simplification18.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 (<= A -1.28e+119) (* (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) A))) (/ (sqrt 2.0) (- B_m))) (* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ B_m C)))))))
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 (A <= -1.28e+119) {
tmp = sqrt((-0.5 * ((pow(B_m, 2.0) * F) / A))) * (sqrt(2.0) / -B_m);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
}
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 (a <= (-1.28d+119)) then
tmp = sqrt(((-0.5d0) * (((b_m ** 2.0d0) * f) / a))) * (sqrt(2.0d0) / -b_m)
else
tmp = (sqrt(2.0d0) / b_m) * (sqrt(f) * -sqrt((b_m + c)))
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 (A <= -1.28e+119) {
tmp = Math.sqrt((-0.5 * ((Math.pow(B_m, 2.0) * F) / A))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * -Math.sqrt((B_m + C)));
}
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 A <= -1.28e+119: tmp = math.sqrt((-0.5 * ((math.pow(B_m, 2.0) * F) / A))) * (math.sqrt(2.0) / -B_m) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt(F) * -math.sqrt((B_m + C))) 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 (A <= -1.28e+119) tmp = Float64(sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / A))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C))))); 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 (A <= -1.28e+119)
tmp = sqrt((-0.5 * (((B_m ^ 2.0) * F) / A))) * (sqrt(2.0) / -B_m);
else
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
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[A, -1.28e+119], N[(N[Sqrt[N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $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}\;A \leq -1.28 \cdot 10^{+119}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{{B\_m}^{2} \cdot F}{A}} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m + C}\right)\right)\\
\end{array}
\end{array}
if A < -1.28000000000000006e119Initial program 1.2%
Taylor expanded in C around 0 5.0%
mul-1-neg5.0%
+-commutative5.0%
unpow25.0%
unpow25.0%
hypot-define7.3%
Simplified7.3%
Taylor expanded in A around -inf 6.7%
if -1.28000000000000006e119 < A Initial program 23.2%
Taylor expanded in A around 0 9.8%
mul-1-neg9.8%
unpow29.8%
unpow29.8%
hypot-define16.3%
Simplified16.3%
sqrt-prod22.6%
Applied egg-rr22.6%
*-commutative22.6%
hypot-undefine12.2%
unpow212.2%
unpow212.2%
+-commutative12.2%
unpow212.2%
unpow212.2%
hypot-define22.6%
Simplified22.6%
Taylor expanded in C around 0 19.3%
Final simplification17.8%
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 (<= F 7e+94) (/ (pow (* 2.0 (* F (+ C (hypot B_m C)))) 0.5) (- B_m)) (* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt (+ B_m C)))))))
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 (F <= 7e+94) {
tmp = pow((2.0 * (F * (C + hypot(B_m, C)))), 0.5) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
}
return tmp;
}
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 (F <= 7e+94) {
tmp = Math.pow((2.0 * (F * (C + Math.hypot(B_m, C)))), 0.5) / -B_m;
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * -Math.sqrt((B_m + C)));
}
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 F <= 7e+94: tmp = math.pow((2.0 * (F * (C + math.hypot(B_m, C)))), 0.5) / -B_m else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt(F) * -math.sqrt((B_m + C))) 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 (F <= 7e+94) tmp = Float64((Float64(2.0 * Float64(F * Float64(C + hypot(B_m, C)))) ^ 0.5) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C))))); 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 (F <= 7e+94)
tmp = ((2.0 * (F * (C + hypot(B_m, C)))) ^ 0.5) / -B_m;
else
tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
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[F, 7e+94], N[(N[Power[N[(2.0 * N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $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}\;F \leq 7 \cdot 10^{+94}:\\
\;\;\;\;\frac{{\left(2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\right)\right)}^{0.5}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m + C}\right)\right)\\
\end{array}
\end{array}
if F < 6.9999999999999994e94Initial program 22.0%
Taylor expanded in A around 0 9.1%
mul-1-neg9.1%
unpow29.1%
unpow29.1%
hypot-define17.0%
Simplified17.0%
associate-*l/17.0%
pow1/217.0%
pow1/217.1%
pow-prod-down17.2%
Applied egg-rr17.2%
if 6.9999999999999994e94 < F Initial program 17.0%
Taylor expanded in A around 0 8.8%
mul-1-neg8.8%
unpow28.8%
unpow28.8%
hypot-define9.0%
Simplified9.0%
sqrt-prod25.9%
Applied egg-rr25.9%
*-commutative25.9%
hypot-undefine14.3%
unpow214.3%
unpow214.3%
+-commutative14.3%
unpow214.3%
unpow214.3%
hypot-define25.9%
Simplified25.9%
Taylor expanded in C around 0 20.7%
Final simplification18.2%
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 (<= C 2.7e+72) (/ (sqrt (* 2.0 F)) (- (sqrt B_m))) (/ (pow (* 2.0 (* F (+ C (hypot B_m C)))) 0.5) (- 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 (C <= 2.7e+72) {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
} else {
tmp = pow((2.0 * (F * (C + hypot(B_m, C)))), 0.5) / -B_m;
}
return tmp;
}
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 (C <= 2.7e+72) {
tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
} else {
tmp = Math.pow((2.0 * (F * (C + Math.hypot(B_m, C)))), 0.5) / -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 C <= 2.7e+72: tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m) else: tmp = math.pow((2.0 * (F * (C + math.hypot(B_m, C)))), 0.5) / -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 (C <= 2.7e+72) tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); else tmp = Float64((Float64(2.0 * Float64(F * Float64(C + hypot(B_m, C)))) ^ 0.5) / Float64(-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 (C <= 2.7e+72)
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
else
tmp = ((2.0 * (F * (C + hypot(B_m, C)))) ^ 0.5) / -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[C, 2.7e+72], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision], N[(N[Power[N[(2.0 * N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $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}\;C \leq 2.7 \cdot 10^{+72}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\right)\right)}^{0.5}}{-B\_m}\\
\end{array}
\end{array}
if C < 2.7000000000000001e72Initial program 21.9%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.6%
Applied egg-rr15.6%
unpow115.6%
Simplified15.6%
associate-*l/15.6%
sqrt-div20.3%
Applied egg-rr20.3%
if 2.7000000000000001e72 < C Initial program 16.3%
Taylor expanded in A around 0 4.8%
mul-1-neg4.8%
unpow24.8%
unpow24.8%
hypot-define8.5%
Simplified8.5%
associate-*l/8.5%
pow1/28.5%
pow1/28.9%
pow-prod-down8.9%
Applied egg-rr8.9%
Final simplification17.8%
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 (<= C 2.3e+72) (/ (sqrt (* 2.0 F)) (- (sqrt B_m))) (/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- 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 (C <= 2.3e+72) {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
} else {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
}
return tmp;
}
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 (C <= 2.3e+72) {
tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
} else {
tmp = Math.sqrt((2.0 * (F * (C + Math.hypot(C, B_m))))) / -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 C <= 2.3e+72: tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m) else: tmp = math.sqrt((2.0 * (F * (C + math.hypot(C, B_m))))) / -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 (C <= 2.3e+72) tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-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 (C <= 2.3e+72)
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
else
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -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[C, 2.3e+72], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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}\;C \leq 2.3 \cdot 10^{+72}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if C < 2.3e72Initial program 21.9%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.6%
Applied egg-rr15.6%
unpow115.6%
Simplified15.6%
associate-*l/15.6%
sqrt-div20.3%
Applied egg-rr20.3%
if 2.3e72 < C Initial program 16.3%
Taylor expanded in A around 0 4.8%
mul-1-neg4.8%
unpow24.8%
unpow24.8%
hypot-define8.5%
Simplified8.5%
associate-*l/8.5%
pow1/28.5%
pow1/28.9%
pow-prod-down8.9%
Applied egg-rr8.9%
unpow1/28.5%
*-commutative8.5%
hypot-undefine4.8%
unpow24.8%
unpow24.8%
+-commutative4.8%
unpow24.8%
unpow24.8%
hypot-define8.5%
Simplified8.5%
Final simplification17.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 (/ (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) {
return sqrt((2.0 * F)) / -sqrt(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((2.0d0 * f)) / -sqrt(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((2.0 * F)) / -Math.sqrt(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((2.0 * F)) / -math.sqrt(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(2.0 * F)) / Float64(-sqrt(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((2.0 * F)) / -sqrt(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[(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])\\
\\
\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 13.4%
mul-1-neg13.4%
Simplified13.4%
pow113.4%
sqrt-unprod13.5%
Applied egg-rr13.5%
unpow113.5%
Simplified13.5%
associate-*l/13.5%
sqrt-div17.8%
Applied egg-rr17.8%
Final simplification17.8%
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 (<= C 1.5e+157) (- (pow (* 2.0 (/ F B_m)) 0.5)) (* (sqrt (* C 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) {
double tmp;
if (C <= 1.5e+157) {
tmp = -pow((2.0 * (F / B_m)), 0.5);
} else {
tmp = sqrt((C * F)) * (-2.0 / 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 (c <= 1.5d+157) then
tmp = -((2.0d0 * (f / b_m)) ** 0.5d0)
else
tmp = sqrt((c * f)) * (-2.0d0 / 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 (C <= 1.5e+157) {
tmp = -Math.pow((2.0 * (F / B_m)), 0.5);
} else {
tmp = Math.sqrt((C * F)) * (-2.0 / 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 C <= 1.5e+157: tmp = -math.pow((2.0 * (F / B_m)), 0.5) else: tmp = math.sqrt((C * F)) * (-2.0 / 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 (C <= 1.5e+157) tmp = Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5)); else tmp = Float64(sqrt(Float64(C * F)) * Float64(Float64(-2.0) / 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 (C <= 1.5e+157)
tmp = -((2.0 * (F / B_m)) ^ 0.5);
else
tmp = sqrt((C * F)) * (-2.0 / 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[C, 1.5e+157], (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / 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}\;C \leq 1.5 \cdot 10^{+157}:\\
\;\;\;\;-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{C \cdot F} \cdot \frac{-2}{B\_m}\\
\end{array}
\end{array}
if C < 1.50000000000000005e157Initial program 23.4%
Taylor expanded in B around inf 14.6%
mul-1-neg14.6%
Simplified14.6%
sqrt-unprod14.7%
pow1/214.9%
Applied egg-rr14.9%
if 1.50000000000000005e157 < C Initial program 2.4%
Taylor expanded in A around 0 1.3%
mul-1-neg1.3%
unpow21.3%
unpow21.3%
hypot-define4.5%
Simplified4.5%
Taylor expanded in B around 0 1.7%
*-commutative1.7%
unpow21.7%
rem-square-sqrt1.7%
Simplified1.7%
Final simplification13.2%
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 (- (pow (* 2.0 (/ F 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) {
return -pow((2.0 * (F / B_m)), 0.5);
}
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 = -((2.0d0 * (f / b_m)) ** 0.5d0)
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.pow((2.0 * (F / B_m)), 0.5);
}
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.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5)) 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 = -((2.0 * (F / B_m)) ^ 0.5);
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[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 13.4%
mul-1-neg13.4%
Simplified13.4%
sqrt-unprod13.5%
pow1/213.7%
Applied egg-rr13.7%
Final simplification13.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 (- (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) {
return -sqrt((2.0 * (F / 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((2.0d0 * (f / 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((2.0 * (F / 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((2.0 * (F / 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(2.0 * Float64(F / 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((2.0 * (F / 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[(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])\\
\\
-\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 13.4%
mul-1-neg13.4%
Simplified13.4%
pow113.4%
sqrt-unprod13.5%
Applied egg-rr13.5%
unpow113.5%
Simplified13.5%
Final simplification13.5%
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 20.7%
Taylor expanded in B around inf 13.4%
mul-1-neg13.4%
Simplified13.4%
sqrt-unprod13.5%
pow1/213.7%
Applied egg-rr13.7%
*-un-lft-identity13.7%
unpow1/213.5%
associate-*l/13.5%
Applied egg-rr13.5%
*-lft-identity13.5%
associate-/l*13.5%
Simplified13.5%
herbie shell --seed 2024103
(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))))