
(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 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* F t_0))
(t_2 (- A (- (hypot B_m (- A C)) C)))
(t_3 (- t_0))
(t_4 (* (* 4.0 A) C))
(t_5
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_4) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_4 (pow B_m 2.0)))))
(if (<= t_5 (- INFINITY))
(* (sqrt (* F (/ t_2 (fma -4.0 (* A C) (pow B_m 2.0))))) (- (sqrt 2.0)))
(if (<= t_5 -5e-200)
(/ (sqrt (* t_1 (* 2.0 t_2))) t_3)
(if (<= t_5 INFINITY)
(/
(sqrt (* t_1 (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
t_3)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = F * t_0;
double t_2 = A - (hypot(B_m, (A - C)) - C);
double t_3 = -t_0;
double t_4 = (4.0 * A) * C;
double t_5 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_4) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_4 - pow(B_m, 2.0));
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = sqrt((F * (t_2 / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_5 <= -5e-200) {
tmp = sqrt((t_1 * (2.0 * t_2))) / t_3;
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_3;
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(F * t_0) t_2 = Float64(A - Float64(hypot(B_m, Float64(A - C)) - C)) t_3 = Float64(-t_0) t_4 = Float64(Float64(4.0 * A) * C) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_4) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_4 - (B_m ^ 2.0))) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(t_2 / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_5 <= -5e-200) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * t_2))) / t_3); elseif (t_5 <= Inf) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_3); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(A - N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] - C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, Block[{t$95$4 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$4), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$4 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[Sqrt[N[(F * N[(t$95$2 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$5, -5e-200], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := F \cdot t\_0\\
t_2 := A - \left(\mathsf{hypot}\left(B\_m, A - C\right) - C\right)\\
t_3 := -t\_0\\
t_4 := \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_4\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_4 - {B\_m}^{2}}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{t\_2}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_5 \leq -5 \cdot 10^{-200}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot t\_2\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.2%
Taylor expanded in F around 0 35.3%
mul-1-neg35.3%
*-commutative35.3%
associate-/l*41.5%
associate--l+41.5%
unpow241.5%
unpow241.5%
hypot-undefine64.2%
cancel-sign-sub-inv64.2%
Simplified64.2%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -4.99999999999999991e-200Initial program 97.5%
Simplified97.5%
if -4.99999999999999991e-200 < (/.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 20.9%
Simplified29.4%
Taylor expanded in C around inf 21.6%
mul-1-neg21.6%
Simplified21.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%
Taylor expanded in C around 0 2.1%
mul-1-neg2.1%
+-commutative2.1%
unpow22.1%
unpow22.1%
hypot-define19.1%
Simplified19.1%
Final simplification39.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A)))
(- t_0 (pow B_m 2.0))))
(t_2 (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))
(if (<= (pow B_m 2.0) 1e-176)
t_1
(if (<= (pow B_m 2.0) 1e-85)
t_2
(if (<= (pow B_m 2.0) 1e-80)
t_1
(if (<= (pow B_m 2.0) 1e-9)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C))))))
t_2))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
double t_2 = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
double tmp;
if (pow(B_m, 2.0) <= 1e-176) {
tmp = t_1;
} else if (pow(B_m, 2.0) <= 1e-85) {
tmp = t_2;
} else if (pow(B_m, 2.0) <= 1e-80) {
tmp = t_1;
} else if (pow(B_m, 2.0) <= 1e-9) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = t_2;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - Math.pow(B_m, 2.0));
double t_2 = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-176) {
tmp = t_1;
} else if (Math.pow(B_m, 2.0) <= 1e-85) {
tmp = t_2;
} else if (Math.pow(B_m, 2.0) <= 1e-80) {
tmp = t_1;
} else if (Math.pow(B_m, 2.0) <= 1e-9) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (-0.5 * (Math.pow(B_m, 2.0) / C))));
} else {
tmp = t_2;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - math.pow(B_m, 2.0)) t_2 = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m) tmp = 0 if math.pow(B_m, 2.0) <= 1e-176: tmp = t_1 elif math.pow(B_m, 2.0) <= 1e-85: tmp = t_2 elif math.pow(B_m, 2.0) <= 1e-80: tmp = t_1 elif math.pow(B_m, 2.0) <= 1e-9: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (-0.5 * (math.pow(B_m, 2.0) / C)))) else: tmp = t_2 return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0))) t_2 = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-176) tmp = t_1; elseif ((B_m ^ 2.0) <= 1e-85) tmp = t_2; elseif ((B_m ^ 2.0) <= 1e-80) tmp = t_1; elseif ((B_m ^ 2.0) <= 1e-9) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))))); else tmp = t_2; end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - (B_m ^ 2.0));
t_2 = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-176)
tmp = t_1;
elseif ((B_m ^ 2.0) <= 1e-85)
tmp = t_2;
elseif ((B_m ^ 2.0) <= 1e-80)
tmp = t_1;
elseif ((B_m ^ 2.0) <= 1e-9)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * ((B_m ^ 2.0) / C))));
else
tmp = t_2;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-176], t$95$1, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-85], t$95$2, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], t$95$1, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], t$95$2]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-176}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-85}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-9}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-176 or 9.9999999999999998e-86 < (pow.f64 B 2) < 9.99999999999999961e-81Initial program 23.2%
Taylor expanded in A around -inf 19.6%
if 1e-176 < (pow.f64 B 2) < 9.9999999999999998e-86 or 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 17.1%
Taylor expanded in C around 0 11.7%
mul-1-neg11.7%
+-commutative11.7%
unpow211.7%
unpow211.7%
hypot-define24.8%
Simplified24.8%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
Taylor expanded in C around inf 15.3%
Final simplification22.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2 (/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A))) t_1))
(t_3 (sqrt (* F (- A (hypot B_m A))))))
(if (<= (pow B_m 2.0) 1e-176)
t_2
(if (<= (pow B_m 2.0) 1e-85)
(/ (* B_m (* (sqrt 2.0) t_3)) t_1)
(if (<= (pow B_m 2.0) 1e-80)
t_2
(if (<= (pow B_m 2.0) 1e-9)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C))))))
(* t_3 (/ (sqrt 2.0) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / t_1;
double t_3 = sqrt((F * (A - hypot(B_m, A))));
double tmp;
if (pow(B_m, 2.0) <= 1e-176) {
tmp = t_2;
} else if (pow(B_m, 2.0) <= 1e-85) {
tmp = (B_m * (sqrt(2.0) * t_3)) / t_1;
} else if (pow(B_m, 2.0) <= 1e-80) {
tmp = t_2;
} else if (pow(B_m, 2.0) <= 1e-9) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = t_3 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - Math.pow(B_m, 2.0);
double t_2 = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / t_1;
double t_3 = Math.sqrt((F * (A - Math.hypot(B_m, A))));
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-176) {
tmp = t_2;
} else if (Math.pow(B_m, 2.0) <= 1e-85) {
tmp = (B_m * (Math.sqrt(2.0) * t_3)) / t_1;
} else if (Math.pow(B_m, 2.0) <= 1e-80) {
tmp = t_2;
} else if (Math.pow(B_m, 2.0) <= 1e-9) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (-0.5 * (Math.pow(B_m, 2.0) / C))));
} else {
tmp = t_3 * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = t_0 - math.pow(B_m, 2.0) t_2 = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / t_1 t_3 = math.sqrt((F * (A - math.hypot(B_m, A)))) tmp = 0 if math.pow(B_m, 2.0) <= 1e-176: tmp = t_2 elif math.pow(B_m, 2.0) <= 1e-85: tmp = (B_m * (math.sqrt(2.0) * t_3)) / t_1 elif math.pow(B_m, 2.0) <= 1e-80: tmp = t_2 elif math.pow(B_m, 2.0) <= 1e-9: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (-0.5 * (math.pow(B_m, 2.0) / C)))) else: tmp = t_3 * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / t_1) t_3 = sqrt(Float64(F * Float64(A - hypot(B_m, A)))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-176) tmp = t_2; elseif ((B_m ^ 2.0) <= 1e-85) tmp = Float64(Float64(B_m * Float64(sqrt(2.0) * t_3)) / t_1); elseif ((B_m ^ 2.0) <= 1e-80) tmp = t_2; elseif ((B_m ^ 2.0) <= 1e-9) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))))); else tmp = Float64(t_3 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = t_0 - (B_m ^ 2.0);
t_2 = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * A))) / t_1;
t_3 = sqrt((F * (A - hypot(B_m, A))));
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-176)
tmp = t_2;
elseif ((B_m ^ 2.0) <= 1e-85)
tmp = (B_m * (sqrt(2.0) * t_3)) / t_1;
elseif ((B_m ^ 2.0) <= 1e-80)
tmp = t_2;
elseif ((B_m ^ 2.0) <= 1e-9)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * ((B_m ^ 2.0) / C))));
else
tmp = t_3 * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-176], t$95$2, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-85], N[(N[(B$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], t$95$2, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(t$95$3 * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_1}\\
t_3 := \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-176}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-85}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{2} \cdot t\_3\right)}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-9}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_3 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-176 or 9.9999999999999998e-86 < (pow.f64 B 2) < 9.99999999999999961e-81Initial program 23.2%
Taylor expanded in A around -inf 19.6%
if 1e-176 < (pow.f64 B 2) < 9.9999999999999998e-86Initial program 34.4%
Taylor expanded in C around 0 17.4%
associate-*l*17.5%
+-commutative17.5%
unpow217.5%
unpow217.5%
hypot-define18.0%
Simplified18.0%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
Taylor expanded in C around inf 15.3%
if 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 14.3%
Taylor expanded in C around 0 10.8%
mul-1-neg10.8%
+-commutative10.8%
unpow210.8%
unpow210.8%
hypot-define26.0%
Simplified26.0%
Final simplification22.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (sqrt (* F (- A (hypot B_m A))))))
(if (<= (pow B_m 2.0) 2e-304)
(/
-1.0
(/
(fma C (* A -4.0) (pow B_m 2.0))
(sqrt (* -8.0 (* (* A C) (* F (+ A A)))))))
(if (<= (pow B_m 2.0) 2e-92)
(/ (sqrt (* (* F t_0) (* 2.0 (- A (- (hypot B_m (- A C)) C))))) (- t_0))
(if (<= (pow B_m 2.0) 1e-80)
(/ (* B_m (* (sqrt 2.0) t_1)) (- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e-9)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C))))))
(* t_1 (/ (sqrt 2.0) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = sqrt((F * (A - hypot(B_m, A))));
double tmp;
if (pow(B_m, 2.0) <= 2e-304) {
tmp = -1.0 / (fma(C, (A * -4.0), pow(B_m, 2.0)) / sqrt((-8.0 * ((A * C) * (F * (A + A))))));
} else if (pow(B_m, 2.0) <= 2e-92) {
tmp = sqrt(((F * t_0) * (2.0 * (A - (hypot(B_m, (A - C)) - C))))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e-80) {
tmp = (B_m * (sqrt(2.0) * t_1)) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e-9) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = t_1 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = sqrt(Float64(F * Float64(A - hypot(B_m, A)))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-304) tmp = Float64(-1.0 / Float64(fma(C, Float64(A * -4.0), (B_m ^ 2.0)) / sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))))); elseif ((B_m ^ 2.0) <= 2e-92) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A - Float64(hypot(B_m, Float64(A - C)) - C))))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e-80) tmp = Float64(Float64(B_m * Float64(sqrt(2.0) * t_1)) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e-9) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))))); else tmp = Float64(t_1 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-304], N[(-1.0 / N[(N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-92], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A - N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], N[(N[(B$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(t$95$1 * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-304}:\\
\;\;\;\;\frac{-1}{\frac{\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-92}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A - \left(\mathsf{hypot}\left(B\_m, A - C\right) - C\right)\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{2} \cdot t\_1\right)}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-9}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.99999999999999994e-304Initial program 19.7%
Simplified29.6%
Taylor expanded in C around inf 17.0%
associate-*r*21.7%
*-commutative21.7%
mul-1-neg21.7%
Simplified21.7%
clear-num21.8%
inv-pow21.8%
associate-*r*18.6%
Applied egg-rr18.6%
unpow-118.6%
associate-*l*21.8%
Simplified21.8%
if 1.99999999999999994e-304 < (pow.f64 B 2) < 1.99999999999999998e-92Initial program 32.3%
Simplified37.1%
if 1.99999999999999998e-92 < (pow.f64 B 2) < 9.99999999999999961e-81Initial program 27.3%
Taylor expanded in C around 0 29.4%
associate-*l*29.4%
+-commutative29.4%
unpow229.4%
unpow229.4%
hypot-define29.4%
Simplified29.4%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
Taylor expanded in C around inf 15.3%
if 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 14.3%
Taylor expanded in C around 0 10.8%
mul-1-neg10.8%
+-commutative10.8%
unpow210.8%
unpow210.8%
hypot-define26.0%
Simplified26.0%
Final simplification26.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-176)
(/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0))))
(if (or (<= (pow B_m 2.0) 1e-80) (not (<= (pow B_m 2.0) 1e-9)))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) C))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-176) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if ((pow(B_m, 2.0) <= 1e-80) || !(pow(B_m, 2.0) <= 1e-9)) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * ((pow(B_m, 2.0) * F) / C)));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-176) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if ((Math.pow(B_m, 2.0) <= 1e-80) || !(Math.pow(B_m, 2.0) <= 1e-9)) {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((-0.5 * ((Math.pow(B_m, 2.0) * F) / C)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e-176: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) elif (math.pow(B_m, 2.0) <= 1e-80) or not (math.pow(B_m, 2.0) <= 1e-9): tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m) else: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((-0.5 * ((math.pow(B_m, 2.0) * F) / C))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-176) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); elseif (((B_m ^ 2.0) <= 1e-80) || !((B_m ^ 2.0) <= 1e-9)) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / C))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-176)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
elseif (((B_m ^ 2.0) <= 1e-80) || ~(((B_m ^ 2.0) <= 1e-9)))
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
else
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * (((B_m ^ 2.0) * F) / C)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-176], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9]], $MachinePrecision]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-176}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80} \lor \neg \left({B\_m}^{2} \leq 10^{-9}\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B\_m}^{2} \cdot F}{C}}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-176Initial program 22.6%
Simplified27.3%
Taylor expanded in C around inf 15.8%
associate-*r*19.0%
*-commutative19.0%
mul-1-neg19.0%
Simplified19.0%
Taylor expanded in C around inf 18.8%
associate-*r*18.8%
Simplified18.8%
if 1e-176 < (pow.f64 B 2) < 9.99999999999999961e-81 or 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 17.5%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
unpow211.6%
unpow211.6%
hypot-define24.5%
Simplified24.5%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
Taylor expanded in C around inf 15.4%
Final simplification22.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-176)
(/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0))))
(if (or (<= (pow B_m 2.0) 1e-80) (not (<= (pow B_m 2.0) 1e-9)))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-176) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if ((pow(B_m, 2.0) <= 1e-80) || !(pow(B_m, 2.0) <= 1e-9)) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-176) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if ((Math.pow(B_m, 2.0) <= 1e-80) || !(Math.pow(B_m, 2.0) <= 1e-9)) {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (-0.5 * (Math.pow(B_m, 2.0) / C))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e-176: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) elif (math.pow(B_m, 2.0) <= 1e-80) or not (math.pow(B_m, 2.0) <= 1e-9): tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m) else: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (-0.5 * (math.pow(B_m, 2.0) / C)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-176) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); elseif (((B_m ^ 2.0) <= 1e-80) || !((B_m ^ 2.0) <= 1e-9)) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-176)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
elseif (((B_m ^ 2.0) <= 1e-80) || ~(((B_m ^ 2.0) <= 1e-9)))
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
else
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * ((B_m ^ 2.0) / C))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-176], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9]], $MachinePrecision]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-176}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80} \lor \neg \left({B\_m}^{2} \leq 10^{-9}\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-176Initial program 22.6%
Simplified27.3%
Taylor expanded in C around inf 15.8%
associate-*r*19.0%
*-commutative19.0%
mul-1-neg19.0%
Simplified19.0%
Taylor expanded in C around inf 18.8%
associate-*r*18.8%
Simplified18.8%
if 1e-176 < (pow.f64 B 2) < 9.99999999999999961e-81 or 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 17.5%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
unpow211.6%
unpow211.6%
hypot-define24.5%
Simplified24.5%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
Taylor expanded in C around inf 15.3%
Final simplification22.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-176)
(/
(sqrt (* -8.0 (* (* A C) (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(if (or (<= (pow B_m 2.0) 1e-80) (not (<= (pow B_m 2.0) 1e-9)))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-176) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else if ((pow(B_m, 2.0) <= 1e-80) || !(pow(B_m, 2.0) <= 1e-9)) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-176) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); elseif (((B_m ^ 2.0) <= 1e-80) || !((B_m ^ 2.0) <= 1e-9)) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-176], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9]], $MachinePrecision]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-176}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80} \lor \neg \left({B\_m}^{2} \leq 10^{-9}\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-176Initial program 22.6%
Simplified27.3%
Taylor expanded in C around inf 15.8%
associate-*r*19.0%
*-commutative19.0%
mul-1-neg19.0%
Simplified19.0%
if 1e-176 < (pow.f64 B 2) < 9.99999999999999961e-81 or 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 17.5%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
unpow211.6%
unpow211.6%
hypot-define24.5%
Simplified24.5%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
Taylor expanded in C around inf 15.3%
Final simplification22.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-176)
(/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0))))
(if (or (<= (pow B_m 2.0) 1e-80) (not (<= (pow B_m 2.0) 1e-9)))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
(/ (sqrt (* 2.0 (* F (* -0.5 (/ (pow B_m 2.0) C))))) (- B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-176) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if ((pow(B_m, 2.0) <= 1e-80) || !(pow(B_m, 2.0) <= 1e-9)) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt((2.0 * (F * (-0.5 * (pow(B_m, 2.0) / C))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-176) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if ((Math.pow(B_m, 2.0) <= 1e-80) || !(Math.pow(B_m, 2.0) <= 1e-9)) {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = Math.sqrt((2.0 * (F * (-0.5 * (Math.pow(B_m, 2.0) / C))))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e-176: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) elif (math.pow(B_m, 2.0) <= 1e-80) or not (math.pow(B_m, 2.0) <= 1e-9): tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m) else: tmp = math.sqrt((2.0 * (F * (-0.5 * (math.pow(B_m, 2.0) / C))))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-176) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); elseif (((B_m ^ 2.0) <= 1e-80) || !((B_m ^ 2.0) <= 1e-9)) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-176)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
elseif (((B_m ^ 2.0) <= 1e-80) || ~(((B_m ^ 2.0) <= 1e-9)))
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
else
tmp = sqrt((2.0 * (F * (-0.5 * ((B_m ^ 2.0) / C))))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-176], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-80], N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-9]], $MachinePrecision]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-176}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-80} \lor \neg \left({B\_m}^{2} \leq 10^{-9}\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-176Initial program 22.6%
Simplified27.3%
Taylor expanded in C around inf 15.8%
associate-*r*19.0%
*-commutative19.0%
mul-1-neg19.0%
Simplified19.0%
Taylor expanded in C around inf 18.8%
associate-*r*18.8%
Simplified18.8%
if 1e-176 < (pow.f64 B 2) < 9.99999999999999961e-81 or 1.00000000000000006e-9 < (pow.f64 B 2) Initial program 17.5%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
unpow211.6%
unpow211.6%
hypot-define24.5%
Simplified24.5%
if 9.99999999999999961e-81 < (pow.f64 B 2) < 1.00000000000000006e-9Initial program 15.5%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define9.7%
Simplified9.7%
associate-*l/9.7%
pow1/29.7%
pow1/29.7%
pow-prod-down9.7%
Applied egg-rr9.7%
unpow1/29.7%
Simplified9.7%
Taylor expanded in C around inf 15.3%
Final simplification22.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.6e-87)
(/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0))))
(if (<= B_m 2.9e-43)
(/ (sqrt (* 2.0 (* B_m (- F)))) (- B_m))
(if (<= B_m 8.5e-42)
(/ (sqrt (* (* -8.0 (+ A A)) (* C (* A F)))) (* 4.0 (* A C)))
(if (<= B_m 1.2e+39)
(/ (sqrt (* 2.0 (* -0.5 (/ (* (pow B_m 2.0) F) C)))) (- B_m))
(/ (sqrt (* 2.0 (* F (- C (hypot B_m C))))) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.6e-87) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if (B_m <= 2.9e-43) {
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
} else if (B_m <= 8.5e-42) {
tmp = sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
} else if (B_m <= 1.2e+39) {
tmp = sqrt((2.0 * (-0.5 * ((pow(B_m, 2.0) * F) / C)))) / -B_m;
} else {
tmp = sqrt((2.0 * (F * (C - hypot(B_m, C))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.6e-87) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if (B_m <= 2.9e-43) {
tmp = Math.sqrt((2.0 * (B_m * -F))) / -B_m;
} else if (B_m <= 8.5e-42) {
tmp = Math.sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
} else if (B_m <= 1.2e+39) {
tmp = Math.sqrt((2.0 * (-0.5 * ((Math.pow(B_m, 2.0) * F) / C)))) / -B_m;
} else {
tmp = Math.sqrt((2.0 * (F * (C - Math.hypot(B_m, C))))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4.6e-87: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) elif B_m <= 2.9e-43: tmp = math.sqrt((2.0 * (B_m * -F))) / -B_m elif B_m <= 8.5e-42: tmp = math.sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C)) elif B_m <= 1.2e+39: tmp = math.sqrt((2.0 * (-0.5 * ((math.pow(B_m, 2.0) * F) / C)))) / -B_m else: tmp = math.sqrt((2.0 * (F * (C - math.hypot(B_m, C))))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.6e-87) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); elseif (B_m <= 2.9e-43) tmp = Float64(sqrt(Float64(2.0 * Float64(B_m * Float64(-F)))) / Float64(-B_m)); elseif (B_m <= 8.5e-42) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A + A)) * Float64(C * Float64(A * F)))) / Float64(4.0 * Float64(A * C))); elseif (B_m <= 1.2e+39) tmp = Float64(sqrt(Float64(2.0 * Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / C)))) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(B_m, C))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4.6e-87)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
elseif (B_m <= 2.9e-43)
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
elseif (B_m <= 8.5e-42)
tmp = sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
elseif (B_m <= 1.2e+39)
tmp = sqrt((2.0 * (-0.5 * (((B_m ^ 2.0) * F) / C)))) / -B_m;
else
tmp = sqrt((2.0 * (F * (C - hypot(B_m, C))))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.6e-87], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.9e-43], N[(N[Sqrt[N[(2.0 * N[(B$95$m * (-F)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[B$95$m, 8.5e-42], N[(N[Sqrt[N[(N[(-8.0 * N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(C * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.2e+39], N[(N[Sqrt[N[(2.0 * N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.6 \cdot 10^{-87}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 2.9 \cdot 10^{-43}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(B\_m \cdot \left(-F\right)\right)}}{-B\_m}\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{-42}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A + A\right)\right) \cdot \left(C \cdot \left(A \cdot F\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;B\_m \leq 1.2 \cdot 10^{+39}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2} \cdot F}{C}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(B\_m, C\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 4.6000000000000003e-87Initial program 22.3%
Simplified23.7%
Taylor expanded in C around inf 10.7%
associate-*r*12.2%
*-commutative12.2%
mul-1-neg12.2%
Simplified12.2%
Taylor expanded in C around inf 12.3%
associate-*r*12.3%
Simplified12.3%
if 4.6000000000000003e-87 < B < 2.9000000000000001e-43Initial program 30.8%
Taylor expanded in A around 0 28.1%
mul-1-neg28.1%
unpow228.1%
unpow228.1%
hypot-define30.2%
Simplified30.2%
associate-*l/30.2%
pow1/230.2%
pow1/230.2%
pow-prod-down30.2%
Applied egg-rr30.2%
unpow1/230.2%
Simplified30.2%
Taylor expanded in C around 0 31.6%
associate-*r*31.6%
mul-1-neg31.6%
Simplified31.6%
if 2.9000000000000001e-43 < B < 8.4999999999999996e-42Initial program 2.2%
Simplified20.0%
Taylor expanded in C around inf 100.0%
associate-*r*100.0%
*-commutative100.0%
mul-1-neg100.0%
Simplified100.0%
Taylor expanded in C around inf 100.0%
associate-*r*100.0%
Simplified100.0%
div-inv100.0%
associate-*r*98.4%
*-commutative98.4%
associate-*l*100.0%
distribute-rgt-neg-in100.0%
*-commutative100.0%
Applied egg-rr100.0%
associate-*r/100.0%
*-rgt-identity100.0%
associate-*r*100.0%
sub-neg100.0%
remove-double-neg100.0%
*-commutative100.0%
distribute-rgt-neg-out100.0%
*-commutative100.0%
associate-*r*100.0%
distribute-lft-neg-in100.0%
metadata-eval100.0%
*-commutative100.0%
Simplified100.0%
if 8.4999999999999996e-42 < B < 1.2e39Initial program 25.6%
Taylor expanded in A around 0 32.1%
mul-1-neg32.1%
unpow232.1%
unpow232.1%
hypot-define38.2%
Simplified38.2%
associate-*l/38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
unpow1/238.4%
Simplified38.4%
Taylor expanded in C around inf 12.7%
if 1.2e39 < B Initial program 6.1%
Taylor expanded in A around 0 21.5%
mul-1-neg21.5%
unpow221.5%
unpow221.5%
hypot-define56.1%
Simplified56.1%
associate-*l/56.1%
pow1/256.1%
pow1/256.1%
pow-prod-down56.3%
Applied egg-rr56.3%
unpow1/256.3%
Simplified56.3%
Final simplification23.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.1e-85)
(/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0))))
(if (<= B_m 1.8e-42)
(/ (sqrt (* 2.0 (* B_m (- F)))) (- B_m))
(if (<= B_m 9.2e-42)
(/ (sqrt (* (* -8.0 (+ A A)) (* C (* A F)))) (* 4.0 (* A C)))
(if (<= B_m 8.5e+38)
(/ (sqrt (* 2.0 (* F (* -0.5 (/ (pow B_m 2.0) C))))) (- B_m))
(/ (sqrt (* 2.0 (* F (- C (hypot B_m C))))) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.1e-85) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if (B_m <= 1.8e-42) {
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
} else if (B_m <= 9.2e-42) {
tmp = sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
} else if (B_m <= 8.5e+38) {
tmp = sqrt((2.0 * (F * (-0.5 * (pow(B_m, 2.0) / C))))) / -B_m;
} else {
tmp = sqrt((2.0 * (F * (C - hypot(B_m, C))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.1e-85) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else if (B_m <= 1.8e-42) {
tmp = Math.sqrt((2.0 * (B_m * -F))) / -B_m;
} else if (B_m <= 9.2e-42) {
tmp = Math.sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
} else if (B_m <= 8.5e+38) {
tmp = Math.sqrt((2.0 * (F * (-0.5 * (Math.pow(B_m, 2.0) / C))))) / -B_m;
} else {
tmp = Math.sqrt((2.0 * (F * (C - Math.hypot(B_m, C))))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.1e-85: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) elif B_m <= 1.8e-42: tmp = math.sqrt((2.0 * (B_m * -F))) / -B_m elif B_m <= 9.2e-42: tmp = math.sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C)) elif B_m <= 8.5e+38: tmp = math.sqrt((2.0 * (F * (-0.5 * (math.pow(B_m, 2.0) / C))))) / -B_m else: tmp = math.sqrt((2.0 * (F * (C - math.hypot(B_m, C))))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.1e-85) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); elseif (B_m <= 1.8e-42) tmp = Float64(sqrt(Float64(2.0 * Float64(B_m * Float64(-F)))) / Float64(-B_m)); elseif (B_m <= 9.2e-42) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A + A)) * Float64(C * Float64(A * F)))) / Float64(4.0 * Float64(A * C))); elseif (B_m <= 8.5e+38) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(B_m, C))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.1e-85)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
elseif (B_m <= 1.8e-42)
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
elseif (B_m <= 9.2e-42)
tmp = sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
elseif (B_m <= 8.5e+38)
tmp = sqrt((2.0 * (F * (-0.5 * ((B_m ^ 2.0) / C))))) / -B_m;
else
tmp = sqrt((2.0 * (F * (C - hypot(B_m, C))))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.1e-85], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.8e-42], N[(N[Sqrt[N[(2.0 * N[(B$95$m * (-F)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[B$95$m, 9.2e-42], N[(N[Sqrt[N[(N[(-8.0 * N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(C * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 8.5e+38], N[(N[Sqrt[N[(2.0 * N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.1 \cdot 10^{-85}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 1.8 \cdot 10^{-42}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(B\_m \cdot \left(-F\right)\right)}}{-B\_m}\\
\mathbf{elif}\;B\_m \leq 9.2 \cdot 10^{-42}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A + A\right)\right) \cdot \left(C \cdot \left(A \cdot F\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{+38}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(B\_m, C\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.1000000000000002e-85Initial program 22.3%
Simplified23.7%
Taylor expanded in C around inf 10.7%
associate-*r*12.2%
*-commutative12.2%
mul-1-neg12.2%
Simplified12.2%
Taylor expanded in C around inf 12.3%
associate-*r*12.3%
Simplified12.3%
if 3.1000000000000002e-85 < B < 1.8000000000000001e-42Initial program 30.8%
Taylor expanded in A around 0 28.1%
mul-1-neg28.1%
unpow228.1%
unpow228.1%
hypot-define30.2%
Simplified30.2%
associate-*l/30.2%
pow1/230.2%
pow1/230.2%
pow-prod-down30.2%
Applied egg-rr30.2%
unpow1/230.2%
Simplified30.2%
Taylor expanded in C around 0 31.6%
associate-*r*31.6%
mul-1-neg31.6%
Simplified31.6%
if 1.8000000000000001e-42 < B < 9.20000000000000015e-42Initial program 2.2%
Simplified20.0%
Taylor expanded in C around inf 100.0%
associate-*r*100.0%
*-commutative100.0%
mul-1-neg100.0%
Simplified100.0%
Taylor expanded in C around inf 100.0%
associate-*r*100.0%
Simplified100.0%
div-inv100.0%
associate-*r*98.4%
*-commutative98.4%
associate-*l*100.0%
distribute-rgt-neg-in100.0%
*-commutative100.0%
Applied egg-rr100.0%
associate-*r/100.0%
*-rgt-identity100.0%
associate-*r*100.0%
sub-neg100.0%
remove-double-neg100.0%
*-commutative100.0%
distribute-rgt-neg-out100.0%
*-commutative100.0%
associate-*r*100.0%
distribute-lft-neg-in100.0%
metadata-eval100.0%
*-commutative100.0%
Simplified100.0%
if 9.20000000000000015e-42 < B < 8.4999999999999997e38Initial program 25.6%
Taylor expanded in A around 0 32.1%
mul-1-neg32.1%
unpow232.1%
unpow232.1%
hypot-define38.2%
Simplified38.2%
associate-*l/38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
unpow1/238.4%
Simplified38.4%
Taylor expanded in C around inf 12.6%
if 8.4999999999999997e38 < B Initial program 6.1%
Taylor expanded in A around 0 21.5%
mul-1-neg21.5%
unpow221.5%
unpow221.5%
hypot-define56.1%
Simplified56.1%
associate-*l/56.1%
pow1/256.1%
pow1/256.1%
pow-prod-down56.3%
Applied egg-rr56.3%
unpow1/256.3%
Simplified56.3%
Final simplification23.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 2.6e-85) (/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0)))) (/ (sqrt (* 2.0 (* F (- C (hypot B_m C))))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.6e-85) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else {
tmp = sqrt((2.0 * (F * (C - hypot(B_m, C))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.6e-85) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else {
tmp = Math.sqrt((2.0 * (F * (C - Math.hypot(B_m, C))))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 2.6e-85: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) else: tmp = math.sqrt((2.0 * (F * (C - math.hypot(B_m, C))))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.6e-85) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(B_m, C))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 2.6e-85)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
else
tmp = sqrt((2.0 * (F * (C - hypot(B_m, C))))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.6e-85], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.6 \cdot 10^{-85}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(B\_m, C\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 2.60000000000000011e-85Initial program 22.3%
Simplified23.7%
Taylor expanded in C around inf 10.7%
associate-*r*12.2%
*-commutative12.2%
mul-1-neg12.2%
Simplified12.2%
Taylor expanded in C around inf 12.3%
associate-*r*12.3%
Simplified12.3%
if 2.60000000000000011e-85 < B Initial program 12.9%
Taylor expanded in A around 0 24.2%
mul-1-neg24.2%
unpow224.2%
unpow224.2%
hypot-define48.9%
Simplified48.9%
associate-*l/48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down49.0%
Applied egg-rr49.0%
unpow1/249.0%
Simplified49.0%
Final simplification24.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.1e-85) (/ (sqrt (* -8.0 (* (+ A A) (* F (* A C))))) (* C (* A (- -4.0)))) (/ (sqrt (* 2.0 (* B_m (- F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.1e-85) {
tmp = sqrt((-8.0 * ((A + A) * (F * (A * C))))) / (C * (A * -(-4.0)));
} else {
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.1d-85) then
tmp = sqrt(((-8.0d0) * ((a + a) * (f * (a * c))))) / (c * (a * -(-4.0d0)))
else
tmp = sqrt((2.0d0 * (b_m * -f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.1e-85) {
tmp = Math.sqrt((-8.0 * ((A + A) * (F * (A * C))))) / (C * (A * -(-4.0)));
} else {
tmp = Math.sqrt((2.0 * (B_m * -F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.1e-85: tmp = math.sqrt((-8.0 * ((A + A) * (F * (A * C))))) / (C * (A * -(-4.0))) else: tmp = math.sqrt((2.0 * (B_m * -F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.1e-85) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A + A) * Float64(F * Float64(A * C))))) / Float64(C * Float64(A * Float64(-(-4.0))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(B_m * Float64(-F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.1e-85)
tmp = sqrt((-8.0 * ((A + A) * (F * (A * C))))) / (C * (A * -(-4.0)));
else
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.1e-85], N[(N[Sqrt[N[(-8.0 * N[(N[(A + A), $MachinePrecision] * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(B$95$m * (-F)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.1 \cdot 10^{-85}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A + A\right) \cdot \left(F \cdot \left(A \cdot C\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(B\_m \cdot \left(-F\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.1000000000000002e-85Initial program 22.3%
Simplified23.7%
Taylor expanded in C around inf 10.7%
associate-*r*12.2%
*-commutative12.2%
mul-1-neg12.2%
Simplified12.2%
distribute-frac-neg212.2%
associate-*r*11.2%
Applied egg-rr11.2%
Taylor expanded in C around inf 11.3%
associate-*r*12.3%
Simplified11.3%
if 3.1000000000000002e-85 < B Initial program 12.9%
Taylor expanded in A around 0 24.2%
mul-1-neg24.2%
unpow224.2%
unpow224.2%
hypot-define48.9%
Simplified48.9%
associate-*l/48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down49.0%
Applied egg-rr49.0%
unpow1/249.0%
Simplified49.0%
Taylor expanded in C around 0 40.7%
associate-*r*40.7%
mul-1-neg40.7%
Simplified40.7%
Final simplification21.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 2.8e-85) (/ (sqrt (* -8.0 (* (* A C) (* F (+ A A))))) (* C (* A (- -4.0)))) (/ (sqrt (* 2.0 (* B_m (- F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.8e-85) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else {
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 2.8d-85) then
tmp = sqrt(((-8.0d0) * ((a * c) * (f * (a + a))))) / (c * (a * -(-4.0d0)))
else
tmp = sqrt((2.0d0 * (b_m * -f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.8e-85) {
tmp = Math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
} else {
tmp = Math.sqrt((2.0 * (B_m * -F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 2.8e-85: tmp = math.sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0))) else: tmp = math.sqrt((2.0 * (B_m * -F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.8e-85) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(C * Float64(A * Float64(-(-4.0))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(B_m * Float64(-F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 2.8e-85)
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / (C * (A * -(-4.0)));
else
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.8e-85], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * (--4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(B$95$m * (-F)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.8 \cdot 10^{-85}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{C \cdot \left(A \cdot \left(--4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(B\_m \cdot \left(-F\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 2.80000000000000017e-85Initial program 22.3%
Simplified23.7%
Taylor expanded in C around inf 10.7%
associate-*r*12.2%
*-commutative12.2%
mul-1-neg12.2%
Simplified12.2%
Taylor expanded in C around inf 12.3%
associate-*r*12.3%
Simplified12.3%
if 2.80000000000000017e-85 < B Initial program 12.9%
Taylor expanded in A around 0 24.2%
mul-1-neg24.2%
unpow224.2%
unpow224.2%
hypot-define48.9%
Simplified48.9%
associate-*l/48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down49.0%
Applied egg-rr49.0%
unpow1/249.0%
Simplified49.0%
Taylor expanded in C around 0 40.7%
associate-*r*40.7%
mul-1-neg40.7%
Simplified40.7%
Final simplification21.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.85e-85) (/ (sqrt (* (* -8.0 (+ A A)) (* C (* A F)))) (* 4.0 (* A C))) (/ (sqrt (* 2.0 (* B_m (- F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.85e-85) {
tmp = sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
} else {
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 1.85d-85) then
tmp = sqrt((((-8.0d0) * (a + a)) * (c * (a * f)))) / (4.0d0 * (a * c))
else
tmp = sqrt((2.0d0 * (b_m * -f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.85e-85) {
tmp = Math.sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
} else {
tmp = Math.sqrt((2.0 * (B_m * -F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 1.85e-85: tmp = math.sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C)) else: tmp = math.sqrt((2.0 * (B_m * -F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.85e-85) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A + A)) * Float64(C * Float64(A * F)))) / Float64(4.0 * Float64(A * C))); else tmp = Float64(sqrt(Float64(2.0 * Float64(B_m * Float64(-F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 1.85e-85)
tmp = sqrt(((-8.0 * (A + A)) * (C * (A * F)))) / (4.0 * (A * C));
else
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.85e-85], N[(N[Sqrt[N[(N[(-8.0 * N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(C * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(B$95$m * (-F)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.85 \cdot 10^{-85}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A + A\right)\right) \cdot \left(C \cdot \left(A \cdot F\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(B\_m \cdot \left(-F\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 1.84999999999999992e-85Initial program 22.3%
Simplified23.7%
Taylor expanded in C around inf 10.7%
associate-*r*12.2%
*-commutative12.2%
mul-1-neg12.2%
Simplified12.2%
Taylor expanded in C around inf 12.3%
associate-*r*12.3%
Simplified12.3%
div-inv12.3%
associate-*r*11.2%
*-commutative11.2%
associate-*l*10.8%
distribute-rgt-neg-in10.8%
*-commutative10.8%
Applied egg-rr10.8%
associate-*r/10.9%
*-rgt-identity10.9%
associate-*r*10.9%
sub-neg10.9%
remove-double-neg10.9%
*-commutative10.9%
distribute-rgt-neg-out10.9%
*-commutative10.9%
associate-*r*10.9%
distribute-lft-neg-in10.9%
metadata-eval10.9%
*-commutative10.9%
Simplified10.9%
if 1.84999999999999992e-85 < B Initial program 12.9%
Taylor expanded in A around 0 24.2%
mul-1-neg24.2%
unpow224.2%
unpow224.2%
hypot-define48.9%
Simplified48.9%
associate-*l/48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down49.0%
Applied egg-rr49.0%
unpow1/249.0%
Simplified49.0%
Taylor expanded in C around 0 40.7%
associate-*r*40.7%
mul-1-neg40.7%
Simplified40.7%
Final simplification20.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 (* B_m (- F)))) (- B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 * (B_m * -F))) / -B_m;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 * (b_m * -f))) / -b_m
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 * (B_m * -F))) / -B_m;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 * (B_m * -F))) / -B_m
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(2.0 * Float64(B_m * Float64(-F)))) / Float64(-B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 * (B_m * -F))) / -B_m;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(2.0 * N[(B$95$m * (-F)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2 \cdot \left(B\_m \cdot \left(-F\right)\right)}}{-B\_m}
\end{array}
Initial program 19.2%
Taylor expanded in A around 0 10.0%
mul-1-neg10.0%
unpow210.0%
unpow210.0%
hypot-define18.7%
Simplified18.7%
associate-*l/18.7%
pow1/218.7%
pow1/218.8%
pow-prod-down18.9%
Applied egg-rr18.9%
unpow1/218.8%
Simplified18.8%
Taylor expanded in C around 0 15.8%
associate-*r*15.8%
mul-1-neg15.8%
Simplified15.8%
Final simplification15.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 (* B_m F))) (- B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 * (B_m * F))) / -B_m;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 * (b_m * f))) / -b_m
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 * (B_m * F))) / -B_m;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 * (B_m * F))) / -B_m
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(2.0 * Float64(B_m * F))) / Float64(-B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 * (B_m * F))) / -B_m;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}
\end{array}
Initial program 19.2%
Taylor expanded in A around 0 10.0%
mul-1-neg10.0%
unpow210.0%
unpow210.0%
hypot-define18.7%
Simplified18.7%
associate-*l/18.7%
pow1/218.7%
pow1/218.8%
pow-prod-down18.9%
Applied egg-rr18.9%
unpow1/218.8%
Simplified18.8%
Taylor expanded in B around -inf 1.6%
Final simplification1.6%
herbie shell --seed 2024096
(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))))