
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0)))
(t_1 (* (sqrt (* F (* C -4.0))) (/ t_0 (/ C (sqrt 0.125)))))
(t_2 (- (* B B) (* 4.0 (* C A)))))
(if (<= B 1.05e-193)
t_1
(if (<= B 3.1e-78)
(/ (- (sqrt (* 2.0 (* t_2 (* F (* 2.0 A)))))) t_2)
(if (<= B 1.7e-53)
t_1
(if (<= B 7e+110)
(/
(*
(sqrt (fma B B (* C (* -4.0 A))))
(- (sqrt (* (* 2.0 F) (+ A (- C (hypot B (- A C))))))))
(fma B B (* (* C -4.0) A)))
(* (sqrt (* F (- A (hypot A B)))) (/ t_0 B))))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = -sqrt(2.0);
double t_1 = sqrt((F * (C * -4.0))) * (t_0 / (C / sqrt(0.125)));
double t_2 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 1.05e-193) {
tmp = t_1;
} else if (B <= 3.1e-78) {
tmp = -sqrt((2.0 * (t_2 * (F * (2.0 * A))))) / t_2;
} else if (B <= 1.7e-53) {
tmp = t_1;
} else if (B <= 7e+110) {
tmp = (sqrt(fma(B, B, (C * (-4.0 * A)))) * -sqrt(((2.0 * F) * (A + (C - hypot(B, (A - C))))))) / fma(B, B, ((C * -4.0) * A));
} else {
tmp = sqrt((F * (A - hypot(A, B)))) * (t_0 / B);
}
return tmp;
}
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(-sqrt(2.0)) t_1 = Float64(sqrt(Float64(F * Float64(C * -4.0))) * Float64(t_0 / Float64(C / sqrt(0.125)))) t_2 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= 1.05e-193) tmp = t_1; elseif (B <= 3.1e-78) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_2 * Float64(F * Float64(2.0 * A)))))) / t_2); elseif (B <= 1.7e-53) tmp = t_1; elseif (B <= 7e+110) tmp = Float64(Float64(sqrt(fma(B, B, Float64(C * Float64(-4.0 * A)))) * Float64(-sqrt(Float64(Float64(2.0 * F) * Float64(A + Float64(C - hypot(B, Float64(A - C)))))))) / fma(B, B, Float64(Float64(C * -4.0) * A))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(A, B)))) * Float64(t_0 / B)); end return tmp end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(N[Sqrt[N[(F * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 / N[(C / N[Sqrt[0.125], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.05e-193], t$95$1, If[LessEqual[B, 3.1e-78], N[((-N[Sqrt[N[(2.0 * N[(t$95$2 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[B, 1.7e-53], t$95$1, If[LessEqual[B, 7e+110], N[(N[(N[Sqrt[N[(B * B + N[(C * N[(-4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + N[(C - N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(B * B + N[(N[(C * -4.0), $MachinePrecision] * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 / B), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := -\sqrt{2}\\
t_1 := \sqrt{F \cdot \left(C \cdot -4\right)} \cdot \frac{t_0}{\frac{C}{\sqrt{0.125}}}\\
t_2 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq 1.05 \cdot 10^{-193}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;B \leq 3.1 \cdot 10^{-78}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_2 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_2}\\
\mathbf{elif}\;B \leq 1.7 \cdot 10^{-53}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;B \leq 7 \cdot 10^{+110}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)} \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(A + \left(C - \mathsf{hypot}\left(B, A - C\right)\right)\right)}\right)}{\mathsf{fma}\left(B, B, \left(C \cdot -4\right) \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)} \cdot \frac{t_0}{B}\\
\end{array}
\end{array}
if B < 1.05e-193 or 3.10000000000000018e-78 < B < 1.7e-53Initial program 22.9%
Simplified22.9%
flip--9.1%
add-sqr-sqrt9.1%
fma-def9.1%
unpow29.1%
hypot-udef9.1%
Applied egg-rr9.1%
Taylor expanded in A around -inf 18.2%
mul-1-neg18.2%
distribute-rgt-neg-in18.2%
associate-/l*18.3%
*-commutative18.3%
distribute-rgt-out--18.3%
metadata-eval18.3%
Simplified18.3%
if 1.05e-193 < B < 3.10000000000000018e-78Initial program 29.1%
Simplified29.1%
Taylor expanded in A around -inf 33.7%
*-commutative33.7%
Simplified33.7%
distribute-frac-neg33.7%
associate-*l*36.4%
Applied egg-rr36.4%
if 1.7e-53 < B < 6.9999999999999998e110Initial program 33.8%
Simplified40.6%
sqrt-prod46.2%
associate-*r*46.2%
*-commutative46.2%
associate-*l*46.3%
associate--r-45.3%
+-commutative45.3%
Applied egg-rr45.3%
associate-*r*45.3%
Simplified45.3%
if 6.9999999999999998e110 < B Initial program 0.6%
Simplified0.6%
Taylor expanded in C around 0 8.0%
mul-1-neg8.0%
*-commutative8.0%
+-commutative8.0%
unpow28.0%
unpow28.0%
hypot-def43.1%
Simplified43.1%
Final simplification29.1%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0)))
(t_1 (* (sqrt (* F (* C -4.0))) (/ t_0 (/ C (sqrt 0.125)))))
(t_2 (- (* B B) (* 4.0 (* C A)))))
(if (<= B 7.8e-194)
t_1
(if (<= B 2.2e-78)
(/ (- (sqrt (* 2.0 (* t_2 (* F (* 2.0 A)))))) t_2)
(if (<= B 3.7e-15) t_1 (* (sqrt (* F (- A (hypot A B)))) (/ t_0 B)))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = -sqrt(2.0);
double t_1 = sqrt((F * (C * -4.0))) * (t_0 / (C / sqrt(0.125)));
double t_2 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 7.8e-194) {
tmp = t_1;
} else if (B <= 2.2e-78) {
tmp = -sqrt((2.0 * (t_2 * (F * (2.0 * A))))) / t_2;
} else if (B <= 3.7e-15) {
tmp = t_1;
} else {
tmp = sqrt((F * (A - hypot(A, B)))) * (t_0 / B);
}
return tmp;
}
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = -Math.sqrt(2.0);
double t_1 = Math.sqrt((F * (C * -4.0))) * (t_0 / (C / Math.sqrt(0.125)));
double t_2 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 7.8e-194) {
tmp = t_1;
} else if (B <= 2.2e-78) {
tmp = -Math.sqrt((2.0 * (t_2 * (F * (2.0 * A))))) / t_2;
} else if (B <= 3.7e-15) {
tmp = t_1;
} else {
tmp = Math.sqrt((F * (A - Math.hypot(A, B)))) * (t_0 / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = -math.sqrt(2.0) t_1 = math.sqrt((F * (C * -4.0))) * (t_0 / (C / math.sqrt(0.125))) t_2 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= 7.8e-194: tmp = t_1 elif B <= 2.2e-78: tmp = -math.sqrt((2.0 * (t_2 * (F * (2.0 * A))))) / t_2 elif B <= 3.7e-15: tmp = t_1 else: tmp = math.sqrt((F * (A - math.hypot(A, B)))) * (t_0 / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(-sqrt(2.0)) t_1 = Float64(sqrt(Float64(F * Float64(C * -4.0))) * Float64(t_0 / Float64(C / sqrt(0.125)))) t_2 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= 7.8e-194) tmp = t_1; elseif (B <= 2.2e-78) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_2 * Float64(F * Float64(2.0 * A)))))) / t_2); elseif (B <= 3.7e-15) tmp = t_1; else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(A, B)))) * Float64(t_0 / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = -sqrt(2.0);
t_1 = sqrt((F * (C * -4.0))) * (t_0 / (C / sqrt(0.125)));
t_2 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= 7.8e-194)
tmp = t_1;
elseif (B <= 2.2e-78)
tmp = -sqrt((2.0 * (t_2 * (F * (2.0 * A))))) / t_2;
elseif (B <= 3.7e-15)
tmp = t_1;
else
tmp = sqrt((F * (A - hypot(A, B)))) * (t_0 / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(N[Sqrt[N[(F * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 / N[(C / N[Sqrt[0.125], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 7.8e-194], t$95$1, If[LessEqual[B, 2.2e-78], N[((-N[Sqrt[N[(2.0 * N[(t$95$2 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[B, 3.7e-15], t$95$1, N[(N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$0 / B), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := -\sqrt{2}\\
t_1 := \sqrt{F \cdot \left(C \cdot -4\right)} \cdot \frac{t_0}{\frac{C}{\sqrt{0.125}}}\\
t_2 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq 7.8 \cdot 10^{-194}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;B \leq 2.2 \cdot 10^{-78}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_2 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_2}\\
\mathbf{elif}\;B \leq 3.7 \cdot 10^{-15}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)} \cdot \frac{t_0}{B}\\
\end{array}
\end{array}
if B < 7.7999999999999997e-194 or 2.1999999999999999e-78 < B < 3.70000000000000017e-15Initial program 24.5%
Simplified24.5%
flip--9.7%
add-sqr-sqrt9.7%
fma-def9.7%
unpow29.7%
hypot-udef9.7%
Applied egg-rr9.7%
Taylor expanded in A around -inf 17.6%
mul-1-neg17.6%
distribute-rgt-neg-in17.6%
associate-/l*17.7%
*-commutative17.7%
distribute-rgt-out--17.7%
metadata-eval17.7%
Simplified17.7%
if 7.7999999999999997e-194 < B < 2.1999999999999999e-78Initial program 29.1%
Simplified29.1%
Taylor expanded in A around -inf 33.7%
*-commutative33.7%
Simplified33.7%
distribute-frac-neg33.7%
associate-*l*36.4%
Applied egg-rr36.4%
if 3.70000000000000017e-15 < B Initial program 10.2%
Simplified10.2%
Taylor expanded in C around 0 15.1%
mul-1-neg15.1%
*-commutative15.1%
+-commutative15.1%
unpow215.1%
unpow215.1%
hypot-def39.0%
Simplified39.0%
Final simplification26.0%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B 6.6e-12)
(- (/ (sqrt (* 2.0 (* t_0 (* F (* 2.0 A))))) t_0))
(* (sqrt (* F (- A (hypot A B)))) (/ (- (sqrt 2.0)) B)))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 6.6e-12) {
tmp = -(sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
} else {
tmp = sqrt((F * (A - hypot(A, B)))) * (-sqrt(2.0) / B);
}
return tmp;
}
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 6.6e-12) {
tmp = -(Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
} else {
tmp = Math.sqrt((F * (A - Math.hypot(A, B)))) * (-Math.sqrt(2.0) / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= 6.6e-12: tmp = -(math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0) else: tmp = math.sqrt((F * (A - math.hypot(A, B)))) * (-math.sqrt(2.0) / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= 6.6e-12) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A))))) / t_0)); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(A, B)))) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= 6.6e-12)
tmp = -(sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
else
tmp = sqrt((F * (A - hypot(A, B)))) * (-sqrt(2.0) / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 6.6e-12], (-N[(N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq 6.6 \cdot 10^{-12}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 6.6000000000000001e-12Initial program 25.4%
Simplified25.4%
Taylor expanded in A around -inf 17.8%
*-commutative17.8%
Simplified17.8%
distribute-frac-neg17.8%
associate-*l*19.4%
Applied egg-rr19.4%
if 6.6000000000000001e-12 < B Initial program 9.1%
Simplified9.1%
Taylor expanded in C around 0 15.1%
mul-1-neg15.1%
*-commutative15.1%
+-commutative15.1%
unpow215.1%
unpow215.1%
hypot-def39.3%
Simplified39.3%
Final simplification25.7%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (+ (* B B) (* -4.0 (* C A)))) (t_1 (- (* B B) (* 4.0 (* C A)))))
(if (<= B 3.1e-55)
(- (/ (sqrt (* 2.0 (* t_1 (* F (* 2.0 A))))) t_1))
(if (<= B 2.2e+84)
(/ (- (sqrt (* 2.0 (* t_0 (* F (+ A (- C (hypot B (- A C))))))))) t_0)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (- A B)))))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (C * A));
double t_1 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 3.1e-55) {
tmp = -(sqrt((2.0 * (t_1 * (F * (2.0 * A))))) / t_1);
} else if (B <= 2.2e+84) {
tmp = -sqrt((2.0 * (t_0 * (F * (A + (C - hypot(B, (A - C)))))))) / t_0;
} else {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - B)));
}
return tmp;
}
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (C * A));
double t_1 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 3.1e-55) {
tmp = -(Math.sqrt((2.0 * (t_1 * (F * (2.0 * A))))) / t_1);
} else if (B <= 2.2e+84) {
tmp = -Math.sqrt((2.0 * (t_0 * (F * (A + (C - Math.hypot(B, (A - C)))))))) / t_0;
} else {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A - B)));
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) + (-4.0 * (C * A)) t_1 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= 3.1e-55: tmp = -(math.sqrt((2.0 * (t_1 * (F * (2.0 * A))))) / t_1) elif B <= 2.2e+84: tmp = -math.sqrt((2.0 * (t_0 * (F * (A + (C - math.hypot(B, (A - C)))))))) / t_0 else: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A - B))) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) + Float64(-4.0 * Float64(C * A))) t_1 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= 3.1e-55) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_1 * Float64(F * Float64(2.0 * A))))) / t_1)); elseif (B <= 2.2e+84) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(A + Float64(C - hypot(B, Float64(A - C))))))))) / t_0); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A - B))))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) + (-4.0 * (C * A));
t_1 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= 3.1e-55)
tmp = -(sqrt((2.0 * (t_1 * (F * (2.0 * A))))) / t_1);
elseif (B <= 2.2e+84)
tmp = -sqrt((2.0 * (t_0 * (F * (A + (C - hypot(B, (A - C)))))))) / t_0;
else
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - B)));
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 3.1e-55], (-N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), If[LessEqual[B, 2.2e+84], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(A + N[(C - N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B + -4 \cdot \left(C \cdot A\right)\\
t_1 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq 3.1 \cdot 10^{-55}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_1 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_1}\\
\mathbf{elif}\;B \leq 2.2 \cdot 10^{+84}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(A + \left(C - \mathsf{hypot}\left(B, A - C\right)\right)\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A - B\right)}\right)\\
\end{array}
\end{array}
if B < 3.09999999999999997e-55Initial program 23.9%
Simplified23.9%
Taylor expanded in A around -inf 19.3%
*-commutative19.3%
Simplified19.3%
distribute-frac-neg19.3%
associate-*l*21.0%
Applied egg-rr21.0%
if 3.09999999999999997e-55 < B < 2.1999999999999998e84Initial program 33.8%
Simplified33.8%
distribute-frac-neg33.8%
Applied egg-rr39.8%
if 2.1999999999999998e84 < B Initial program 2.3%
Simplified2.3%
Taylor expanded in C around 0 10.6%
mul-1-neg10.6%
*-commutative10.6%
+-commutative10.6%
unpow210.6%
unpow210.6%
hypot-def42.9%
Simplified42.9%
Taylor expanded in A around 0 41.4%
neg-mul-141.4%
unsub-neg41.4%
Simplified41.4%
Final simplification28.4%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))) (t_1 (* F t_0)))
(if (<= B 3.6e-54)
(/ (- (sqrt (* 2.0 (* t_0 (* F (* 2.0 A)))))) t_0)
(if (<= B 6.5e+23)
(/ (- (sqrt (* 2.0 (* (- A (hypot A B)) t_1)))) t_0)
(if (<= B 1.58e+38)
(-
(/
(sqrt
(*
2.0
(*
t_1
(+ A (- A (* -0.5 (/ (- (- (* A A) (* A A)) (* B B)) C)))))))
t_0))
(* (sqrt (* F (- A B))) (/ (- (sqrt 2.0)) B)))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double t_1 = F * t_0;
double tmp;
if (B <= 3.6e-54) {
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else if (B <= 6.5e+23) {
tmp = -sqrt((2.0 * ((A - hypot(A, B)) * t_1))) / t_0;
} else if (B <= 1.58e+38) {
tmp = -(sqrt((2.0 * (t_1 * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0);
} else {
tmp = sqrt((F * (A - B))) * (-sqrt(2.0) / B);
}
return tmp;
}
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double t_1 = F * t_0;
double tmp;
if (B <= 3.6e-54) {
tmp = -Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else if (B <= 6.5e+23) {
tmp = -Math.sqrt((2.0 * ((A - Math.hypot(A, B)) * t_1))) / t_0;
} else if (B <= 1.58e+38) {
tmp = -(Math.sqrt((2.0 * (t_1 * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0);
} else {
tmp = Math.sqrt((F * (A - B))) * (-Math.sqrt(2.0) / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) t_1 = F * t_0 tmp = 0 if B <= 3.6e-54: tmp = -math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0 elif B <= 6.5e+23: tmp = -math.sqrt((2.0 * ((A - math.hypot(A, B)) * t_1))) / t_0 elif B <= 1.58e+38: tmp = -(math.sqrt((2.0 * (t_1 * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0) else: tmp = math.sqrt((F * (A - B))) * (-math.sqrt(2.0) / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) t_1 = Float64(F * t_0) tmp = 0.0 if (B <= 3.6e-54) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A)))))) / t_0); elseif (B <= 6.5e+23) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(A - hypot(A, B)) * t_1)))) / t_0); elseif (B <= 1.58e+38) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_1 * Float64(A + Float64(A - Float64(-0.5 * Float64(Float64(Float64(Float64(A * A) - Float64(A * A)) - Float64(B * B)) / C))))))) / t_0)); else tmp = Float64(sqrt(Float64(F * Float64(A - B))) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
t_1 = F * t_0;
tmp = 0.0;
if (B <= 3.6e-54)
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
elseif (B <= 6.5e+23)
tmp = -sqrt((2.0 * ((A - hypot(A, B)) * t_1))) / t_0;
elseif (B <= 1.58e+38)
tmp = -(sqrt((2.0 * (t_1 * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0);
else
tmp = sqrt((F * (A - B))) * (-sqrt(2.0) / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[B, 3.6e-54], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 6.5e+23], N[((-N[Sqrt[N[(2.0 * N[(N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 1.58e+38], (-N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(A + N[(A - N[(-0.5 * N[(N[(N[(N[(A * A), $MachinePrecision] - N[(A * A), $MachinePrecision]), $MachinePrecision] - N[(B * B), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[Sqrt[N[(F * N[(A - B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
t_1 := F \cdot t_0\\
\mathbf{if}\;B \leq 3.6 \cdot 10^{-54}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 6.5 \cdot 10^{+23}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(A - \mathsf{hypot}\left(A, B\right)\right) \cdot t_1\right)}}{t_0}\\
\mathbf{elif}\;B \leq 1.58 \cdot 10^{+38}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_1 \cdot \left(A + \left(A - -0.5 \cdot \frac{\left(A \cdot A - A \cdot A\right) - B \cdot B}{C}\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - B\right)} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 3.59999999999999976e-54Initial program 23.8%
Simplified23.8%
Taylor expanded in A around -inf 19.2%
*-commutative19.2%
Simplified19.2%
distribute-frac-neg19.2%
associate-*l*20.9%
Applied egg-rr20.9%
if 3.59999999999999976e-54 < B < 6.4999999999999996e23Initial program 42.4%
Simplified42.4%
Taylor expanded in C around 0 22.5%
+-commutative22.5%
unpow222.5%
unpow222.5%
hypot-def22.8%
Simplified22.8%
if 6.4999999999999996e23 < B < 1.58e38Initial program 17.2%
Simplified17.2%
Taylor expanded in C around inf 50.3%
associate--l+50.3%
associate--l+50.3%
unpow250.3%
unpow250.3%
unpow250.3%
mul-1-neg50.3%
mul-1-neg50.3%
sqr-neg50.3%
mul-1-neg50.3%
Simplified50.3%
if 1.58e38 < B Initial program 5.1%
Simplified5.1%
Taylor expanded in C around 0 14.1%
mul-1-neg14.1%
*-commutative14.1%
+-commutative14.1%
unpow214.1%
unpow214.1%
hypot-def42.3%
Simplified42.3%
Taylor expanded in A around 0 41.0%
neg-mul-141.0%
unsub-neg41.0%
Simplified41.0%
Final simplification26.9%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B 6e+39)
(- (/ (sqrt (* 2.0 (* t_0 (* F (* 2.0 A))))) t_0))
(* (/ (sqrt 2.0) B) (- (sqrt (* F (- A B))))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 6e+39) {
tmp = -(sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
} else {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - B)));
}
return tmp;
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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
real(8) :: tmp
t_0 = (b * b) - (4.0d0 * (c * a))
if (b <= 6d+39) then
tmp = -(sqrt((2.0d0 * (t_0 * (f * (2.0d0 * a))))) / t_0)
else
tmp = (sqrt(2.0d0) / b) * -sqrt((f * (a - b)))
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 6e+39) {
tmp = -(Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
} else {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A - B)));
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= 6e+39: tmp = -(math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0) else: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A - B))) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= 6e+39) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A))))) / t_0)); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A - B))))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= 6e+39)
tmp = -(sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
else
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - B)));
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 6e+39], (-N[(N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq 6 \cdot 10^{+39}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A - B\right)}\right)\\
\end{array}
\end{array}
if B < 5.9999999999999999e39Initial program 25.8%
Simplified25.8%
Taylor expanded in A around -inf 17.4%
*-commutative17.4%
Simplified17.4%
distribute-frac-neg17.4%
associate-*l*18.8%
Applied egg-rr18.8%
if 5.9999999999999999e39 < B Initial program 5.1%
Simplified5.1%
Taylor expanded in C around 0 14.1%
mul-1-neg14.1%
*-commutative14.1%
+-commutative14.1%
unpow214.1%
unpow214.1%
hypot-def42.3%
Simplified42.3%
Taylor expanded in A around 0 41.0%
neg-mul-141.0%
unsub-neg41.0%
Simplified41.0%
Final simplification24.8%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B 1.5e+38)
(/ (- (sqrt (* 2.0 (* t_0 (* F (* 2.0 A)))))) t_0)
(* (sqrt (- (* B F))) (/ (- (sqrt 2.0)) B)))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 1.5e+38) {
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else {
tmp = sqrt(-(B * F)) * (-sqrt(2.0) / B);
}
return tmp;
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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
real(8) :: tmp
t_0 = (b * b) - (4.0d0 * (c * a))
if (b <= 1.5d+38) then
tmp = -sqrt((2.0d0 * (t_0 * (f * (2.0d0 * a))))) / t_0
else
tmp = sqrt(-(b * f)) * (-sqrt(2.0d0) / b)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= 1.5e+38) {
tmp = -Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else {
tmp = Math.sqrt(-(B * F)) * (-Math.sqrt(2.0) / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= 1.5e+38: tmp = -math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0 else: tmp = math.sqrt(-(B * F)) * (-math.sqrt(2.0) / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= 1.5e+38) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A)))))) / t_0); else tmp = Float64(sqrt(Float64(-Float64(B * F))) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= 1.5e+38)
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
else
tmp = sqrt(-(B * F)) * (-sqrt(2.0) / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.5e+38], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[Sqrt[(-N[(B * F), $MachinePrecision])], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq 1.5 \cdot 10^{+38}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-B \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 1.5000000000000001e38Initial program 25.8%
Simplified25.8%
Taylor expanded in A around -inf 17.4%
*-commutative17.4%
Simplified17.4%
distribute-frac-neg17.4%
associate-*l*18.8%
Applied egg-rr18.8%
if 1.5000000000000001e38 < B Initial program 5.1%
Simplified5.1%
Taylor expanded in C around 0 14.1%
mul-1-neg14.1%
*-commutative14.1%
+-commutative14.1%
unpow214.1%
unpow214.1%
hypot-def42.3%
Simplified42.3%
Taylor expanded in A around 0 42.0%
neg-mul-142.0%
Simplified42.0%
Final simplification25.1%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= A -2.2e-97)
(/ (- (sqrt (* 2.0 (* t_0 (* F (* 2.0 A)))))) t_0)
(-
(/
(sqrt
(*
2.0
(*
(* F t_0)
(+ A (- A (* -0.5 (/ (- (- (* A A) (* A A)) (* B B)) C)))))))
t_0)))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (A <= -2.2e-97) {
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else {
tmp = -(sqrt((2.0 * ((F * t_0) * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0);
}
return tmp;
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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
real(8) :: tmp
t_0 = (b * b) - (4.0d0 * (c * a))
if (a <= (-2.2d-97)) then
tmp = -sqrt((2.0d0 * (t_0 * (f * (2.0d0 * a))))) / t_0
else
tmp = -(sqrt((2.0d0 * ((f * t_0) * (a + (a - ((-0.5d0) * ((((a * a) - (a * a)) - (b * b)) / c))))))) / t_0)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (A <= -2.2e-97) {
tmp = -Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else {
tmp = -(Math.sqrt((2.0 * ((F * t_0) * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if A <= -2.2e-97: tmp = -math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0 else: tmp = -(math.sqrt((2.0 * ((F * t_0) * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (A <= -2.2e-97) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A)))))) / t_0); else tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(A + Float64(A - Float64(-0.5 * Float64(Float64(Float64(Float64(A * A) - Float64(A * A)) - Float64(B * B)) / C))))))) / t_0)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (A <= -2.2e-97)
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
else
tmp = -(sqrt((2.0 * ((F * t_0) * (A + (A - (-0.5 * ((((A * A) - (A * A)) - (B * B)) / C))))))) / t_0);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, -2.2e-97], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(A + N[(A - N[(-0.5 * N[(N[(N[(N[(A * A), $MachinePrecision] - N[(A * A), $MachinePrecision]), $MachinePrecision] - N[(B * B), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision])]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;A \leq -2.2 \cdot 10^{-97}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(A + \left(A - -0.5 \cdot \frac{\left(A \cdot A - A \cdot A\right) - B \cdot B}{C}\right)\right)\right)}}{t_0}\\
\end{array}
\end{array}
if A < -2.1999999999999999e-97Initial program 22.6%
Simplified22.6%
Taylor expanded in A around -inf 28.9%
*-commutative28.9%
Simplified28.9%
distribute-frac-neg28.9%
associate-*l*32.4%
Applied egg-rr32.4%
if -2.1999999999999999e-97 < A Initial program 19.2%
Simplified19.2%
Taylor expanded in C around inf 7.4%
associate--l+7.4%
associate--l+7.5%
unpow27.5%
unpow27.5%
unpow27.5%
mul-1-neg7.5%
mul-1-neg7.5%
sqr-neg7.5%
mul-1-neg7.5%
Simplified7.5%
Final simplification15.2%
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (let* ((t_0 (- (* B B) (* 4.0 (* C A))))) (/ (- (pow (* 2.0 (* t_0 (* F (* 2.0 A)))) 0.5)) t_0)))
B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
return -pow((2.0 * (t_0 * (F * (2.0 * A)))), 0.5) / t_0;
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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 * b) - (4.0d0 * (c * a))
code = -((2.0d0 * (t_0 * (f * (2.0d0 * a)))) ** 0.5d0) / t_0
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
return -Math.pow((2.0 * (t_0 * (F * (2.0 * A)))), 0.5) / t_0;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) return -math.pow((2.0 * (t_0 * (F * (2.0 * A)))), 0.5) / t_0
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) return Float64(Float64(-(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A)))) ^ 0.5)) / t_0) end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = -((2.0 * (t_0 * (F * (2.0 * A)))) ^ 0.5) / t_0;
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[((-N[Power[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\frac{-{\left(2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)\right)}^{0.5}}{t_0}
\end{array}
\end{array}
Initial program 20.3%
Simplified20.3%
Taylor expanded in A around -inf 12.8%
*-commutative12.8%
Simplified12.8%
pow1/213.0%
associate-*l*14.1%
Applied egg-rr14.1%
Final simplification14.1%
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (let* ((t_0 (- (* B B) (* 4.0 (* C A))))) (- (/ (sqrt (* 2.0 (* t_0 (* F (* 2.0 A))))) t_0))))
B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
return -(sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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 * b) - (4.0d0 * (c * a))
code = -(sqrt((2.0d0 * (t_0 * (f * (2.0d0 * a))))) / t_0)
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
return -(Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) return -(math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0)
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) return Float64(-Float64(sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A))))) / t_0)) end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = -(sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0);
end
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, (-N[(N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision])]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
-\frac{\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}
\end{array}
\end{array}
Initial program 20.3%
Simplified20.3%
Taylor expanded in A around -inf 12.8%
*-commutative12.8%
Simplified12.8%
distribute-frac-neg12.8%
associate-*l*13.9%
Applied egg-rr13.9%
Final simplification13.9%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B 1.85e-15)
(/
(- (sqrt (* 2.0 (* (* 2.0 A) (* -4.0 (* A (* C F)))))))
(- (* B B) (* 4.0 (* C A))))
(* -2.0 (/ (sqrt (* F A)) B))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 1.85e-15) {
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = -2.0 * (sqrt((F * A)) / B);
}
return tmp;
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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) :: tmp
if (b <= 1.85d-15) then
tmp = -sqrt((2.0d0 * ((2.0d0 * a) * ((-4.0d0) * (a * (c * f)))))) / ((b * b) - (4.0d0 * (c * a)))
else
tmp = (-2.0d0) * (sqrt((f * a)) / b)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 1.85e-15) {
tmp = -Math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = -2.0 * (Math.sqrt((F * A)) / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if B <= 1.85e-15: tmp = -math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (C * A))) else: tmp = -2.0 * (math.sqrt((F * A)) / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= 1.85e-15) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(2.0 * A) * Float64(-4.0 * Float64(A * Float64(C * F))))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(F * A)) / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (B <= 1.85e-15)
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (C * A)));
else
tmp = -2.0 * (sqrt((F * A)) / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, 1.85e-15], N[((-N[Sqrt[N[(2.0 * N[(N[(2.0 * A), $MachinePrecision] * N[(-4.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 1.85 \cdot 10^{-15}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(2 \cdot A\right) \cdot \left(-4 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{F \cdot A}}{B}\\
\end{array}
\end{array}
if B < 1.85000000000000008e-15Initial program 25.0%
Simplified25.0%
Taylor expanded in A around -inf 17.9%
*-commutative17.9%
Simplified17.9%
Taylor expanded in B around 0 12.9%
if 1.85000000000000008e-15 < B Initial program 10.2%
Simplified10.2%
Taylor expanded in A around -inf 2.1%
*-commutative2.1%
Simplified2.1%
Taylor expanded in B around inf 2.4%
associate-*r/2.4%
*-rgt-identity2.4%
Simplified2.4%
Final simplification9.6%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B 4.5e-11)
(/
(- (sqrt (* 2.0 (* (* 2.0 A) (* F (* (* C -4.0) A))))))
(- (* B B) (* 4.0 (* C A))))
(* -2.0 (/ (sqrt (* F A)) B))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 4.5e-11) {
tmp = -sqrt((2.0 * ((2.0 * A) * (F * ((C * -4.0) * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = -2.0 * (sqrt((F * A)) / B);
}
return tmp;
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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) :: tmp
if (b <= 4.5d-11) then
tmp = -sqrt((2.0d0 * ((2.0d0 * a) * (f * ((c * (-4.0d0)) * a))))) / ((b * b) - (4.0d0 * (c * a)))
else
tmp = (-2.0d0) * (sqrt((f * a)) / b)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 4.5e-11) {
tmp = -Math.sqrt((2.0 * ((2.0 * A) * (F * ((C * -4.0) * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = -2.0 * (Math.sqrt((F * A)) / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if B <= 4.5e-11: tmp = -math.sqrt((2.0 * ((2.0 * A) * (F * ((C * -4.0) * A))))) / ((B * B) - (4.0 * (C * A))) else: tmp = -2.0 * (math.sqrt((F * A)) / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= 4.5e-11) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(2.0 * A) * Float64(F * Float64(Float64(C * -4.0) * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(F * A)) / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (B <= 4.5e-11)
tmp = -sqrt((2.0 * ((2.0 * A) * (F * ((C * -4.0) * A))))) / ((B * B) - (4.0 * (C * A)));
else
tmp = -2.0 * (sqrt((F * A)) / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, 4.5e-11], N[((-N[Sqrt[N[(2.0 * N[(N[(2.0 * A), $MachinePrecision] * N[(F * N[(N[(C * -4.0), $MachinePrecision] * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 4.5 \cdot 10^{-11}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(2 \cdot A\right) \cdot \left(F \cdot \left(\left(C \cdot -4\right) \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{F \cdot A}}{B}\\
\end{array}
\end{array}
if B < 4.5e-11Initial program 25.4%
Simplified25.4%
Taylor expanded in A around -inf 17.8%
*-commutative17.8%
Simplified17.8%
Taylor expanded in B around 0 14.9%
*-commutative14.9%
associate-*r*14.9%
*-commutative14.9%
Simplified14.9%
if 4.5e-11 < B Initial program 9.1%
Simplified9.1%
Taylor expanded in A around -inf 2.1%
*-commutative2.1%
Simplified2.1%
Taylor expanded in B around inf 2.5%
associate-*r/2.5%
*-rgt-identity2.5%
Simplified2.5%
Final simplification11.0%
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* -2.0 (/ (sqrt (* F A)) B)))
B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
return -2.0 * (sqrt((F * A)) / B);
}
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
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
code = (-2.0d0) * (sqrt((f * a)) / b)
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
return -2.0 * (Math.sqrt((F * A)) / B);
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): return -2.0 * (math.sqrt((F * A)) / B)
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) return Float64(-2.0 * Float64(sqrt(Float64(F * A)) / B)) end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
tmp = -2.0 * (sqrt((F * A)) / B);
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(-2.0 * N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
-2 \cdot \frac{\sqrt{F \cdot A}}{B}
\end{array}
Initial program 20.3%
Simplified20.3%
Taylor expanded in A around -inf 12.8%
*-commutative12.8%
Simplified12.8%
Taylor expanded in B around inf 2.3%
associate-*r/2.3%
*-rgt-identity2.3%
Simplified2.3%
Final simplification2.3%
herbie shell --seed 2023199
(FPCore (A B C F)
:name "ABCF->ab-angle b"
: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))))