
(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 14 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 (* 4.0 (* A C))) (t_1 (* -0.5 (/ (pow B_m 2.0) A))))
(if (<= B_m 2.5e-187)
(/
(sqrt (* 2.0 (* (* F (- (pow B_m 2.0) t_0)) (fma 2.0 C t_1))))
(- t_0 (pow B_m 2.0)))
(if (<= B_m 2.9e-157)
(* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))
(if (<= B_m 5.2e-29)
(/
(sqrt
(*
(* 2.0 (fma -4.0 (* A C) (pow B_m 2.0)))
(* F (+ t_1 (* 2.0 C)))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= B_m 7.5e+46)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* -4.0 (* A C))))))
(sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- (fma B_m B_m (* A (* C -4.0)))))
(* (sqrt 2.0) (/ (sqrt 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 t_1 = -0.5 * (pow(B_m, 2.0) / A);
double tmp;
if (B_m <= 2.5e-187) {
tmp = sqrt((2.0 * ((F * (pow(B_m, 2.0) - t_0)) * fma(2.0, C, t_1)))) / (t_0 - pow(B_m, 2.0));
} else if (B_m <= 2.9e-157) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else if (B_m <= 5.2e-29) {
tmp = sqrt(((2.0 * fma(-4.0, (A * C), pow(B_m, 2.0))) * (F * (t_1 + (2.0 * C))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (B_m <= 7.5e+46) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, (-4.0 * (A * C)))))) * sqrt((A + (C + hypot((A - C), B_m))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(4.0 * Float64(A * C)) t_1 = Float64(-0.5 * Float64((B_m ^ 2.0) / A)) tmp = 0.0 if (B_m <= 2.5e-187) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * fma(2.0, C, t_1)))) / Float64(t_0 - (B_m ^ 2.0))); elseif (B_m <= 2.9e-157) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); elseif (B_m <= 5.2e-29) tmp = Float64(sqrt(Float64(Float64(2.0 * fma(-4.0, Float64(A * C), (B_m ^ 2.0))) * Float64(F * Float64(t_1 + Float64(2.0 * C))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif (B_m <= 7.5e+46) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.5e-187], N[(N[Sqrt[N[(2.0 * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.9e-157], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.2e-29], N[(N[Sqrt[N[(N[(2.0 * N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(t$95$1 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 7.5e+46], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := 4 \cdot \left(A \cdot C\right)\\
t_1 := -0.5 \cdot \frac{{B\_m}^{2}}{A}\\
\mathbf{if}\;B\_m \leq 2.5 \cdot 10^{-187}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot \mathsf{fma}\left(2, C, t\_1\right)\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 2.9 \cdot 10^{-157}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 5.2 \cdot 10^{-29}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)\right) \cdot \left(F \cdot \left(t\_1 + 2 \cdot C\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 7.5 \cdot 10^{+46}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.4999999999999998e-187Initial program 20.4%
Taylor expanded in A around -inf 14.7%
distribute-frac-neg14.7%
associate-*l*14.7%
associate-*l*14.7%
+-commutative14.7%
fma-define14.7%
associate-*l*14.7%
Applied egg-rr14.7%
if 2.4999999999999998e-187 < B < 2.89999999999999988e-157Initial program 0.0%
+-commutative0.0%
unpow20.0%
unpow20.0%
hypot-undefine1.1%
add-exp-log1.1%
hypot-undefine0.0%
unpow20.0%
unpow20.0%
+-commutative0.0%
unpow20.0%
unpow20.0%
hypot-define1.1%
Applied egg-rr1.1%
Taylor expanded in F around 0 1.0%
mul-1-neg1.0%
Simplified35.9%
Taylor expanded in A around -inf 36.4%
if 2.89999999999999988e-157 < B < 5.2000000000000004e-29Initial program 34.8%
*-un-lft-identity34.8%
associate-*r*34.8%
associate-*l*34.8%
associate-+l+34.9%
unpow234.9%
unpow234.9%
hypot-define44.8%
Applied egg-rr44.8%
*-lft-identity44.8%
associate-*l*49.3%
cancel-sign-sub-inv49.3%
metadata-eval49.3%
+-commutative49.3%
fma-define49.3%
*-commutative49.3%
hypot-undefine35.0%
unpow235.0%
unpow235.0%
+-commutative35.0%
Simplified49.3%
Taylor expanded in A around -inf 39.2%
if 5.2000000000000004e-29 < B < 7.5000000000000003e46Initial program 38.3%
Simplified44.3%
associate-*r*44.3%
associate-+r+43.6%
hypot-undefine38.3%
unpow238.3%
unpow238.3%
+-commutative38.3%
sqrt-prod38.2%
*-commutative38.2%
associate-*r*38.2%
associate-+l+38.0%
Applied egg-rr53.0%
if 7.5000000000000003e46 < B Initial program 11.9%
Taylor expanded in B around inf 45.3%
mul-1-neg45.3%
distribute-rgt-neg-in45.3%
Simplified45.3%
sqrt-div63.3%
Applied egg-rr63.3%
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
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (* 2.0 (* (- (pow B_m 2.0) t_0) F)))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3
(/
(sqrt (* t_1 (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2)))
(if (<= t_3 -1e-197)
(*
(*
(sqrt F)
(sqrt
(/ (+ (+ A C) (hypot B_m (- A C))) (fma C (* A -4.0) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_3 INFINITY)
(/ (sqrt (* t_1 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))) t_2)
(* (sqrt 2.0) (/ (sqrt 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 t_1 = 2.0 * ((pow(B_m, 2.0) - t_0) * F);
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = sqrt((t_1 * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -1e-197) {
tmp = (sqrt(F) * sqrt((((A + C) + hypot(B_m, (A - C))) / fma(C, (A * -4.0), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_2;
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= -1e-197) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(C, Float64(A * -4.0), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / t_2); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $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[Sqrt[N[(t$95$1 * 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$2), $MachinePrecision]}, If[LessEqual[t$95$3, -1e-197], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(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]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{-197}:\\
\;\;\;\;\left(\sqrt{F} \cdot \sqrt{\frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}}\right) \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999999e-198Initial program 43.9%
+-commutative43.9%
unpow243.9%
unpow243.9%
hypot-undefine50.9%
add-exp-log48.2%
hypot-undefine42.1%
unpow242.1%
unpow242.1%
+-commutative42.1%
unpow242.1%
unpow242.1%
hypot-define48.2%
Applied egg-rr48.2%
Taylor expanded in F around 0 40.2%
mul-1-neg40.2%
Simplified50.8%
pow1/250.8%
associate-/l*57.5%
unpow-prod-down73.5%
pow1/273.5%
associate-+r+72.1%
+-commutative72.1%
*-commutative72.1%
fma-define72.1%
*-commutative72.1%
Applied egg-rr72.1%
unpow1/272.1%
Simplified72.1%
if -9.9999999999999999e-198 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 18.9%
Taylor expanded in A around -inf 36.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf 14.0%
mul-1-neg14.0%
distribute-rgt-neg-in14.0%
Simplified14.0%
sqrt-div21.9%
Applied egg-rr21.9%
Final simplification44.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) 5e-55)
(/
(sqrt (* -8.0 (* (* A C) (* F (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C))))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 2e+261)
(*
(- (sqrt 2.0))
(sqrt
(*
F
(/ (+ A (+ C (hypot B_m (- A C)))) (fma -4.0 (* A C) (pow B_m 2.0))))))
(* (sqrt 2.0) (/ (sqrt 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) <= 5e-55) {
tmp = sqrt((-8.0 * ((A * C) * (F * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 2e+261) {
tmp = -sqrt(2.0) * sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0)))));
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-55) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C)))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 2e+261) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-55], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+261], N[((-N[Sqrt[2.0], $MachinePrecision]) * 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]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-55}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+261}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \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)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-55Initial program 24.7%
Taylor expanded in A around -inf 24.4%
Taylor expanded in B around 0 23.3%
Taylor expanded in F around 0 20.6%
associate-*r*24.2%
fma-define24.2%
Simplified24.2%
if 5.0000000000000002e-55 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e261Initial program 30.6%
Taylor expanded in F around 0 34.4%
mul-1-neg34.4%
*-commutative34.4%
distribute-rgt-neg-in34.4%
associate-/l*35.7%
cancel-sign-sub-inv35.7%
metadata-eval35.7%
+-commutative35.7%
Simplified48.7%
if 1.9999999999999999e261 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.1%
Taylor expanded in B around inf 25.9%
mul-1-neg25.9%
distribute-rgt-neg-in25.9%
Simplified25.9%
sqrt-div39.9%
Applied egg-rr39.9%
Final simplification35.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-100)
(/
(sqrt (* C (+ (* -16.0 (* A (* C F))) (* 4.0 (* (pow B_m 2.0) F)))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 5e+24)
(* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))
(if (<= (pow B_m 2.0) 2e+261)
(/
-1.0
(/
(+ (pow B_m 2.0) (* C (* A -4.0)))
(* B_m (sqrt (* 2.0 (* F (+ C (hypot B_m C))))))))
(* (sqrt 2.0) (/ (sqrt 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) <= 1e-100) {
tmp = sqrt((C * ((-16.0 * (A * (C * F))) + (4.0 * (pow(B_m, 2.0) * F))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 5e+24) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else if (pow(B_m, 2.0) <= 2e+261) {
tmp = -1.0 / ((pow(B_m, 2.0) + (C * (A * -4.0))) / (B_m * sqrt((2.0 * (F * (C + hypot(B_m, C)))))));
} else {
tmp = sqrt(2.0) * (sqrt(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) <= 1e-100) {
tmp = Math.sqrt((C * ((-16.0 * (A * (C * F))) + (4.0 * (Math.pow(B_m, 2.0) * F))))) / (((4.0 * A) * C) - Math.pow(B_m, 2.0));
} else if (Math.pow(B_m, 2.0) <= 5e+24) {
tmp = -Math.sqrt(2.0) * Math.sqrt((-0.5 * (F / A)));
} else if (Math.pow(B_m, 2.0) <= 2e+261) {
tmp = -1.0 / ((Math.pow(B_m, 2.0) + (C * (A * -4.0))) / (B_m * Math.sqrt((2.0 * (F * (C + Math.hypot(B_m, C)))))));
} else {
tmp = Math.sqrt(2.0) * (Math.sqrt(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) <= 1e-100: tmp = math.sqrt((C * ((-16.0 * (A * (C * F))) + (4.0 * (math.pow(B_m, 2.0) * F))))) / (((4.0 * A) * C) - math.pow(B_m, 2.0)) elif math.pow(B_m, 2.0) <= 5e+24: tmp = -math.sqrt(2.0) * math.sqrt((-0.5 * (F / A))) elif math.pow(B_m, 2.0) <= 2e+261: tmp = -1.0 / ((math.pow(B_m, 2.0) + (C * (A * -4.0))) / (B_m * math.sqrt((2.0 * (F * (C + math.hypot(B_m, C))))))) else: tmp = math.sqrt(2.0) * (math.sqrt(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) <= 1e-100) tmp = Float64(sqrt(Float64(C * Float64(Float64(-16.0 * Float64(A * Float64(C * F))) + Float64(4.0 * Float64((B_m ^ 2.0) * F))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 5e+24) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); elseif ((B_m ^ 2.0) <= 2e+261) tmp = Float64(-1.0 / Float64(Float64((B_m ^ 2.0) + Float64(C * Float64(A * -4.0))) / Float64(B_m * sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(B_m, C)))))))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(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) <= 1e-100)
tmp = sqrt((C * ((-16.0 * (A * (C * F))) + (4.0 * ((B_m ^ 2.0) * F))))) / (((4.0 * A) * C) - (B_m ^ 2.0));
elseif ((B_m ^ 2.0) <= 5e+24)
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
elseif ((B_m ^ 2.0) <= 2e+261)
tmp = -1.0 / (((B_m ^ 2.0) + (C * (A * -4.0))) / (B_m * sqrt((2.0 * (F * (C + hypot(B_m, C)))))));
else
tmp = sqrt(2.0) * (sqrt(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], 1e-100], N[(N[Sqrt[N[(C * N[(N[(-16.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+24], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+261], N[(-1.0 / N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-100}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(-16 \cdot \left(A \cdot \left(C \cdot F\right)\right) + 4 \cdot \left({B\_m}^{2} \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+24}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+261}:\\
\;\;\;\;\frac{-1}{\frac{{B\_m}^{2} + C \cdot \left(A \cdot -4\right)}{B\_m \cdot \sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-100Initial program 23.7%
Taylor expanded in A around -inf 25.6%
Taylor expanded in B around 0 24.3%
Taylor expanded in C around 0 24.3%
if 1e-100 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000045e24Initial program 32.5%
+-commutative32.5%
unpow232.5%
unpow232.5%
hypot-undefine32.3%
add-exp-log31.5%
hypot-undefine31.8%
unpow231.8%
unpow231.8%
+-commutative31.8%
unpow231.8%
unpow231.8%
hypot-define31.5%
Applied egg-rr31.5%
Taylor expanded in F around 0 28.0%
mul-1-neg28.0%
Simplified37.3%
Taylor expanded in A around -inf 27.3%
if 5.00000000000000045e24 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e261Initial program 30.6%
Taylor expanded in A around 0 16.9%
associate-*l*16.8%
unpow216.8%
unpow216.8%
hypot-define18.8%
Simplified18.8%
clear-num18.8%
inv-pow18.8%
associate-*l*18.8%
distribute-rgt-neg-in18.8%
sqrt-unprod18.9%
Applied egg-rr18.9%
unpow-118.9%
cancel-sign-sub-inv18.9%
metadata-eval18.9%
associate-*r*18.9%
Simplified18.9%
if 1.9999999999999999e261 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.1%
Taylor expanded in B around inf 25.9%
mul-1-neg25.9%
distribute-rgt-neg-in25.9%
Simplified25.9%
sqrt-div39.9%
Applied egg-rr39.9%
Final simplification27.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)) (t_1 (- t_0 (pow B_m 2.0))))
(if (<= B_m 1.7e-187)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C))) t_1)
(if (<= B_m 1.75e-157)
(* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))
(if (<= B_m 2.1e-48)
(/
(sqrt
(* -8.0 (* (* A C) (* F (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C))))))
t_1)
(if (<= B_m 2.3e+44)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* -4.0 (* A C))))))
(sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- (fma B_m B_m (* A (* C -4.0)))))
(* (sqrt 2.0) (/ (sqrt 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 t_1 = t_0 - pow(B_m, 2.0);
double tmp;
if (B_m <= 1.7e-187) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
} else if (B_m <= 1.75e-157) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else if (B_m <= 2.1e-48) {
tmp = sqrt((-8.0 * ((A * C) * (F * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))))) / t_1;
} else if (B_m <= 2.3e+44) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, (-4.0 * (A * C)))))) * sqrt((A + (C + hypot((A - C), B_m))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) tmp = 0.0 if (B_m <= 1.7e-187) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / t_1); elseif (B_m <= 1.75e-157) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); elseif (B_m <= 2.1e-48) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C)))))) / t_1); elseif (B_m <= 2.3e+44) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.7e-187], 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$1), $MachinePrecision], If[LessEqual[B$95$m, 1.75e-157], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.1e-48], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 2.3e+44], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
\mathbf{if}\;B\_m \leq 1.7 \cdot 10^{-187}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.75 \cdot 10^{-157}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 2.1 \cdot 10^{-48}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+44}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.7000000000000001e-187Initial program 20.4%
Taylor expanded in A around -inf 13.3%
if 1.7000000000000001e-187 < B < 1.7500000000000001e-157Initial program 0.0%
+-commutative0.0%
unpow20.0%
unpow20.0%
hypot-undefine1.1%
add-exp-log1.1%
hypot-undefine0.0%
unpow20.0%
unpow20.0%
+-commutative0.0%
unpow20.0%
unpow20.0%
hypot-define1.1%
Applied egg-rr1.1%
Taylor expanded in F around 0 1.0%
mul-1-neg1.0%
Simplified35.9%
Taylor expanded in A around -inf 36.4%
if 1.7500000000000001e-157 < B < 2.09999999999999989e-48Initial program 36.3%
Taylor expanded in A around -inf 36.4%
Taylor expanded in B around 0 36.3%
Taylor expanded in F around 0 36.1%
associate-*r*41.0%
fma-define41.0%
Simplified41.0%
if 2.09999999999999989e-48 < B < 2.30000000000000004e44Initial program 36.6%
Simplified42.5%
associate-*r*42.5%
associate-+r+41.6%
hypot-undefine36.6%
unpow236.6%
unpow236.6%
+-commutative36.6%
sqrt-prod36.4%
*-commutative36.4%
associate-*r*36.4%
associate-+l+36.5%
Applied egg-rr50.7%
if 2.30000000000000004e44 < B Initial program 11.9%
Taylor expanded in B around inf 45.3%
mul-1-neg45.3%
distribute-rgt-neg-in45.3%
Simplified45.3%
sqrt-div63.3%
Applied egg-rr63.3%
Final simplification29.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 (/ (pow B_m 2.0) A)))
(if (<= B_m 7.5e-191)
(/
(sqrt (* 2.0 (* (* F (- (pow B_m 2.0) t_0)) (fma 2.0 C (* -0.5 t_1)))))
(- t_0 (pow B_m 2.0)))
(if (<= B_m 2.9e-157)
(* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))
(if (<= B_m 6e-47)
(/
(sqrt (* -8.0 (* (* A C) (* F (fma -0.5 t_1 (* 2.0 C))))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= B_m 2.3e+44)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* -4.0 (* A C))))))
(sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- (fma B_m B_m (* A (* C -4.0)))))
(* (sqrt 2.0) (/ (sqrt 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 t_1 = pow(B_m, 2.0) / A;
double tmp;
if (B_m <= 7.5e-191) {
tmp = sqrt((2.0 * ((F * (pow(B_m, 2.0) - t_0)) * fma(2.0, C, (-0.5 * t_1))))) / (t_0 - pow(B_m, 2.0));
} else if (B_m <= 2.9e-157) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else if (B_m <= 6e-47) {
tmp = sqrt((-8.0 * ((A * C) * (F * fma(-0.5, t_1, (2.0 * C)))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (B_m <= 2.3e+44) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, (-4.0 * (A * C)))))) * sqrt((A + (C + hypot((A - C), B_m))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(4.0 * Float64(A * C)) t_1 = Float64((B_m ^ 2.0) / A) tmp = 0.0 if (B_m <= 7.5e-191) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * fma(2.0, C, Float64(-0.5 * t_1))))) / Float64(t_0 - (B_m ^ 2.0))); elseif (B_m <= 2.9e-157) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); elseif (B_m <= 6e-47) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * fma(-0.5, t_1, Float64(2.0 * C)))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif (B_m <= 2.3e+44) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]}, If[LessEqual[B$95$m, 7.5e-191], N[(N[Sqrt[N[(2.0 * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C + N[(-0.5 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.9e-157], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6e-47], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(-0.5 * t$95$1 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.3e+44], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := 4 \cdot \left(A \cdot C\right)\\
t_1 := \frac{{B\_m}^{2}}{A}\\
\mathbf{if}\;B\_m \leq 7.5 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot \mathsf{fma}\left(2, C, -0.5 \cdot t\_1\right)\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 2.9 \cdot 10^{-157}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 6 \cdot 10^{-47}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \mathsf{fma}\left(-0.5, t\_1, 2 \cdot C\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+44}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 7.4999999999999995e-191Initial program 20.4%
Taylor expanded in A around -inf 14.7%
distribute-frac-neg14.7%
associate-*l*14.7%
associate-*l*14.7%
+-commutative14.7%
fma-define14.7%
associate-*l*14.7%
Applied egg-rr14.7%
if 7.4999999999999995e-191 < B < 2.89999999999999988e-157Initial program 0.0%
+-commutative0.0%
unpow20.0%
unpow20.0%
hypot-undefine1.1%
add-exp-log1.1%
hypot-undefine0.0%
unpow20.0%
unpow20.0%
+-commutative0.0%
unpow20.0%
unpow20.0%
hypot-define1.1%
Applied egg-rr1.1%
Taylor expanded in F around 0 1.0%
mul-1-neg1.0%
Simplified35.9%
Taylor expanded in A around -inf 36.4%
if 2.89999999999999988e-157 < B < 6.00000000000000033e-47Initial program 36.3%
Taylor expanded in A around -inf 36.4%
Taylor expanded in B around 0 36.3%
Taylor expanded in F around 0 36.1%
associate-*r*41.0%
fma-define41.0%
Simplified41.0%
if 6.00000000000000033e-47 < B < 2.30000000000000004e44Initial program 36.6%
Simplified42.5%
associate-*r*42.5%
associate-+r+41.6%
hypot-undefine36.6%
unpow236.6%
unpow236.6%
+-commutative36.6%
sqrt-prod36.4%
*-commutative36.4%
associate-*r*36.4%
associate-+l+36.5%
Applied egg-rr50.7%
if 2.30000000000000004e44 < B Initial program 11.9%
Taylor expanded in B around inf 45.3%
mul-1-neg45.3%
distribute-rgt-neg-in45.3%
Simplified45.3%
sqrt-div63.3%
Applied egg-rr63.3%
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
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2 (* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))))
(if (<= B_m 9e-191)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C))) t_1)
(if (<= B_m 1.1e-157)
t_2
(if (<= B_m 2.15e-50)
(/
(sqrt
(* -8.0 (* (* A C) (* F (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C))))))
t_1)
(if (<= B_m 4000000000000.0)
t_2
(if (<= B_m 5.8e+194)
(* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m)))
(* (sqrt 2.0) (/ (sqrt 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 t_1 = t_0 - pow(B_m, 2.0);
double t_2 = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
double tmp;
if (B_m <= 9e-191) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
} else if (B_m <= 1.1e-157) {
tmp = t_2;
} else if (B_m <= 2.15e-50) {
tmp = sqrt((-8.0 * ((A * C) * (F * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))))) / t_1;
} else if (B_m <= 4000000000000.0) {
tmp = t_2;
} else if (B_m <= 5.8e+194) {
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))) tmp = 0.0 if (B_m <= 9e-191) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / t_1); elseif (B_m <= 1.1e-157) tmp = t_2; elseif (B_m <= 2.15e-50) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C)))))) / t_1); elseif (B_m <= 4000000000000.0) tmp = t_2; elseif (B_m <= 5.8e+194) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 9e-191], 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$1), $MachinePrecision], If[LessEqual[B$95$m, 1.1e-157], t$95$2, If[LessEqual[B$95$m, 2.15e-50], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 4000000000000.0], t$95$2, If[LessEqual[B$95$m, 5.8e+194], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{if}\;B\_m \leq 9 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.1 \cdot 10^{-157}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 2.15 \cdot 10^{-50}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 4000000000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 5.8 \cdot 10^{+194}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 9.00000000000000017e-191Initial program 20.4%
Taylor expanded in A around -inf 13.3%
if 9.00000000000000017e-191 < B < 1.10000000000000005e-157 or 2.14999999999999999e-50 < B < 4e12Initial program 16.3%
+-commutative16.3%
unpow216.3%
unpow216.3%
hypot-undefine16.4%
add-exp-log16.5%
hypot-undefine16.4%
unpow216.4%
unpow216.4%
+-commutative16.4%
unpow216.4%
unpow216.4%
hypot-define16.5%
Applied egg-rr16.5%
Taylor expanded in F around 0 16.7%
mul-1-neg16.7%
Simplified24.6%
Taylor expanded in A around -inf 30.6%
if 1.10000000000000005e-157 < B < 2.14999999999999999e-50Initial program 40.0%
Taylor expanded in A around -inf 35.0%
Taylor expanded in B around 0 34.6%
Taylor expanded in F around 0 34.6%
associate-*r*40.1%
fma-define40.1%
Simplified40.1%
if 4e12 < B < 5.8000000000000001e194Initial program 26.4%
Taylor expanded in A around 0 28.9%
mul-1-neg28.9%
*-commutative28.9%
distribute-rgt-neg-in28.9%
unpow228.9%
unpow228.9%
hypot-define40.8%
Simplified40.8%
if 5.8000000000000001e194 < B Initial program 0.0%
Taylor expanded in B around inf 52.7%
mul-1-neg52.7%
distribute-rgt-neg-in52.7%
Simplified52.7%
sqrt-div88.2%
Applied egg-rr88.2%
Final simplification27.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))
(t_1
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0))))
(t_2 (* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))))
(if (<= B_m 7.6e-191)
t_1
(if (<= B_m 1.9e-157)
t_2
(if (<= B_m 3.6e-50)
t_1
(if (<= B_m 2200000000000.0)
t_2
(if (<= B_m 2.3e+195)
(* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m)))
(* (sqrt 2.0) (/ (sqrt 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 t_1 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
double t_2 = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
double tmp;
if (B_m <= 7.6e-191) {
tmp = t_1;
} else if (B_m <= 1.9e-157) {
tmp = t_2;
} else if (B_m <= 3.6e-50) {
tmp = t_1;
} else if (B_m <= 2200000000000.0) {
tmp = t_2;
} else if (B_m <= 2.3e+195) {
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt(2.0) * (sqrt(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 t_0 = (4.0 * A) * C;
double t_1 = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
double t_2 = -Math.sqrt(2.0) * Math.sqrt((-0.5 * (F / A)));
double tmp;
if (B_m <= 7.6e-191) {
tmp = t_1;
} else if (B_m <= 1.9e-157) {
tmp = t_2;
} else if (B_m <= 3.6e-50) {
tmp = t_1;
} else if (B_m <= 2200000000000.0) {
tmp = t_2;
} else if (B_m <= 2.3e+195) {
tmp = Math.sqrt((F * (C + Math.hypot(B_m, C)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = Math.sqrt(2.0) * (Math.sqrt(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 t_1 = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) t_2 = -math.sqrt(2.0) * math.sqrt((-0.5 * (F / A))) tmp = 0 if B_m <= 7.6e-191: tmp = t_1 elif B_m <= 1.9e-157: tmp = t_2 elif B_m <= 3.6e-50: tmp = t_1 elif B_m <= 2200000000000.0: tmp = t_2 elif B_m <= 2.3e+195: tmp = math.sqrt((F * (C + math.hypot(B_m, C)))) * (math.sqrt(2.0) / -B_m) else: tmp = math.sqrt(2.0) * (math.sqrt(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) t_1 = 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))) t_2 = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))) tmp = 0.0 if (B_m <= 7.6e-191) tmp = t_1; elseif (B_m <= 1.9e-157) tmp = t_2; elseif (B_m <= 3.6e-50) tmp = t_1; elseif (B_m <= 2200000000000.0) tmp = t_2; elseif (B_m <= 2.3e+195) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(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;
t_1 = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
t_2 = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
tmp = 0.0;
if (B_m <= 7.6e-191)
tmp = t_1;
elseif (B_m <= 1.9e-157)
tmp = t_2;
elseif (B_m <= 3.6e-50)
tmp = t_1;
elseif (B_m <= 2200000000000.0)
tmp = t_2;
elseif (B_m <= 2.3e+195)
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
else
tmp = sqrt(2.0) * (sqrt(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]}, 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[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 7.6e-191], t$95$1, If[LessEqual[B$95$m, 1.9e-157], t$95$2, If[LessEqual[B$95$m, 3.6e-50], t$95$1, If[LessEqual[B$95$m, 2200000000000.0], t$95$2, If[LessEqual[B$95$m, 2.3e+195], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
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(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := \left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{if}\;B\_m \leq 7.6 \cdot 10^{-191}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 1.9 \cdot 10^{-157}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 3.6 \cdot 10^{-50}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 2200000000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+195}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 7.5999999999999996e-191 or 1.9000000000000001e-157 < B < 3.59999999999999979e-50Initial program 22.4%
Taylor expanded in A around -inf 15.5%
if 7.5999999999999996e-191 < B < 1.9000000000000001e-157 or 3.59999999999999979e-50 < B < 2.2e12Initial program 16.3%
+-commutative16.3%
unpow216.3%
unpow216.3%
hypot-undefine16.4%
add-exp-log16.5%
hypot-undefine16.4%
unpow216.4%
unpow216.4%
+-commutative16.4%
unpow216.4%
unpow216.4%
hypot-define16.5%
Applied egg-rr16.5%
Taylor expanded in F around 0 16.7%
mul-1-neg16.7%
Simplified24.6%
Taylor expanded in A around -inf 30.6%
if 2.2e12 < B < 2.3000000000000001e195Initial program 26.4%
Taylor expanded in A around 0 28.9%
mul-1-neg28.9%
*-commutative28.9%
distribute-rgt-neg-in28.9%
unpow228.9%
unpow228.9%
hypot-define40.8%
Simplified40.8%
if 2.3000000000000001e195 < B Initial program 0.0%
Taylor expanded in B around inf 52.7%
mul-1-neg52.7%
distribute-rgt-neg-in52.7%
Simplified52.7%
sqrt-div88.2%
Applied egg-rr88.2%
Final simplification26.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1900000000000.0)
(* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))
(if (<= B_m 6.5e+194)
(* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m)))
(* (sqrt 2.0) (/ (sqrt 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 <= 1900000000000.0) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else if (B_m <= 6.5e+194) {
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt(2.0) * (sqrt(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 (B_m <= 1900000000000.0) {
tmp = -Math.sqrt(2.0) * Math.sqrt((-0.5 * (F / A)));
} else if (B_m <= 6.5e+194) {
tmp = Math.sqrt((F * (C + Math.hypot(B_m, C)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = Math.sqrt(2.0) * (Math.sqrt(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 <= 1900000000000.0: tmp = -math.sqrt(2.0) * math.sqrt((-0.5 * (F / A))) elif B_m <= 6.5e+194: tmp = math.sqrt((F * (C + math.hypot(B_m, C)))) * (math.sqrt(2.0) / -B_m) else: tmp = math.sqrt(2.0) * (math.sqrt(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 <= 1900000000000.0) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); elseif (B_m <= 6.5e+194) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(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 <= 1900000000000.0)
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
elseif (B_m <= 6.5e+194)
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
else
tmp = sqrt(2.0) * (sqrt(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, 1900000000000.0], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.5e+194], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1900000000000:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{+194}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.9e12Initial program 22.0%
+-commutative22.0%
unpow222.0%
unpow222.0%
hypot-undefine26.9%
add-exp-log25.3%
hypot-undefine21.1%
unpow221.1%
unpow221.1%
+-commutative21.1%
unpow221.1%
unpow221.1%
hypot-define25.3%
Applied egg-rr25.3%
Taylor expanded in F around 0 17.0%
mul-1-neg17.0%
Simplified22.9%
Taylor expanded in A around -inf 18.8%
if 1.9e12 < B < 6.50000000000000005e194Initial program 26.4%
Taylor expanded in A around 0 28.9%
mul-1-neg28.9%
*-commutative28.9%
distribute-rgt-neg-in28.9%
unpow228.9%
unpow228.9%
hypot-define40.8%
Simplified40.8%
if 6.50000000000000005e194 < B Initial program 0.0%
Taylor expanded in B around inf 52.7%
mul-1-neg52.7%
distribute-rgt-neg-in52.7%
Simplified52.7%
sqrt-div88.2%
Applied egg-rr88.2%
Final simplification28.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 (<= B_m 7.3e+22) (* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A)))) (* (sqrt 2.0) (/ (sqrt 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 <= 7.3e+22) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else {
tmp = sqrt(2.0) * (sqrt(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 <= 7.3d+22) then
tmp = -sqrt(2.0d0) * sqrt(((-0.5d0) * (f / a)))
else
tmp = sqrt(2.0d0) * (sqrt(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 <= 7.3e+22) {
tmp = -Math.sqrt(2.0) * Math.sqrt((-0.5 * (F / A)));
} else {
tmp = Math.sqrt(2.0) * (Math.sqrt(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 <= 7.3e+22: tmp = -math.sqrt(2.0) * math.sqrt((-0.5 * (F / A))) else: tmp = math.sqrt(2.0) * (math.sqrt(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 <= 7.3e+22) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); else tmp = Float64(sqrt(2.0) * Float64(sqrt(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 <= 7.3e+22)
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
else
tmp = sqrt(2.0) * (sqrt(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, 7.3e+22], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7.3 \cdot 10^{+22}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 7.29999999999999979e22Initial program 22.4%
+-commutative22.4%
unpow222.4%
unpow222.4%
hypot-undefine27.1%
add-exp-log25.5%
hypot-undefine21.4%
unpow221.4%
unpow221.4%
+-commutative21.4%
unpow221.4%
unpow221.4%
hypot-define25.5%
Applied egg-rr25.5%
Taylor expanded in F around 0 17.1%
mul-1-neg17.1%
Simplified22.8%
Taylor expanded in A around -inf 19.3%
if 7.29999999999999979e22 < B Initial program 15.9%
Taylor expanded in B around inf 44.1%
mul-1-neg44.1%
distribute-rgt-neg-in44.1%
Simplified44.1%
sqrt-div61.7%
Applied egg-rr61.7%
Final simplification29.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0))))
(if (<= B_m 5.8e+24)
(* t_0 (sqrt (* -0.5 (/ F A))))
(* t_0 (sqrt (/ (+ F (* F (/ (+ A C) B_m))) B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0);
double tmp;
if (B_m <= 5.8e+24) {
tmp = t_0 * sqrt((-0.5 * (F / A)));
} else {
tmp = t_0 * sqrt(((F + (F * ((A + C) / B_m))) / 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 = -sqrt(2.0d0)
if (b_m <= 5.8d+24) then
tmp = t_0 * sqrt(((-0.5d0) * (f / a)))
else
tmp = t_0 * sqrt(((f + (f * ((a + c) / b_m))) / 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 = -Math.sqrt(2.0);
double tmp;
if (B_m <= 5.8e+24) {
tmp = t_0 * Math.sqrt((-0.5 * (F / A)));
} else {
tmp = t_0 * Math.sqrt(((F + (F * ((A + C) / B_m))) / B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = -math.sqrt(2.0) tmp = 0 if B_m <= 5.8e+24: tmp = t_0 * math.sqrt((-0.5 * (F / A))) else: tmp = t_0 * math.sqrt(((F + (F * ((A + C) / B_m))) / B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-sqrt(2.0)) tmp = 0.0 if (B_m <= 5.8e+24) tmp = Float64(t_0 * sqrt(Float64(-0.5 * Float64(F / A)))); else tmp = Float64(t_0 * sqrt(Float64(Float64(F + Float64(F * Float64(Float64(A + C) / B_m))) / 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 = -sqrt(2.0);
tmp = 0.0;
if (B_m <= 5.8e+24)
tmp = t_0 * sqrt((-0.5 * (F / A)));
else
tmp = t_0 * sqrt(((F + (F * ((A + C) / B_m))) / B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 5.8e+24], N[(t$95$0 * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(N[(F + N[(F * N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -\sqrt{2}\\
\mathbf{if}\;B\_m \leq 5.8 \cdot 10^{+24}:\\
\;\;\;\;t\_0 \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{F + F \cdot \frac{A + C}{B\_m}}{B\_m}}\\
\end{array}
\end{array}
if B < 5.79999999999999958e24Initial program 22.7%
+-commutative22.7%
unpow222.7%
unpow222.7%
hypot-undefine27.4%
add-exp-log25.8%
hypot-undefine21.7%
unpow221.7%
unpow221.7%
+-commutative21.7%
unpow221.7%
unpow221.7%
hypot-define25.8%
Applied egg-rr25.8%
Taylor expanded in F around 0 17.4%
mul-1-neg17.4%
Simplified23.1%
Taylor expanded in A around -inf 19.6%
if 5.79999999999999958e24 < B Initial program 14.8%
+-commutative14.8%
unpow214.8%
unpow214.8%
hypot-undefine18.2%
add-exp-log17.1%
hypot-undefine14.1%
unpow214.1%
unpow214.1%
+-commutative14.1%
unpow214.1%
unpow214.1%
hypot-define17.1%
Applied egg-rr17.1%
Taylor expanded in F around 0 17.0%
mul-1-neg17.0%
Simplified22.3%
Taylor expanded in B around inf 37.3%
associate-/l*44.1%
Simplified44.1%
Final simplification25.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 7e+22) (* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A)))) (- (sqrt (* 2.0 (/ F B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7e+22) {
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
} else {
tmp = -sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 7d+22) then
tmp = -sqrt(2.0d0) * sqrt(((-0.5d0) * (f / a)))
else
tmp = -sqrt((2.0d0 * (f / b_m)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7e+22) {
tmp = -Math.sqrt(2.0) * Math.sqrt((-0.5 * (F / A)));
} else {
tmp = -Math.sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 7e+22: tmp = -math.sqrt(2.0) * math.sqrt((-0.5 * (F / A))) else: tmp = -math.sqrt((2.0 * (F / B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7e+22) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(-0.5 * Float64(F / A)))); else tmp = Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 7e+22)
tmp = -sqrt(2.0) * sqrt((-0.5 * (F / A)));
else
tmp = -sqrt((2.0 * (F / B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7e+22], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7 \cdot 10^{+22}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if B < 7e22Initial program 22.4%
+-commutative22.4%
unpow222.4%
unpow222.4%
hypot-undefine27.1%
add-exp-log25.5%
hypot-undefine21.4%
unpow221.4%
unpow221.4%
+-commutative21.4%
unpow221.4%
unpow221.4%
hypot-define25.5%
Applied egg-rr25.5%
Taylor expanded in F around 0 17.1%
mul-1-neg17.1%
Simplified22.8%
Taylor expanded in A around -inf 19.3%
if 7e22 < B Initial program 15.9%
Taylor expanded in B around inf 44.1%
mul-1-neg44.1%
distribute-rgt-neg-in44.1%
Simplified44.1%
pow144.1%
distribute-rgt-neg-out44.1%
pow1/244.1%
pow1/244.1%
pow-prod-down44.3%
Applied egg-rr44.3%
unpow144.3%
unpow1/244.3%
Simplified44.3%
Final simplification25.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (pow (* 2.0 (/ F B_m)) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -pow((2.0 * (F / B_m)), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -((2.0d0 * (f / b_m)) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.pow((2.0 * (F / B_m)), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -((2.0 * (F / B_m)) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 20.9%
Taylor expanded in B around inf 12.3%
mul-1-neg12.3%
distribute-rgt-neg-in12.3%
Simplified12.3%
distribute-rgt-neg-out12.3%
pow1/212.5%
pow1/212.5%
pow-prod-down12.5%
Applied egg-rr12.5%
Final simplification12.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* 2.0 (/ F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((2.0d0 * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.9%
Taylor expanded in B around inf 12.3%
mul-1-neg12.3%
distribute-rgt-neg-in12.3%
Simplified12.3%
pow112.3%
distribute-rgt-neg-out12.3%
pow1/212.5%
pow1/212.5%
pow-prod-down12.5%
Applied egg-rr12.5%
unpow112.5%
unpow1/212.4%
Simplified12.4%
Final simplification12.4%
herbie shell --seed 2024077
(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))))