
(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 21 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 (sqrt (* 2.0 (+ A (+ C (hypot (- A C) B_m))))))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (- t_1))
(t_3 (* (* 4.0 A) C))
(t_4 (- t_3 (pow B_m 2.0)))
(t_5 (* 2.0 (* (- (pow B_m 2.0) t_3) F)))
(t_6 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(if (<= (pow B_m 2.0) 5e-128)
(/ (sqrt (* t_5 (* 2.0 C))) t_4)
(if (<= (pow B_m 2.0) 2e+31)
(/ (* (sqrt (* F t_1)) t_0) t_2)
(if (<= (pow B_m 2.0) 2e+46)
(/ (sqrt (* t_5 t_6)) t_4)
(if (<= (pow B_m 2.0) 2e+150)
(/
(*
B_m
(* (sqrt (+ A (+ C (hypot B_m (- A C))))) (- (sqrt (* 2.0 F)))))
t_1)
(if (<= (pow B_m 2.0) 5e+163)
(/
(sqrt
(* t_6 (* 2.0 (* F (* C (- (/ (pow B_m 2.0) C) (* 4.0 A)))))))
t_4)
(if (<= (pow B_m 2.0) 2e+253)
(/ (* t_0 (* B_m (sqrt F))) t_2)
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = sqrt((2.0 * (A + (C + hypot((A - C), B_m)))));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = -t_1;
double t_3 = (4.0 * A) * C;
double t_4 = t_3 - pow(B_m, 2.0);
double t_5 = 2.0 * ((pow(B_m, 2.0) - t_3) * F);
double t_6 = (-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C);
double tmp;
if (pow(B_m, 2.0) <= 5e-128) {
tmp = sqrt((t_5 * (2.0 * C))) / t_4;
} else if (pow(B_m, 2.0) <= 2e+31) {
tmp = (sqrt((F * t_1)) * t_0) / t_2;
} else if (pow(B_m, 2.0) <= 2e+46) {
tmp = sqrt((t_5 * t_6)) / t_4;
} else if (pow(B_m, 2.0) <= 2e+150) {
tmp = (B_m * (sqrt((A + (C + hypot(B_m, (A - C))))) * -sqrt((2.0 * F)))) / t_1;
} else if (pow(B_m, 2.0) <= 5e+163) {
tmp = sqrt((t_6 * (2.0 * (F * (C * ((pow(B_m, 2.0) / C) - (4.0 * A))))))) / t_4;
} else if (pow(B_m, 2.0) <= 2e+253) {
tmp = (t_0 * (B_m * sqrt(F))) / t_2;
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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) t_0 = sqrt(Float64(2.0 * Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(-t_1) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(t_3 - (B_m ^ 2.0)) t_5 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) t_6 = Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-128) tmp = Float64(sqrt(Float64(t_5 * Float64(2.0 * C))) / t_4); elseif ((B_m ^ 2.0) <= 2e+31) tmp = Float64(Float64(sqrt(Float64(F * t_1)) * t_0) / t_2); elseif ((B_m ^ 2.0) <= 2e+46) tmp = Float64(sqrt(Float64(t_5 * t_6)) / t_4); elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(Float64(B_m * Float64(sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) * Float64(-sqrt(Float64(2.0 * F))))) / t_1); elseif ((B_m ^ 2.0) <= 5e+163) tmp = Float64(sqrt(Float64(t_6 * Float64(2.0 * Float64(F * Float64(C * Float64(Float64((B_m ^ 2.0) / C) - Float64(4.0 * A))))))) / t_4); elseif ((B_m ^ 2.0) <= 2e+253) tmp = Float64(Float64(t_0 * Float64(B_m * sqrt(F))) / t_2); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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[Sqrt[N[(2.0 * N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-128], N[(N[Sqrt[N[(t$95$5 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+31], N[(N[(N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+46], N[(N[Sqrt[N[(t$95$5 * t$95$6), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[(B$95$m * N[(N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+163], N[(N[Sqrt[N[(t$95$6 * N[(2.0 * N[(F * N[(C * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+253], N[(N[(t$95$0 * N[(B$95$m * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)}\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := -t\_1\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := t\_3 - {B\_m}^{2}\\
t_5 := 2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\\
t_6 := -0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-128}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(2 \cdot C\right)}}{t\_4}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+31}:\\
\;\;\;\;\frac{\sqrt{F \cdot t\_1} \cdot t\_0}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+46}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot t\_6}}{t\_4}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)} \cdot \left(-\sqrt{2 \cdot F}\right)\right)}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+163}:\\
\;\;\;\;\frac{\sqrt{t\_6 \cdot \left(2 \cdot \left(F \cdot \left(C \cdot \left(\frac{{B\_m}^{2}}{C} - 4 \cdot A\right)\right)\right)\right)}}{t\_4}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+253}:\\
\;\;\;\;\frac{t\_0 \cdot \left(B\_m \cdot \sqrt{F}\right)}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 5.0000000000000001e-128Initial program 16.6%
Taylor expanded in A around -inf 22.6%
if 5.0000000000000001e-128 < (pow.f64 B 2) < 1.9999999999999999e31Initial program 44.4%
Simplified56.0%
sqrt-prod62.0%
*-commutative62.0%
hypot-undefine45.6%
unpow245.6%
unpow245.6%
+-commutative45.6%
unpow245.6%
unpow245.6%
hypot-define62.0%
Applied egg-rr62.0%
if 1.9999999999999999e31 < (pow.f64 B 2) < 2e46Initial program 36.1%
Taylor expanded in A around -inf 66.7%
if 2e46 < (pow.f64 B 2) < 1.99999999999999996e150Initial program 36.2%
Simplified41.6%
Taylor expanded in B around inf 41.3%
pow1/241.3%
unpow241.3%
associate-*l*41.2%
unpow-prod-down45.5%
pow-prod-down31.2%
pow1/231.2%
pow1/231.2%
add-sqr-sqrt32.2%
associate-+r+32.5%
Applied egg-rr32.5%
associate-*r*32.5%
unpow-prod-down40.8%
pow1/240.8%
associate-+l+40.4%
Applied egg-rr40.4%
unpow1/240.4%
Simplified40.4%
if 1.99999999999999996e150 < (pow.f64 B 2) < 5e163Initial program 2.1%
Taylor expanded in A around -inf 60.3%
Taylor expanded in C around inf 60.6%
if 5e163 < (pow.f64 B 2) < 1.9999999999999999e253Initial program 32.5%
Simplified38.8%
sqrt-prod44.8%
*-commutative44.8%
hypot-undefine32.6%
unpow232.6%
unpow232.6%
+-commutative32.6%
unpow232.6%
unpow232.6%
hypot-define44.8%
Applied egg-rr44.8%
Taylor expanded in B around inf 23.9%
if 1.9999999999999999e253 < (pow.f64 B 2) Initial program 4.2%
Taylor expanded in C around 0 8.2%
mul-1-neg8.2%
+-commutative8.2%
unpow28.2%
unpow28.2%
hypot-define30.0%
Simplified30.0%
pow1/230.0%
*-commutative30.0%
unpow-prod-down46.1%
pow1/246.1%
pow1/246.1%
Applied egg-rr46.1%
Final simplification37.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (sqrt (* F t_0)))
(t_2 (/ (pow B_m 2.0) A))
(t_3 (* (* 4.0 A) C))
(t_4 (- t_3 (pow B_m 2.0)))
(t_5
(/
(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_4))
(t_6 (- t_0)))
(if (<= t_5 (- INFINITY))
(/
(*
(sqrt (fma 2.0 C (* -0.5 t_2)))
(sqrt (* 2.0 (* F (- (pow B_m 2.0) (* 4.0 (* A C)))))))
t_4)
(if (<= t_5 -1e-219)
(/ (* t_1 (sqrt (* 2.0 (+ A (+ C (hypot (- A C) B_m)))))) t_6)
(if (<= t_5 0.0)
(*
(sqrt
(* F (/ (fma -0.5 t_2 (* 2.0 C)) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_5 INFINITY)
(/ (* t_1 (sqrt (* 2.0 (* 2.0 C)))) t_6)
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = sqrt((F * t_0));
double t_2 = pow(B_m, 2.0) / A;
double t_3 = (4.0 * A) * C;
double t_4 = t_3 - pow(B_m, 2.0);
double t_5 = 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_4;
double t_6 = -t_0;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = (sqrt(fma(2.0, C, (-0.5 * t_2))) * sqrt((2.0 * (F * (pow(B_m, 2.0) - (4.0 * (A * C))))))) / t_4;
} else if (t_5 <= -1e-219) {
tmp = (t_1 * sqrt((2.0 * (A + (C + hypot((A - C), B_m)))))) / t_6;
} else if (t_5 <= 0.0) {
tmp = sqrt((F * (fma(-0.5, t_2, (2.0 * C)) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_5 <= ((double) INFINITY)) {
tmp = (t_1 * sqrt((2.0 * (2.0 * C)))) / t_6;
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = sqrt(Float64(F * t_0)) t_2 = Float64((B_m ^ 2.0) / A) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(t_3 - (B_m ^ 2.0)) t_5 = 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)))))) / t_4) t_6 = Float64(-t_0) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(2.0, C, Float64(-0.5 * t_2))) * sqrt(Float64(2.0 * Float64(F * Float64((B_m ^ 2.0) - Float64(4.0 * Float64(A * C))))))) / t_4); elseif (t_5 <= -1e-219) tmp = Float64(Float64(t_1 * sqrt(Float64(2.0 * Float64(A + Float64(C + hypot(Float64(A - C), B_m)))))) / t_6); elseif (t_5 <= 0.0) tmp = Float64(sqrt(Float64(F * Float64(fma(-0.5, t_2, Float64(2.0 * C)) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_5 <= Inf) tmp = Float64(Float64(t_1 * sqrt(Float64(2.0 * Float64(2.0 * C)))) / t_6); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = 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] / t$95$4), $MachinePrecision]}, Block[{t$95$6 = (-t$95$0)}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * C + N[(-0.5 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, -1e-219], N[(N[(t$95$1 * N[Sqrt[N[(2.0 * N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[Sqrt[N[(F * N[(N[(-0.5 * t$95$2 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[(t$95$1 * N[Sqrt[N[(2.0 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$6), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \sqrt{F \cdot t\_0}\\
t_2 := \frac{{B\_m}^{2}}{A}\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := t\_3 - {B\_m}^{2}\\
t_5 := \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\_4}\\
t_6 := -t\_0\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, C, -0.5 \cdot t\_2\right)} \cdot \sqrt{2 \cdot \left(F \cdot \left({B\_m}^{2} - 4 \cdot \left(A \cdot C\right)\right)\right)}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-219}:\\
\;\;\;\;\frac{t\_1 \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\sqrt{F \cdot \frac{\mathsf{fma}\left(-0.5, t\_2, 2 \cdot C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{t\_1 \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{t\_6}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.1%
Taylor expanded in A around -inf 11.6%
pow1/212.7%
*-commutative12.7%
unpow-prod-down19.5%
pow1/219.2%
+-commutative19.2%
fma-define19.2%
pow1/219.2%
associate-*l*19.2%
Applied egg-rr19.2%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -1e-219Initial program 98.2%
Simplified98.2%
sqrt-prod98.9%
*-commutative98.9%
hypot-undefine98.9%
unpow298.9%
unpow298.9%
+-commutative98.9%
unpow298.9%
unpow298.9%
hypot-define98.9%
Applied egg-rr98.9%
if -1e-219 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -0.0Initial program 3.4%
Taylor expanded in A around -inf 27.2%
Taylor expanded in F around 0 21.2%
mul-1-neg21.2%
associate-/l*21.0%
fma-define21.0%
sub-neg21.0%
+-commutative21.0%
distribute-lft-neg-in21.0%
metadata-eval21.0%
fma-define21.0%
Simplified21.0%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 50.6%
Simplified84.6%
sqrt-prod94.3%
*-commutative94.3%
hypot-undefine46.3%
unpow246.3%
unpow246.3%
+-commutative46.3%
unpow246.3%
unpow246.3%
hypot-define94.3%
Applied egg-rr94.3%
Taylor expanded in A around -inf 56.7%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Taylor expanded in C around 0 1.8%
mul-1-neg1.8%
+-commutative1.8%
unpow21.8%
unpow21.8%
hypot-define19.0%
Simplified19.0%
pow1/219.0%
*-commutative19.0%
unpow-prod-down30.2%
pow1/230.2%
pow1/230.2%
Applied egg-rr30.2%
Final simplification37.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
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (* -0.5 (/ (pow B_m 2.0) A)))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (- (sqrt t_1))))))
(if (<= (pow B_m 2.0) 5e-78)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C))) t_2)
(if (<= (pow B_m 2.0) 2e+23)
t_3
(if (<= (pow B_m 2.0) 2e+46)
(/ (sqrt (* (+ t_1 (* 2.0 C)) (* 2.0 (* F (* C (* A -4.0)))))) t_2)
(if (<= (pow B_m 2.0) 2e+150)
(* (sqrt 2.0) (* (sqrt F) (- (sqrt (/ 1.0 B_m)))))
(if (<= (pow B_m 2.0) 1e+200)
t_3
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = (4.0 * A) * C;
double t_1 = -0.5 * (pow(B_m, 2.0) / A);
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt(t_1));
double tmp;
if (pow(B_m, 2.0) <= 5e-78) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_2;
} else if (pow(B_m, 2.0) <= 2e+23) {
tmp = t_3;
} else if (pow(B_m, 2.0) <= 2e+46) {
tmp = sqrt(((t_1 + (2.0 * C)) * (2.0 * (F * (C * (A * -4.0)))))) / t_2;
} else if (pow(B_m, 2.0) <= 2e+150) {
tmp = sqrt(2.0) * (sqrt(F) * -sqrt((1.0 / B_m)));
} else if (pow(B_m, 2.0) <= 1e+200) {
tmp = t_3;
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(2.0) / -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 t_1 = -0.5 * (Math.pow(B_m, 2.0) / A);
double t_2 = t_0 - Math.pow(B_m, 2.0);
double t_3 = (Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * -Math.sqrt(t_1));
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-78) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_2;
} else if (Math.pow(B_m, 2.0) <= 2e+23) {
tmp = t_3;
} else if (Math.pow(B_m, 2.0) <= 2e+46) {
tmp = Math.sqrt(((t_1 + (2.0 * C)) * (2.0 * (F * (C * (A * -4.0)))))) / t_2;
} else if (Math.pow(B_m, 2.0) <= 2e+150) {
tmp = Math.sqrt(2.0) * (Math.sqrt(F) * -Math.sqrt((1.0 / B_m)));
} else if (Math.pow(B_m, 2.0) <= 1e+200) {
tmp = t_3;
} else {
tmp = (Math.sqrt((A + Math.hypot(B_m, A))) * Math.sqrt(F)) * (Math.sqrt(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): t_0 = (4.0 * A) * C t_1 = -0.5 * (math.pow(B_m, 2.0) / A) t_2 = t_0 - math.pow(B_m, 2.0) t_3 = (math.sqrt(2.0) / B_m) * (math.sqrt(F) * -math.sqrt(t_1)) tmp = 0 if math.pow(B_m, 2.0) <= 5e-78: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_2 elif math.pow(B_m, 2.0) <= 2e+23: tmp = t_3 elif math.pow(B_m, 2.0) <= 2e+46: tmp = math.sqrt(((t_1 + (2.0 * C)) * (2.0 * (F * (C * (A * -4.0)))))) / t_2 elif math.pow(B_m, 2.0) <= 2e+150: tmp = math.sqrt(2.0) * (math.sqrt(F) * -math.sqrt((1.0 / B_m))) elif math.pow(B_m, 2.0) <= 1e+200: tmp = t_3 else: tmp = (math.sqrt((A + math.hypot(B_m, A))) * math.sqrt(F)) * (math.sqrt(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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(-0.5 * Float64((B_m ^ 2.0) / A)) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(t_1)))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-78) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / t_2); elseif ((B_m ^ 2.0) <= 2e+23) tmp = t_3; elseif ((B_m ^ 2.0) <= 2e+46) tmp = Float64(sqrt(Float64(Float64(t_1 + Float64(2.0 * C)) * Float64(2.0 * Float64(F * Float64(C * Float64(A * -4.0)))))) / t_2); elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(sqrt(2.0) * Float64(sqrt(F) * Float64(-sqrt(Float64(1.0 / B_m))))); elseif ((B_m ^ 2.0) <= 1e+200) tmp = t_3; else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / 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)
t_0 = (4.0 * A) * C;
t_1 = -0.5 * ((B_m ^ 2.0) / A);
t_2 = t_0 - (B_m ^ 2.0);
t_3 = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt(t_1));
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-78)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / t_2;
elseif ((B_m ^ 2.0) <= 2e+23)
tmp = t_3;
elseif ((B_m ^ 2.0) <= 2e+46)
tmp = sqrt(((t_1 + (2.0 * C)) * (2.0 * (F * (C * (A * -4.0)))))) / t_2;
elseif ((B_m ^ 2.0) <= 2e+150)
tmp = sqrt(2.0) * (sqrt(F) * -sqrt((1.0 / B_m)));
elseif ((B_m ^ 2.0) <= 1e+200)
tmp = t_3;
else
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[t$95$1], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-78], 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] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+23], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+46], N[(N[Sqrt[N[(N[(t$95$1 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+200], t$95$3, N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \left(4 \cdot A\right) \cdot C\\
t_1 := -0.5 \cdot \frac{{B\_m}^{2}}{A}\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{t\_1}\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-78}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+23}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+46}:\\
\;\;\;\;\frac{\sqrt{\left(t\_1 + 2 \cdot C\right) \cdot \left(2 \cdot \left(F \cdot \left(C \cdot \left(A \cdot -4\right)\right)\right)\right)}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\sqrt{2} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{\frac{1}{B\_m}}\right)\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+200}:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 4.9999999999999996e-78Initial program 20.2%
Taylor expanded in A around -inf 23.6%
if 4.9999999999999996e-78 < (pow.f64 B 2) < 1.9999999999999998e23 or 1.99999999999999996e150 < (pow.f64 B 2) < 9.9999999999999997e199Initial program 25.6%
Taylor expanded in C around 0 5.6%
mul-1-neg5.6%
+-commutative5.6%
unpow25.6%
unpow25.6%
hypot-define6.2%
Simplified6.2%
pow1/26.2%
*-commutative6.2%
unpow-prod-down7.7%
pow1/27.7%
pow1/27.7%
Applied egg-rr7.7%
Taylor expanded in A around -inf 24.0%
if 1.9999999999999998e23 < (pow.f64 B 2) < 2e46Initial program 42.2%
Taylor expanded in A around -inf 41.9%
Taylor expanded in B around 0 80.0%
associate-*r*80.0%
Simplified80.0%
if 2e46 < (pow.f64 B 2) < 1.99999999999999996e150Initial program 36.2%
Taylor expanded in B around inf 28.2%
mul-1-neg28.2%
Simplified28.2%
pow1/228.2%
div-inv28.2%
unpow-prod-down32.0%
pow1/232.0%
Applied egg-rr32.0%
unpow1/232.0%
Simplified32.0%
if 9.9999999999999997e199 < (pow.f64 B 2) Initial program 8.4%
Taylor expanded in C around 0 10.3%
mul-1-neg10.3%
+-commutative10.3%
unpow210.3%
unpow210.3%
hypot-define29.9%
Simplified29.9%
pow1/229.9%
*-commutative29.9%
unpow-prod-down44.3%
pow1/244.3%
pow1/244.3%
Applied egg-rr44.3%
Final simplification32.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))
(t_1
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(- t_0 (pow B_m 2.0))))
(t_2 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 500.0)
t_1
(if (<= (pow B_m 2.0) 2e+150)
(/
(* B_m (* (sqrt (+ A (+ C (hypot B_m (- A C))))) (- (sqrt (* 2.0 F)))))
t_2)
(if (<= (pow B_m 2.0) 5e+163)
t_1
(if (<= (pow B_m 2.0) 2e+253)
(/
(* (sqrt (* 2.0 (+ A (+ C (hypot (- A C) B_m))))) (* B_m (sqrt F)))
(- t_2))
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = (4.0 * A) * C;
double t_1 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / (t_0 - pow(B_m, 2.0));
double t_2 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 500.0) {
tmp = t_1;
} else if (pow(B_m, 2.0) <= 2e+150) {
tmp = (B_m * (sqrt((A + (C + hypot(B_m, (A - C))))) * -sqrt((2.0 * F)))) / t_2;
} else if (pow(B_m, 2.0) <= 5e+163) {
tmp = t_1;
} else if (pow(B_m, 2.0) <= 2e+253) {
tmp = (sqrt((2.0 * (A + (C + hypot((A - C), B_m))))) * (B_m * sqrt(F))) / -t_2;
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / Float64(t_0 - (B_m ^ 2.0))) t_2 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 500.0) tmp = t_1; elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(Float64(B_m * Float64(sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) * Float64(-sqrt(Float64(2.0 * F))))) / t_2); elseif ((B_m ^ 2.0) <= 5e+163) tmp = t_1; elseif ((B_m ^ 2.0) <= 2e+253) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) * Float64(B_m * sqrt(F))) / Float64(-t_2)); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = 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[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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], 500.0], t$95$1, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[(B$95$m * N[(N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+163], t$95$1, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+253], N[(N[(N[Sqrt[N[(2.0 * N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-t$95$2)), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 500:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)} \cdot \left(-\sqrt{2 \cdot F}\right)\right)}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+163}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+253}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)} \cdot \left(B\_m \cdot \sqrt{F}\right)}{-t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 500 or 1.99999999999999996e150 < (pow.f64 B 2) < 5e163Initial program 20.1%
Taylor expanded in A around -inf 26.5%
if 500 < (pow.f64 B 2) < 1.99999999999999996e150Initial program 40.9%
Simplified47.8%
Taylor expanded in B around inf 44.6%
pow1/244.6%
unpow244.6%
associate-*l*44.6%
unpow-prod-down47.6%
pow-prod-down28.1%
pow1/228.1%
pow1/228.1%
add-sqr-sqrt29.0%
associate-+r+29.2%
Applied egg-rr29.2%
associate-*r*29.2%
unpow-prod-down35.0%
pow1/235.0%
associate-+l+34.8%
Applied egg-rr34.8%
unpow1/234.8%
Simplified34.8%
if 5e163 < (pow.f64 B 2) < 1.9999999999999999e253Initial program 32.5%
Simplified38.8%
sqrt-prod44.8%
*-commutative44.8%
hypot-undefine32.6%
unpow232.6%
unpow232.6%
+-commutative32.6%
unpow232.6%
unpow232.6%
hypot-define44.8%
Applied egg-rr44.8%
Taylor expanded in B around inf 23.9%
if 1.9999999999999999e253 < (pow.f64 B 2) Initial program 4.2%
Taylor expanded in C around 0 8.2%
mul-1-neg8.2%
+-commutative8.2%
unpow28.2%
unpow28.2%
hypot-define30.0%
Simplified30.0%
pow1/230.0%
*-commutative30.0%
unpow-prod-down46.1%
pow1/246.1%
pow1/246.1%
Applied egg-rr46.1%
Final simplification33.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 (* (* 4.0 A) C))
(t_1 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))
(t_2 (fma B_m B_m (* A (* C -4.0))))
(t_3 (- t_0 (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 500.0)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) t_1)) t_3)
(if (<= (pow B_m 2.0) 2e+150)
(/
(* B_m (* (sqrt (+ A (+ C (hypot B_m (- A C))))) (- (sqrt (* 2.0 F)))))
t_2)
(if (<= (pow B_m 2.0) 5e+163)
(/
(sqrt (* t_1 (* 2.0 (* F (* C (- (/ (pow B_m 2.0) C) (* 4.0 A)))))))
t_3)
(if (<= (pow B_m 2.0) 2e+253)
(/
(* (sqrt (* 2.0 (+ A (+ C (hypot (- A C) B_m))))) (* B_m (sqrt F)))
(- t_2))
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = (4.0 * A) * C;
double t_1 = (-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C);
double t_2 = fma(B_m, B_m, (A * (C * -4.0)));
double t_3 = t_0 - pow(B_m, 2.0);
double tmp;
if (pow(B_m, 2.0) <= 500.0) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * t_1)) / t_3;
} else if (pow(B_m, 2.0) <= 2e+150) {
tmp = (B_m * (sqrt((A + (C + hypot(B_m, (A - C))))) * -sqrt((2.0 * F)))) / t_2;
} else if (pow(B_m, 2.0) <= 5e+163) {
tmp = sqrt((t_1 * (2.0 * (F * (C * ((pow(B_m, 2.0) / C) - (4.0 * A))))))) / t_3;
} else if (pow(B_m, 2.0) <= 2e+253) {
tmp = (sqrt((2.0 * (A + (C + hypot((A - C), B_m))))) * (B_m * sqrt(F))) / -t_2;
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)) t_2 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_3 = Float64(t_0 - (B_m ^ 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 500.0) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * t_1)) / t_3); elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(Float64(B_m * Float64(sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) * Float64(-sqrt(Float64(2.0 * F))))) / t_2); elseif ((B_m ^ 2.0) <= 5e+163) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(F * Float64(C * Float64(Float64((B_m ^ 2.0) / C) - Float64(4.0 * A))))))) / t_3); elseif ((B_m ^ 2.0) <= 2e+253) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) * Float64(B_m * sqrt(F))) / Float64(-t_2)); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 500.0], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[(B$95$m * N[(N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+163], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * N[(F * N[(C * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+253], N[(N[(N[Sqrt[N[(2.0 * N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-t$95$2)), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \left(4 \cdot A\right) \cdot C\\
t_1 := -0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\\
t_2 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_3 := t\_0 - {B\_m}^{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 500:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot t\_1}}{t\_3}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)} \cdot \left(-\sqrt{2 \cdot F}\right)\right)}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+163}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(F \cdot \left(C \cdot \left(\frac{{B\_m}^{2}}{C} - 4 \cdot A\right)\right)\right)\right)}}{t\_3}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+253}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)} \cdot \left(B\_m \cdot \sqrt{F}\right)}{-t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 500Initial program 20.8%
Taylor expanded in A around -inf 25.1%
if 500 < (pow.f64 B 2) < 1.99999999999999996e150Initial program 40.9%
Simplified47.8%
Taylor expanded in B around inf 44.6%
pow1/244.6%
unpow244.6%
associate-*l*44.6%
unpow-prod-down47.6%
pow-prod-down28.1%
pow1/228.1%
pow1/228.1%
add-sqr-sqrt29.0%
associate-+r+29.2%
Applied egg-rr29.2%
associate-*r*29.2%
unpow-prod-down35.0%
pow1/235.0%
associate-+l+34.8%
Applied egg-rr34.8%
unpow1/234.8%
Simplified34.8%
if 1.99999999999999996e150 < (pow.f64 B 2) < 5e163Initial program 2.1%
Taylor expanded in A around -inf 60.3%
Taylor expanded in C around inf 60.6%
if 5e163 < (pow.f64 B 2) < 1.9999999999999999e253Initial program 32.5%
Simplified38.8%
sqrt-prod44.8%
*-commutative44.8%
hypot-undefine32.6%
unpow232.6%
unpow232.6%
+-commutative32.6%
unpow232.6%
unpow232.6%
hypot-define44.8%
Applied egg-rr44.8%
Taylor expanded in B around inf 23.9%
if 1.9999999999999999e253 < (pow.f64 B 2) Initial program 4.2%
Taylor expanded in C around 0 8.2%
mul-1-neg8.2%
+-commutative8.2%
unpow28.2%
unpow28.2%
hypot-define30.0%
Simplified30.0%
pow1/230.0%
*-commutative30.0%
unpow-prod-down46.1%
pow1/246.1%
pow1/246.1%
Applied egg-rr46.1%
Final simplification33.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 (* (* 4.0 A) C))
(t_1 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))
(t_2 (- t_0 (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 500.0)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) t_1)) t_2)
(if (<= (pow B_m 2.0) 2e+150)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= (pow B_m 2.0) 5e+163)
(/
(sqrt (* t_1 (* 2.0 (* F (* C (- (/ (pow B_m 2.0) C) (* 4.0 A)))))))
t_2)
(if (<= (pow B_m 2.0) 2e+253)
(/
(* (sqrt (* 2.0 (+ A (+ C (hypot (- A C) B_m))))) (* B_m (sqrt F)))
(- (fma B_m B_m (* A (* C -4.0)))))
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = (4.0 * A) * C;
double t_1 = (-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C);
double t_2 = t_0 - pow(B_m, 2.0);
double tmp;
if (pow(B_m, 2.0) <= 500.0) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * t_1)) / t_2;
} else if (pow(B_m, 2.0) <= 2e+150) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (pow(B_m, 2.0) <= 5e+163) {
tmp = sqrt((t_1 * (2.0 * (F * (C * ((pow(B_m, 2.0) / C) - (4.0 * A))))))) / t_2;
} else if (pow(B_m, 2.0) <= 2e+253) {
tmp = (sqrt((2.0 * (A + (C + hypot((A - C), B_m))))) * (B_m * sqrt(F))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)) t_2 = Float64(t_0 - (B_m ^ 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 500.0) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * t_1)) / t_2); elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif ((B_m ^ 2.0) <= 5e+163) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(F * Float64(C * Float64(Float64((B_m ^ 2.0) / C) - Float64(4.0 * A))))))) / t_2); elseif ((B_m ^ 2.0) <= 2e+253) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) * Float64(B_m * sqrt(F))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 500.0], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+163], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * N[(F * N[(C * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+253], N[(N[(N[Sqrt[N[(2.0 * N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \left(4 \cdot A\right) \cdot C\\
t_1 := -0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\\
t_2 := t\_0 - {B\_m}^{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 500:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+163}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(F \cdot \left(C \cdot \left(\frac{{B\_m}^{2}}{C} - 4 \cdot A\right)\right)\right)\right)}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+253}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)} \cdot \left(B\_m \cdot \sqrt{F}\right)}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 500Initial program 20.8%
Taylor expanded in A around -inf 25.1%
if 500 < (pow.f64 B 2) < 1.99999999999999996e150Initial program 40.9%
Taylor expanded in F around 0 35.4%
mul-1-neg35.4%
Simplified59.7%
if 1.99999999999999996e150 < (pow.f64 B 2) < 5e163Initial program 2.1%
Taylor expanded in A around -inf 60.3%
Taylor expanded in C around inf 60.6%
if 5e163 < (pow.f64 B 2) < 1.9999999999999999e253Initial program 32.5%
Simplified38.8%
sqrt-prod44.8%
*-commutative44.8%
hypot-undefine32.6%
unpow232.6%
unpow232.6%
+-commutative32.6%
unpow232.6%
unpow232.6%
hypot-define44.8%
Applied egg-rr44.8%
Taylor expanded in B around inf 23.9%
if 1.9999999999999999e253 < (pow.f64 B 2) Initial program 4.2%
Taylor expanded in C around 0 8.2%
mul-1-neg8.2%
+-commutative8.2%
unpow28.2%
unpow28.2%
hypot-define30.0%
Simplified30.0%
pow1/230.0%
*-commutative30.0%
unpow-prod-down46.1%
pow1/246.1%
pow1/246.1%
Applied egg-rr46.1%
Final simplification36.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 (* (* 4.0 A) C)) (t_1 (/ (sqrt 2.0) B_m)))
(if (<= (pow B_m 2.0) 1e-11)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 2e+150)
(/
(* B_m (* (sqrt (+ A (+ C (hypot B_m (- A C))))) (- (sqrt (* 2.0 F)))))
(fma B_m B_m (* A (* C -4.0))))
(if (<= (pow B_m 2.0) 1e+200)
(* t_1 (* (sqrt F) (- (sqrt (* -0.5 (/ (pow B_m 2.0) A))))))
(if (<= (pow B_m 2.0) 2e+271)
(* t_1 (- (sqrt (* F (+ C (hypot B_m C))))))
(*
(* (sqrt (+ A (hypot B_m A))) (sqrt F))
(/ (sqrt 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 t_0 = (4.0 * A) * C;
double t_1 = sqrt(2.0) / B_m;
double tmp;
if (pow(B_m, 2.0) <= 1e-11) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 2e+150) {
tmp = (B_m * (sqrt((A + (C + hypot(B_m, (A - C))))) * -sqrt((2.0 * F)))) / fma(B_m, B_m, (A * (C * -4.0)));
} else if (pow(B_m, 2.0) <= 1e+200) {
tmp = t_1 * (sqrt(F) * -sqrt((-0.5 * (pow(B_m, 2.0) / A))));
} else if (pow(B_m, 2.0) <= 2e+271) {
tmp = t_1 * -sqrt((F * (C + hypot(B_m, C))));
} else {
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(2.0) / B_m) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-11) 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))); elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(Float64(B_m * Float64(sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) * Float64(-sqrt(Float64(2.0 * F))))) / fma(B_m, B_m, Float64(A * Float64(C * -4.0)))); elseif ((B_m ^ 2.0) <= 1e+200) tmp = Float64(t_1 * Float64(sqrt(F) * Float64(-sqrt(Float64(-0.5 * Float64((B_m ^ 2.0) / A)))))); elseif ((B_m ^ 2.0) <= 2e+271) tmp = Float64(t_1 * Float64(-sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-11], 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], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[(B$95$m * N[(N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+200], N[(t$95$1 * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+271], N[(t$95$1 * (-N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{2}}{B\_m}\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-11}:\\
\;\;\;\;\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{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)} \cdot \left(-\sqrt{2 \cdot F}\right)\right)}{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+200}:\\
\;\;\;\;t\_1 \cdot \left(\sqrt{F} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A}}\right)\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+271}:\\
\;\;\;\;t\_1 \cdot \left(-\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 9.99999999999999939e-12Initial program 20.4%
Taylor expanded in A around -inf 23.7%
if 9.99999999999999939e-12 < (pow.f64 B 2) < 1.99999999999999996e150Initial program 40.4%
Simplified46.6%
Taylor expanded in B around inf 43.7%
pow1/243.7%
unpow243.7%
associate-*l*41.1%
unpow-prod-down43.8%
pow-prod-down25.7%
pow1/225.7%
pow1/225.7%
add-sqr-sqrt26.7%
associate-+r+26.9%
Applied egg-rr26.9%
associate-*r*26.9%
unpow-prod-down32.3%
pow1/232.3%
associate-+l+32.0%
Applied egg-rr32.0%
unpow1/232.0%
Simplified32.0%
if 1.99999999999999996e150 < (pow.f64 B 2) < 9.9999999999999997e199Initial program 10.0%
Taylor expanded in C around 0 2.9%
mul-1-neg2.9%
+-commutative2.9%
unpow22.9%
unpow22.9%
hypot-define4.0%
Simplified4.0%
pow1/24.0%
*-commutative4.0%
unpow-prod-down7.4%
pow1/27.4%
pow1/27.4%
Applied egg-rr7.4%
Taylor expanded in A around -inf 48.2%
if 9.9999999999999997e199 < (pow.f64 B 2) < 1.99999999999999991e271Initial program 47.5%
Taylor expanded in A around 0 39.7%
mul-1-neg39.7%
unpow239.7%
unpow239.7%
hypot-define40.5%
Simplified40.5%
if 1.99999999999999991e271 < (pow.f64 B 2) Initial program 1.6%
Taylor expanded in C around 0 5.9%
mul-1-neg5.9%
+-commutative5.9%
unpow25.9%
unpow25.9%
hypot-define28.9%
Simplified28.9%
pow1/228.9%
*-commutative28.9%
unpow-prod-down45.8%
pow1/245.8%
pow1/245.8%
Applied egg-rr45.8%
Final simplification33.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
(if (<= (pow B_m 2.0) 2e-225)
(/
(sqrt (* (* -8.0 (* A (* C F))) (+ A (+ C (hypot B_m (- C A))))))
(- (* 4.0 (* A C)) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 500.0)
(* (sqrt (* -0.5 (* (pow B_m 2.0) (/ F A)))) (/ (sqrt 2.0) (- B_m)))
(/ (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 (pow(B_m, 2.0) <= 2e-225) {
tmp = sqrt(((-8.0 * (A * (C * F))) * (A + (C + hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 500.0) {
tmp = sqrt((-0.5 * (pow(B_m, 2.0) * (F / A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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 (Math.pow(B_m, 2.0) <= 2e-225) {
tmp = Math.sqrt(((-8.0 * (A * (C * F))) * (A + (C + Math.hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - Math.pow(B_m, 2.0));
} else if (Math.pow(B_m, 2.0) <= 500.0) {
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 * 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 math.pow(B_m, 2.0) <= 2e-225: tmp = math.sqrt(((-8.0 * (A * (C * F))) * (A + (C + math.hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - math.pow(B_m, 2.0)) elif math.pow(B_m, 2.0) <= 500.0: 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 * 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 ^ 2.0) <= 2e-225) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(A + Float64(C + hypot(B_m, Float64(C - A)))))) / Float64(Float64(4.0 * Float64(A * C)) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 500.0) tmp = Float64(sqrt(Float64(-0.5 * Float64((B_m ^ 2.0) * Float64(F / A)))) * Float64(sqrt(2.0) / Float64(-B_m))); 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 ^ 2.0) <= 2e-225)
tmp = sqrt(((-8.0 * (A * (C * F))) * (A + (C + hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - (B_m ^ 2.0));
elseif ((B_m ^ 2.0) <= 500.0)
tmp = sqrt((-0.5 * ((B_m ^ 2.0) * (F / A)))) * (sqrt(2.0) / -B_m);
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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-225], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(C - A), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 500.0], N[(N[Sqrt[N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] * N[(F / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $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}^{2} \leq 2 \cdot 10^{-225}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, C - A\right)\right)\right)}}{4 \cdot \left(A \cdot C\right) - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 500:\\
\;\;\;\;\sqrt{-0.5 \cdot \left({B\_m}^{2} \cdot \frac{F}{A}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.9999999999999999e-225Initial program 14.1%
Simplified27.5%
Taylor expanded in A around inf 23.3%
if 1.9999999999999999e-225 < (pow.f64 B 2) < 500Initial program 33.2%
Taylor expanded in C around 0 7.9%
mul-1-neg7.9%
+-commutative7.9%
unpow27.9%
unpow27.9%
hypot-define8.2%
Simplified8.2%
Taylor expanded in A around -inf 9.3%
associate-/l*8.9%
Simplified8.9%
if 500 < (pow.f64 B 2) Initial program 16.6%
Taylor expanded in B around inf 27.7%
mul-1-neg27.7%
Simplified27.7%
sqrt-div33.7%
Applied egg-rr33.7%
associate-*l/33.7%
pow1/233.7%
pow1/233.7%
pow-prod-down33.8%
Applied egg-rr33.8%
unpow1/233.8%
Simplified33.8%
Final simplification26.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
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 2e+46)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(* (* (sqrt (+ A (hypot B_m A))) (sqrt F)) (/ (sqrt 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 t_0 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 2e+46) {
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((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(2.0) / -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) <= 2e+46) {
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((A + Math.hypot(B_m, A))) * Math.sqrt(F)) * (Math.sqrt(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): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 2e+46: 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((A + math.hypot(B_m, A))) * math.sqrt(F)) * (math.sqrt(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) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+46) 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(Float64(A + hypot(B_m, A))) * sqrt(F)) * Float64(sqrt(2.0) / 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)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 2e+46)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt((A + hypot(B_m, A))) * sqrt(F)) * (sqrt(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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+46], 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[N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+46}:\\
\;\;\;\;\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}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B\_m, A\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 2e46Initial program 23.1%
Taylor expanded in A around -inf 25.2%
if 2e46 < (pow.f64 B 2) Initial program 13.8%
Taylor expanded in C around 0 13.6%
mul-1-neg13.6%
+-commutative13.6%
unpow213.6%
unpow213.6%
hypot-define27.9%
Simplified27.9%
pow1/227.9%
*-commutative27.9%
unpow-prod-down39.3%
pow1/239.3%
pow1/239.3%
Applied egg-rr39.3%
Final simplification32.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
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 2e+46)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(/ (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 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 2e+46) {
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 * 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) :: t_0
real(8) :: tmp
t_0 = (4.0d0 * a) * c
if ((b_m ** 2.0d0) <= 2d+46) 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 * 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 t_0 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 2e+46) {
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 * 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): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 2e+46: 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 * 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) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+46) 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(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)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 2e+46)
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 * 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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+46], 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[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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+46}:\\
\;\;\;\;\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 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 2e46Initial program 23.1%
Taylor expanded in A around -inf 25.2%
if 2e46 < (pow.f64 B 2) Initial program 13.8%
Taylor expanded in B around inf 29.0%
mul-1-neg29.0%
Simplified29.0%
sqrt-div35.5%
Applied egg-rr35.5%
associate-*l/35.5%
pow1/235.5%
pow1/235.5%
pow-prod-down35.6%
Applied egg-rr35.6%
unpow1/235.6%
Simplified35.6%
Final simplification30.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 (<= B_m 2900.0) (* (sqrt (* -0.5 (* (pow B_m 2.0) (/ F A)))) (/ (sqrt 2.0) (- B_m))) (/ (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 <= 2900.0) {
tmp = sqrt((-0.5 * (pow(B_m, 2.0) * (F / A)))) * (sqrt(2.0) / -B_m);
} 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 <= 2900.0d0) then
tmp = sqrt(((-0.5d0) * ((b_m ** 2.0d0) * (f / a)))) * (sqrt(2.0d0) / -b_m)
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 <= 2900.0) {
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 * 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 <= 2900.0: 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 * 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 <= 2900.0) tmp = Float64(sqrt(Float64(-0.5 * Float64((B_m ^ 2.0) * Float64(F / A)))) * Float64(sqrt(2.0) / Float64(-B_m))); 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 <= 2900.0)
tmp = sqrt((-0.5 * ((B_m ^ 2.0) * (F / A)))) * (sqrt(2.0) / -B_m);
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, 2900.0], N[(N[Sqrt[N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] * N[(F / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $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 2900:\\
\;\;\;\;\sqrt{-0.5 \cdot \left({B\_m}^{2} \cdot \frac{F}{A}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2900Initial program 18.7%
Taylor expanded in C around 0 3.5%
mul-1-neg3.5%
+-commutative3.5%
unpow23.5%
unpow23.5%
hypot-define4.2%
Simplified4.2%
Taylor expanded in A around -inf 5.5%
associate-/l*4.8%
Simplified4.8%
if 2900 < B Initial program 18.5%
Taylor expanded in B around inf 49.2%
mul-1-neg49.2%
Simplified49.2%
sqrt-div61.5%
Applied egg-rr61.5%
associate-*l/61.4%
pow1/261.4%
pow1/261.4%
pow-prod-down61.6%
Applied egg-rr61.6%
unpow1/261.6%
Simplified61.6%
Final simplification21.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 700.0) (* (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) A))) (/ (sqrt 2.0) (- B_m))) (/ (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 <= 700.0) {
tmp = sqrt((-0.5 * ((pow(B_m, 2.0) * F) / A))) * (sqrt(2.0) / -B_m);
} 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 <= 700.0d0) then
tmp = sqrt(((-0.5d0) * (((b_m ** 2.0d0) * f) / a))) * (sqrt(2.0d0) / -b_m)
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 <= 700.0) {
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 * 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 <= 700.0: 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 * 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 <= 700.0) tmp = Float64(sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / A))) * Float64(sqrt(2.0) / Float64(-B_m))); 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 <= 700.0)
tmp = sqrt((-0.5 * (((B_m ^ 2.0) * F) / A))) * (sqrt(2.0) / -B_m);
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, 700.0], 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[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 700:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{{B\_m}^{2} \cdot F}{A}} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 700Initial program 18.7%
Taylor expanded in C around 0 3.5%
mul-1-neg3.5%
+-commutative3.5%
unpow23.5%
unpow23.5%
hypot-define4.2%
Simplified4.2%
Taylor expanded in A around -inf 5.5%
if 700 < B Initial program 18.5%
Taylor expanded in B around inf 49.2%
mul-1-neg49.2%
Simplified49.2%
sqrt-div61.5%
Applied egg-rr61.5%
associate-*l/61.4%
pow1/261.4%
pow1/261.4%
pow-prod-down61.6%
Applied egg-rr61.6%
unpow1/261.6%
Simplified61.6%
Final simplification21.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 (if (<= F 8e+26) (* (/ (sqrt 2.0) B_m) (- (sqrt (* F (+ C (hypot B_m C)))))) (/ (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 (F <= 8e+26) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + hypot(B_m, C))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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 (F <= 8e+26) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (C + Math.hypot(B_m, C))));
} 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 F <= 8e+26: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (C + math.hypot(B_m, C)))) 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 (F <= 8e+26) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); 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 (F <= 8e+26)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + hypot(B_m, C))));
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[F, 8e+26], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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}\;F \leq 8 \cdot 10^{+26}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if F < 8.00000000000000038e26Initial program 24.2%
Taylor expanded in A around 0 10.3%
mul-1-neg10.3%
unpow210.3%
unpow210.3%
hypot-define20.3%
Simplified20.3%
if 8.00000000000000038e26 < F Initial program 9.5%
Taylor expanded in B around inf 20.0%
mul-1-neg20.0%
Simplified20.0%
sqrt-div21.1%
Applied egg-rr21.1%
associate-*l/21.1%
pow1/221.1%
pow1/221.1%
pow-prod-down21.1%
Applied egg-rr21.1%
unpow1/221.1%
Simplified21.1%
Final simplification20.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 (- (sqrt (fabs (* 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(fabs((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(abs((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(Math.abs((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(math.fabs((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(abs(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(abs((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[Abs[N[(F * N[(2.0 / 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])\\
\\
-\sqrt{\left|F \cdot \frac{2}{B\_m}\right|}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
pow115.8%
sqrt-unprod15.9%
Applied egg-rr15.9%
unpow115.9%
Simplified15.9%
add-sqr-sqrt15.9%
pow1/215.9%
pow1/216.0%
pow-prod-down18.7%
pow218.7%
associate-*l/18.7%
Applied egg-rr18.7%
unpow1/218.7%
unpow218.7%
rem-sqrt-square28.8%
associate-/l*28.8%
Simplified28.8%
Final simplification28.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 (* (sqrt F) (- (sqrt (/ 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) * -sqrt((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) * -sqrt((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) * -Math.sqrt((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) * -math.sqrt((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(F) * Float64(-sqrt(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) * -sqrt((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[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[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 \left(-\sqrt{\frac{2}{B\_m}}\right)
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
sqrt-div19.4%
Applied egg-rr19.4%
sqrt-undiv15.8%
sqrt-prod15.9%
pow115.9%
associate-*l/15.9%
Applied egg-rr15.9%
unpow115.9%
associate-/l*15.9%
Simplified15.9%
pow1/216.0%
*-commutative16.0%
unpow-prod-down19.4%
pow1/219.4%
pow1/219.4%
Applied egg-rr19.4%
Final simplification19.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 (/ (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 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
sqrt-div19.4%
Applied egg-rr19.4%
associate-*l/19.4%
pow1/219.4%
pow1/219.4%
pow-prod-down19.4%
Applied egg-rr19.4%
unpow1/219.4%
Simplified19.4%
Final simplification19.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 (- (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 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
sqrt-unprod15.9%
pow1/216.0%
Applied egg-rr16.0%
Final simplification16.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 (- (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(Float64(2.0 * 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[(N[(2.0 * F), $MachinePrecision] / B$95$m), $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(\frac{2 \cdot F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
sqrt-div19.4%
Applied egg-rr19.4%
sqrt-undiv15.8%
sqrt-prod15.9%
pow1/216.0%
associate-*l/16.0%
Applied egg-rr16.0%
Final simplification16.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 (- (sqrt (* (/ F B_m) -2.0))))
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 / B_m) * -2.0));
}
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 / b_m) * (-2.0d0)))
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 / B_m) * -2.0));
}
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 / B_m) * -2.0))
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(Float64(F / B_m) * -2.0))) 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 / B_m) * -2.0));
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[(N[(F / B$95$m), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{F}{B\_m} \cdot -2}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
pow115.8%
sqrt-unprod15.9%
Applied egg-rr15.9%
unpow115.9%
Simplified15.9%
add-sqr-sqrt15.9%
pow1/215.9%
pow1/216.0%
pow-prod-down18.7%
pow218.7%
associate-*l/18.7%
Applied egg-rr18.7%
unpow1/218.7%
associate-/l*18.6%
Simplified18.6%
Taylor expanded in F around -inf 13.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 (* 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 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
sqrt-div19.4%
Applied egg-rr19.4%
sqrt-undiv15.8%
sqrt-prod15.9%
pow115.9%
associate-*l/15.9%
Applied egg-rr15.9%
unpow115.9%
associate-/l*15.9%
Simplified15.9%
Final simplification15.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 (- (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 18.6%
Taylor expanded in B around inf 15.8%
mul-1-neg15.8%
Simplified15.8%
pow115.8%
sqrt-unprod15.9%
Applied egg-rr15.9%
unpow115.9%
Simplified15.9%
Final simplification15.9%
herbie shell --seed 2024054
(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))))