
(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 24 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
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C)))))))
(t_1 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 5e-192)
t_0
(if (<= (pow B_m 2.0) 1e-163)
(/
(*
(hypot (sqrt (* A (* C -4.0))) B_m)
(sqrt (* (+ (+ A C) (hypot B_m (- C A))) (* 2.0 F))))
(- (* 4.0 (* A C)) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 2e-81)
t_0
(if (<= (pow B_m 2.0) 5e+203)
(/
(*
(sqrt (+ C (+ A (hypot (- A C) B_m))))
(sqrt (* 2.0 (* (- (pow B_m 2.0) t_1) F))))
(- t_1 (pow B_m 2.0)))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double t_1 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 5e-192) {
tmp = t_0;
} else if (pow(B_m, 2.0) <= 1e-163) {
tmp = (hypot(sqrt((A * (C * -4.0))), B_m) * sqrt((((A + C) + hypot(B_m, (C - A))) * (2.0 * F)))) / ((4.0 * (A * C)) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 2e-81) {
tmp = t_0;
} else if (pow(B_m, 2.0) <= 5e+203) {
tmp = (sqrt((C + (A + hypot((A - C), B_m)))) * sqrt((2.0 * ((pow(B_m, 2.0) - t_1) * F)))) / (t_1 - pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
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 = -2.0 * ((C / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * Math.sqrt((F * ((A * -4.0) + (Math.pow(B_m, 2.0) / C)))));
double t_1 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-192) {
tmp = t_0;
} else if (Math.pow(B_m, 2.0) <= 1e-163) {
tmp = (Math.hypot(Math.sqrt((A * (C * -4.0))), B_m) * Math.sqrt((((A + C) + Math.hypot(B_m, (C - A))) * (2.0 * F)))) / ((4.0 * (A * C)) - Math.pow(B_m, 2.0));
} else if (Math.pow(B_m, 2.0) <= 2e-81) {
tmp = t_0;
} else if (Math.pow(B_m, 2.0) <= 5e+203) {
tmp = (Math.sqrt((C + (A + Math.hypot((A - C), B_m)))) * Math.sqrt((2.0 * ((Math.pow(B_m, 2.0) - t_1) * F)))) / (t_1 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + Math.hypot(B_m, C))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = -2.0 * ((C / (math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * math.sqrt((F * ((A * -4.0) + (math.pow(B_m, 2.0) / C))))) t_1 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 5e-192: tmp = t_0 elif math.pow(B_m, 2.0) <= 1e-163: tmp = (math.hypot(math.sqrt((A * (C * -4.0))), B_m) * math.sqrt((((A + C) + math.hypot(B_m, (C - A))) * (2.0 * F)))) / ((4.0 * (A * C)) - math.pow(B_m, 2.0)) elif math.pow(B_m, 2.0) <= 2e-81: tmp = t_0 elif math.pow(B_m, 2.0) <= 5e+203: tmp = (math.sqrt((C + (A + math.hypot((A - C), B_m)))) * math.sqrt((2.0 * ((math.pow(B_m, 2.0) - t_1) * F)))) / (t_1 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + math.hypot(B_m, C))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) t_1 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-192) tmp = t_0; elseif ((B_m ^ 2.0) <= 1e-163) tmp = Float64(Float64(hypot(sqrt(Float64(A * Float64(C * -4.0))), B_m) * sqrt(Float64(Float64(Float64(A + C) + hypot(B_m, Float64(C - A))) * Float64(2.0 * F)))) / Float64(Float64(4.0 * Float64(A * C)) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 2e-81) tmp = t_0; elseif ((B_m ^ 2.0) <= 5e+203) tmp = Float64(Float64(sqrt(Float64(C + Float64(A + hypot(Float64(A - C), B_m)))) * sqrt(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)))) / Float64(t_1 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = -2.0 * ((C / ((B_m ^ 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + ((B_m ^ 2.0) / C)))));
t_1 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-192)
tmp = t_0;
elseif ((B_m ^ 2.0) <= 1e-163)
tmp = (hypot(sqrt((A * (C * -4.0))), B_m) * sqrt((((A + C) + hypot(B_m, (C - A))) * (2.0 * F)))) / ((4.0 * (A * C)) - (B_m ^ 2.0));
elseif ((B_m ^ 2.0) <= 2e-81)
tmp = t_0;
elseif ((B_m ^ 2.0) <= 5e+203)
tmp = (sqrt((C + (A + hypot((A - C), B_m)))) * sqrt((2.0 * (((B_m ^ 2.0) - t_1) * F)))) / (t_1 - (B_m ^ 2.0));
else
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-192], t$95$0, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-163], N[(N[(N[Sqrt[N[Sqrt[N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] * N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(C - A), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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], 2e-81], t$95$0, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+203], N[(N[(N[Sqrt[N[(C + N[(A + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 := -2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-192}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-163}:\\
\;\;\;\;\frac{\mathsf{hypot}\left(\sqrt{A \cdot \left(C \cdot -4\right)}, B\_m\right) \cdot \sqrt{\left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, C - A\right)\right) \cdot \left(2 \cdot F\right)}}{4 \cdot \left(A \cdot C\right) - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-81}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+203}:\\
\;\;\;\;\frac{\sqrt{C + \left(A + \mathsf{hypot}\left(A - C, B\_m\right)\right)} \cdot \sqrt{2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e-192 or 9.99999999999999923e-164 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-81Initial program 18.3%
Simplified25.4%
Taylor expanded in C around inf 21.9%
Taylor expanded in C around inf 16.8%
distribute-lft1-in16.8%
metadata-eval16.8%
Simplified16.8%
Taylor expanded in F around 0 29.1%
if 5.0000000000000001e-192 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999923e-164Initial program 61.4%
Simplified80.7%
pow1/280.7%
associate-*l*80.7%
unpow-prod-down99.5%
pow1/299.5%
fma-undefine99.5%
add-sqr-sqrt99.5%
unpow299.5%
hypot-define99.5%
associate-+r+99.5%
Applied egg-rr99.5%
unpow1/299.5%
+-commutative99.5%
Simplified99.5%
if 1.9999999999999999e-81 < (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999994e203Initial program 29.4%
expm1-log1p-u28.1%
unpow228.1%
unpow228.1%
hypot-define38.7%
Applied egg-rr38.7%
pow1/238.7%
*-commutative38.7%
unpow-prod-down55.6%
pow1/255.6%
+-commutative55.6%
expm1-log1p-u58.8%
pow1/258.8%
*-commutative58.8%
*-commutative58.8%
Applied egg-rr58.8%
associate-+l+59.3%
Simplified59.3%
if 4.99999999999999994e203 < (pow.f64 B #s(literal 2 binary64)) Initial program 8.8%
Taylor expanded in A around 0 8.0%
mul-1-neg8.0%
unpow28.0%
unpow28.0%
hypot-define35.2%
Simplified35.2%
pow1/235.2%
*-commutative35.2%
unpow-prod-down47.5%
pow1/247.5%
pow1/247.5%
Applied egg-rr47.5%
Final simplification43.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 (* 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 (- INFINITY))
(*
(sqrt
(*
F
(/ (+ A (+ C (hypot B_m (- A C)))) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_3 -1e-191)
(/ (* (sqrt (+ C (+ A (hypot (- A C) B_m)))) (sqrt t_1)) t_2)
(if (<= t_3 INFINITY)
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))
(*
(expm1 (log1p (/ (sqrt 2.0) B_m)))
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double 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 <= -((double) INFINITY)) {
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 (t_3 <= -1e-191) {
tmp = (sqrt((C + (A + hypot((A - C), B_m)))) * sqrt(t_1)) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
} else {
tmp = expm1(log1p((sqrt(2.0) / B_m))) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) 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 <= Float64(-Inf)) 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 (t_3 <= -1e-191) tmp = Float64(Float64(sqrt(Float64(C + Float64(A + hypot(Float64(A - C), B_m)))) * sqrt(t_1)) / t_2); elseif (t_3 <= Inf) tmp = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))); else tmp = Float64(expm1(log1p(Float64(sqrt(2.0) / B_m))) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); 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, (-Infinity)], 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[t$95$3, -1e-191], N[(N[(N[Sqrt[N[(C + N[(A + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Exp[N[Log[1 + N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 -\infty:\\
\;\;\;\;\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}\;t\_3 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{C + \left(A + \mathsf{hypot}\left(A - C, B\_m\right)\right)} \cdot \sqrt{t\_1}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;-2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\sqrt{2}}{B\_m}\right)\right) \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in F around 0 19.8%
mul-1-neg19.8%
Simplified70.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))) < -1e-191Initial program 99.2%
expm1-log1p-u95.4%
unpow295.4%
unpow295.4%
hypot-define95.4%
Applied egg-rr95.4%
pow1/295.4%
*-commutative95.4%
unpow-prod-down95.5%
pow1/295.5%
+-commutative95.5%
expm1-log1p-u99.3%
pow1/299.3%
*-commutative99.3%
*-commutative99.3%
Applied egg-rr99.3%
associate-+l+99.3%
Simplified99.3%
if -1e-191 < (/.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 12.7%
Simplified21.7%
Taylor expanded in C around inf 20.0%
Taylor expanded in C around inf 18.5%
distribute-lft1-in18.5%
metadata-eval18.5%
Simplified18.5%
Taylor expanded in F around 0 34.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 A around 0 1.8%
mul-1-neg1.8%
unpow21.8%
unpow21.8%
hypot-define23.5%
Simplified23.5%
pow1/223.6%
*-commutative23.6%
unpow-prod-down33.1%
pow1/233.1%
pow1/233.1%
Applied egg-rr33.1%
expm1-log1p-u32.7%
expm1-undefine3.3%
Applied egg-rr3.3%
expm1-define32.7%
Simplified32.7%
Final simplification49.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 (* A (* C -4.0)))
(t_1
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C)))))))
(t_2 (fma B_m B_m t_0)))
(if (<= B_m 3.9e-91)
t_1
(if (<= B_m 3.1e-82)
(/
(*
(hypot (sqrt t_0) B_m)
(sqrt (* (+ (+ A C) (hypot B_m (- C A))) (* 2.0 F))))
(- (* 4.0 (* A C)) (pow B_m 2.0)))
(if (<= B_m 6.5e-41)
t_1
(if (<= B_m 1e+94)
(/
(* (sqrt (* F (* 2.0 t_2))) (sqrt (+ A (+ C (hypot B_m (- A C))))))
(- t_2))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = A * (C * -4.0);
double t_1 = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double t_2 = fma(B_m, B_m, t_0);
double tmp;
if (B_m <= 3.9e-91) {
tmp = t_1;
} else if (B_m <= 3.1e-82) {
tmp = (hypot(sqrt(t_0), B_m) * sqrt((((A + C) + hypot(B_m, (C - A))) * (2.0 * F)))) / ((4.0 * (A * C)) - pow(B_m, 2.0));
} else if (B_m <= 6.5e-41) {
tmp = t_1;
} else if (B_m <= 1e+94) {
tmp = (sqrt((F * (2.0 * t_2))) * sqrt((A + (C + hypot(B_m, (A - C)))))) / -t_2;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(A * Float64(C * -4.0)) t_1 = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) t_2 = fma(B_m, B_m, t_0) tmp = 0.0 if (B_m <= 3.9e-91) tmp = t_1; elseif (B_m <= 3.1e-82) tmp = Float64(Float64(hypot(sqrt(t_0), B_m) * sqrt(Float64(Float64(Float64(A + C) + hypot(B_m, Float64(C - A))) * Float64(2.0 * F)))) / Float64(Float64(4.0 * Float64(A * C)) - (B_m ^ 2.0))); elseif (B_m <= 6.5e-41) tmp = t_1; elseif (B_m <= 1e+94) tmp = Float64(Float64(sqrt(Float64(F * Float64(2.0 * t_2))) * sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))))) / Float64(-t_2)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); 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[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]}, If[LessEqual[B$95$m, 3.9e-91], t$95$1, If[LessEqual[B$95$m, 3.1e-82], N[(N[(N[Sqrt[N[Sqrt[t$95$0], $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] * N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(C - A), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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[B$95$m, 6.5e-41], t$95$1, If[LessEqual[B$95$m, 1e+94], N[(N[(N[Sqrt[N[(F * N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$2)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 := A \cdot \left(C \cdot -4\right)\\
t_1 := -2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
t_2 := \mathsf{fma}\left(B\_m, B\_m, t\_0\right)\\
\mathbf{if}\;B\_m \leq 3.9 \cdot 10^{-91}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 3.1 \cdot 10^{-82}:\\
\;\;\;\;\frac{\mathsf{hypot}\left(\sqrt{t\_0}, B\_m\right) \cdot \sqrt{\left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, C - A\right)\right) \cdot \left(2 \cdot F\right)}}{4 \cdot \left(A \cdot C\right) - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{-41}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 10^{+94}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(2 \cdot t\_2\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}}{-t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 3.89999999999999994e-91 or 3.1e-82 < B < 6.5000000000000004e-41Initial program 18.8%
Simplified25.0%
Taylor expanded in C around inf 20.9%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 22.7%
if 3.89999999999999994e-91 < B < 3.1e-82Initial program 67.8%
Simplified100.0%
pow1/2100.0%
associate-*l*100.0%
unpow-prod-down99.2%
pow1/299.2%
fma-undefine99.2%
add-sqr-sqrt99.2%
unpow299.2%
hypot-define99.2%
associate-+r+99.2%
Applied egg-rr99.2%
unpow1/299.2%
+-commutative99.2%
Simplified99.2%
if 6.5000000000000004e-41 < B < 1e94Initial program 32.5%
Simplified48.5%
pow1/248.5%
associate-*r*48.5%
associate-+r+48.5%
hypot-undefine32.5%
unpow232.5%
unpow232.5%
+-commutative32.5%
unpow-prod-down39.2%
*-commutative39.2%
pow1/239.2%
Applied egg-rr65.0%
unpow1/265.0%
associate-*l*65.1%
hypot-undefine39.3%
unpow239.3%
unpow239.3%
+-commutative39.3%
unpow239.3%
unpow239.3%
hypot-undefine65.1%
Simplified65.1%
if 1e94 < B Initial program 7.5%
Taylor expanded in A around 0 11.5%
mul-1-neg11.5%
unpow211.5%
unpow211.5%
hypot-define52.5%
Simplified52.5%
pow1/252.6%
*-commutative52.6%
unpow-prod-down71.1%
pow1/271.1%
pow1/271.1%
Applied egg-rr71.1%
Final simplification38.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 4.5e-159)
t_1
(if (<= B_m 3.9e-82)
(/
(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)))
(if (<= B_m 8.8e-41)
t_1
(if (<= B_m 4.2e+71)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 4.5e-159) {
tmp = t_1;
} else if (B_m <= 3.9e-82) {
tmp = 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));
} else if (B_m <= 8.8e-41) {
tmp = t_1;
} else if (B_m <= 4.2e+71) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 4.5e-159) tmp = t_1; elseif (B_m <= 3.9e-82) tmp = 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))); elseif (B_m <= 8.8e-41) tmp = t_1; elseif (B_m <= 4.2e+71) 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))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); 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[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.5e-159], t$95$1, If[LessEqual[B$95$m, 3.9e-82], 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], If[LessEqual[B$95$m, 8.8e-41], t$95$1, If[LessEqual[B$95$m, 4.2e+71], 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], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 4.5 \cdot 10^{-159}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 3.9 \cdot 10^{-82}:\\
\;\;\;\;\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}}\\
\mathbf{elif}\;B\_m \leq 8.8 \cdot 10^{-41}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 4.2 \cdot 10^{+71}:\\
\;\;\;\;\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{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 4.49999999999999989e-159 or 3.89999999999999973e-82 < B < 8.7999999999999999e-41Initial program 18.8%
Simplified24.6%
Taylor expanded in C around inf 20.3%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 24.1%
if 4.49999999999999989e-159 < B < 3.89999999999999973e-82Initial program 28.4%
Taylor expanded in A around -inf 30.0%
if 8.7999999999999999e-41 < B < 4.19999999999999978e71Initial program 34.8%
Taylor expanded in F around 0 42.3%
mul-1-neg42.3%
Simplified59.5%
if 4.19999999999999978e71 < B Initial program 8.7%
Taylor expanded in A around 0 14.1%
mul-1-neg14.1%
unpow214.1%
unpow214.1%
hypot-define54.9%
Simplified54.9%
pow1/254.9%
*-commutative54.9%
unpow-prod-down71.9%
pow1/271.9%
pow1/271.9%
Applied egg-rr71.9%
Final simplification39.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
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 1.1e-93)
t_0
(if (<= B_m 3.6e-82)
(/
(*
(hypot (sqrt (* A (* C -4.0))) B_m)
(sqrt (* (+ (+ A C) (hypot B_m (- C A))) (* 2.0 F))))
(- (* 4.0 (* A C)) (pow B_m 2.0)))
(if (<= B_m 8e-41)
t_0
(if (<= B_m 2.5e+68)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 1.1e-93) {
tmp = t_0;
} else if (B_m <= 3.6e-82) {
tmp = (hypot(sqrt((A * (C * -4.0))), B_m) * sqrt((((A + C) + hypot(B_m, (C - A))) * (2.0 * F)))) / ((4.0 * (A * C)) - pow(B_m, 2.0));
} else if (B_m <= 8e-41) {
tmp = t_0;
} else if (B_m <= 2.5e+68) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 1.1e-93) tmp = t_0; elseif (B_m <= 3.6e-82) tmp = Float64(Float64(hypot(sqrt(Float64(A * Float64(C * -4.0))), B_m) * sqrt(Float64(Float64(Float64(A + C) + hypot(B_m, Float64(C - A))) * Float64(2.0 * F)))) / Float64(Float64(4.0 * Float64(A * C)) - (B_m ^ 2.0))); elseif (B_m <= 8e-41) tmp = t_0; elseif (B_m <= 2.5e+68) 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))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); 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[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.1e-93], t$95$0, If[LessEqual[B$95$m, 3.6e-82], N[(N[(N[Sqrt[N[Sqrt[N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] * N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(C - A), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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[B$95$m, 8e-41], t$95$0, If[LessEqual[B$95$m, 2.5e+68], 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], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 := -2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 1.1 \cdot 10^{-93}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 3.6 \cdot 10^{-82}:\\
\;\;\;\;\frac{\mathsf{hypot}\left(\sqrt{A \cdot \left(C \cdot -4\right)}, B\_m\right) \cdot \sqrt{\left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, C - A\right)\right) \cdot \left(2 \cdot F\right)}}{4 \cdot \left(A \cdot C\right) - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{-41}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 2.5 \cdot 10^{+68}:\\
\;\;\;\;\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{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 1.09999999999999998e-93 or 3.59999999999999998e-82 < B < 8.00000000000000005e-41Initial program 18.8%
Simplified25.0%
Taylor expanded in C around inf 20.9%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 22.7%
if 1.09999999999999998e-93 < B < 3.59999999999999998e-82Initial program 67.8%
Simplified100.0%
pow1/2100.0%
associate-*l*100.0%
unpow-prod-down99.2%
pow1/299.2%
fma-undefine99.2%
add-sqr-sqrt99.2%
unpow299.2%
hypot-define99.2%
associate-+r+99.2%
Applied egg-rr99.2%
unpow1/299.2%
+-commutative99.2%
Simplified99.2%
if 8.00000000000000005e-41 < B < 2.5000000000000002e68Initial program 34.8%
Taylor expanded in F around 0 42.3%
mul-1-neg42.3%
Simplified59.5%
if 2.5000000000000002e68 < B Initial program 8.7%
Taylor expanded in A around 0 14.1%
mul-1-neg14.1%
unpow214.1%
unpow214.1%
hypot-define54.9%
Simplified54.9%
pow1/254.9%
*-commutative54.9%
unpow-prod-down71.9%
pow1/271.9%
pow1/271.9%
Applied egg-rr71.9%
Final simplification38.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 (+ (pow B_m 2.0) (* -4.0 (* A C))))
(t_2
(*
-2.0
(* (/ C t_1) (sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 3.9e-159)
t_2
(if (<= B_m 1e-83)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= B_m 1e-40)
t_2
(if (<= B_m 2.65e+70)
(*
(sqrt (/ (* F (+ A (+ C (hypot B_m (- A C))))) t_1))
(- (sqrt 2.0)))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = pow(B_m, 2.0) + (-4.0 * (A * C));
double t_2 = -2.0 * ((C / t_1) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 3.9e-159) {
tmp = t_2;
} else if (B_m <= 1e-83) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (B_m <= 1e-40) {
tmp = t_2;
} else if (B_m <= 2.65e+70) {
tmp = sqrt(((F * (A + (C + hypot(B_m, (A - C))))) / t_1)) * -sqrt(2.0);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
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.pow(B_m, 2.0) + (-4.0 * (A * C));
double t_2 = -2.0 * ((C / t_1) * Math.sqrt((F * ((A * -4.0) + (Math.pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 3.9e-159) {
tmp = t_2;
} else if (B_m <= 1e-83) {
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 if (B_m <= 1e-40) {
tmp = t_2;
} else if (B_m <= 2.65e+70) {
tmp = Math.sqrt(((F * (A + (C + Math.hypot(B_m, (A - C))))) / t_1)) * -Math.sqrt(2.0);
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + Math.hypot(B_m, C))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = math.pow(B_m, 2.0) + (-4.0 * (A * C)) t_2 = -2.0 * ((C / t_1) * math.sqrt((F * ((A * -4.0) + (math.pow(B_m, 2.0) / C))))) tmp = 0 if B_m <= 3.9e-159: tmp = t_2 elif B_m <= 1e-83: 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)) elif B_m <= 1e-40: tmp = t_2 elif B_m <= 2.65e+70: tmp = math.sqrt(((F * (A + (C + math.hypot(B_m, (A - C))))) / t_1)) * -math.sqrt(2.0) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + math.hypot(B_m, C))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C))) t_2 = Float64(-2.0 * Float64(Float64(C / t_1) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 3.9e-159) tmp = t_2; elseif (B_m <= 1e-83) 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 <= 1e-40) tmp = t_2; elseif (B_m <= 2.65e+70) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / t_1)) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = (B_m ^ 2.0) + (-4.0 * (A * C));
t_2 = -2.0 * ((C / t_1) * sqrt((F * ((A * -4.0) + ((B_m ^ 2.0) / C)))));
tmp = 0.0;
if (B_m <= 3.9e-159)
tmp = t_2;
elseif (B_m <= 1e-83)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
elseif (B_m <= 1e-40)
tmp = t_2;
elseif (B_m <= 2.65e+70)
tmp = sqrt(((F * (A + (C + hypot(B_m, (A - C))))) / t_1)) * -sqrt(2.0);
else
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-2.0 * N[(N[(C / t$95$1), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 3.9e-159], t$95$2, If[LessEqual[B$95$m, 1e-83], 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[B$95$m, 1e-40], t$95$2, If[LessEqual[B$95$m, 2.65e+70], N[(N[Sqrt[N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 := {B\_m}^{2} + -4 \cdot \left(A \cdot C\right)\\
t_2 := -2 \cdot \left(\frac{C}{t\_1} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 3.9 \cdot 10^{-159}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 10^{-83}:\\
\;\;\;\;\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 \leq 10^{-40}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 2.65 \cdot 10^{+70}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{t\_1}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 3.89999999999999977e-159 or 1e-83 < B < 9.9999999999999993e-41Initial program 19.3%
Simplified25.1%
Taylor expanded in C around inf 20.2%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 24.0%
if 3.89999999999999977e-159 < B < 1e-83Initial program 23.3%
Taylor expanded in A around -inf 30.9%
if 9.9999999999999993e-41 < B < 2.65e70Initial program 34.8%
expm1-log1p-u33.7%
unpow233.7%
unpow233.7%
hypot-define47.9%
Applied egg-rr47.9%
Taylor expanded in F around 0 42.3%
mul-1-neg42.3%
unpow242.3%
unpow242.3%
hypot-undefine58.8%
cancel-sign-sub-inv58.8%
metadata-eval58.8%
Simplified58.8%
if 2.65e70 < B Initial program 8.7%
Taylor expanded in A around 0 14.1%
mul-1-neg14.1%
unpow214.1%
unpow214.1%
hypot-define54.9%
Simplified54.9%
pow1/254.9%
*-commutative54.9%
unpow-prod-down71.9%
pow1/271.9%
pow1/271.9%
Applied egg-rr71.9%
Final simplification38.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 (fma B_m B_m (* A (* C -4.0))))
(t_1 (+ (pow B_m 2.0) (* -4.0 (* A C))))
(t_2
(*
-2.0
(* (/ C t_1) (sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 6.5e-159)
t_2
(if (<= B_m 3.1e-82)
(/
-1.0
(/
t_0
(sqrt
(* t_0 (* (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)) (* 2.0 F))))))
(if (<= B_m 4.5e-41)
t_2
(if (<= B_m 3.85e+68)
(*
(sqrt (/ (* F (+ A (+ C (hypot B_m (- A C))))) t_1))
(- (sqrt 2.0)))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = pow(B_m, 2.0) + (-4.0 * (A * C));
double t_2 = -2.0 * ((C / t_1) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 6.5e-159) {
tmp = t_2;
} else if (B_m <= 3.1e-82) {
tmp = -1.0 / (t_0 / sqrt((t_0 * (((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)) * (2.0 * F)))));
} else if (B_m <= 4.5e-41) {
tmp = t_2;
} else if (B_m <= 3.85e+68) {
tmp = sqrt(((F * (A + (C + hypot(B_m, (A - C))))) / t_1)) * -sqrt(2.0);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C))) t_2 = Float64(-2.0 * Float64(Float64(C / t_1) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 6.5e-159) tmp = t_2; elseif (B_m <= 3.1e-82) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(t_0 * Float64(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)) * Float64(2.0 * F)))))); elseif (B_m <= 4.5e-41) tmp = t_2; elseif (B_m <= 3.85e+68) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / t_1)) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); 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[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-2.0 * N[(N[(C / t$95$1), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 6.5e-159], t$95$2, If[LessEqual[B$95$m, 3.1e-82], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(t$95$0 * N[(N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.5e-41], t$95$2, If[LessEqual[B$95$m, 3.85e+68], N[(N[Sqrt[N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := {B\_m}^{2} + -4 \cdot \left(A \cdot C\right)\\
t_2 := -2 \cdot \left(\frac{C}{t\_1} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 6.5 \cdot 10^{-159}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 3.1 \cdot 10^{-82}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0 \cdot \left(\left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right) \cdot \left(2 \cdot F\right)\right)}}}\\
\mathbf{elif}\;B\_m \leq 4.5 \cdot 10^{-41}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 3.85 \cdot 10^{+68}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{t\_1}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 6.5000000000000001e-159 or 3.1e-82 < B < 4.5e-41Initial program 18.8%
Simplified24.6%
Taylor expanded in C around inf 20.3%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 24.1%
if 6.5000000000000001e-159 < B < 3.1e-82Initial program 28.4%
Simplified43.9%
clear-num43.9%
inv-pow43.9%
Applied egg-rr43.9%
unpow-143.9%
associate-*r*43.9%
hypot-undefine29.4%
unpow229.4%
unpow229.4%
+-commutative29.4%
unpow229.4%
unpow229.4%
hypot-undefine43.9%
Simplified43.9%
Taylor expanded in A around -inf 30.3%
if 4.5e-41 < B < 3.8499999999999999e68Initial program 34.8%
expm1-log1p-u33.7%
unpow233.7%
unpow233.7%
hypot-define47.9%
Applied egg-rr47.9%
Taylor expanded in F around 0 42.3%
mul-1-neg42.3%
unpow242.3%
unpow242.3%
hypot-undefine58.8%
cancel-sign-sub-inv58.8%
metadata-eval58.8%
Simplified58.8%
if 3.8499999999999999e68 < B Initial program 8.7%
Taylor expanded in A around 0 14.1%
mul-1-neg14.1%
unpow214.1%
unpow214.1%
hypot-define54.9%
Simplified54.9%
pow1/254.9%
*-commutative54.9%
unpow-prod-down71.9%
pow1/271.9%
pow1/271.9%
Applied egg-rr71.9%
Final simplification38.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 (+ (pow B_m 2.0) (* -4.0 (* A C))))
(t_2
(*
-2.0
(* (/ C t_1) (sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 8.2e-159)
t_2
(if (<= B_m 3.6e-82)
(/
(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)))
(if (<= B_m 7.8e-41)
t_2
(if (<= B_m 1.25e+67)
(*
(sqrt (/ (* F (+ A (+ C (hypot B_m (- A C))))) t_1))
(- (sqrt 2.0)))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = pow(B_m, 2.0) + (-4.0 * (A * C));
double t_2 = -2.0 * ((C / t_1) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 8.2e-159) {
tmp = t_2;
} else if (B_m <= 3.6e-82) {
tmp = 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));
} else if (B_m <= 7.8e-41) {
tmp = t_2;
} else if (B_m <= 1.25e+67) {
tmp = sqrt(((F * (A + (C + hypot(B_m, (A - C))))) / t_1)) * -sqrt(2.0);
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
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.pow(B_m, 2.0) + (-4.0 * (A * C));
double t_2 = -2.0 * ((C / t_1) * Math.sqrt((F * ((A * -4.0) + (Math.pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 8.2e-159) {
tmp = t_2;
} else if (B_m <= 3.6e-82) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * ((-0.5 * (Math.pow(B_m, 2.0) / A)) + (2.0 * C)))) / (t_0 - Math.pow(B_m, 2.0));
} else if (B_m <= 7.8e-41) {
tmp = t_2;
} else if (B_m <= 1.25e+67) {
tmp = Math.sqrt(((F * (A + (C + Math.hypot(B_m, (A - C))))) / t_1)) * -Math.sqrt(2.0);
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + Math.hypot(B_m, C))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = math.pow(B_m, 2.0) + (-4.0 * (A * C)) t_2 = -2.0 * ((C / t_1) * math.sqrt((F * ((A * -4.0) + (math.pow(B_m, 2.0) / C))))) tmp = 0 if B_m <= 8.2e-159: tmp = t_2 elif B_m <= 3.6e-82: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * ((-0.5 * (math.pow(B_m, 2.0) / A)) + (2.0 * C)))) / (t_0 - math.pow(B_m, 2.0)) elif B_m <= 7.8e-41: tmp = t_2 elif B_m <= 1.25e+67: tmp = math.sqrt(((F * (A + (C + math.hypot(B_m, (A - C))))) / t_1)) * -math.sqrt(2.0) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + math.hypot(B_m, C))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C))) t_2 = Float64(-2.0 * Float64(Float64(C / t_1) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 8.2e-159) tmp = t_2; elseif (B_m <= 3.6e-82) tmp = 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))); elseif (B_m <= 7.8e-41) tmp = t_2; elseif (B_m <= 1.25e+67) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / t_1)) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = (B_m ^ 2.0) + (-4.0 * (A * C));
t_2 = -2.0 * ((C / t_1) * sqrt((F * ((A * -4.0) + ((B_m ^ 2.0) / C)))));
tmp = 0.0;
if (B_m <= 8.2e-159)
tmp = t_2;
elseif (B_m <= 3.6e-82)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * ((-0.5 * ((B_m ^ 2.0) / A)) + (2.0 * C)))) / (t_0 - (B_m ^ 2.0));
elseif (B_m <= 7.8e-41)
tmp = t_2;
elseif (B_m <= 1.25e+67)
tmp = sqrt(((F * (A + (C + hypot(B_m, (A - C))))) / t_1)) * -sqrt(2.0);
else
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-2.0 * N[(N[(C / t$95$1), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 8.2e-159], t$95$2, If[LessEqual[B$95$m, 3.6e-82], 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], If[LessEqual[B$95$m, 7.8e-41], t$95$2, If[LessEqual[B$95$m, 1.25e+67], N[(N[Sqrt[N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 := {B\_m}^{2} + -4 \cdot \left(A \cdot C\right)\\
t_2 := -2 \cdot \left(\frac{C}{t\_1} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 8.2 \cdot 10^{-159}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 3.6 \cdot 10^{-82}:\\
\;\;\;\;\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}}\\
\mathbf{elif}\;B\_m \leq 7.8 \cdot 10^{-41}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 1.25 \cdot 10^{+67}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{t\_1}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 8.20000000000000029e-159 or 3.59999999999999998e-82 < B < 7.79999999999999982e-41Initial program 18.8%
Simplified24.6%
Taylor expanded in C around inf 20.3%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 24.1%
if 8.20000000000000029e-159 < B < 3.59999999999999998e-82Initial program 28.4%
Taylor expanded in A around -inf 30.0%
if 7.79999999999999982e-41 < B < 1.24999999999999994e67Initial program 34.8%
expm1-log1p-u33.7%
unpow233.7%
unpow233.7%
hypot-define47.9%
Applied egg-rr47.9%
Taylor expanded in F around 0 42.3%
mul-1-neg42.3%
unpow242.3%
unpow242.3%
hypot-undefine58.8%
cancel-sign-sub-inv58.8%
metadata-eval58.8%
Simplified58.8%
if 1.24999999999999994e67 < B Initial program 8.7%
Taylor expanded in A around 0 14.1%
mul-1-neg14.1%
unpow214.1%
unpow214.1%
hypot-define54.9%
Simplified54.9%
pow1/254.9%
*-commutative54.9%
unpow-prod-down71.9%
pow1/271.9%
pow1/271.9%
Applied egg-rr71.9%
Final simplification38.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
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 4.8e-159)
t_1
(if (<= B_m 9e-83)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= B_m 1e-40)
t_1
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot B_m C))) (- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 4.8e-159) {
tmp = t_1;
} else if (B_m <= 9e-83) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (B_m <= 1e-40) {
tmp = t_1;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
}
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 = -2.0 * ((C / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * Math.sqrt((F * ((A * -4.0) + (Math.pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 4.8e-159) {
tmp = t_1;
} else if (B_m <= 9e-83) {
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 if (B_m <= 1e-40) {
tmp = t_1;
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + Math.hypot(B_m, C))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = -2.0 * ((C / (math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * math.sqrt((F * ((A * -4.0) + (math.pow(B_m, 2.0) / C))))) tmp = 0 if B_m <= 4.8e-159: tmp = t_1 elif B_m <= 9e-83: 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)) elif B_m <= 1e-40: tmp = t_1 else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + math.hypot(B_m, C))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 4.8e-159) tmp = t_1; elseif (B_m <= 9e-83) 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 <= 1e-40) tmp = t_1; else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(B_m, C))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = -2.0 * ((C / ((B_m ^ 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + ((B_m ^ 2.0) / C)))));
tmp = 0.0;
if (B_m <= 4.8e-159)
tmp = t_1;
elseif (B_m <= 9e-83)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
elseif (B_m <= 1e-40)
tmp = t_1;
else
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(B_m, C))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.8e-159], t$95$1, If[LessEqual[B$95$m, 9e-83], 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[B$95$m, 1e-40], t$95$1, N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-159}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 9 \cdot 10^{-83}:\\
\;\;\;\;\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 \leq 10^{-40}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B\_m, C\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 4.79999999999999995e-159 or 8.99999999999999995e-83 < B < 9.9999999999999993e-41Initial program 19.3%
Simplified25.1%
Taylor expanded in C around inf 20.2%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 24.0%
if 4.79999999999999995e-159 < B < 8.99999999999999995e-83Initial program 23.3%
Taylor expanded in A around -inf 30.9%
if 9.9999999999999993e-41 < B Initial program 16.2%
Taylor expanded in A around 0 19.1%
mul-1-neg19.1%
unpow219.1%
unpow219.1%
hypot-define48.4%
Simplified48.4%
pow1/248.4%
*-commutative48.4%
unpow-prod-down60.5%
pow1/260.5%
pow1/260.5%
Applied egg-rr60.5%
Final simplification36.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
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))))
(if (<= B_m 1.3e-158)
t_1
(if (<= B_m 8e-84)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= B_m 6.5e-41)
t_1
(if (<= B_m 1.55e+128)
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (+ C (hypot B_m C))))))
(* (sqrt (* 2.0 F)) (- (sqrt (/ 1.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 = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 1.3e-158) {
tmp = t_1;
} else if (B_m <= 8e-84) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (B_m <= 6.5e-41) {
tmp = t_1;
} else if (B_m <= 1.55e+128) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
} else {
tmp = sqrt((2.0 * F)) * -sqrt((1.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 = -2.0 * ((C / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * Math.sqrt((F * ((A * -4.0) + (Math.pow(B_m, 2.0) / C)))));
double tmp;
if (B_m <= 1.3e-158) {
tmp = t_1;
} else if (B_m <= 8e-84) {
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 if (B_m <= 6.5e-41) {
tmp = t_1;
} else if (B_m <= 1.55e+128) {
tmp = -1.0 / ((B_m / Math.sqrt(2.0)) * Math.sqrt(((1.0 / F) / (C + Math.hypot(B_m, C)))));
} else {
tmp = Math.sqrt((2.0 * F)) * -Math.sqrt((1.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 = -2.0 * ((C / (math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * math.sqrt((F * ((A * -4.0) + (math.pow(B_m, 2.0) / C))))) tmp = 0 if B_m <= 1.3e-158: tmp = t_1 elif B_m <= 8e-84: 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)) elif B_m <= 6.5e-41: tmp = t_1 elif B_m <= 1.55e+128: tmp = -1.0 / ((B_m / math.sqrt(2.0)) * math.sqrt(((1.0 / F) / (C + math.hypot(B_m, C))))) else: tmp = math.sqrt((2.0 * F)) * -math.sqrt((1.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(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))) tmp = 0.0 if (B_m <= 1.3e-158) tmp = t_1; elseif (B_m <= 8e-84) 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 <= 6.5e-41) tmp = t_1; elseif (B_m <= 1.55e+128) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(C + hypot(B_m, C)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) * Float64(-sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = -2.0 * ((C / ((B_m ^ 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + ((B_m ^ 2.0) / C)))));
tmp = 0.0;
if (B_m <= 1.3e-158)
tmp = t_1;
elseif (B_m <= 8e-84)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
elseif (B_m <= 6.5e-41)
tmp = t_1;
elseif (B_m <= 1.55e+128)
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
else
tmp = sqrt((2.0 * F)) * -sqrt((1.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[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.3e-158], t$95$1, If[LessEqual[B$95$m, 8e-84], 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[B$95$m, 6.5e-41], t$95$1, If[LessEqual[B$95$m, 1.55e+128], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(1.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])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := -2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{if}\;B\_m \leq 1.3 \cdot 10^{-158}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{-84}:\\
\;\;\;\;\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 \leq 6.5 \cdot 10^{-41}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 1.55 \cdot 10^{+128}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(B\_m, C\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot F} \cdot \left(-\sqrt{\frac{1}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 1.3e-158 or 8.0000000000000003e-84 < B < 6.5000000000000004e-41Initial program 19.3%
Simplified25.1%
Taylor expanded in C around inf 20.2%
Taylor expanded in C around inf 12.1%
distribute-lft1-in12.1%
metadata-eval12.1%
Simplified12.1%
Taylor expanded in F around 0 24.0%
if 1.3e-158 < B < 8.0000000000000003e-84Initial program 23.3%
Taylor expanded in A around -inf 30.9%
if 6.5000000000000004e-41 < B < 1.55000000000000002e128Initial program 36.5%
Simplified49.1%
clear-num49.2%
inv-pow49.2%
Applied egg-rr49.8%
unpow-149.8%
associate-*r*49.8%
hypot-undefine36.5%
unpow236.5%
unpow236.5%
+-commutative36.5%
unpow236.5%
unpow236.5%
hypot-undefine49.8%
Simplified49.8%
Taylor expanded in A around 0 40.7%
mul-1-neg40.7%
associate-/r*40.6%
unpow240.6%
unpow240.6%
hypot-undefine45.9%
Simplified45.9%
if 1.55000000000000002e128 < B Initial program 0.1%
Taylor expanded in B around inf 38.8%
mul-1-neg38.8%
Simplified38.8%
pow138.8%
sqrt-unprod39.1%
Applied egg-rr39.1%
unpow139.1%
Simplified39.1%
associate-*l/39.1%
Applied egg-rr39.1%
pow1/239.1%
div-inv39.1%
unpow-prod-down65.9%
pow1/265.9%
*-commutative65.9%
pow1/265.9%
Applied egg-rr65.9%
Final simplification35.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 1.18e-94)
(/
-1.0
(/
(fma B_m B_m (* A (* C -4.0)))
(sqrt (* -16.0 (* A (* F (pow C 2.0)))))))
(if (<= B_m 7.6e+129)
(/
(* B_m (sqrt (* 2.0 (* F (+ C (hypot B_m C))))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(* (sqrt (* 2.0 F)) (- (sqrt (/ 1.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.18e-94) {
tmp = -1.0 / (fma(B_m, B_m, (A * (C * -4.0))) / sqrt((-16.0 * (A * (F * pow(C, 2.0))))));
} else if (B_m <= 7.6e+129) {
tmp = (B_m * sqrt((2.0 * (F * (C + hypot(B_m, C)))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else {
tmp = sqrt((2.0 * F)) * -sqrt((1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.18e-94) tmp = Float64(-1.0 / Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) / sqrt(Float64(-16.0 * Float64(A * Float64(F * (C ^ 2.0))))))); elseif (B_m <= 7.6e+129) tmp = Float64(Float64(B_m * sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(B_m, C)))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(2.0 * F)) * Float64(-sqrt(Float64(1.0 / 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[B$95$m, 1.18e-94], N[(-1.0 / N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-16.0 * N[(A * N[(F * N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 7.6e+129], N[(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] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(1.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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.18 \cdot 10^{-94}:\\
\;\;\;\;\frac{-1}{\frac{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}{\sqrt{-16 \cdot \left(A \cdot \left(F \cdot {C}^{2}\right)\right)}}}\\
\mathbf{elif}\;B\_m \leq 7.6 \cdot 10^{+129}:\\
\;\;\;\;\frac{B\_m \cdot \sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot F} \cdot \left(-\sqrt{\frac{1}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 1.18e-94Initial program 18.2%
Simplified24.7%
clear-num24.7%
inv-pow24.7%
Applied egg-rr24.2%
unpow-124.2%
associate-*r*24.2%
hypot-undefine18.3%
unpow218.3%
unpow218.3%
+-commutative18.3%
unpow218.3%
unpow218.3%
hypot-undefine24.2%
Simplified24.2%
Taylor expanded in A around -inf 10.8%
if 1.18e-94 < B < 7.60000000000000011e129Initial program 36.1%
Taylor expanded in A around 0 33.9%
associate-*l*33.9%
unpow233.9%
unpow233.9%
hypot-define37.8%
Simplified37.8%
*-un-lft-identity37.8%
distribute-lft-neg-in37.8%
sqrt-unprod37.8%
*-commutative37.8%
Applied egg-rr37.8%
*-lft-identity37.8%
Simplified37.8%
if 7.60000000000000011e129 < B Initial program 0.1%
Taylor expanded in B around inf 38.8%
mul-1-neg38.8%
Simplified38.8%
pow138.8%
sqrt-unprod39.1%
Applied egg-rr39.1%
unpow139.1%
Simplified39.1%
associate-*l/39.1%
Applied egg-rr39.1%
pow1/239.1%
div-inv39.1%
unpow-prod-down65.9%
pow1/265.9%
*-commutative65.9%
pow1/265.9%
Applied egg-rr65.9%
Final simplification26.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 7.4e-41)
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(sqrt (* F (+ (* A -4.0) (/ (pow B_m 2.0) C))))))
(if (<= B_m 1.25e+130)
(/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (+ C (hypot B_m C))))))
(* (sqrt (* 2.0 F)) (- (sqrt (/ 1.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7.4e-41) {
tmp = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + (pow(B_m, 2.0) / C)))));
} else if (B_m <= 1.25e+130) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
} else {
tmp = sqrt((2.0 * F)) * -sqrt((1.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 tmp;
if (B_m <= 7.4e-41) {
tmp = -2.0 * ((C / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * Math.sqrt((F * ((A * -4.0) + (Math.pow(B_m, 2.0) / C)))));
} else if (B_m <= 1.25e+130) {
tmp = -1.0 / ((B_m / Math.sqrt(2.0)) * Math.sqrt(((1.0 / F) / (C + Math.hypot(B_m, C)))));
} else {
tmp = Math.sqrt((2.0 * F)) * -Math.sqrt((1.0 / B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 7.4e-41: tmp = -2.0 * ((C / (math.pow(B_m, 2.0) + (-4.0 * (A * C)))) * math.sqrt((F * ((A * -4.0) + (math.pow(B_m, 2.0) / C))))) elif B_m <= 1.25e+130: tmp = -1.0 / ((B_m / math.sqrt(2.0)) * math.sqrt(((1.0 / F) / (C + math.hypot(B_m, C))))) else: tmp = math.sqrt((2.0 * F)) * -math.sqrt((1.0 / B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7.4e-41) tmp = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(Float64(A * -4.0) + Float64((B_m ^ 2.0) / C)))))); elseif (B_m <= 1.25e+130) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(C + hypot(B_m, C)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) * Float64(-sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 7.4e-41)
tmp = -2.0 * ((C / ((B_m ^ 2.0) + (-4.0 * (A * C)))) * sqrt((F * ((A * -4.0) + ((B_m ^ 2.0) / C)))));
elseif (B_m <= 1.25e+130)
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
else
tmp = sqrt((2.0 * F)) * -sqrt((1.0 / B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7.4e-41], N[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A * -4.0), $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.25e+130], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(1.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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7.4 \cdot 10^{-41}:\\
\;\;\;\;-2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \sqrt{F \cdot \left(A \cdot -4 + \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{elif}\;B\_m \leq 1.25 \cdot 10^{+130}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(B\_m, C\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot F} \cdot \left(-\sqrt{\frac{1}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 7.4000000000000004e-41Initial program 19.6%
Simplified26.3%
Taylor expanded in C around inf 21.2%
Taylor expanded in C around inf 11.9%
distribute-lft1-in11.9%
metadata-eval11.9%
Simplified11.9%
Taylor expanded in F around 0 22.3%
if 7.4000000000000004e-41 < B < 1.2499999999999999e130Initial program 36.5%
Simplified49.1%
clear-num49.2%
inv-pow49.2%
Applied egg-rr49.8%
unpow-149.8%
associate-*r*49.8%
hypot-undefine36.5%
unpow236.5%
unpow236.5%
+-commutative36.5%
unpow236.5%
unpow236.5%
hypot-undefine49.8%
Simplified49.8%
Taylor expanded in A around 0 40.7%
mul-1-neg40.7%
associate-/r*40.6%
unpow240.6%
unpow240.6%
hypot-undefine45.9%
Simplified45.9%
if 1.2499999999999999e130 < B Initial program 0.1%
Taylor expanded in B around inf 38.8%
mul-1-neg38.8%
Simplified38.8%
pow138.8%
sqrt-unprod39.1%
Applied egg-rr39.1%
unpow139.1%
Simplified39.1%
associate-*l/39.1%
Applied egg-rr39.1%
pow1/239.1%
div-inv39.1%
unpow-prod-down65.9%
pow1/265.9%
*-commutative65.9%
pow1/265.9%
Applied egg-rr65.9%
Final simplification33.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3e-91)
(/
-1.0
(/
(fma B_m B_m (* A (* C -4.0)))
(sqrt (* -16.0 (* A (* F (pow C 2.0)))))))
(if (<= B_m 3.9e+133)
(/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (+ C (hypot B_m C))))))
(* (sqrt (* 2.0 F)) (- (sqrt (/ 1.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3e-91) {
tmp = -1.0 / (fma(B_m, B_m, (A * (C * -4.0))) / sqrt((-16.0 * (A * (F * pow(C, 2.0))))));
} else if (B_m <= 3.9e+133) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
} else {
tmp = sqrt((2.0 * F)) * -sqrt((1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3e-91) tmp = Float64(-1.0 / Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) / sqrt(Float64(-16.0 * Float64(A * Float64(F * (C ^ 2.0))))))); elseif (B_m <= 3.9e+133) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(C + hypot(B_m, C)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) * Float64(-sqrt(Float64(1.0 / 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[B$95$m, 3e-91], N[(-1.0 / N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-16.0 * N[(A * N[(F * N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 3.9e+133], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(1.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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3 \cdot 10^{-91}:\\
\;\;\;\;\frac{-1}{\frac{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}{\sqrt{-16 \cdot \left(A \cdot \left(F \cdot {C}^{2}\right)\right)}}}\\
\mathbf{elif}\;B\_m \leq 3.9 \cdot 10^{+133}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(B\_m, C\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot F} \cdot \left(-\sqrt{\frac{1}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 3.0000000000000002e-91Initial program 18.2%
Simplified24.7%
clear-num24.7%
inv-pow24.7%
Applied egg-rr24.2%
unpow-124.2%
associate-*r*24.2%
hypot-undefine18.3%
unpow218.3%
unpow218.3%
+-commutative18.3%
unpow218.3%
unpow218.3%
hypot-undefine24.2%
Simplified24.2%
Taylor expanded in A around -inf 10.8%
if 3.0000000000000002e-91 < B < 3.90000000000000014e133Initial program 36.1%
Simplified47.1%
clear-num47.2%
inv-pow47.2%
Applied egg-rr47.6%
unpow-147.6%
associate-*r*47.6%
hypot-undefine36.3%
unpow236.3%
unpow236.3%
+-commutative36.3%
unpow236.3%
unpow236.3%
hypot-undefine47.6%
Simplified47.6%
Taylor expanded in A around 0 34.3%
mul-1-neg34.3%
associate-/r*34.3%
unpow234.3%
unpow234.3%
hypot-undefine38.0%
Simplified38.0%
if 3.90000000000000014e133 < B Initial program 0.1%
Taylor expanded in B around inf 38.8%
mul-1-neg38.8%
Simplified38.8%
pow138.8%
sqrt-unprod39.1%
Applied egg-rr39.1%
unpow139.1%
Simplified39.1%
associate-*l/39.1%
Applied egg-rr39.1%
pow1/239.1%
div-inv39.1%
unpow-prod-down65.9%
pow1/265.9%
*-commutative65.9%
pow1/265.9%
Applied egg-rr65.9%
Final simplification26.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 2.05e+114) (/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (+ C (hypot B_m C)))))) (* (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 tmp;
if (F <= 2.05e+114) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
} else {
tmp = 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 tmp;
if (F <= 2.05e+114) {
tmp = -1.0 / ((B_m / Math.sqrt(2.0)) * Math.sqrt(((1.0 / F) / (C + Math.hypot(B_m, C)))));
} else {
tmp = 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): tmp = 0 if F <= 2.05e+114: tmp = -1.0 / ((B_m / math.sqrt(2.0)) * math.sqrt(((1.0 / F) / (C + math.hypot(B_m, C))))) else: tmp = 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) tmp = 0.0 if (F <= 2.05e+114) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(C + hypot(B_m, C)))))); else tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 2.05e+114)
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (C + hypot(B_m, C)))));
else
tmp = 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_] := If[LessEqual[F, 2.05e+114], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 2.05 \cdot 10^{+114}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(B\_m, C\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if F < 2.05e114Initial program 21.8%
Simplified30.2%
clear-num30.2%
inv-pow30.2%
Applied egg-rr29.8%
unpow-129.8%
associate-*r*29.8%
hypot-undefine21.7%
unpow221.7%
unpow221.7%
+-commutative21.7%
unpow221.7%
unpow221.7%
hypot-undefine29.8%
Simplified29.8%
Taylor expanded in A around 0 10.2%
mul-1-neg10.2%
associate-/r*10.2%
unpow210.2%
unpow210.2%
hypot-undefine23.5%
Simplified23.5%
if 2.05e114 < F Initial program 8.8%
Taylor expanded in B around inf 18.4%
mul-1-neg18.4%
Simplified18.4%
pow118.4%
sqrt-unprod18.5%
Applied egg-rr18.5%
unpow118.5%
Simplified18.5%
associate-*l/18.5%
Applied egg-rr18.5%
pow1/219.2%
associate-/l*19.2%
unpow-prod-down20.1%
pow1/220.1%
Applied egg-rr20.1%
unpow1/220.1%
Simplified20.1%
Final simplification22.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 (if (<= F 1.8e+114) (/ (sqrt (* 2.0 (* F (+ C (hypot B_m C))))) (- B_m)) (* (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 tmp;
if (F <= 1.8e+114) {
tmp = sqrt((2.0 * (F * (C + hypot(B_m, C))))) / -B_m;
} else {
tmp = 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 tmp;
if (F <= 1.8e+114) {
tmp = Math.sqrt((2.0 * (F * (C + Math.hypot(B_m, C))))) / -B_m;
} else {
tmp = 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): tmp = 0 if F <= 1.8e+114: tmp = math.sqrt((2.0 * (F * (C + math.hypot(B_m, C))))) / -B_m else: tmp = 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) tmp = 0.0 if (F <= 1.8e+114) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(B_m, C))))) / Float64(-B_m)); else tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 1.8e+114)
tmp = sqrt((2.0 * (F * (C + hypot(B_m, C))))) / -B_m;
else
tmp = 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_] := If[LessEqual[F, 1.8e+114], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 1.8 \cdot 10^{+114}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if F < 1.8e114Initial program 21.8%
Taylor expanded in A around 0 10.1%
mul-1-neg10.1%
unpow210.1%
unpow210.1%
hypot-define23.3%
Simplified23.3%
associate-*l/23.3%
sqrt-unprod23.4%
Applied egg-rr23.4%
if 1.8e114 < F Initial program 8.8%
Taylor expanded in B around inf 18.4%
mul-1-neg18.4%
Simplified18.4%
pow118.4%
sqrt-unprod18.5%
Applied egg-rr18.5%
unpow118.5%
Simplified18.5%
associate-*l/18.5%
Applied egg-rr18.5%
pow1/219.2%
associate-/l*19.2%
unpow-prod-down20.1%
pow1/220.1%
Applied egg-rr20.1%
unpow1/220.1%
Simplified20.1%
Final simplification22.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 (<= C 6e+161) (* (sqrt (* 2.0 F)) (- (sqrt (/ 1.0 B_m)))) (* -2.0 (/ (sqrt (* C 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 (C <= 6e+161) {
tmp = sqrt((2.0 * F)) * -sqrt((1.0 / B_m));
} else {
tmp = -2.0 * (sqrt((C * 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 (c <= 6d+161) then
tmp = sqrt((2.0d0 * f)) * -sqrt((1.0d0 / b_m))
else
tmp = (-2.0d0) * (sqrt((c * 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 (C <= 6e+161) {
tmp = Math.sqrt((2.0 * F)) * -Math.sqrt((1.0 / B_m));
} else {
tmp = -2.0 * (Math.sqrt((C * 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 C <= 6e+161: tmp = math.sqrt((2.0 * F)) * -math.sqrt((1.0 / B_m)) else: tmp = -2.0 * (math.sqrt((C * 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 (C <= 6e+161) tmp = Float64(sqrt(Float64(2.0 * F)) * Float64(-sqrt(Float64(1.0 / B_m)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * 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 (C <= 6e+161)
tmp = sqrt((2.0 * F)) * -sqrt((1.0 / B_m));
else
tmp = -2.0 * (sqrt((C * 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[C, 6e+161], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $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}
\mathbf{if}\;C \leq 6 \cdot 10^{+161}:\\
\;\;\;\;\sqrt{2 \cdot F} \cdot \left(-\sqrt{\frac{1}{B\_m}}\right)\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 6.00000000000000023e161Initial program 21.4%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.7%
Applied egg-rr15.7%
unpow115.7%
Simplified15.7%
associate-*l/15.7%
Applied egg-rr15.7%
pow1/215.9%
div-inv15.9%
unpow-prod-down21.7%
pow1/221.7%
*-commutative21.7%
pow1/221.7%
Applied egg-rr21.7%
if 6.00000000000000023e161 < C Initial program 1.6%
Simplified16.7%
Taylor expanded in C around inf 11.6%
Taylor expanded in C around inf 11.6%
distribute-lft1-in11.6%
metadata-eval11.6%
Simplified11.6%
Taylor expanded in C around 0 14.6%
associate-*l/14.6%
*-lft-identity14.6%
Simplified14.6%
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 (if (<= C 5.4e+160) (- (sqrt (fabs (* 2.0 (/ F B_m))))) (* -2.0 (/ (sqrt (* C 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 (C <= 5.4e+160) {
tmp = -sqrt(fabs((2.0 * (F / B_m))));
} else {
tmp = -2.0 * (sqrt((C * 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 (c <= 5.4d+160) then
tmp = -sqrt(abs((2.0d0 * (f / b_m))))
else
tmp = (-2.0d0) * (sqrt((c * 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 (C <= 5.4e+160) {
tmp = -Math.sqrt(Math.abs((2.0 * (F / B_m))));
} else {
tmp = -2.0 * (Math.sqrt((C * 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 C <= 5.4e+160: tmp = -math.sqrt(math.fabs((2.0 * (F / B_m)))) else: tmp = -2.0 * (math.sqrt((C * 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 (C <= 5.4e+160) tmp = Float64(-sqrt(abs(Float64(2.0 * Float64(F / B_m))))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * 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 (C <= 5.4e+160)
tmp = -sqrt(abs((2.0 * (F / B_m))));
else
tmp = -2.0 * (sqrt((C * 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[C, 5.4e+160], (-N[Sqrt[N[Abs[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $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}
\mathbf{if}\;C \leq 5.4 \cdot 10^{+160}:\\
\;\;\;\;-\sqrt{\left|2 \cdot \frac{F}{B\_m}\right|}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 5.4e160Initial program 21.4%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.7%
Applied egg-rr15.7%
unpow115.7%
Simplified15.7%
add-sqr-sqrt15.7%
pow1/215.7%
pow1/215.9%
pow-prod-down22.1%
pow222.1%
*-commutative22.1%
Applied egg-rr22.1%
unpow1/222.1%
unpow222.1%
rem-sqrt-square28.5%
Simplified28.5%
if 5.4e160 < C Initial program 1.6%
Simplified16.7%
Taylor expanded in C around inf 11.6%
Taylor expanded in C around inf 11.6%
distribute-lft1-in11.6%
metadata-eval11.6%
Simplified11.6%
Taylor expanded in C around 0 14.6%
associate-*l/14.6%
*-lft-identity14.6%
Simplified14.6%
Final simplification26.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 2.3e+161) (* (sqrt F) (- (sqrt (/ 2.0 B_m)))) (* -2.0 (/ (sqrt (* C 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 (C <= 2.3e+161) {
tmp = sqrt(F) * -sqrt((2.0 / B_m));
} else {
tmp = -2.0 * (sqrt((C * 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 (c <= 2.3d+161) then
tmp = sqrt(f) * -sqrt((2.0d0 / b_m))
else
tmp = (-2.0d0) * (sqrt((c * 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 (C <= 2.3e+161) {
tmp = Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
} else {
tmp = -2.0 * (Math.sqrt((C * 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 C <= 2.3e+161: tmp = math.sqrt(F) * -math.sqrt((2.0 / B_m)) else: tmp = -2.0 * (math.sqrt((C * 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 (C <= 2.3e+161) tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * 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 (C <= 2.3e+161)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
else
tmp = -2.0 * (sqrt((C * 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[C, 2.3e+161], N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $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}
\mathbf{if}\;C \leq 2.3 \cdot 10^{+161}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 2.2999999999999999e161Initial program 21.4%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.7%
Applied egg-rr15.7%
unpow115.7%
Simplified15.7%
associate-*l/15.7%
Applied egg-rr15.7%
pow1/215.9%
associate-/l*15.9%
unpow-prod-down21.7%
pow1/221.7%
Applied egg-rr21.7%
unpow1/221.7%
Simplified21.7%
if 2.2999999999999999e161 < C Initial program 1.6%
Simplified16.7%
Taylor expanded in C around inf 11.6%
Taylor expanded in C around inf 11.6%
distribute-lft1-in11.6%
metadata-eval11.6%
Simplified11.6%
Taylor expanded in C around 0 14.6%
associate-*l/14.6%
*-lft-identity14.6%
Simplified14.6%
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 (if (<= C 9.5e+160) (/ (- (sqrt (* 2.0 F))) (sqrt B_m)) (* -2.0 (/ (sqrt (* C 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 (C <= 9.5e+160) {
tmp = -sqrt((2.0 * F)) / sqrt(B_m);
} else {
tmp = -2.0 * (sqrt((C * 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 (c <= 9.5d+160) then
tmp = -sqrt((2.0d0 * f)) / sqrt(b_m)
else
tmp = (-2.0d0) * (sqrt((c * 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 (C <= 9.5e+160) {
tmp = -Math.sqrt((2.0 * F)) / Math.sqrt(B_m);
} else {
tmp = -2.0 * (Math.sqrt((C * 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 C <= 9.5e+160: tmp = -math.sqrt((2.0 * F)) / math.sqrt(B_m) else: tmp = -2.0 * (math.sqrt((C * 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 (C <= 9.5e+160) tmp = Float64(Float64(-sqrt(Float64(2.0 * F))) / sqrt(B_m)); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * 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 (C <= 9.5e+160)
tmp = -sqrt((2.0 * F)) / sqrt(B_m);
else
tmp = -2.0 * (sqrt((C * 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[C, 9.5e+160], N[((-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]) / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $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}
\mathbf{if}\;C \leq 9.5 \cdot 10^{+160}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 9.5000000000000006e160Initial program 21.4%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.7%
Applied egg-rr15.7%
unpow115.7%
Simplified15.7%
associate-*l/15.7%
sqrt-div21.7%
Applied egg-rr21.7%
if 9.5000000000000006e160 < C Initial program 1.6%
Simplified16.7%
Taylor expanded in C around inf 11.6%
Taylor expanded in C around inf 11.6%
distribute-lft1-in11.6%
metadata-eval11.6%
Simplified11.6%
Taylor expanded in C around 0 14.6%
associate-*l/14.6%
*-lft-identity14.6%
Simplified14.6%
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 (if (<= C 1.5e+161) (- (sqrt (/ (* 2.0 F) B_m))) (* -2.0 (/ (sqrt (* C 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 (C <= 1.5e+161) {
tmp = -sqrt(((2.0 * F) / B_m));
} else {
tmp = -2.0 * (sqrt((C * 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 (c <= 1.5d+161) then
tmp = -sqrt(((2.0d0 * f) / b_m))
else
tmp = (-2.0d0) * (sqrt((c * 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 (C <= 1.5e+161) {
tmp = -Math.sqrt(((2.0 * F) / B_m));
} else {
tmp = -2.0 * (Math.sqrt((C * 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 C <= 1.5e+161: tmp = -math.sqrt(((2.0 * F) / B_m)) else: tmp = -2.0 * (math.sqrt((C * 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 (C <= 1.5e+161) tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / B_m))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * 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 (C <= 1.5e+161)
tmp = -sqrt(((2.0 * F) / B_m));
else
tmp = -2.0 * (sqrt((C * 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[C, 1.5e+161], (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $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}
\mathbf{if}\;C \leq 1.5 \cdot 10^{+161}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 1.50000000000000006e161Initial program 21.4%
Taylor expanded in B around inf 15.6%
mul-1-neg15.6%
Simplified15.6%
pow115.6%
sqrt-unprod15.7%
Applied egg-rr15.7%
unpow115.7%
Simplified15.7%
associate-*l/15.7%
Applied egg-rr15.7%
if 1.50000000000000006e161 < C Initial program 1.6%
Simplified16.7%
Taylor expanded in C around inf 11.6%
Taylor expanded in C around inf 11.6%
distribute-lft1-in11.6%
metadata-eval11.6%
Simplified11.6%
Taylor expanded in C around 0 14.6%
associate-*l/14.6%
*-lft-identity14.6%
Simplified14.6%
Final simplification15.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 (- (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.5%
Taylor expanded in B around inf 13.7%
mul-1-neg13.7%
Simplified13.7%
sqrt-unprod13.8%
pow1/214.0%
Applied egg-rr14.0%
Final simplification14.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 (/ 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.5%
Taylor expanded in B around inf 13.7%
mul-1-neg13.7%
Simplified13.7%
pow113.7%
sqrt-unprod13.8%
Applied egg-rr13.8%
unpow113.8%
Simplified13.8%
associate-*l/13.8%
Applied egg-rr13.8%
*-un-lft-identity13.8%
associate-/l*13.8%
Applied egg-rr13.8%
*-lft-identity13.8%
Simplified13.8%
Final simplification13.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 (* 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.5%
Taylor expanded in B around inf 13.7%
mul-1-neg13.7%
Simplified13.7%
pow113.7%
sqrt-unprod13.8%
Applied egg-rr13.8%
unpow113.8%
Simplified13.8%
Final simplification13.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 (/ (* 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(Float64(2.0 * 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[(N[(2.0 * F), $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])\\
\\
-\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 18.5%
Taylor expanded in B around inf 13.7%
mul-1-neg13.7%
Simplified13.7%
pow113.7%
sqrt-unprod13.8%
Applied egg-rr13.8%
unpow113.8%
Simplified13.8%
associate-*l/13.8%
Applied egg-rr13.8%
Final simplification13.8%
herbie shell --seed 2024067
(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))))