
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma B B (* -4.0 (* A C))))
(t_1 (fma B B (* A (* C -4.0))))
(t_2 (hypot B (- A C)))
(t_3 (- (pow B 2.0) (* (* 4.0 A) C)))
(t_4
(/
(-
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0)))))))
t_3)))
(if (<= t_4 -2e-206)
(/
(* (* (sqrt 2.0) (* (sqrt F) (sqrt t_0))) (- (sqrt (+ A (+ C t_2)))))
(- (* B B) (* 4.0 (* A C))))
(if (<= t_4 0.0)
(/
(- (sqrt (* 2.0 (* (* F t_1) (fma 2.0 A (* -0.5 (/ (* B B) C)))))))
t_1)
(if (<= t_4 INFINITY)
(* (sqrt (* t_0 (* 2.0 F))) (* (sqrt (+ (+ A C) t_2)) (/ -1.0 t_0)))
(* (sqrt 2.0) (- (sqrt (/ F B)))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double t_1 = fma(B, B, (A * (C * -4.0)));
double t_2 = hypot(B, (A - C));
double t_3 = pow(B, 2.0) - ((4.0 * A) * C);
double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -2e-206) {
tmp = ((sqrt(2.0) * (sqrt(F) * sqrt(t_0))) * -sqrt((A + (C + t_2)))) / ((B * B) - (4.0 * (A * C)));
} else if (t_4 <= 0.0) {
tmp = -sqrt((2.0 * ((F * t_1) * fma(2.0, A, (-0.5 * ((B * B) / C)))))) / t_1;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_0 * (2.0 * F))) * (sqrt(((A + C) + t_2)) * (-1.0 / t_0));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = abs(B) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_1 = fma(B, B, Float64(A * Float64(C * -4.0))) t_2 = hypot(B, Float64(A - C)) t_3 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_3) tmp = 0.0 if (t_4 <= -2e-206) tmp = Float64(Float64(Float64(sqrt(2.0) * Float64(sqrt(F) * sqrt(t_0))) * Float64(-sqrt(Float64(A + Float64(C + t_2))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); elseif (t_4 <= 0.0) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_1) * fma(2.0, A, Float64(-0.5 * Float64(Float64(B * B) / C))))))) / t_1); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) * Float64(sqrt(Float64(Float64(A + C) + t_2)) * Float64(-1.0 / t_0))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, -2e-206], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[N[(A + N[(C + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$1), $MachinePrecision] * N[(2.0 * A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + t$95$2), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \mathsf{hypot}\left(B, A - C\right)\\
t_3 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{-\sqrt{\left(2 \cdot \left(t_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_3}\\
\mathbf{if}\;t_4 \leq -2 \cdot 10^{-206}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \left(\sqrt{F} \cdot \sqrt{t_0}\right)\right) \cdot \left(-\sqrt{A + \left(C + t_2\right)}\right)}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;t_4 \leq 0:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_1\right) \cdot \mathsf{fma}\left(2, A, -0.5 \cdot \frac{B \cdot B}{C}\right)\right)}}{t_1}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\sqrt{t_0 \cdot \left(2 \cdot F\right)} \cdot \left(\sqrt{\left(A + C\right) + t_2} \cdot \frac{-1}{t_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -2.00000000000000006e-206Initial program 50.9%
associate-*l*50.9%
unpow250.9%
+-commutative50.9%
unpow250.9%
associate-*l*50.9%
unpow250.9%
Simplified50.9%
sqrt-prod57.4%
*-commutative57.4%
associate-*r*57.4%
unpow257.4%
hypot-udef71.0%
associate-+r+72.1%
Applied egg-rr72.1%
sqrt-prod71.9%
associate-*r*71.9%
cancel-sign-sub-inv71.9%
metadata-eval71.9%
Applied egg-rr71.9%
sqrt-prod80.0%
fma-def79.9%
Applied egg-rr79.9%
*-commutative79.9%
Simplified79.9%
if -2.00000000000000006e-206 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -0.0Initial program 3.3%
Simplified3.3%
Taylor expanded in C around -inf 31.4%
fma-def31.4%
unpow231.4%
Simplified31.4%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 53.5%
associate-*l*53.5%
unpow253.5%
+-commutative53.5%
unpow253.5%
associate-*l*53.5%
unpow253.5%
Simplified53.5%
sqrt-prod53.4%
*-commutative53.4%
associate-*r*53.4%
unpow253.4%
hypot-udef74.3%
associate-+r+74.3%
Applied egg-rr74.3%
sqrt-prod74.1%
associate-*r*74.1%
cancel-sign-sub-inv74.1%
metadata-eval74.1%
Applied egg-rr74.1%
div-inv74.1%
Applied egg-rr74.3%
associate-*l*74.6%
associate-*r*74.6%
*-commutative74.6%
associate-+r+74.6%
*-commutative74.6%
Simplified74.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified0.3%
Taylor expanded in B around inf 0.9%
unpow20.9%
Simplified0.9%
Taylor expanded in B around inf 0.8%
Taylor expanded in A around 0 19.1%
mul-1-neg19.1%
*-commutative19.1%
distribute-rgt-neg-in19.1%
Simplified19.1%
Final simplification49.2%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (sqrt (+ A (+ C (hypot B (- A C))))))
(t_1 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 9000000000.0)
(/ (* (sqrt (* 2.0 (* F (- (* B B) (* (* 4.0 A) C))))) (- t_0)) t_1)
(if (<= B 6.5e+136)
(/ (- (* t_0 (* (sqrt F) (* B (sqrt 2.0))))) t_1)
(if (or (<= B 2.95e+207) (not (<= B 1.3e+226)))
(* (sqrt 2.0) (- (sqrt (/ F B))))
(* (/ (sqrt 2.0) B) (- (sqrt (* F (+ A (hypot A B)))))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = sqrt((A + (C + hypot(B, (A - C)))));
double t_1 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 9000000000.0) {
tmp = (sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -t_0) / t_1;
} else if (B <= 6.5e+136) {
tmp = -(t_0 * (sqrt(F) * (B * sqrt(2.0)))) / t_1;
} else if ((B <= 2.95e+207) || !(B <= 1.3e+226)) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B))));
}
return tmp;
}
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = Math.sqrt((A + (C + Math.hypot(B, (A - C)))));
double t_1 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 9000000000.0) {
tmp = (Math.sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -t_0) / t_1;
} else if (B <= 6.5e+136) {
tmp = -(t_0 * (Math.sqrt(F) * (B * Math.sqrt(2.0)))) / t_1;
} else if ((B <= 2.95e+207) || !(B <= 1.3e+226)) {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
} else {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A + Math.hypot(A, B))));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = math.sqrt((A + (C + math.hypot(B, (A - C))))) t_1 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 9000000000.0: tmp = (math.sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -t_0) / t_1 elif B <= 6.5e+136: tmp = -(t_0 * (math.sqrt(F) * (B * math.sqrt(2.0)))) / t_1 elif (B <= 2.95e+207) or not (B <= 1.3e+226): tmp = math.sqrt(2.0) * -math.sqrt((F / B)) else: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A + math.hypot(A, B)))) return tmp
B = abs(B) function code(A, B, C, F) t_0 = sqrt(Float64(A + Float64(C + hypot(B, Float64(A - C))))) t_1 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 9000000000.0) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(Float64(B * B) - Float64(Float64(4.0 * A) * C))))) * Float64(-t_0)) / t_1); elseif (B <= 6.5e+136) tmp = Float64(Float64(-Float64(t_0 * Float64(sqrt(F) * Float64(B * sqrt(2.0))))) / t_1); elseif ((B <= 2.95e+207) || !(B <= 1.3e+226)) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A + hypot(A, B)))))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = sqrt((A + (C + hypot(B, (A - C))))); t_1 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 9000000000.0) tmp = (sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -t_0) / t_1; elseif (B <= 6.5e+136) tmp = -(t_0 * (sqrt(F) * (B * sqrt(2.0)))) / t_1; elseif ((B <= 2.95e+207) || ~((B <= 1.3e+226))) tmp = sqrt(2.0) * -sqrt((F / B)); else tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B)))); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(A + N[(C + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 9000000000.0], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(N[(B * B), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-t$95$0)), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B, 6.5e+136], N[((-N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[(B * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) / t$95$1), $MachinePrecision], If[Or[LessEqual[B, 2.95e+207], N[Not[LessEqual[B, 1.3e+226]], $MachinePrecision]], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \sqrt{A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)}\\
t_1 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 9000000000:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(B \cdot B - \left(4 \cdot A\right) \cdot C\right)\right)} \cdot \left(-t_0\right)}{t_1}\\
\mathbf{elif}\;B \leq 6.5 \cdot 10^{+136}:\\
\;\;\;\;\frac{-t_0 \cdot \left(\sqrt{F} \cdot \left(B \cdot \sqrt{2}\right)\right)}{t_1}\\
\mathbf{elif}\;B \leq 2.95 \cdot 10^{+207} \lor \neg \left(B \leq 1.3 \cdot 10^{+226}\right):\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A + \mathsf{hypot}\left(A, B\right)\right)}\right)\\
\end{array}
\end{array}
if B < 9e9Initial program 25.3%
associate-*l*25.3%
unpow225.3%
+-commutative25.3%
unpow225.3%
associate-*l*25.3%
unpow225.3%
Simplified25.3%
sqrt-prod27.1%
*-commutative27.1%
associate-*r*27.1%
unpow227.1%
hypot-udef36.7%
associate-+r+37.5%
Applied egg-rr37.5%
if 9e9 < B < 6.4999999999999998e136Initial program 56.2%
associate-*l*56.2%
unpow256.2%
+-commutative56.2%
unpow256.2%
associate-*l*56.2%
unpow256.2%
Simplified56.2%
sqrt-prod66.8%
*-commutative66.8%
associate-*r*66.8%
unpow266.8%
hypot-udef66.7%
associate-+r+68.0%
Applied egg-rr68.0%
Taylor expanded in B around inf 73.9%
if 6.4999999999999998e136 < B < 2.9499999999999999e207 or 1.3000000000000001e226 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
Taylor expanded in A around 0 54.0%
mul-1-neg54.0%
*-commutative54.0%
distribute-rgt-neg-in54.0%
Simplified54.0%
if 2.9499999999999999e207 < B < 1.3000000000000001e226Initial program 0.0%
Simplified0.0%
Taylor expanded in C around 0 2.1%
mul-1-neg2.1%
distribute-rgt-neg-in2.1%
*-commutative2.1%
+-commutative2.1%
unpow22.1%
unpow22.1%
hypot-def98.8%
Simplified98.8%
Final simplification44.6%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(if (<= B 2.2e+79)
(/
(*
(sqrt (* 2.0 (* F (- (* B B) (* (* 4.0 A) C)))))
(- (sqrt (+ A (+ C (hypot B (- A C)))))))
(- (* B B) (* 4.0 (* A C))))
(if (<= B 7.5e+226)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (+ A (hypot A B))))))
(* (sqrt 2.0) (- (sqrt (/ F B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 2.2e+79) {
tmp = (sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -sqrt((A + (C + hypot(B, (A - C)))))) / ((B * B) - (4.0 * (A * C)));
} else if (B <= 7.5e+226) {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B))));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 2.2e+79) {
tmp = (Math.sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -Math.sqrt((A + (C + Math.hypot(B, (A - C)))))) / ((B * B) - (4.0 * (A * C)));
} else if (B <= 7.5e+226) {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A + Math.hypot(A, B))));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if B <= 2.2e+79: tmp = (math.sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -math.sqrt((A + (C + math.hypot(B, (A - C)))))) / ((B * B) - (4.0 * (A * C))) elif B <= 7.5e+226: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A + math.hypot(A, B)))) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (B <= 2.2e+79) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(Float64(B * B) - Float64(Float64(4.0 * A) * C))))) * Float64(-sqrt(Float64(A + Float64(C + hypot(B, Float64(A - C))))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); elseif (B <= 7.5e+226) tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A + hypot(A, B)))))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (B <= 2.2e+79) tmp = (sqrt((2.0 * (F * ((B * B) - ((4.0 * A) * C))))) * -sqrt((A + (C + hypot(B, (A - C)))))) / ((B * B) - (4.0 * (A * C))); elseif (B <= 7.5e+226) tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B)))); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[B, 2.2e+79], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(N[(B * B), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(A + N[(C + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 7.5e+226], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 2.2 \cdot 10^{+79}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(B \cdot B - \left(4 \cdot A\right) \cdot C\right)\right)} \cdot \left(-\sqrt{A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)}\right)}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;B \leq 7.5 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A + \mathsf{hypot}\left(A, B\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 2.1999999999999999e79Initial program 27.5%
associate-*l*27.5%
unpow227.5%
+-commutative27.5%
unpow227.5%
associate-*l*27.5%
unpow227.5%
Simplified27.5%
sqrt-prod30.2%
*-commutative30.2%
associate-*r*30.2%
unpow230.2%
hypot-udef39.1%
associate-+r+40.0%
Applied egg-rr40.0%
if 2.1999999999999999e79 < B < 7.49999999999999964e226Initial program 27.3%
Simplified27.1%
Taylor expanded in C around 0 33.7%
mul-1-neg33.7%
distribute-rgt-neg-in33.7%
*-commutative33.7%
+-commutative33.7%
unpow233.7%
unpow233.7%
hypot-def67.9%
Simplified67.9%
if 7.49999999999999964e226 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
Taylor expanded in A around 0 62.5%
mul-1-neg62.5%
*-commutative62.5%
distribute-rgt-neg-in62.5%
Simplified62.5%
Final simplification44.9%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (+ A (+ C (hypot B (- A C))))) (t_1 (- (* B B) (* (* 4.0 A) C))))
(if (<= B 1.85e-109)
(/
(* (sqrt (* 2.0 (* F (* -4.0 (* A C))))) (- (sqrt t_0)))
(- (* B B) (* 4.0 (* A C))))
(if (<= B 1e+77)
(* (sqrt (* t_0 (* 2.0 (* F t_1)))) (/ -1.0 t_1))
(if (<= B 3.3e+226)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (+ A (hypot A B))))))
(* (sqrt 2.0) (- (sqrt (/ F B)))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = A + (C + hypot(B, (A - C)));
double t_1 = (B * B) - ((4.0 * A) * C);
double tmp;
if (B <= 1.85e-109) {
tmp = (sqrt((2.0 * (F * (-4.0 * (A * C))))) * -sqrt(t_0)) / ((B * B) - (4.0 * (A * C)));
} else if (B <= 1e+77) {
tmp = sqrt((t_0 * (2.0 * (F * t_1)))) * (-1.0 / t_1);
} else if (B <= 3.3e+226) {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B))));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = A + (C + Math.hypot(B, (A - C)));
double t_1 = (B * B) - ((4.0 * A) * C);
double tmp;
if (B <= 1.85e-109) {
tmp = (Math.sqrt((2.0 * (F * (-4.0 * (A * C))))) * -Math.sqrt(t_0)) / ((B * B) - (4.0 * (A * C)));
} else if (B <= 1e+77) {
tmp = Math.sqrt((t_0 * (2.0 * (F * t_1)))) * (-1.0 / t_1);
} else if (B <= 3.3e+226) {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A + Math.hypot(A, B))));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = A + (C + math.hypot(B, (A - C))) t_1 = (B * B) - ((4.0 * A) * C) tmp = 0 if B <= 1.85e-109: tmp = (math.sqrt((2.0 * (F * (-4.0 * (A * C))))) * -math.sqrt(t_0)) / ((B * B) - (4.0 * (A * C))) elif B <= 1e+77: tmp = math.sqrt((t_0 * (2.0 * (F * t_1)))) * (-1.0 / t_1) elif B <= 3.3e+226: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A + math.hypot(A, B)))) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(A + Float64(C + hypot(B, Float64(A - C)))) t_1 = Float64(Float64(B * B) - Float64(Float64(4.0 * A) * C)) tmp = 0.0 if (B <= 1.85e-109) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(t_0))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); elseif (B <= 1e+77) tmp = Float64(sqrt(Float64(t_0 * Float64(2.0 * Float64(F * t_1)))) * Float64(-1.0 / t_1)); elseif (B <= 3.3e+226) tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A + hypot(A, B)))))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = A + (C + hypot(B, (A - C))); t_1 = (B * B) - ((4.0 * A) * C); tmp = 0.0; if (B <= 1.85e-109) tmp = (sqrt((2.0 * (F * (-4.0 * (A * C))))) * -sqrt(t_0)) / ((B * B) - (4.0 * (A * C))); elseif (B <= 1e+77) tmp = sqrt((t_0 * (2.0 * (F * t_1)))) * (-1.0 / t_1); elseif (B <= 3.3e+226) tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B)))); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(A + N[(C + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.85e-109], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[t$95$0], $MachinePrecision])), $MachinePrecision] / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 1e+77], N[(N[Sqrt[N[(t$95$0 * N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 3.3e+226], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\\
t_1 := B \cdot B - \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B \leq 1.85 \cdot 10^{-109}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(-4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \left(-\sqrt{t_0}\right)}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;B \leq 10^{+77}:\\
\;\;\;\;\sqrt{t_0 \cdot \left(2 \cdot \left(F \cdot t_1\right)\right)} \cdot \frac{-1}{t_1}\\
\mathbf{elif}\;B \leq 3.3 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A + \mathsf{hypot}\left(A, B\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 1.8499999999999999e-109Initial program 23.9%
associate-*l*23.9%
unpow223.9%
+-commutative23.9%
unpow223.9%
associate-*l*23.9%
unpow223.9%
Simplified23.9%
sqrt-prod26.0%
*-commutative26.0%
associate-*r*26.0%
unpow226.0%
hypot-udef35.9%
associate-+r+36.7%
Applied egg-rr36.7%
Taylor expanded in B around 0 23.1%
if 1.8499999999999999e-109 < B < 9.99999999999999983e76Initial program 41.8%
associate-*l*41.8%
unpow241.8%
+-commutative41.8%
unpow241.8%
associate-*l*41.8%
unpow241.8%
Simplified41.8%
div-inv41.9%
Applied egg-rr49.4%
if 9.99999999999999983e76 < B < 3.29999999999999978e226Initial program 28.9%
Simplified28.8%
Taylor expanded in C around 0 35.2%
mul-1-neg35.2%
distribute-rgt-neg-in35.2%
*-commutative35.2%
+-commutative35.2%
unpow235.2%
unpow235.2%
hypot-def66.9%
Simplified66.9%
if 3.29999999999999978e226 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
Taylor expanded in A around 0 62.5%
mul-1-neg62.5%
*-commutative62.5%
distribute-rgt-neg-in62.5%
Simplified62.5%
Final simplification35.5%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (+ (* B B) (* -4.0 (* A C)))))
(if (<= B 1.02e+77)
(*
(sqrt (* (+ A (+ C (hypot B (- A C)))) (* 2.0 (* F t_0))))
(/ -1.0 t_0))
(if (<= B 3.5e+226)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (+ A (hypot A B))))))
(* (sqrt 2.0) (- (sqrt (/ F B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 1.02e+77) {
tmp = sqrt(((A + (C + hypot(B, (A - C)))) * (2.0 * (F * t_0)))) * (-1.0 / t_0);
} else if (B <= 3.5e+226) {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B))));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 1.02e+77) {
tmp = Math.sqrt(((A + (C + Math.hypot(B, (A - C)))) * (2.0 * (F * t_0)))) * (-1.0 / t_0);
} else if (B <= 3.5e+226) {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A + Math.hypot(A, B))));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) + (-4.0 * (A * C)) tmp = 0 if B <= 1.02e+77: tmp = math.sqrt(((A + (C + math.hypot(B, (A - C)))) * (2.0 * (F * t_0)))) * (-1.0 / t_0) elif B <= 3.5e+226: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A + math.hypot(A, B)))) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.02e+77) tmp = Float64(sqrt(Float64(Float64(A + Float64(C + hypot(B, Float64(A - C)))) * Float64(2.0 * Float64(F * t_0)))) * Float64(-1.0 / t_0)); elseif (B <= 3.5e+226) tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A + hypot(A, B)))))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) + (-4.0 * (A * C)); tmp = 0.0; if (B <= 1.02e+77) tmp = sqrt(((A + (C + hypot(B, (A - C)))) * (2.0 * (F * t_0)))) * (-1.0 / t_0); elseif (B <= 3.5e+226) tmp = (sqrt(2.0) / B) * -sqrt((F * (A + hypot(A, B)))); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.02e+77], N[(N[Sqrt[N[(N[(A + N[(C + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 3.5e+226], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B + -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.02 \cdot 10^{+77}:\\
\;\;\;\;\sqrt{\left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)} \cdot \frac{-1}{t_0}\\
\mathbf{elif}\;B \leq 3.5 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A + \mathsf{hypot}\left(A, B\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 1.02e77Initial program 27.3%
associate-*l*27.3%
unpow227.3%
+-commutative27.3%
unpow227.3%
associate-*l*27.3%
unpow227.3%
Simplified27.3%
sqrt-prod29.5%
*-commutative29.5%
associate-*r*29.5%
unpow229.5%
hypot-udef38.5%
associate-+r+39.4%
Applied egg-rr39.4%
div-inv39.4%
sqrt-prod32.6%
*-commutative32.6%
associate-*r*32.6%
cancel-sign-sub-inv32.6%
metadata-eval32.6%
Applied egg-rr32.6%
if 1.02e77 < B < 3.4999999999999998e226Initial program 28.9%
Simplified28.8%
Taylor expanded in C around 0 35.2%
mul-1-neg35.2%
distribute-rgt-neg-in35.2%
*-commutative35.2%
+-commutative35.2%
unpow235.2%
unpow235.2%
hypot-def66.9%
Simplified66.9%
if 3.4999999999999998e226 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
Taylor expanded in A around 0 62.5%
mul-1-neg62.5%
*-commutative62.5%
distribute-rgt-neg-in62.5%
Simplified62.5%
Final simplification39.1%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* (* 4.0 A) C))))
(if (<= B 6.8e+128)
(/ (- (sqrt (* (+ A (+ C (hypot B (- A C)))) (* 2.0 (* F t_0))))) t_0)
(* (sqrt 2.0) (- (sqrt (/ F B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - ((4.0 * A) * C);
double tmp;
if (B <= 6.8e+128) {
tmp = -sqrt(((A + (C + hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0;
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - ((4.0 * A) * C);
double tmp;
if (B <= 6.8e+128) {
tmp = -Math.sqrt(((A + (C + Math.hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0;
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - ((4.0 * A) * C) tmp = 0 if B <= 6.8e+128: tmp = -math.sqrt(((A + (C + math.hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0 else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(Float64(4.0 * A) * C)) tmp = 0.0 if (B <= 6.8e+128) tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(C + hypot(B, Float64(A - C)))) * Float64(2.0 * Float64(F * t_0))))) / t_0); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - ((4.0 * A) * C); tmp = 0.0; if (B <= 6.8e+128) tmp = -sqrt(((A + (C + hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0; else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 6.8e+128], N[((-N[Sqrt[N[(N[(A + N[(C + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B \leq 6.8 \cdot 10^{+128}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 6.7999999999999997e128Initial program 29.1%
associate-*l*29.1%
unpow229.1%
+-commutative29.1%
unpow229.1%
associate-*l*29.1%
unpow229.1%
Simplified29.1%
distribute-frac-neg29.1%
Applied egg-rr34.0%
if 6.7999999999999997e128 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
*-commutative52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
Final simplification36.6%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (+ (* B B) (* -4.0 (* A C)))))
(if (<= B 6.8e+128)
(/ (- (sqrt (* (+ A (+ C (hypot B (- A C)))) (* 2.0 (* F t_0))))) t_0)
(* (sqrt 2.0) (- (sqrt (/ F B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 6.8e+128) {
tmp = -sqrt(((A + (C + hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0;
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 6.8e+128) {
tmp = -Math.sqrt(((A + (C + Math.hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0;
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) + (-4.0 * (A * C)) tmp = 0 if B <= 6.8e+128: tmp = -math.sqrt(((A + (C + math.hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0 else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B <= 6.8e+128) tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(C + hypot(B, Float64(A - C)))) * Float64(2.0 * Float64(F * t_0))))) / t_0); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) + (-4.0 * (A * C)); tmp = 0.0; if (B <= 6.8e+128) tmp = -sqrt(((A + (C + hypot(B, (A - C)))) * (2.0 * (F * t_0)))) / t_0; else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 6.8e+128], N[((-N[Sqrt[N[(N[(A + N[(C + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B + -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 6.8 \cdot 10^{+128}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 6.7999999999999997e128Initial program 29.1%
associate-*l*29.1%
unpow229.1%
+-commutative29.1%
unpow229.1%
associate-*l*29.1%
unpow229.1%
Simplified29.1%
sqrt-prod32.0%
*-commutative32.0%
associate-*r*32.0%
unpow232.0%
hypot-udef40.4%
associate-+r+41.3%
Applied egg-rr41.3%
sqrt-prod34.0%
expm1-log1p-u32.7%
distribute-frac-neg32.7%
Applied egg-rr34.1%
if 6.7999999999999997e128 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in B around inf 0.0%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
*-commutative52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
Final simplification36.7%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(if (<= F -5e-311)
(/
(*
(sqrt (* 2.0 (* F (+ (* B B) (* -4.0 (* A C))))))
(- (sqrt (+ A (+ A C)))))
(- (* B B) (* 4.0 (* A C))))
(if (<= F 32000000000.0)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (+ B C)))))
(* (sqrt 2.0) (- (sqrt (/ F B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (F <= -5e-311) {
tmp = (sqrt((2.0 * (F * ((B * B) + (-4.0 * (A * C)))))) * -sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C)));
} else if (F <= 32000000000.0) {
tmp = (sqrt(2.0) / B) * -sqrt((F * (B + C)));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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 (f <= (-5d-311)) then
tmp = (sqrt((2.0d0 * (f * ((b * b) + ((-4.0d0) * (a * c)))))) * -sqrt((a + (a + c)))) / ((b * b) - (4.0d0 * (a * c)))
else if (f <= 32000000000.0d0) then
tmp = (sqrt(2.0d0) / b) * -sqrt((f * (b + c)))
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (F <= -5e-311) {
tmp = (Math.sqrt((2.0 * (F * ((B * B) + (-4.0 * (A * C)))))) * -Math.sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C)));
} else if (F <= 32000000000.0) {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (B + C)));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if F <= -5e-311: tmp = (math.sqrt((2.0 * (F * ((B * B) + (-4.0 * (A * C)))))) * -math.sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C))) elif F <= 32000000000.0: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (B + C))) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (F <= -5e-311) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C)))))) * Float64(-sqrt(Float64(A + Float64(A + C))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); elseif (F <= 32000000000.0) tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(B + C))))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (F <= -5e-311) tmp = (sqrt((2.0 * (F * ((B * B) + (-4.0 * (A * C)))))) * -sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C))); elseif (F <= 32000000000.0) tmp = (sqrt(2.0) / B) * -sqrt((F * (B + C))); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[F, -5e-311], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[F, 32000000000.0], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(B \cdot B + -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \left(-\sqrt{A + \left(A + C\right)}\right)}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;F \leq 32000000000:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(B + C\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if F < -5.00000000000023e-311Initial program 38.8%
associate-*l*38.8%
unpow238.8%
+-commutative38.8%
unpow238.8%
associate-*l*38.8%
unpow238.8%
Simplified38.8%
Taylor expanded in A around inf 35.1%
sqrt-prod38.7%
associate-*r*38.7%
*-commutative38.7%
associate-*r*38.7%
cancel-sign-sub-inv38.7%
metadata-eval38.7%
+-commutative38.7%
Applied egg-rr38.7%
if -5.00000000000023e-311 < F < 3.2e10Initial program 25.2%
associate-*l*25.2%
unpow225.2%
+-commutative25.2%
unpow225.2%
associate-*l*25.2%
unpow225.2%
Simplified25.2%
Taylor expanded in C around 0 20.6%
+-commutative20.6%
unpow220.6%
unpow220.6%
hypot-def22.9%
Simplified22.9%
Taylor expanded in A around 0 27.4%
mul-1-neg27.4%
Simplified27.4%
if 3.2e10 < F Initial program 21.4%
Simplified21.3%
Taylor expanded in B around inf 14.1%
unpow214.1%
Simplified14.1%
Taylor expanded in B around inf 7.2%
Taylor expanded in A around 0 19.8%
mul-1-neg19.8%
*-commutative19.8%
distribute-rgt-neg-in19.8%
Simplified19.8%
Final simplification25.1%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= F -5e-311)
(/ (- (sqrt (* (+ A (+ A C)) (* 2.0 (* F t_0))))) t_0)
(if (<= F 1200000000000.0)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (+ B C)))))
(* (sqrt 2.0) (- (sqrt (/ F B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (F <= -5e-311) {
tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
} else if (F <= 1200000000000.0) {
tmp = (sqrt(2.0) / B) * -sqrt((F * (B + C)));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
if (f <= (-5d-311)) then
tmp = -sqrt(((a + (a + c)) * (2.0d0 * (f * t_0)))) / t_0
else if (f <= 1200000000000.0d0) then
tmp = (sqrt(2.0d0) / b) * -sqrt((f * (b + c)))
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (F <= -5e-311) {
tmp = -Math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
} else if (F <= 1200000000000.0) {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (B + C)));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if F <= -5e-311: tmp = -math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0 elif F <= 1200000000000.0: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (B + C))) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (F <= -5e-311) tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(A + C)) * Float64(2.0 * Float64(F * t_0))))) / t_0); elseif (F <= 1200000000000.0) tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(B + C))))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (F <= -5e-311) tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0; elseif (F <= 1200000000000.0) tmp = (sqrt(2.0) / B) * -sqrt((F * (B + C))); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[F, -5e-311], N[((-N[Sqrt[N[(N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[F, 1200000000000.0], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;F \leq -5 \cdot 10^{-311}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{elif}\;F \leq 1200000000000:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(B + C\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if F < -5.00000000000023e-311Initial program 38.8%
associate-*l*38.8%
unpow238.8%
+-commutative38.8%
unpow238.8%
associate-*l*38.8%
unpow238.8%
Simplified38.8%
Taylor expanded in A around inf 35.1%
if -5.00000000000023e-311 < F < 1.2e12Initial program 25.2%
associate-*l*25.2%
unpow225.2%
+-commutative25.2%
unpow225.2%
associate-*l*25.2%
unpow225.2%
Simplified25.2%
Taylor expanded in C around 0 20.6%
+-commutative20.6%
unpow220.6%
unpow220.6%
hypot-def22.9%
Simplified22.9%
Taylor expanded in A around 0 27.4%
mul-1-neg27.4%
Simplified27.4%
if 1.2e12 < F Initial program 21.4%
Simplified21.3%
Taylor expanded in B around inf 14.1%
unpow214.1%
Simplified14.1%
Taylor expanded in B around inf 7.2%
Taylor expanded in A around 0 19.8%
mul-1-neg19.8%
*-commutative19.8%
distribute-rgt-neg-in19.8%
Simplified19.8%
Final simplification24.7%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (if (<= B 3.4e-45) (/ (- (sqrt (* (* A -16.0) (* F (* A C))))) (- (* B B) (* 4.0 (* A C)))) (* (sqrt 2.0) (- (sqrt (/ F B))))))
B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 3.4e-45) {
tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C)));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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 <= 3.4d-45) then
tmp = -sqrt(((a * (-16.0d0)) * (f * (a * c)))) / ((b * b) - (4.0d0 * (a * c)))
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 3.4e-45) {
tmp = -Math.sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C)));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if B <= 3.4e-45: tmp = -math.sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C))) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (B <= 3.4e-45) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -16.0) * Float64(F * Float64(A * C))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (B <= 3.4e-45) tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C))); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[B, 3.4e-45], N[((-N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 3.4 \cdot 10^{-45}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)}}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 3.40000000000000004e-45Initial program 24.2%
associate-*l*24.2%
unpow224.2%
+-commutative24.2%
unpow224.2%
associate-*l*24.2%
unpow224.2%
Simplified24.2%
Taylor expanded in A around inf 13.5%
Taylor expanded in A around inf 11.7%
unpow211.7%
Simplified11.7%
*-un-lft-identity11.7%
associate-*l*13.5%
*-commutative13.5%
Applied egg-rr13.5%
*-lft-identity13.5%
associate-*r*13.5%
*-commutative13.5%
associate-*r*16.8%
*-commutative16.8%
Simplified16.8%
if 3.40000000000000004e-45 < B Initial program 27.0%
Simplified28.3%
Taylor expanded in B around inf 24.8%
unpow224.8%
Simplified24.8%
Taylor expanded in B around inf 18.1%
Taylor expanded in A around 0 48.2%
mul-1-neg48.2%
*-commutative48.2%
distribute-rgt-neg-in48.2%
Simplified48.2%
Final simplification26.0%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= C 5.8e-85)
(/ (- (sqrt (* (* A -16.0) (* F (* A C))))) t_0)
(/
(-
(sqrt
(* (* 2.0 (* F t_0)) (+ (+ A C) (+ C (- (* (/ (* B B) C) 0.5) A))))))
t_0))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= 5.8e-85) {
tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -sqrt(((2.0 * (F * t_0)) * ((A + C) + (C + ((((B * B) / C) * 0.5) - A))))) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
if (c <= 5.8d-85) then
tmp = -sqrt(((a * (-16.0d0)) * (f * (a * c)))) / t_0
else
tmp = -sqrt(((2.0d0 * (f * t_0)) * ((a + c) + (c + ((((b * b) / c) * 0.5d0) - a))))) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= 5.8e-85) {
tmp = -Math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -Math.sqrt(((2.0 * (F * t_0)) * ((A + C) + (C + ((((B * B) / C) * 0.5) - A))))) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if C <= 5.8e-85: tmp = -math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0 else: tmp = -math.sqrt(((2.0 * (F * t_0)) * ((A + C) + (C + ((((B * B) / C) * 0.5) - A))))) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (C <= 5.8e-85) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -16.0) * Float64(F * Float64(A * C))))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + Float64(C + Float64(Float64(Float64(Float64(B * B) / C) * 0.5) - A)))))) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (C <= 5.8e-85) tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0; else tmp = -sqrt(((2.0 * (F * t_0)) * ((A + C) + (C + ((((B * B) / C) * 0.5) - A))))) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, 5.8e-85], N[((-N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[(C + N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * 0.5), $MachinePrecision] - A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;C \leq 5.8 \cdot 10^{-85}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(F \cdot t_0\right)\right) \cdot \left(\left(A + C\right) + \left(C + \left(\frac{B \cdot B}{C} \cdot 0.5 - A\right)\right)\right)}}{t_0}\\
\end{array}
\end{array}
if C < 5.8000000000000004e-85Initial program 21.5%
associate-*l*21.5%
unpow221.5%
+-commutative21.5%
unpow221.5%
associate-*l*21.5%
unpow221.5%
Simplified21.5%
Taylor expanded in A around inf 10.5%
Taylor expanded in A around inf 13.2%
unpow213.2%
Simplified13.2%
*-un-lft-identity13.2%
associate-*l*14.8%
*-commutative14.8%
Applied egg-rr14.8%
*-lft-identity14.8%
associate-*r*14.8%
*-commutative14.8%
associate-*r*18.2%
*-commutative18.2%
Simplified18.2%
if 5.8000000000000004e-85 < C Initial program 32.4%
associate-*l*32.4%
unpow232.4%
+-commutative32.4%
unpow232.4%
associate-*l*32.4%
unpow232.4%
Simplified32.4%
Taylor expanded in C around inf 24.8%
mul-1-neg24.8%
unsub-neg24.8%
Simplified25.0%
Final simplification20.4%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= C 6.2e-84)
(/ (- (sqrt (* (* A -16.0) (* F (* A C))))) t_0)
(/ (- (sqrt (* (* 2.0 (* F t_0)) (+ (+ A C) (- C A))))) t_0))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= 6.2e-84) {
tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -sqrt(((2.0 * (F * t_0)) * ((A + C) + (C - A)))) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
if (c <= 6.2d-84) then
tmp = -sqrt(((a * (-16.0d0)) * (f * (a * c)))) / t_0
else
tmp = -sqrt(((2.0d0 * (f * t_0)) * ((a + c) + (c - a)))) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= 6.2e-84) {
tmp = -Math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -Math.sqrt(((2.0 * (F * t_0)) * ((A + C) + (C - A)))) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if C <= 6.2e-84: tmp = -math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0 else: tmp = -math.sqrt(((2.0 * (F * t_0)) * ((A + C) + (C - A)))) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (C <= 6.2e-84) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -16.0) * Float64(F * Float64(A * C))))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + Float64(C - A))))) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (C <= 6.2e-84) tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0; else tmp = -sqrt(((2.0 * (F * t_0)) * ((A + C) + (C - A)))) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, 6.2e-84], N[((-N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[(C - A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;C \leq 6.2 \cdot 10^{-84}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(F \cdot t_0\right)\right) \cdot \left(\left(A + C\right) + \left(C - A\right)\right)}}{t_0}\\
\end{array}
\end{array}
if C < 6.20000000000000003e-84Initial program 21.5%
associate-*l*21.5%
unpow221.5%
+-commutative21.5%
unpow221.5%
associate-*l*21.5%
unpow221.5%
Simplified21.5%
Taylor expanded in A around inf 10.5%
Taylor expanded in A around inf 13.2%
unpow213.2%
Simplified13.2%
*-un-lft-identity13.2%
associate-*l*14.8%
*-commutative14.8%
Applied egg-rr14.8%
*-lft-identity14.8%
associate-*r*14.8%
*-commutative14.8%
associate-*r*18.2%
*-commutative18.2%
Simplified18.2%
if 6.20000000000000003e-84 < C Initial program 32.4%
associate-*l*32.4%
unpow232.4%
+-commutative32.4%
unpow232.4%
associate-*l*32.4%
unpow232.4%
Simplified32.4%
Taylor expanded in A around -inf 25.0%
mul-1-neg25.0%
sub-neg25.0%
Simplified25.0%
Final simplification20.4%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= C -2.6e-116)
(/ (- (sqrt (* (* A -16.0) (* F (* A C))))) t_0)
(/
(-
(pow (* 2.0 (* (* F (+ (* B B) (* -4.0 (* A C)))) (+ A (+ A C)))) 0.5))
t_0))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= -2.6e-116) {
tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -pow((2.0 * ((F * ((B * B) + (-4.0 * (A * C)))) * (A + (A + C)))), 0.5) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
if (c <= (-2.6d-116)) then
tmp = -sqrt(((a * (-16.0d0)) * (f * (a * c)))) / t_0
else
tmp = -((2.0d0 * ((f * ((b * b) + ((-4.0d0) * (a * c)))) * (a + (a + c)))) ** 0.5d0) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= -2.6e-116) {
tmp = -Math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -Math.pow((2.0 * ((F * ((B * B) + (-4.0 * (A * C)))) * (A + (A + C)))), 0.5) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if C <= -2.6e-116: tmp = -math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0 else: tmp = -math.pow((2.0 * ((F * ((B * B) + (-4.0 * (A * C)))) * (A + (A + C)))), 0.5) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (C <= -2.6e-116) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -16.0) * Float64(F * Float64(A * C))))) / t_0); else tmp = Float64(Float64(-(Float64(2.0 * Float64(Float64(F * Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C)))) * Float64(A + Float64(A + C)))) ^ 0.5)) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (C <= -2.6e-116) tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0; else tmp = -((2.0 * ((F * ((B * B) + (-4.0 * (A * C)))) * (A + (A + C)))) ^ 0.5) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, -2.6e-116], N[((-N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Power[N[(2.0 * N[(N[(F * N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]) / t$95$0), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;C \leq -2.6 \cdot 10^{-116}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-{\left(2 \cdot \left(\left(F \cdot \left(B \cdot B + -4 \cdot \left(A \cdot C\right)\right)\right) \cdot \left(A + \left(A + C\right)\right)\right)\right)}^{0.5}}{t_0}\\
\end{array}
\end{array}
if C < -2.6e-116Initial program 10.2%
associate-*l*10.2%
unpow210.2%
+-commutative10.2%
unpow210.2%
associate-*l*10.2%
unpow210.2%
Simplified10.2%
Taylor expanded in A around inf 1.7%
Taylor expanded in A around inf 15.5%
unpow215.5%
Simplified15.5%
*-un-lft-identity15.5%
associate-*l*17.2%
*-commutative17.2%
Applied egg-rr17.2%
*-lft-identity17.2%
associate-*r*17.2%
*-commutative17.2%
associate-*r*21.8%
*-commutative21.8%
Simplified21.8%
if -2.6e-116 < C Initial program 32.3%
associate-*l*32.3%
unpow232.3%
+-commutative32.3%
unpow232.3%
associate-*l*32.3%
unpow232.3%
Simplified32.3%
Taylor expanded in A around inf 14.5%
pow1/214.6%
associate-*l*14.6%
*-commutative14.6%
cancel-sign-sub-inv14.6%
metadata-eval14.6%
+-commutative14.6%
Applied egg-rr14.6%
Final simplification17.0%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= C -5.2e-116)
(/ (- (sqrt (* (* A -16.0) (* F (* A C))))) t_0)
(/ (- (sqrt (* (+ A (+ A C)) (* 2.0 (* F t_0))))) t_0))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= -5.2e-116) {
tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
if (c <= (-5.2d-116)) then
tmp = -sqrt(((a * (-16.0d0)) * (f * (a * c)))) / t_0
else
tmp = -sqrt(((a + (a + c)) * (2.0d0 * (f * t_0)))) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (C <= -5.2e-116) {
tmp = -Math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0;
} else {
tmp = -Math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if C <= -5.2e-116: tmp = -math.sqrt(((A * -16.0) * (F * (A * C)))) / t_0 else: tmp = -math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (C <= -5.2e-116) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -16.0) * Float64(F * Float64(A * C))))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(A + C)) * Float64(2.0 * Float64(F * t_0))))) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (C <= -5.2e-116) tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / t_0; else tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, -5.2e-116], N[((-N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;C \leq -5.2 \cdot 10^{-116}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\end{array}
\end{array}
if C < -5.2000000000000001e-116Initial program 10.2%
associate-*l*10.2%
unpow210.2%
+-commutative10.2%
unpow210.2%
associate-*l*10.2%
unpow210.2%
Simplified10.2%
Taylor expanded in A around inf 1.7%
Taylor expanded in A around inf 15.5%
unpow215.5%
Simplified15.5%
*-un-lft-identity15.5%
associate-*l*17.2%
*-commutative17.2%
Applied egg-rr17.2%
*-lft-identity17.2%
associate-*r*17.2%
*-commutative17.2%
associate-*r*21.8%
*-commutative21.8%
Simplified21.8%
if -5.2000000000000001e-116 < C Initial program 32.3%
associate-*l*32.3%
unpow232.3%
+-commutative32.3%
unpow232.3%
associate-*l*32.3%
unpow232.3%
Simplified32.3%
Taylor expanded in A around inf 14.5%
Final simplification16.9%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (if (<= B 7.2e+50) (/ (- (sqrt (* -16.0 (* (* A A) (* C F))))) (- (* B B) (* 4.0 (* A C)))) (* (sqrt (* A F)) (- (/ 2.0 B)))))
B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7.2e+50) {
tmp = -sqrt((-16.0 * ((A * A) * (C * F)))) / ((B * B) - (4.0 * (A * C)));
} else {
tmp = sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
NOTE: B should be positive 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 <= 7.2d+50) then
tmp = -sqrt(((-16.0d0) * ((a * a) * (c * f)))) / ((b * b) - (4.0d0 * (a * c)))
else
tmp = sqrt((a * f)) * -(2.0d0 / b)
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7.2e+50) {
tmp = -Math.sqrt((-16.0 * ((A * A) * (C * F)))) / ((B * B) - (4.0 * (A * C)));
} else {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if B <= 7.2e+50: tmp = -math.sqrt((-16.0 * ((A * A) * (C * F)))) / ((B * B) - (4.0 * (A * C))) else: tmp = math.sqrt((A * F)) * -(2.0 / B) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (B <= 7.2e+50) tmp = Float64(Float64(-sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (B <= 7.2e+50) tmp = -sqrt((-16.0 * ((A * A) * (C * F)))) / ((B * B) - (4.0 * (A * C))); else tmp = sqrt((A * F)) * -(2.0 / B); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[B, 7.2e+50], N[((-N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 7.2 \cdot 10^{+50}:\\
\;\;\;\;\frac{-\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\end{array}
\end{array}
if B < 7.19999999999999972e50Initial program 26.2%
associate-*l*26.2%
unpow226.2%
+-commutative26.2%
unpow226.2%
associate-*l*26.2%
unpow226.2%
Simplified26.2%
Taylor expanded in A around inf 12.8%
Taylor expanded in A around inf 12.4%
unpow212.4%
Simplified12.4%
if 7.19999999999999972e50 < B Initial program 20.9%
associate-*l*20.9%
unpow220.9%
+-commutative20.9%
unpow220.9%
associate-*l*20.9%
unpow220.9%
Simplified20.9%
Taylor expanded in A around inf 1.7%
Taylor expanded in B around inf 11.2%
Taylor expanded in C around 0 9.3%
*-commutative9.3%
unpow29.3%
rem-square-sqrt9.4%
Simplified9.4%
Final simplification11.7%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (if (<= B 3.3e+69) (/ (- (sqrt (* (* A -16.0) (* F (* A C))))) (- (* B B) (* 4.0 (* A C)))) (* (sqrt (* A F)) (- (/ 2.0 B)))))
B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 3.3e+69) {
tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C)));
} else {
tmp = sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
NOTE: B should be positive 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 <= 3.3d+69) then
tmp = -sqrt(((a * (-16.0d0)) * (f * (a * c)))) / ((b * b) - (4.0d0 * (a * c)))
else
tmp = sqrt((a * f)) * -(2.0d0 / b)
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 3.3e+69) {
tmp = -Math.sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C)));
} else {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if B <= 3.3e+69: tmp = -math.sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C))) else: tmp = math.sqrt((A * F)) * -(2.0 / B) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (B <= 3.3e+69) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -16.0) * Float64(F * Float64(A * C))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (B <= 3.3e+69) tmp = -sqrt(((A * -16.0) * (F * (A * C)))) / ((B * B) - (4.0 * (A * C))); else tmp = sqrt((A * F)) * -(2.0 / B); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[B, 3.3e+69], N[((-N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 3.3 \cdot 10^{+69}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)}}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\end{array}
\end{array}
if B < 3.2999999999999999e69Initial program 26.8%
associate-*l*26.8%
unpow226.8%
+-commutative26.8%
unpow226.8%
associate-*l*26.8%
unpow226.8%
Simplified26.8%
Taylor expanded in A around inf 12.7%
Taylor expanded in A around inf 12.2%
unpow212.2%
Simplified12.2%
*-un-lft-identity12.2%
associate-*l*13.9%
*-commutative13.9%
Applied egg-rr13.9%
*-lft-identity13.9%
associate-*r*13.9%
*-commutative13.9%
associate-*r*16.9%
*-commutative16.9%
Simplified16.9%
if 3.2999999999999999e69 < B Initial program 18.4%
associate-*l*18.4%
unpow218.4%
+-commutative18.4%
unpow218.4%
associate-*l*18.4%
unpow218.4%
Simplified18.4%
Taylor expanded in A around inf 1.6%
Taylor expanded in B around inf 11.6%
Taylor expanded in C around 0 9.6%
*-commutative9.6%
unpow29.6%
rem-square-sqrt9.7%
Simplified9.7%
Final simplification15.4%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (if (<= B 5.2e+50) (/ (- (sqrt (* -16.0 (* (* A A) (* C F))))) (* -4.0 (* A C))) (* (sqrt (* A F)) (- (/ 2.0 B)))))
B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 5.2e+50) {
tmp = -sqrt((-16.0 * ((A * A) * (C * F)))) / (-4.0 * (A * C));
} else {
tmp = sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
NOTE: B should be positive 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 <= 5.2d+50) then
tmp = -sqrt(((-16.0d0) * ((a * a) * (c * f)))) / ((-4.0d0) * (a * c))
else
tmp = sqrt((a * f)) * -(2.0d0 / b)
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 5.2e+50) {
tmp = -Math.sqrt((-16.0 * ((A * A) * (C * F)))) / (-4.0 * (A * C));
} else {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if B <= 5.2e+50: tmp = -math.sqrt((-16.0 * ((A * A) * (C * F)))) / (-4.0 * (A * C)) else: tmp = math.sqrt((A * F)) * -(2.0 / B) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (B <= 5.2e+50) tmp = Float64(Float64(-sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F))))) / Float64(-4.0 * Float64(A * C))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (B <= 5.2e+50) tmp = -sqrt((-16.0 * ((A * A) * (C * F)))) / (-4.0 * (A * C)); else tmp = sqrt((A * F)) * -(2.0 / B); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[B, 5.2e+50], N[((-N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 5.2 \cdot 10^{+50}:\\
\;\;\;\;\frac{-\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\end{array}
\end{array}
if B < 5.2000000000000004e50Initial program 26.2%
associate-*l*26.2%
unpow226.2%
+-commutative26.2%
unpow226.2%
associate-*l*26.2%
unpow226.2%
Simplified26.2%
Taylor expanded in A around inf 12.8%
Taylor expanded in A around inf 12.4%
unpow212.4%
Simplified12.4%
Taylor expanded in B around 0 12.2%
*-commutative12.2%
Simplified12.2%
if 5.2000000000000004e50 < B Initial program 20.9%
associate-*l*20.9%
unpow220.9%
+-commutative20.9%
unpow220.9%
associate-*l*20.9%
unpow220.9%
Simplified20.9%
Taylor expanded in A around inf 1.7%
Taylor expanded in B around inf 11.2%
Taylor expanded in C around 0 9.3%
*-commutative9.3%
unpow29.3%
rem-square-sqrt9.4%
Simplified9.4%
Final simplification11.6%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (* (sqrt (* A F)) (- (/ 2.0 B))))
B = abs(B);
double code(double A, double B, double C, double F) {
return sqrt((A * F)) * -(2.0 / B);
}
NOTE: B should be positive 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 = sqrt((a * f)) * -(2.0d0 / b)
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
return Math.sqrt((A * F)) * -(2.0 / B);
}
B = abs(B) def code(A, B, C, F): return math.sqrt((A * F)) * -(2.0 / B)
B = abs(B) function code(A, B, C, F) return Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))) end
B = abs(B) function tmp = code(A, B, C, F) tmp = sqrt((A * F)) * -(2.0 / B); end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B = |B|\\
\\
\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)
\end{array}
Initial program 25.0%
associate-*l*25.0%
unpow225.0%
+-commutative25.0%
unpow225.0%
associate-*l*25.0%
unpow225.0%
Simplified25.0%
Taylor expanded in A around inf 10.3%
Taylor expanded in B around inf 3.5%
Taylor expanded in C around 0 3.3%
*-commutative3.3%
unpow23.3%
rem-square-sqrt3.3%
Simplified3.3%
Final simplification3.3%
herbie shell --seed 2023252
(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))))