
(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 11 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 (- (sqrt F)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 -2e-180)
(*
(sqrt 2.0)
(*
(sqrt
(/ (+ (+ A C) (hypot B_m (- A C))) (fma -4.0 (* A C) (pow B_m 2.0))))
t_1))
(if (<= t_3 INFINITY)
(/
(*
(sqrt (* 2.0 (* F t_0)))
(sqrt (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(- t_0))
(* (sqrt (/ 2.0 B_m)) t_1)))))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);
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -2e-180) {
tmp = sqrt(2.0) * (sqrt((((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * t_1);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * (F * t_0))) * sqrt(((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / -t_0;
} else {
tmp = sqrt((2.0 / B_m)) * t_1;
}
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(-sqrt(F)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= -2e-180) tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * t_1)); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * t_1); 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[F], $MachinePrecision])}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $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$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e-180], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$1), $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}\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{-180}:\\
\;\;\;\;\sqrt{2} \cdot \left(\sqrt{\frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot t\_1\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot t\_1\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2e-180Initial program 34.5%
Taylor expanded in F around 0 38.7%
mul-1-neg38.7%
*-commutative38.7%
cancel-sign-sub-inv38.7%
metadata-eval38.7%
+-commutative38.7%
Simplified56.2%
pow1/256.2%
associate-/l*65.8%
unpow-prod-down77.1%
pow1/277.1%
associate-+r+76.1%
*-commutative76.1%
Applied egg-rr76.1%
unpow1/276.1%
Simplified76.1%
if -2e-180 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 10.8%
Simplified20.7%
associate-*r*20.7%
associate-+r+19.4%
hypot-undefine10.8%
unpow210.8%
unpow210.8%
+-commutative10.8%
sqrt-prod16.6%
*-commutative16.6%
associate-+l+17.3%
Applied egg-rr35.8%
Taylor expanded in A around -inf 31.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf 14.6%
mul-1-neg14.6%
*-commutative14.6%
Simplified14.6%
*-commutative14.6%
pow1/214.6%
pow1/214.6%
pow-prod-down14.6%
Applied egg-rr14.6%
unpow1/214.6%
Simplified14.6%
Taylor expanded in F around 0 14.6%
associate-*r/14.6%
*-commutative14.6%
associate-/l*14.6%
Simplified14.6%
pow1/214.6%
*-commutative14.6%
unpow-prod-down20.5%
pow1/220.5%
pow1/220.5%
Applied egg-rr20.5%
Final simplification42.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (pow B_m 2.0)))
(t_1 (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 1.7e-190)
(- (sqrt (* 2.0 (* (* F -0.5) (/ 1.0 A)))))
(if (<= B_m 1.6e-125)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) (- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.35e+90)
(*
(sqrt (* F (* 2.0 t_1)))
(/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) (- t_1)))
(if (<= B_m 1.02e+154)
(- (sqrt (* 2.0 (* F (/ (+ (+ A C) (hypot B_m (- A C))) t_0)))))
(- (* (sqrt F) (sqrt (/ 2.0 B_m))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), pow(B_m, 2.0));
double t_1 = fma(B_m, B_m, (-4.0 * (A * C)));
double tmp;
if (B_m <= 1.7e-190) {
tmp = -sqrt((2.0 * ((F * -0.5) * (1.0 / A))));
} else if (B_m <= 1.6e-125) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 1.35e+90) {
tmp = sqrt((F * (2.0 * t_1))) * (sqrt(((A + C) + hypot((A - C), B_m))) / -t_1);
} else if (B_m <= 1.02e+154) {
tmp = -sqrt((2.0 * (F * (((A + C) + hypot(B_m, (A - C))) / t_0))));
} else {
tmp = -(sqrt(F) * 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(-4.0, Float64(A * C), (B_m ^ 2.0)) t_1 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B_m <= 1.7e-190) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * -0.5) * Float64(1.0 / A))))); elseif (B_m <= 1.6e-125) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 1.35e+90) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_1))) * Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / Float64(-t_1))); elseif (B_m <= 1.02e+154) tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / t_0))))); else tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.7e-190], (-N[Sqrt[N[(2.0 * N[(N[(F * -0.5), $MachinePrecision] * N[(1.0 / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 1.6e-125], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.35e+90], N[(N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.02e+154], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;B\_m \leq 1.7 \cdot 10^{-190}:\\
\;\;\;\;-\sqrt{2 \cdot \left(\left(F \cdot -0.5\right) \cdot \frac{1}{A}\right)}\\
\mathbf{elif}\;B\_m \leq 1.6 \cdot 10^{-125}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 1.35 \cdot 10^{+90}:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot t\_1\right)} \cdot \frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 1.02 \cdot 10^{+154}:\\
\;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{t\_0}\right)}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F} \cdot \sqrt{\frac{2}{B\_m}}\\
\end{array}
\end{array}
if B < 1.69999999999999991e-190Initial program 15.8%
Taylor expanded in F around 0 19.2%
mul-1-neg19.2%
*-commutative19.2%
cancel-sign-sub-inv19.2%
metadata-eval19.2%
+-commutative19.2%
Simplified27.7%
Taylor expanded in A around -inf 16.2%
sqrt-unprod16.3%
associate-*r/16.3%
Applied egg-rr16.3%
div-inv16.3%
Applied egg-rr16.3%
if 1.69999999999999991e-190 < B < 1.5999999999999999e-125Initial program 8.1%
Simplified16.9%
Taylor expanded in A around -inf 47.5%
*-commutative47.5%
Simplified47.5%
Taylor expanded in F around 0 47.5%
associate-*r*47.5%
*-commutative47.5%
+-commutative47.5%
unpow247.5%
*-commutative47.5%
associate-*r*47.5%
fma-undefine47.5%
associate-*r*53.9%
*-commutative53.9%
*-commutative53.9%
fma-undefine53.9%
unpow253.9%
associate-*r*53.9%
*-commutative53.9%
+-commutative53.9%
fma-define53.9%
Simplified53.9%
if 1.5999999999999999e-125 < B < 1.35e90Initial program 22.1%
Simplified35.1%
associate-*r*35.1%
associate-+r+34.1%
hypot-undefine22.1%
unpow222.1%
unpow222.1%
+-commutative22.1%
sqrt-prod28.8%
*-commutative28.8%
associate-+l+29.1%
Applied egg-rr48.1%
associate-/l*48.2%
associate-*l*48.2%
associate-*r*48.2%
associate-+r+47.5%
associate-*r*47.5%
Applied egg-rr47.5%
if 1.35e90 < B < 1.02000000000000007e154Initial program 20.8%
Taylor expanded in F around 0 39.0%
mul-1-neg39.0%
*-commutative39.0%
cancel-sign-sub-inv39.0%
metadata-eval39.0%
+-commutative39.0%
Simplified45.9%
*-commutative45.9%
pow1/245.9%
pow1/245.9%
pow-prod-down45.8%
associate-/l*57.7%
associate-+r+57.7%
*-commutative57.7%
Applied egg-rr57.7%
unpow1/257.7%
Simplified57.7%
if 1.02000000000000007e154 < B Initial program 0.0%
Taylor expanded in B around inf 43.6%
mul-1-neg43.6%
*-commutative43.6%
Simplified43.6%
*-commutative43.6%
pow1/243.6%
pow1/243.6%
pow-prod-down43.8%
Applied egg-rr43.8%
unpow1/243.8%
Simplified43.8%
Taylor expanded in F around 0 43.8%
associate-*r/43.8%
*-commutative43.8%
associate-/l*43.8%
Simplified43.8%
pow1/243.8%
*-commutative43.8%
unpow-prod-down66.0%
pow1/266.0%
pow1/266.0%
Applied egg-rr66.0%
Final simplification31.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 8.8e-219)
(- (sqrt (* 2.0 (* (* F -0.5) (/ 1.0 A)))))
(if (<= B_m 1.8e-61)
(/
(*
(sqrt (* 2.0 (* F t_0)))
(sqrt (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(- t_0))
(if (<= B_m 2.5e+153)
(-
(sqrt
(*
2.0
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(- (* (sqrt F) (sqrt (/ 2.0 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 8.8e-219) {
tmp = -sqrt((2.0 * ((F * -0.5) * (1.0 / A))));
} else if (B_m <= 1.8e-61) {
tmp = (sqrt((2.0 * (F * t_0))) * sqrt(((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / -t_0;
} else if (B_m <= 2.5e+153) {
tmp = -sqrt((2.0 * (F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))));
} else {
tmp = -(sqrt(F) * 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))) tmp = 0.0 if (B_m <= 8.8e-219) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * -0.5) * Float64(1.0 / A))))); elseif (B_m <= 1.8e-61) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / Float64(-t_0)); elseif (B_m <= 2.5e+153) tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 8.8e-219], (-N[Sqrt[N[(2.0 * N[(N[(F * -0.5), $MachinePrecision] * N[(1.0 / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 1.8e-61], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 2.5e+153], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 8.8 \cdot 10^{-219}:\\
\;\;\;\;-\sqrt{2 \cdot \left(\left(F \cdot -0.5\right) \cdot \frac{1}{A}\right)}\\
\mathbf{elif}\;B\_m \leq 1.8 \cdot 10^{-61}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 2.5 \cdot 10^{+153}:\\
\;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F} \cdot \sqrt{\frac{2}{B\_m}}\\
\end{array}
\end{array}
if B < 8.7999999999999998e-219Initial program 15.3%
Taylor expanded in F around 0 19.5%
mul-1-neg19.5%
*-commutative19.5%
cancel-sign-sub-inv19.5%
metadata-eval19.5%
+-commutative19.5%
Simplified28.5%
Taylor expanded in A around -inf 16.5%
sqrt-unprod16.5%
associate-*r/16.5%
Applied egg-rr16.5%
div-inv16.5%
Applied egg-rr16.5%
if 8.7999999999999998e-219 < B < 1.80000000000000007e-61Initial program 16.0%
Simplified27.2%
associate-*r*27.2%
associate-+r+25.6%
hypot-undefine16.0%
unpow216.0%
unpow216.0%
+-commutative16.0%
sqrt-prod26.1%
*-commutative26.1%
associate-+l+26.9%
Applied egg-rr45.3%
Taylor expanded in A around -inf 38.6%
if 1.80000000000000007e-61 < B < 2.50000000000000009e153Initial program 23.0%
Taylor expanded in F around 0 25.2%
mul-1-neg25.2%
*-commutative25.2%
cancel-sign-sub-inv25.2%
metadata-eval25.2%
+-commutative25.2%
Simplified31.2%
*-commutative31.2%
pow1/231.2%
pow1/231.2%
pow-prod-down31.3%
associate-/l*41.2%
associate-+r+40.8%
*-commutative40.8%
Applied egg-rr40.8%
unpow1/240.8%
Simplified40.8%
if 2.50000000000000009e153 < B Initial program 0.0%
Taylor expanded in B around inf 43.6%
mul-1-neg43.6%
*-commutative43.6%
Simplified43.6%
*-commutative43.6%
pow1/243.6%
pow1/243.6%
pow-prod-down43.8%
Applied egg-rr43.8%
unpow1/243.8%
Simplified43.8%
Taylor expanded in F around 0 43.8%
associate-*r/43.8%
*-commutative43.8%
associate-/l*43.8%
Simplified43.8%
pow1/243.8%
*-commutative43.8%
unpow-prod-down66.0%
pow1/266.0%
pow1/266.0%
Applied egg-rr66.0%
Final simplification29.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (pow B_m 2.0))))
(if (<= B_m 8.5e-191)
(- (sqrt (* 2.0 (* (* F -0.5) (/ 1.0 A)))))
(if (<= B_m 5.5e-85)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) (- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.25e-57)
(- (sqrt (* 2.0 (/ (* F -0.5) A))))
(if (<= B_m 6.1e+153)
(- (sqrt (* 2.0 (* F (/ (+ (+ A C) (hypot B_m (- A C))) t_0)))))
(- (* (sqrt F) (sqrt (/ 2.0 B_m))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), pow(B_m, 2.0));
double tmp;
if (B_m <= 8.5e-191) {
tmp = -sqrt((2.0 * ((F * -0.5) * (1.0 / A))));
} else if (B_m <= 5.5e-85) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 1.25e-57) {
tmp = -sqrt((2.0 * ((F * -0.5) / A)));
} else if (B_m <= 6.1e+153) {
tmp = -sqrt((2.0 * (F * (((A + C) + hypot(B_m, (A - C))) / t_0))));
} else {
tmp = -(sqrt(F) * 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(-4.0, Float64(A * C), (B_m ^ 2.0)) tmp = 0.0 if (B_m <= 8.5e-191) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * -0.5) * Float64(1.0 / A))))); elseif (B_m <= 5.5e-85) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 1.25e-57) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * -0.5) / A)))); elseif (B_m <= 6.1e+153) tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / t_0))))); else tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 8.5e-191], (-N[Sqrt[N[(2.0 * N[(N[(F * -0.5), $MachinePrecision] * N[(1.0 / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 5.5e-85], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.25e-57], (-N[Sqrt[N[(2.0 * N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 6.1e+153], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)\\
\mathbf{if}\;B\_m \leq 8.5 \cdot 10^{-191}:\\
\;\;\;\;-\sqrt{2 \cdot \left(\left(F \cdot -0.5\right) \cdot \frac{1}{A}\right)}\\
\mathbf{elif}\;B\_m \leq 5.5 \cdot 10^{-85}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 1.25 \cdot 10^{-57}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F \cdot -0.5}{A}}\\
\mathbf{elif}\;B\_m \leq 6.1 \cdot 10^{+153}:\\
\;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{t\_0}\right)}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F} \cdot \sqrt{\frac{2}{B\_m}}\\
\end{array}
\end{array}
if B < 8.49999999999999954e-191Initial program 15.8%
Taylor expanded in F around 0 19.2%
mul-1-neg19.2%
*-commutative19.2%
cancel-sign-sub-inv19.2%
metadata-eval19.2%
+-commutative19.2%
Simplified27.7%
Taylor expanded in A around -inf 16.2%
sqrt-unprod16.3%
associate-*r/16.3%
Applied egg-rr16.3%
div-inv16.3%
Applied egg-rr16.3%
if 8.49999999999999954e-191 < B < 5.4999999999999997e-85Initial program 9.8%
Simplified23.9%
Taylor expanded in A around -inf 41.3%
*-commutative41.3%
Simplified41.3%
Taylor expanded in F around 0 41.3%
associate-*r*41.3%
*-commutative41.3%
+-commutative41.3%
unpow241.3%
*-commutative41.3%
associate-*r*41.3%
fma-undefine41.3%
associate-*r*45.3%
*-commutative45.3%
*-commutative45.3%
fma-undefine45.3%
unpow245.3%
associate-*r*45.3%
*-commutative45.3%
+-commutative45.3%
fma-define45.3%
Simplified45.3%
if 5.4999999999999997e-85 < B < 1.25e-57Initial program 24.7%
Taylor expanded in F around 0 24.2%
mul-1-neg24.2%
*-commutative24.2%
cancel-sign-sub-inv24.2%
metadata-eval24.2%
+-commutative24.2%
Simplified36.9%
Taylor expanded in A around -inf 34.5%
sqrt-unprod34.9%
associate-*r/34.9%
Applied egg-rr34.9%
if 1.25e-57 < B < 6.0999999999999998e153Initial program 23.5%
Taylor expanded in F around 0 25.7%
mul-1-neg25.7%
*-commutative25.7%
cancel-sign-sub-inv25.7%
metadata-eval25.7%
+-commutative25.7%
Simplified31.9%
*-commutative31.9%
pow1/231.9%
pow1/231.9%
pow-prod-down32.0%
associate-/l*39.7%
associate-+r+39.3%
*-commutative39.3%
Applied egg-rr39.3%
unpow1/239.3%
Simplified39.3%
if 6.0999999999999998e153 < B Initial program 0.0%
Taylor expanded in B around inf 43.6%
mul-1-neg43.6%
*-commutative43.6%
Simplified43.6%
*-commutative43.6%
pow1/243.6%
pow1/243.6%
pow-prod-down43.8%
Applied egg-rr43.8%
unpow1/243.8%
Simplified43.8%
Taylor expanded in F around 0 43.8%
associate-*r/43.8%
*-commutative43.8%
associate-/l*43.8%
Simplified43.8%
pow1/243.8%
*-commutative43.8%
unpow-prod-down66.0%
pow1/266.0%
pow1/266.0%
Applied egg-rr66.0%
Final simplification29.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 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 9e-219)
(- (sqrt (* 2.0 (* (* F -0.5) (/ 1.0 A)))))
(if (<= B_m 1.02e-39)
(/ (* (sqrt (* 2.0 (* F t_0))) (sqrt (* 2.0 C))) (- t_0))
(if (<= B_m 4.4e+153)
(-
(sqrt
(*
2.0
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(- (* (sqrt F) (sqrt (/ 2.0 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 9e-219) {
tmp = -sqrt((2.0 * ((F * -0.5) * (1.0 / A))));
} else if (B_m <= 1.02e-39) {
tmp = (sqrt((2.0 * (F * t_0))) * sqrt((2.0 * C))) / -t_0;
} else if (B_m <= 4.4e+153) {
tmp = -sqrt((2.0 * (F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))));
} else {
tmp = -(sqrt(F) * 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))) tmp = 0.0 if (B_m <= 9e-219) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * -0.5) * Float64(1.0 / A))))); elseif (B_m <= 1.02e-39) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(2.0 * C))) / Float64(-t_0)); elseif (B_m <= 4.4e+153) tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 9e-219], (-N[Sqrt[N[(2.0 * N[(N[(F * -0.5), $MachinePrecision] * N[(1.0 / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 1.02e-39], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 4.4e+153], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), (-N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 9 \cdot 10^{-219}:\\
\;\;\;\;-\sqrt{2 \cdot \left(\left(F \cdot -0.5\right) \cdot \frac{1}{A}\right)}\\
\mathbf{elif}\;B\_m \leq 1.02 \cdot 10^{-39}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{2 \cdot C}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 4.4 \cdot 10^{+153}:\\
\;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F} \cdot \sqrt{\frac{2}{B\_m}}\\
\end{array}
\end{array}
if B < 9.00000000000000029e-219Initial program 15.3%
Taylor expanded in F around 0 19.5%
mul-1-neg19.5%
*-commutative19.5%
cancel-sign-sub-inv19.5%
metadata-eval19.5%
+-commutative19.5%
Simplified28.5%
Taylor expanded in A around -inf 16.5%
sqrt-unprod16.5%
associate-*r/16.5%
Applied egg-rr16.5%
div-inv16.5%
Applied egg-rr16.5%
if 9.00000000000000029e-219 < B < 1.02000000000000007e-39Initial program 17.0%
Simplified29.3%
associate-*r*29.3%
associate-+r+27.8%
hypot-undefine17.0%
unpow217.0%
unpow217.0%
+-commutative17.0%
sqrt-prod26.1%
*-commutative26.1%
associate-+l+26.9%
Applied egg-rr45.7%
Taylor expanded in A around -inf 37.4%
if 1.02000000000000007e-39 < B < 4.3999999999999999e153Initial program 22.6%
Taylor expanded in F around 0 27.7%
mul-1-neg27.7%
*-commutative27.7%
cancel-sign-sub-inv27.7%
metadata-eval27.7%
+-commutative27.7%
Simplified34.4%
*-commutative34.4%
pow1/234.4%
pow1/234.4%
pow-prod-down34.5%
associate-/l*42.7%
associate-+r+42.3%
*-commutative42.3%
Applied egg-rr42.3%
unpow1/242.3%
Simplified42.3%
if 4.3999999999999999e153 < B Initial program 0.0%
Taylor expanded in B around inf 43.6%
mul-1-neg43.6%
*-commutative43.6%
Simplified43.6%
*-commutative43.6%
pow1/243.6%
pow1/243.6%
pow-prod-down43.8%
Applied egg-rr43.8%
unpow1/243.8%
Simplified43.8%
Taylor expanded in F around 0 43.8%
associate-*r/43.8%
*-commutative43.8%
associate-/l*43.8%
Simplified43.8%
pow1/243.8%
*-commutative43.8%
unpow-prod-down66.0%
pow1/266.0%
pow1/266.0%
Applied egg-rr66.0%
Final simplification29.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1.16e-57)
(- (sqrt (/ (- F) A)))
(if (<= B_m 7.6e+153)
(-
(sqrt
(*
2.0
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.16e-57) {
tmp = -sqrt((-F / A));
} else if (B_m <= 7.6e+153) {
tmp = -sqrt((2.0 * (F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.16e-57) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); elseif (B_m <= 7.6e+153) tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.16e-57], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 7.6e+153], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.16 \cdot 10^{-57}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;B\_m \leq 7.6 \cdot 10^{+153}:\\
\;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 1.15999999999999996e-57Initial program 15.4%
Taylor expanded in F around 0 18.2%
mul-1-neg18.2%
*-commutative18.2%
cancel-sign-sub-inv18.2%
metadata-eval18.2%
+-commutative18.2%
Simplified26.5%
Taylor expanded in A around -inf 17.8%
sqrt-unprod17.9%
associate-*r/17.9%
Applied egg-rr17.9%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
Simplified17.9%
if 1.15999999999999996e-57 < B < 7.59999999999999933e153Initial program 23.5%
Taylor expanded in F around 0 25.7%
mul-1-neg25.7%
*-commutative25.7%
cancel-sign-sub-inv25.7%
metadata-eval25.7%
+-commutative25.7%
Simplified31.9%
*-commutative31.9%
pow1/231.9%
pow1/231.9%
pow-prod-down32.0%
associate-/l*39.7%
associate-+r+39.3%
*-commutative39.3%
Applied egg-rr39.3%
unpow1/239.3%
Simplified39.3%
if 7.59999999999999933e153 < B Initial program 0.0%
Taylor expanded in B around inf 43.6%
mul-1-neg43.6%
*-commutative43.6%
Simplified43.6%
*-commutative43.6%
pow1/243.6%
pow1/243.6%
pow-prod-down43.8%
Applied egg-rr43.8%
unpow1/243.8%
Simplified43.8%
Taylor expanded in F around 0 43.8%
associate-*r/43.8%
*-commutative43.8%
associate-/l*43.8%
Simplified43.8%
pow1/243.8%
*-commutative43.8%
unpow-prod-down66.0%
pow1/266.0%
pow1/266.0%
Applied egg-rr66.0%
Final simplification26.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.5e+95) (- (sqrt (/ (- F) A))) (* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.5e+95) {
tmp = -sqrt((-F / A));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
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.5d+95) then
tmp = -sqrt((-f / a))
else
tmp = sqrt((2.0d0 / b_m)) * -sqrt(f)
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.5e+95) {
tmp = -Math.sqrt((-F / A));
} else {
tmp = Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.5e+95: tmp = -math.sqrt((-F / A)) else: tmp = math.sqrt((2.0 / B_m)) * -math.sqrt(F) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.5e+95) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.5e+95)
tmp = -sqrt((-F / A));
else
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.5e+95], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.5 \cdot 10^{+95}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 3.5e95Initial program 16.4%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
*-commutative17.9%
cancel-sign-sub-inv17.9%
metadata-eval17.9%
+-commutative17.9%
Simplified25.9%
Taylor expanded in A around -inf 18.5%
sqrt-unprod18.6%
associate-*r/18.6%
Applied egg-rr18.6%
Taylor expanded in F around 0 18.6%
mul-1-neg18.6%
Simplified18.6%
if 3.5e95 < B Initial program 7.4%
Taylor expanded in B around inf 45.7%
mul-1-neg45.7%
*-commutative45.7%
Simplified45.7%
*-commutative45.7%
pow1/245.7%
pow1/245.7%
pow-prod-down45.8%
Applied egg-rr45.8%
unpow1/245.8%
Simplified45.8%
Taylor expanded in F around 0 45.8%
associate-*r/45.8%
*-commutative45.8%
associate-/l*45.8%
Simplified45.8%
pow1/245.8%
*-commutative45.8%
unpow-prod-down62.7%
pow1/262.7%
pow1/262.7%
Applied egg-rr62.7%
Final simplification26.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 4e+95) (- (sqrt (/ (- F) A))) (- (sqrt (* 2.0 (/ 1.0 (/ B_m F)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4e+95) {
tmp = -sqrt((-F / A));
} else {
tmp = -sqrt((2.0 * (1.0 / (B_m / F))));
}
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 <= 4d+95) then
tmp = -sqrt((-f / a))
else
tmp = -sqrt((2.0d0 * (1.0d0 / (b_m / f))))
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 <= 4e+95) {
tmp = -Math.sqrt((-F / A));
} else {
tmp = -Math.sqrt((2.0 * (1.0 / (B_m / F))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4e+95: tmp = -math.sqrt((-F / A)) else: tmp = -math.sqrt((2.0 * (1.0 / (B_m / F)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4e+95) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); else tmp = Float64(-sqrt(Float64(2.0 * Float64(1.0 / Float64(B_m / F))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4e+95)
tmp = -sqrt((-F / A));
else
tmp = -sqrt((2.0 * (1.0 / (B_m / F))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4e+95], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[(1.0 / N[(B$95$m / F), $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 \leq 4 \cdot 10^{+95}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{1}{\frac{B\_m}{F}}}\\
\end{array}
\end{array}
if B < 4.00000000000000008e95Initial program 16.4%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
*-commutative17.9%
cancel-sign-sub-inv17.9%
metadata-eval17.9%
+-commutative17.9%
Simplified25.9%
Taylor expanded in A around -inf 18.5%
sqrt-unprod18.6%
associate-*r/18.6%
Applied egg-rr18.6%
Taylor expanded in F around 0 18.6%
mul-1-neg18.6%
Simplified18.6%
if 4.00000000000000008e95 < B Initial program 7.4%
Taylor expanded in B around inf 45.7%
mul-1-neg45.7%
*-commutative45.7%
Simplified45.7%
*-commutative45.7%
pow1/245.7%
pow1/245.7%
pow-prod-down45.8%
Applied egg-rr45.8%
unpow1/245.8%
Simplified45.8%
clear-num45.8%
inv-pow45.8%
Applied egg-rr45.8%
unpow-145.8%
Simplified45.8%
Final simplification23.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 4.1e+95) (- (sqrt (/ (- F) A))) (- (sqrt (* 2.0 (/ F B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.1e+95) {
tmp = -sqrt((-F / A));
} else {
tmp = -sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 4.1d+95) then
tmp = -sqrt((-f / a))
else
tmp = -sqrt((2.0d0 * (f / b_m)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.1e+95) {
tmp = -Math.sqrt((-F / A));
} else {
tmp = -Math.sqrt((2.0 * (F / B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4.1e+95: tmp = -math.sqrt((-F / A)) else: tmp = -math.sqrt((2.0 * (F / B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.1e+95) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); else tmp = Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4.1e+95)
tmp = -sqrt((-F / A));
else
tmp = -sqrt((2.0 * (F / B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.1e+95], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.1 \cdot 10^{+95}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if B < 4.09999999999999986e95Initial program 16.4%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
*-commutative17.9%
cancel-sign-sub-inv17.9%
metadata-eval17.9%
+-commutative17.9%
Simplified25.9%
Taylor expanded in A around -inf 18.5%
sqrt-unprod18.6%
associate-*r/18.6%
Applied egg-rr18.6%
Taylor expanded in F around 0 18.6%
mul-1-neg18.6%
Simplified18.6%
if 4.09999999999999986e95 < B Initial program 7.4%
Taylor expanded in B around inf 45.7%
mul-1-neg45.7%
*-commutative45.7%
Simplified45.7%
*-commutative45.7%
pow1/245.7%
pow1/245.7%
pow-prod-down45.8%
Applied egg-rr45.8%
unpow1/245.8%
Simplified45.8%
Final simplification23.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3e+95) (- (sqrt (/ (- F) A))) (- (sqrt (* F (/ 2.0 B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3e+95) {
tmp = -sqrt((-F / A));
} else {
tmp = -sqrt((F * (2.0 / 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 <= 3d+95) then
tmp = -sqrt((-f / a))
else
tmp = -sqrt((f * (2.0d0 / 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 <= 3e+95) {
tmp = -Math.sqrt((-F / A));
} else {
tmp = -Math.sqrt((F * (2.0 / B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3e+95: tmp = -math.sqrt((-F / A)) else: tmp = -math.sqrt((F * (2.0 / B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3e+95) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); else tmp = Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3e+95)
tmp = -sqrt((-F / A));
else
tmp = -sqrt((F * (2.0 / B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3e+95], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3 \cdot 10^{+95}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2}{B\_m}}\\
\end{array}
\end{array}
if B < 2.99999999999999991e95Initial program 16.4%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
*-commutative17.9%
cancel-sign-sub-inv17.9%
metadata-eval17.9%
+-commutative17.9%
Simplified25.9%
Taylor expanded in A around -inf 18.5%
sqrt-unprod18.6%
associate-*r/18.6%
Applied egg-rr18.6%
Taylor expanded in F around 0 18.6%
mul-1-neg18.6%
Simplified18.6%
if 2.99999999999999991e95 < B Initial program 7.4%
Taylor expanded in B around inf 45.7%
mul-1-neg45.7%
*-commutative45.7%
Simplified45.7%
*-commutative45.7%
pow1/245.7%
pow1/245.7%
pow-prod-down45.8%
Applied egg-rr45.8%
unpow1/245.8%
Simplified45.8%
Taylor expanded in F around 0 45.8%
associate-*r/45.8%
*-commutative45.8%
associate-/l*45.8%
Simplified45.8%
Final simplification23.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 (- (sqrt (/ (- F) A))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((-F / A));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((-f / a))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((-F / A));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((-F / A))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(Float64(-F) / A))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((-F / A));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{-F}{A}}
\end{array}
Initial program 14.8%
Taylor expanded in F around 0 17.2%
mul-1-neg17.2%
*-commutative17.2%
cancel-sign-sub-inv17.2%
metadata-eval17.2%
+-commutative17.2%
Simplified24.6%
Taylor expanded in A around -inf 16.7%
sqrt-unprod16.8%
associate-*r/16.8%
Applied egg-rr16.8%
Taylor expanded in F around 0 16.9%
mul-1-neg16.9%
Simplified16.9%
Final simplification16.9%
herbie shell --seed 2024139
(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))))