
(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 20 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 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0))))
(t_3 (* (sqrt F) (sqrt (* 2.0 (fma B_m B_m (* (* A C) -4.0)))))))
(if (<= t_2 -5e-169)
(/ (* t_3 (sqrt (+ A (+ C (hypot (- A C) B_m))))) (- t_0))
(if (<= t_2 0.0)
(/
(* t_3 (sqrt (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(- (pow (cbrt t_0) 3.0)))
(if (<= t_2 INFINITY)
(* (sqrt (* F (* 2.0 t_0))) (/ (- (sqrt (* 2.0 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(B_m, B_m, (A * (C * -4.0)));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double t_3 = sqrt(F) * sqrt((2.0 * fma(B_m, B_m, ((A * C) * -4.0))));
double tmp;
if (t_2 <= -5e-169) {
tmp = (t_3 * sqrt((A + (C + hypot((A - C), B_m))))) / -t_0;
} else if (t_2 <= 0.0) {
tmp = (t_3 * sqrt(((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / -pow(cbrt(t_0), 3.0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((F * (2.0 * t_0))) * (-sqrt((2.0 * 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(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = Float64(sqrt(F) * sqrt(Float64(2.0 * fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))) tmp = 0.0 if (t_2 <= -5e-169) tmp = Float64(Float64(t_3 * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-t_0)); elseif (t_2 <= 0.0) tmp = Float64(Float64(t_3 * sqrt(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / Float64(-(cbrt(t_0) ^ 3.0))); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * Float64(Float64(-sqrt(Float64(2.0 * C))) / t_0)); else tmp = Float64(sqrt(F) * Float64(-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]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $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$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-169], N[(N[(t$95$3 * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[(t$95$3 * 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] / (-N[Power[N[Power[t$95$0, 1/3], $MachinePrecision], 3.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]) / t$95$0), $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)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \sqrt{F} \cdot \sqrt{2 \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-169}:\\
\;\;\;\;\frac{t\_3 \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{t\_3 \cdot \sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C}}{-{\left(\sqrt[3]{t\_0}\right)}^{3}}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \frac{-\sqrt{2 \cdot C}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-169Initial program 46.8%
Simplified54.9%
associate-*r*54.9%
associate-+r+54.3%
hypot-undefine46.8%
unpow246.8%
unpow246.8%
+-commutative46.8%
sqrt-prod56.0%
*-commutative56.0%
associate-+l+56.0%
Applied egg-rr74.8%
pow1/274.8%
associate-*l*74.8%
unpow-prod-down86.2%
pow1/286.2%
associate-*r*86.2%
Applied egg-rr86.2%
unpow1/286.2%
Simplified86.2%
if -5.0000000000000002e-169 < (/.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))) < -0.0Initial program 3.5%
Simplified5.5%
associate-*r*5.5%
associate-+r+3.5%
hypot-undefine3.5%
unpow23.5%
unpow23.5%
+-commutative3.5%
sqrt-prod2.3%
*-commutative2.3%
associate-+l+3.1%
Applied egg-rr3.1%
pow1/23.1%
associate-*l*3.1%
unpow-prod-down21.6%
pow1/221.6%
associate-*r*21.6%
Applied egg-rr21.6%
unpow1/221.6%
Simplified21.6%
add-cube-cbrt21.3%
pow321.3%
Applied egg-rr21.3%
Taylor expanded in A around -inf 37.4%
if -0.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))) < +inf.0Initial program 31.1%
Simplified53.0%
associate-*r*53.0%
associate-+r+52.9%
hypot-undefine31.1%
unpow231.1%
unpow231.1%
+-commutative31.1%
sqrt-prod29.6%
*-commutative29.6%
associate-+l+29.6%
Applied egg-rr72.9%
Taylor expanded in A around -inf 43.3%
associate-/l*43.4%
associate-*l*43.4%
associate-*r*43.4%
*-commutative43.4%
associate-*r*43.4%
sqrt-unprod43.4%
Applied egg-rr43.4%
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 19.8%
mul-1-neg19.8%
*-commutative19.8%
Simplified19.8%
*-commutative19.8%
pow1/219.9%
pow1/219.9%
pow-prod-down20.0%
Applied egg-rr20.0%
unpow1/219.9%
Simplified19.9%
Taylor expanded in F around 0 19.9%
*-commutative19.9%
associate-*l/19.9%
associate-/l*19.9%
Simplified19.9%
*-commutative19.9%
sqrt-prod26.5%
Applied egg-rr26.5%
Final simplification51.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
(let* ((t_0 (hypot (- A C) B_m))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (- t_1))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 -5e-169)
(/
(*
(* (sqrt F) (sqrt (* 2.0 (fma B_m B_m (* (* A C) -4.0)))))
(sqrt (+ A (+ C t_0))))
t_2)
(if (<= t_4 5e+195)
(/ (sqrt (* (* F t_1) (- (* 4.0 C) (/ (pow B_m 2.0) A)))) t_2)
(if (<= t_4 INFINITY)
(pow
(/ t_1 (* (sqrt (* F (* 2.0 t_1))) (- (sqrt (+ (+ A C) t_0)))))
-1.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 = hypot((A - C), B_m);
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = -t_1;
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= -5e-169) {
tmp = ((sqrt(F) * sqrt((2.0 * fma(B_m, B_m, ((A * C) * -4.0))))) * sqrt((A + (C + t_0)))) / t_2;
} else if (t_4 <= 5e+195) {
tmp = sqrt(((F * t_1) * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / t_2;
} else if (t_4 <= ((double) INFINITY)) {
tmp = pow((t_1 / (sqrt((F * (2.0 * t_1))) * -sqrt(((A + C) + t_0)))), -1.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 = hypot(Float64(A - C), B_m) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(-t_1) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= -5e-169) tmp = Float64(Float64(Float64(sqrt(F) * sqrt(Float64(2.0 * fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))) * sqrt(Float64(A + Float64(C + t_0)))) / t_2); elseif (t_4 <= 5e+195) tmp = Float64(sqrt(Float64(Float64(F * t_1) * Float64(Float64(4.0 * C) - Float64((B_m ^ 2.0) / A)))) / t_2); elseif (t_4 <= Inf) tmp = Float64(t_1 / Float64(sqrt(Float64(F * Float64(2.0 * t_1))) * Float64(-sqrt(Float64(Float64(A + C) + t_0))))) ^ -1.0; else tmp = Float64(sqrt(F) * Float64(-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[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $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$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -5e-169], N[(N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(A + N[(C + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, 5e+195], N[(N[Sqrt[N[(N[(F * t$95$1), $MachinePrecision] * N[(N[(4.0 * C), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Power[N[(t$95$1 / N[(N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(N[(A + C), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], -1.0], $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{hypot}\left(A - C, B\_m\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := -t\_1\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq -5 \cdot 10^{-169}:\\
\;\;\;\;\frac{\left(\sqrt{F} \cdot \sqrt{2 \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)}\right) \cdot \sqrt{A + \left(C + t\_0\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq 5 \cdot 10^{+195}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_1\right) \cdot \left(4 \cdot C - \frac{{B\_m}^{2}}{A}\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;{\left(\frac{t\_1}{\sqrt{F \cdot \left(2 \cdot t\_1\right)} \cdot \left(-\sqrt{\left(A + C\right) + t\_0}\right)}\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-169Initial program 46.8%
Simplified54.9%
associate-*r*54.9%
associate-+r+54.3%
hypot-undefine46.8%
unpow246.8%
unpow246.8%
+-commutative46.8%
sqrt-prod56.0%
*-commutative56.0%
associate-+l+56.0%
Applied egg-rr74.8%
pow1/274.8%
associate-*l*74.8%
unpow-prod-down86.2%
pow1/286.2%
associate-*r*86.2%
Applied egg-rr86.2%
unpow1/286.2%
Simplified86.2%
if -5.0000000000000002e-169 < (/.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))) < 4.9999999999999998e195Initial program 15.7%
Simplified17.5%
Taylor expanded in A around -inf 44.1%
if 4.9999999999999998e195 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 3.9%
Simplified36.0%
associate-*r*36.0%
associate-+r+36.0%
hypot-undefine3.9%
unpow23.9%
unpow23.9%
+-commutative3.9%
sqrt-prod10.4%
*-commutative10.4%
associate-+l+10.4%
Applied egg-rr73.9%
pow1/273.9%
associate-*l*73.9%
unpow-prod-down0.0%
pow1/20.0%
associate-*r*0.0%
Applied egg-rr0.0%
unpow1/20.0%
Simplified0.0%
clear-num0.0%
inv-pow0.0%
sqrt-unprod74.0%
*-commutative74.0%
associate-*r*74.0%
associate-+r+74.0%
Applied egg-rr74.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf 19.8%
mul-1-neg19.8%
*-commutative19.8%
Simplified19.8%
*-commutative19.8%
pow1/219.9%
pow1/219.9%
pow-prod-down20.0%
Applied egg-rr20.0%
unpow1/219.9%
Simplified19.9%
Taylor expanded in F around 0 19.9%
*-commutative19.9%
associate-*l/19.9%
associate-/l*19.9%
Simplified19.9%
*-commutative19.9%
sqrt-prod26.5%
Applied egg-rr26.5%
Final simplification54.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-207)
(/ -1.0 (/ t_0 (* (sqrt (* F (* 2.0 t_0))) (sqrt (* 2.0 C)))))
(if (<= (pow B_m 2.0) 4e+289)
(/
(*
(* (sqrt F) (sqrt (* 2.0 (fma B_m B_m (* (* A C) -4.0)))))
(sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- 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(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-207) {
tmp = -1.0 / (t_0 / (sqrt((F * (2.0 * t_0))) * sqrt((2.0 * C))));
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = ((sqrt(F) * sqrt((2.0 * fma(B_m, B_m, ((A * C) * -4.0))))) * sqrt((A + (C + hypot((A - C), B_m))))) / -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(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-207) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * sqrt(Float64(2.0 * C))))); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(Float64(Float64(sqrt(F) * sqrt(Float64(2.0 * fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-t_0)); else tmp = Float64(sqrt(F) * Float64(-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[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-207], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $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}^{2} \leq 10^{-207}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \sqrt{2 \cdot C}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\frac{\left(\sqrt{F} \cdot \sqrt{2 \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)}\right) \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999925e-208Initial program 21.8%
Simplified30.1%
associate-*r*30.1%
associate-+r+28.9%
hypot-undefine21.8%
unpow221.8%
unpow221.8%
+-commutative21.8%
sqrt-prod22.3%
*-commutative22.3%
associate-+l+22.8%
Applied egg-rr34.9%
Taylor expanded in A around -inf 23.7%
clear-num23.7%
inv-pow23.7%
associate-*l*23.7%
associate-*r*23.7%
*-commutative23.7%
associate-*r*23.7%
sqrt-unprod23.8%
Applied egg-rr23.8%
unpow-123.8%
Simplified23.8%
if 9.99999999999999925e-208 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 29.3%
Simplified35.4%
associate-*r*35.4%
associate-+r+34.8%
hypot-undefine29.3%
unpow229.3%
unpow229.3%
+-commutative29.3%
sqrt-prod34.9%
*-commutative34.9%
associate-+l+34.9%
Applied egg-rr49.6%
pow1/249.6%
associate-*l*49.6%
unpow-prod-down52.7%
pow1/252.7%
associate-*r*52.7%
Applied egg-rr52.7%
unpow1/252.7%
Simplified52.7%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification41.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0))) (t_1 (- (sqrt 2.0))))
(if (<= (pow B_m 2.0) 2e-216)
(/
(* (* (sqrt F) (sqrt (* 2.0 t_0))) (* (sqrt C) t_1))
(fma B_m B_m (* A (* C -4.0))))
(if (<= (pow B_m 2.0) 1e+139)
(*
(sqrt (* t_0 (* 2.0 F)))
(/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) (- t_0)))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))
t_1)
(* (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 t_1 = -sqrt(2.0);
double tmp;
if (pow(B_m, 2.0) <= 2e-216) {
tmp = ((sqrt(F) * sqrt((2.0 * t_0))) * (sqrt(C) * t_1)) / fma(B_m, B_m, (A * (C * -4.0)));
} else if (pow(B_m, 2.0) <= 1e+139) {
tmp = sqrt((t_0 * (2.0 * F))) * (sqrt(((A + C) + hypot((A - C), B_m))) / -t_0);
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt((F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * t_1;
} 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(Float64(A * C) * -4.0)) t_1 = Float64(-sqrt(2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-216) tmp = Float64(Float64(Float64(sqrt(F) * sqrt(Float64(2.0 * t_0))) * Float64(sqrt(C) * t_1)) / fma(B_m, B_m, Float64(A * Float64(C * -4.0)))); elseif ((B_m ^ 2.0) <= 1e+139) tmp = Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) * Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / Float64(-t_0))); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * t_1); else tmp = Float64(sqrt(F) * Float64(-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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-216], N[(N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+139], N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $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$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[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] * t$95$1), $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, \left(A \cdot C\right) \cdot -4\right)\\
t_1 := -\sqrt{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\left(\sqrt{F} \cdot \sqrt{2 \cdot t\_0}\right) \cdot \left(\sqrt{C} \cdot t\_1\right)}{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+139}:\\
\;\;\;\;\sqrt{t\_0 \cdot \left(2 \cdot F\right)} \cdot \frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{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)}} \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-216Initial program 21.0%
Simplified29.6%
associate-*r*29.6%
associate-+r+28.3%
hypot-undefine21.0%
unpow221.0%
unpow221.0%
+-commutative21.0%
sqrt-prod21.6%
*-commutative21.6%
associate-+l+22.0%
Applied egg-rr33.4%
pow1/233.4%
associate-*l*33.4%
unpow-prod-down32.0%
pow1/232.0%
associate-*r*32.0%
Applied egg-rr32.0%
unpow1/232.0%
Simplified32.0%
Taylor expanded in A around -inf 23.8%
if 2.0000000000000001e-216 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000003e139Initial program 33.7%
Simplified39.7%
associate-*r*39.7%
associate-+r+38.9%
hypot-undefine33.7%
unpow233.7%
unpow233.7%
+-commutative33.7%
sqrt-prod36.6%
*-commutative36.6%
associate-+l+36.6%
Applied egg-rr49.7%
associate-/l*49.8%
*-commutative49.8%
associate-*r*49.8%
associate-+r+49.8%
+-commutative49.8%
associate-*r*49.8%
Applied egg-rr49.8%
associate-*r*49.8%
Simplified49.8%
if 1.00000000000000003e139 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 20.0%
Taylor expanded in F around 0 33.8%
mul-1-neg33.8%
*-commutative33.8%
cancel-sign-sub-inv33.8%
metadata-eval33.8%
+-commutative33.8%
associate-/l*39.5%
Simplified69.8%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification42.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0)))
(t_1 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-207)
(/ -1.0 (/ t_1 (* (sqrt (* F (* 2.0 t_1))) (sqrt (* 2.0 C)))))
(if (<= (pow B_m 2.0) 1e+139)
(*
(sqrt (* t_0 (* 2.0 F)))
(/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) (- t_0)))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 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 t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-207) {
tmp = -1.0 / (t_1 / (sqrt((F * (2.0 * t_1))) * sqrt((2.0 * C))));
} else if (pow(B_m, 2.0) <= 1e+139) {
tmp = sqrt((t_0 * (2.0 * F))) * (sqrt(((A + C) + hypot((A - C), B_m))) / -t_0);
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt((F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else {
tmp = sqrt(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(Float64(A * C) * -4.0)) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-207) tmp = Float64(-1.0 / Float64(t_1 / Float64(sqrt(Float64(F * Float64(2.0 * t_1))) * sqrt(Float64(2.0 * C))))); elseif ((B_m ^ 2.0) <= 1e+139) tmp = Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) * Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / Float64(-t_0))); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(F) * Float64(-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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-207], N[(-1.0 / N[(t$95$1 / N[(N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+139], N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $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$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[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] * (-N[Sqrt[2.0], $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, \left(A \cdot C\right) \cdot -4\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-207}:\\
\;\;\;\;\frac{-1}{\frac{t\_1}{\sqrt{F \cdot \left(2 \cdot t\_1\right)} \cdot \sqrt{2 \cdot C}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+139}:\\
\;\;\;\;\sqrt{t\_0 \cdot \left(2 \cdot F\right)} \cdot \frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{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)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999925e-208Initial program 21.8%
Simplified30.1%
associate-*r*30.1%
associate-+r+28.9%
hypot-undefine21.8%
unpow221.8%
unpow221.8%
+-commutative21.8%
sqrt-prod22.3%
*-commutative22.3%
associate-+l+22.8%
Applied egg-rr34.9%
Taylor expanded in A around -inf 23.7%
clear-num23.7%
inv-pow23.7%
associate-*l*23.7%
associate-*r*23.7%
*-commutative23.7%
associate-*r*23.7%
sqrt-unprod23.8%
Applied egg-rr23.8%
unpow-123.8%
Simplified23.8%
if 9.99999999999999925e-208 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000003e139Initial program 33.2%
Simplified39.4%
associate-*r*39.4%
associate-+r+38.5%
hypot-undefine33.2%
unpow233.2%
unpow233.2%
+-commutative33.2%
sqrt-prod36.2%
*-commutative36.2%
associate-+l+36.2%
Applied egg-rr48.4%
associate-/l*48.5%
*-commutative48.5%
associate-*r*48.5%
associate-+r+48.5%
+-commutative48.5%
associate-*r*48.5%
Applied egg-rr48.5%
associate-*r*48.5%
Simplified48.5%
if 1.00000000000000003e139 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 20.0%
Taylor expanded in F around 0 33.8%
mul-1-neg33.8%
*-commutative33.8%
cancel-sign-sub-inv33.8%
metadata-eval33.8%
+-commutative33.8%
associate-/l*39.5%
Simplified69.8%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification42.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-138)
(/ -1.0 (/ t_0 (* (sqrt (* F (* 2.0 t_0))) (sqrt (* 2.0 C)))))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 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 (pow(B_m, 2.0) <= 4e-138) {
tmp = -1.0 / (t_0 / (sqrt((F * (2.0 * t_0))) * sqrt((2.0 * C))));
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt((F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else {
tmp = sqrt(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 ^ 2.0) <= 4e-138) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * sqrt(Float64(2.0 * C))))); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(F) * Float64(-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[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-138], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[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] * (-N[Sqrt[2.0], $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}^{2} \leq 4 \cdot 10^{-138}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \sqrt{2 \cdot C}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{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)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000027e-138Initial program 25.2%
Simplified33.7%
associate-*r*33.7%
associate-+r+32.4%
hypot-undefine25.2%
unpow225.2%
unpow225.2%
+-commutative25.2%
sqrt-prod25.6%
*-commutative25.6%
associate-+l+26.0%
Applied egg-rr39.4%
Taylor expanded in A around -inf 23.7%
clear-num23.7%
inv-pow23.7%
associate-*l*23.7%
associate-*r*23.7%
*-commutative23.7%
associate-*r*23.7%
sqrt-unprod23.7%
Applied egg-rr23.7%
unpow-123.7%
Simplified23.7%
if 4.00000000000000027e-138 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 26.8%
Taylor expanded in F around 0 30.7%
mul-1-neg30.7%
*-commutative30.7%
cancel-sign-sub-inv30.7%
metadata-eval30.7%
+-commutative30.7%
associate-/l*33.6%
Simplified48.5%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification38.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-138)
(/ -1.0 (/ t_0 (* (sqrt (* F (* 2.0 t_0))) (sqrt (* 2.0 C)))))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(/
(* F (+ (+ A C) (hypot B_m (- A C))))
(+ (pow B_m 2.0) (* (* A C) -4.0))))
(- (sqrt 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 (pow(B_m, 2.0) <= 4e-138) {
tmp = -1.0 / (t_0 / (sqrt((F * (2.0 * t_0))) * sqrt((2.0 * C))));
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt(((F * ((A + C) + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + ((A * C) * -4.0)))) * -sqrt(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 ^ 2.0) <= 4e-138) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * sqrt(Float64(2.0 * C))))); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(F) * Float64(-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[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-138], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $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}^{2} \leq 4 \cdot 10^{-138}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \sqrt{2 \cdot C}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + \left(A \cdot C\right) \cdot -4}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000027e-138Initial program 25.2%
Simplified33.7%
associate-*r*33.7%
associate-+r+32.4%
hypot-undefine25.2%
unpow225.2%
unpow225.2%
+-commutative25.2%
sqrt-prod25.6%
*-commutative25.6%
associate-+l+26.0%
Applied egg-rr39.4%
Taylor expanded in A around -inf 23.7%
clear-num23.7%
inv-pow23.7%
associate-*l*23.7%
associate-*r*23.7%
*-commutative23.7%
associate-*r*23.7%
sqrt-unprod23.7%
Applied egg-rr23.7%
unpow-123.7%
Simplified23.7%
if 4.00000000000000027e-138 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 26.8%
add-cbrt-cube18.7%
pow318.7%
unpow218.7%
unpow218.7%
hypot-define18.7%
Applied egg-rr18.7%
Taylor expanded in F around 0 30.7%
mul-1-neg30.7%
associate-+r+30.7%
unpow230.7%
unpow230.7%
hypot-undefine40.6%
cancel-sign-sub-inv40.6%
metadata-eval40.6%
Simplified40.6%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification35.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-138)
(/ (* (sqrt (* 2.0 C)) (sqrt (* 2.0 (* F t_0)))) (- t_0))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(/
(* F (+ (+ A C) (hypot B_m (- A C))))
(+ (pow B_m 2.0) (* (* A C) -4.0))))
(- (sqrt 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 (pow(B_m, 2.0) <= 4e-138) {
tmp = (sqrt((2.0 * C)) * sqrt((2.0 * (F * t_0)))) / -t_0;
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt(((F * ((A + C) + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + ((A * C) * -4.0)))) * -sqrt(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 ^ 2.0) <= 4e-138) tmp = Float64(Float64(sqrt(Float64(2.0 * C)) * sqrt(Float64(2.0 * Float64(F * t_0)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(F) * Float64(-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[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-138], N[(N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $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}^{2} \leq 4 \cdot 10^{-138}:\\
\;\;\;\;\frac{\sqrt{2 \cdot C} \cdot \sqrt{2 \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + \left(A \cdot C\right) \cdot -4}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000027e-138Initial program 25.2%
Simplified33.7%
associate-*r*33.7%
associate-+r+32.4%
hypot-undefine25.2%
unpow225.2%
unpow225.2%
+-commutative25.2%
sqrt-prod25.6%
*-commutative25.6%
associate-+l+26.0%
Applied egg-rr39.4%
Taylor expanded in A around -inf 23.7%
if 4.00000000000000027e-138 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 26.8%
add-cbrt-cube18.7%
pow318.7%
unpow218.7%
unpow218.7%
hypot-define18.7%
Applied egg-rr18.7%
Taylor expanded in F around 0 30.7%
mul-1-neg30.7%
associate-+r+30.7%
unpow230.7%
unpow230.7%
hypot-undefine40.6%
cancel-sign-sub-inv40.6%
metadata-eval40.6%
Simplified40.6%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification35.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-138)
(* (sqrt (* F (* 2.0 t_0))) (/ (- (sqrt (* 2.0 C))) t_0))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(/
(* F (+ (+ A C) (hypot B_m (- A C))))
(+ (pow B_m 2.0) (* (* A C) -4.0))))
(- (sqrt 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 (pow(B_m, 2.0) <= 4e-138) {
tmp = sqrt((F * (2.0 * t_0))) * (-sqrt((2.0 * C)) / t_0);
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt(((F * ((A + C) + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + ((A * C) * -4.0)))) * -sqrt(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 ^ 2.0) <= 4e-138) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * Float64(Float64(-sqrt(Float64(2.0 * C))) / t_0)); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(F) * Float64(-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[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-138], N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $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}^{2} \leq 4 \cdot 10^{-138}:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \frac{-\sqrt{2 \cdot C}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + \left(A \cdot C\right) \cdot -4}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000027e-138Initial program 25.2%
Simplified33.7%
associate-*r*33.7%
associate-+r+32.4%
hypot-undefine25.2%
unpow225.2%
unpow225.2%
+-commutative25.2%
sqrt-prod25.6%
*-commutative25.6%
associate-+l+26.0%
Applied egg-rr39.4%
Taylor expanded in A around -inf 23.7%
associate-/l*23.7%
associate-*l*23.7%
associate-*r*23.7%
*-commutative23.7%
associate-*r*23.7%
sqrt-unprod23.7%
Applied egg-rr23.7%
if 4.00000000000000027e-138 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 26.8%
add-cbrt-cube18.7%
pow318.7%
unpow218.7%
unpow218.7%
hypot-define18.7%
Applied egg-rr18.7%
Taylor expanded in F around 0 30.7%
mul-1-neg30.7%
associate-+r+30.7%
unpow230.7%
unpow230.7%
hypot-undefine40.6%
cancel-sign-sub-inv40.6%
metadata-eval40.6%
Simplified40.6%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification35.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-78)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(if (<= (pow B_m 2.0) 4e+289)
(*
(sqrt
(/
(* F (+ (+ A C) (hypot B_m (- A C))))
(+ (pow B_m 2.0) (* (* A C) -4.0))))
(- (sqrt 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 (pow(B_m, 2.0) <= 5e-78) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else if (pow(B_m, 2.0) <= 4e+289) {
tmp = sqrt(((F * ((A + C) + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + ((A * C) * -4.0)))) * -sqrt(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 ^ 2.0) <= 5e-78) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 4e+289) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(F) * Float64(-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[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-78], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+289], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $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}^{2} \leq 5 \cdot 10^{-78}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + \left(A \cdot C\right) \cdot -4}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999996e-78Initial program 26.3%
Simplified34.6%
Taylor expanded in A around -inf 26.3%
*-commutative26.3%
Simplified26.3%
if 4.9999999999999996e-78 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e289Initial program 25.6%
add-cbrt-cube18.3%
pow318.3%
unpow218.3%
unpow218.3%
hypot-define18.3%
Applied egg-rr18.3%
Taylor expanded in F around 0 30.6%
mul-1-neg30.6%
associate-+r+30.6%
unpow230.6%
unpow230.6%
hypot-undefine42.5%
cancel-sign-sub-inv42.5%
metadata-eval42.5%
Simplified42.5%
if 4.0000000000000002e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in B around inf 34.0%
mul-1-neg34.0%
*-commutative34.0%
Simplified34.0%
*-commutative34.0%
pow1/234.0%
pow1/234.0%
pow-prod-down34.2%
Applied egg-rr34.2%
unpow1/234.2%
Simplified34.2%
Taylor expanded in F around 0 34.2%
*-commutative34.2%
associate-*l/34.2%
associate-/l*34.1%
Simplified34.1%
*-commutative34.1%
sqrt-prod45.3%
Applied egg-rr45.3%
Final simplification35.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 B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.4e+23)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(if (<= B_m 4.5e+162)
(* (sqrt (* F (+ C (hypot C B_m)))) (/ (sqrt 2.0) (- B_m)))
(* (sqrt F) (- (sqrt (/ 2.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.4e+23) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else if (B_m <= 4.5e+162) {
tmp = sqrt((F * (C + hypot(C, B_m)))) * (sqrt(2.0) / -B_m);
} 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 <= 1.4e+23) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); elseif (B_m <= 4.5e+162) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(C, B_m)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(F) * Float64(-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, 1.4e+23], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 4.5e+162], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $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 1.4 \cdot 10^{+23}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 4.5 \cdot 10^{+162}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 1.4e23Initial program 23.4%
Simplified30.0%
Taylor expanded in A around -inf 19.7%
*-commutative19.7%
Simplified19.7%
if 1.4e23 < B < 4.49999999999999972e162Initial program 18.7%
Taylor expanded in A around 0 33.5%
mul-1-neg33.5%
*-commutative33.5%
*-commutative33.5%
+-commutative33.5%
unpow233.5%
unpow233.5%
hypot-define41.5%
Simplified41.5%
if 4.49999999999999972e162 < B Initial program 0.0%
Taylor expanded in B around inf 56.9%
mul-1-neg56.9%
*-commutative56.9%
Simplified56.9%
*-commutative56.9%
pow1/256.9%
pow1/256.9%
pow-prod-down57.2%
Applied egg-rr57.2%
unpow1/257.2%
Simplified57.2%
Taylor expanded in F around 0 57.2%
*-commutative57.2%
associate-*l/57.2%
associate-/l*57.1%
Simplified57.1%
*-commutative57.1%
sqrt-prod79.1%
Applied egg-rr79.1%
Final simplification29.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 1.6e-66)
(* 2.0 (- (sqrt (/ (* C F) (fma -4.0 (* A C) (pow B_m 2.0))))))
(if (<= B_m 3.8e+162)
(* (sqrt (* F (+ C (hypot C B_m)))) (/ (sqrt 2.0) (- B_m)))
(* (sqrt F) (- (sqrt (/ 2.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.6e-66) {
tmp = 2.0 * -sqrt(((C * F) / fma(-4.0, (A * C), pow(B_m, 2.0))));
} else if (B_m <= 3.8e+162) {
tmp = sqrt((F * (C + hypot(C, B_m)))) * (sqrt(2.0) / -B_m);
} 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) tmp = 0.0 if (B_m <= 1.6e-66) tmp = Float64(2.0 * Float64(-sqrt(Float64(Float64(C * F) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))); elseif (B_m <= 3.8e+162) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(C, B_m)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(F) * Float64(-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_] := If[LessEqual[B$95$m, 1.6e-66], N[(2.0 * (-N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 3.8e+162], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.6 \cdot 10^{-66}:\\
\;\;\;\;2 \cdot \left(-\sqrt{\frac{C \cdot F}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\
\mathbf{elif}\;B\_m \leq 3.8 \cdot 10^{+162}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 1.59999999999999991e-66Initial program 21.4%
Simplified27.0%
associate-*r*27.0%
associate-+r+26.2%
hypot-undefine21.4%
unpow221.4%
unpow221.4%
+-commutative21.4%
sqrt-prod23.9%
*-commutative23.9%
associate-+l+24.1%
Applied egg-rr34.7%
Taylor expanded in A around -inf 16.4%
Taylor expanded in F around 0 13.8%
mul-1-neg13.8%
fma-define13.8%
unpow213.8%
rem-square-sqrt14.0%
Simplified14.0%
if 1.59999999999999991e-66 < B < 3.80000000000000024e162Initial program 27.3%
Taylor expanded in A around 0 29.5%
mul-1-neg29.5%
*-commutative29.5%
*-commutative29.5%
+-commutative29.5%
unpow229.5%
unpow229.5%
hypot-define33.8%
Simplified33.8%
if 3.80000000000000024e162 < B Initial program 0.0%
Taylor expanded in B around inf 56.9%
mul-1-neg56.9%
*-commutative56.9%
Simplified56.9%
*-commutative56.9%
pow1/256.9%
pow1/256.9%
pow-prod-down57.2%
Applied egg-rr57.2%
unpow1/257.2%
Simplified57.2%
Taylor expanded in F around 0 57.2%
*-commutative57.2%
associate-*l/57.2%
associate-/l*57.1%
Simplified57.1%
*-commutative57.1%
sqrt-prod79.1%
Applied egg-rr79.1%
Final simplification26.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 (<= C 2.1e+118) (* (sqrt F) (- (sqrt (/ 2.0 B_m)))) (* (sqrt (* F (+ C (hypot C B_m)))) (/ (sqrt 2.0) (- B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+118) {
tmp = sqrt(F) * -sqrt((2.0 / B_m));
} else {
tmp = sqrt((F * (C + hypot(C, B_m)))) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+118) {
tmp = Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
} else {
tmp = Math.sqrt((F * (C + Math.hypot(C, B_m)))) * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.1e+118: tmp = math.sqrt(F) * -math.sqrt((2.0 / B_m)) else: tmp = math.sqrt((F * (C + math.hypot(C, B_m)))) * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.1e+118) tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(C + hypot(C, B_m)))) * 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)
tmp = 0.0;
if (C <= 2.1e+118)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
else
tmp = sqrt((F * (C + hypot(C, B_m)))) * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.1e+118], N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 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}
\mathbf{if}\;C \leq 2.1 \cdot 10^{+118}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if C < 2.1e118Initial program 22.5%
Taylor expanded in B around inf 16.7%
mul-1-neg16.7%
*-commutative16.7%
Simplified16.7%
*-commutative16.7%
pow1/216.9%
pow1/216.9%
pow-prod-down17.0%
Applied egg-rr17.0%
unpow1/216.8%
Simplified16.8%
Taylor expanded in F around 0 16.8%
*-commutative16.8%
associate-*l/16.8%
associate-/l*16.8%
Simplified16.8%
*-commutative16.8%
sqrt-prod20.2%
Applied egg-rr20.2%
if 2.1e118 < C Initial program 8.6%
Taylor expanded in A around 0 1.7%
mul-1-neg1.7%
*-commutative1.7%
*-commutative1.7%
+-commutative1.7%
unpow21.7%
unpow21.7%
hypot-define11.2%
Simplified11.2%
Final simplification18.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1.15e+119) (- (sqrt (* 2.0 (fabs (/ F B_m))))) (* (sqrt (* C 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 (C <= 1.15e+119) {
tmp = -sqrt((2.0 * fabs((F / B_m))));
} else {
tmp = sqrt((C * 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 (c <= 1.15d+119) then
tmp = -sqrt((2.0d0 * abs((f / b_m))))
else
tmp = sqrt((c * 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 (C <= 1.15e+119) {
tmp = -Math.sqrt((2.0 * Math.abs((F / B_m))));
} else {
tmp = Math.sqrt((C * 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 C <= 1.15e+119: tmp = -math.sqrt((2.0 * math.fabs((F / B_m)))) else: tmp = math.sqrt((C * 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 (C <= 1.15e+119) tmp = Float64(-sqrt(Float64(2.0 * abs(Float64(F / B_m))))); else tmp = Float64(sqrt(Float64(C * F)) * Float64(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 (C <= 1.15e+119)
tmp = -sqrt((2.0 * abs((F / B_m))));
else
tmp = sqrt((C * 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[C, 1.15e+119], (-N[Sqrt[N[(2.0 * N[Abs[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 1.15 \cdot 10^{+119}:\\
\;\;\;\;-\sqrt{2 \cdot \left|\frac{F}{B\_m}\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{C \cdot F} \cdot \frac{-2}{B\_m}\\
\end{array}
\end{array}
if C < 1.15e119Initial program 22.5%
Taylor expanded in B around inf 16.7%
mul-1-neg16.7%
*-commutative16.7%
Simplified16.7%
*-commutative16.7%
pow1/216.9%
pow1/216.9%
pow-prod-down17.0%
Applied egg-rr17.0%
unpow1/216.8%
Simplified16.8%
add-sqr-sqrt16.8%
pow1/216.8%
pow1/216.9%
pow-prod-down16.6%
pow216.6%
Applied egg-rr16.6%
unpow1/216.6%
unpow216.6%
rem-sqrt-square30.7%
Simplified30.7%
if 1.15e119 < C Initial program 8.6%
Simplified25.9%
associate-*r*25.9%
associate-+r+25.9%
hypot-undefine8.6%
unpow28.6%
unpow28.6%
+-commutative8.6%
sqrt-prod14.9%
*-commutative14.9%
associate-+l+14.9%
Applied egg-rr46.9%
Taylor expanded in A around -inf 44.8%
Taylor expanded in B around inf 5.4%
mul-1-neg5.4%
unpow25.4%
rem-square-sqrt5.4%
Simplified5.4%
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 (* (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) {
return sqrt(F) * -sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(f) * -sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(F) * -math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(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])\\
\\
\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)
\end{array}
Initial program 20.1%
Taylor expanded in B around inf 15.0%
mul-1-neg15.0%
*-commutative15.0%
Simplified15.0%
*-commutative15.0%
pow1/215.2%
pow1/215.2%
pow-prod-down15.3%
Applied egg-rr15.3%
unpow1/215.1%
Simplified15.1%
Taylor expanded in F around 0 15.1%
*-commutative15.1%
associate-*l/15.1%
associate-/l*15.1%
Simplified15.1%
*-commutative15.1%
sqrt-prod18.4%
Applied egg-rr18.4%
Final simplification18.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 2.75e+119) (- (pow (/ (* 2.0 F) B_m) 0.5)) (* (sqrt (* C 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 (C <= 2.75e+119) {
tmp = -pow(((2.0 * F) / B_m), 0.5);
} else {
tmp = sqrt((C * 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 (c <= 2.75d+119) then
tmp = -(((2.0d0 * f) / b_m) ** 0.5d0)
else
tmp = sqrt((c * 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 (C <= 2.75e+119) {
tmp = -Math.pow(((2.0 * F) / B_m), 0.5);
} else {
tmp = Math.sqrt((C * 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 C <= 2.75e+119: tmp = -math.pow(((2.0 * F) / B_m), 0.5) else: tmp = math.sqrt((C * 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 (C <= 2.75e+119) tmp = Float64(-(Float64(Float64(2.0 * F) / B_m) ^ 0.5)); else tmp = Float64(sqrt(Float64(C * F)) * Float64(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 (C <= 2.75e+119)
tmp = -(((2.0 * F) / B_m) ^ 0.5);
else
tmp = sqrt((C * 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[C, 2.75e+119], (-N[Power[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision], 0.5], $MachinePrecision]), N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.75 \cdot 10^{+119}:\\
\;\;\;\;-{\left(\frac{2 \cdot F}{B\_m}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{C \cdot F} \cdot \frac{-2}{B\_m}\\
\end{array}
\end{array}
if C < 2.7500000000000002e119Initial program 22.5%
Taylor expanded in B around inf 16.7%
mul-1-neg16.7%
*-commutative16.7%
Simplified16.7%
*-commutative16.7%
pow1/216.9%
pow1/216.9%
pow-prod-down17.0%
Applied egg-rr17.0%
unpow1/216.8%
Simplified16.8%
Taylor expanded in F around 0 16.8%
*-commutative16.8%
associate-*l/16.8%
associate-/l*16.8%
Simplified16.8%
pow1/216.9%
associate-*r/17.0%
Applied egg-rr17.0%
if 2.7500000000000002e119 < C Initial program 8.6%
Simplified25.9%
associate-*r*25.9%
associate-+r+25.9%
hypot-undefine8.6%
unpow28.6%
unpow28.6%
+-commutative8.6%
sqrt-prod14.9%
*-commutative14.9%
associate-+l+14.9%
Applied egg-rr46.9%
Taylor expanded in A around -inf 44.8%
Taylor expanded in B around inf 5.4%
mul-1-neg5.4%
unpow25.4%
rem-square-sqrt5.4%
Simplified5.4%
Final simplification14.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 (- (pow (/ (* 2.0 F) B_m) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -pow(((2.0 * F) / B_m), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -(((2.0d0 * f) / b_m) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.pow(((2.0 * F) / B_m), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.pow(((2.0 * F) / B_m), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(Float64(2.0 * F) / B_m) ^ 0.5)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -(((2.0 * F) / B_m) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Power[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(\frac{2 \cdot F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 20.1%
Taylor expanded in B around inf 15.0%
mul-1-neg15.0%
*-commutative15.0%
Simplified15.0%
*-commutative15.0%
pow1/215.2%
pow1/215.2%
pow-prod-down15.3%
Applied egg-rr15.3%
unpow1/215.1%
Simplified15.1%
Taylor expanded in F around 0 15.1%
*-commutative15.1%
associate-*l/15.1%
associate-/l*15.1%
Simplified15.1%
pow1/215.2%
associate-*r/15.3%
Applied egg-rr15.3%
Final simplification15.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 (- (pow (* 2.0 (/ F B_m)) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -pow((2.0 * (F / B_m)), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -((2.0d0 * (f / b_m)) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.pow((2.0 * (F / B_m)), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -((2.0 * (F / B_m)) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 20.1%
Taylor expanded in B around inf 15.0%
mul-1-neg15.0%
*-commutative15.0%
Simplified15.0%
*-commutative15.0%
pow1/215.2%
pow1/215.2%
pow-prod-down15.3%
Applied egg-rr15.3%
Final simplification15.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 (- (sqrt (* 2.0 (/ F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((2.0d0 * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.1%
Taylor expanded in B around inf 15.0%
mul-1-neg15.0%
*-commutative15.0%
Simplified15.0%
*-commutative15.0%
pow1/215.2%
pow1/215.2%
pow-prod-down15.3%
Applied egg-rr15.3%
unpow1/215.1%
Simplified15.1%
Final simplification15.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 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 20.1%
Taylor expanded in B around inf 15.0%
mul-1-neg15.0%
*-commutative15.0%
Simplified15.0%
*-commutative15.0%
pow1/215.2%
pow1/215.2%
pow-prod-down15.3%
Applied egg-rr15.3%
unpow1/215.1%
Simplified15.1%
Taylor expanded in F around 0 15.1%
*-commutative15.1%
associate-*l/15.1%
associate-/l*15.1%
Simplified15.1%
herbie shell --seed 2024149
(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))))