
(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 22 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 A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(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_2))
(t_4 (sqrt (* 2.0 F))))
(if (<= t_3 (- INFINITY))
(/
(* (sqrt (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))) (* (sqrt t_0) t_4))
t_2)
(if (<= t_3 -2e-195)
(/
(*
(sqrt (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))))
(* t_4 (sqrt (fma B_m B_m (* -4.0 (* A C))))))
t_2)
(if (<= t_3 5e+61)
(/
-1.0
(/
t_0
(sqrt
(* (fma B_m (* -0.5 (/ B_m A)) (* 2.0 C)) (* F (* 2.0 t_0))))))
(if (<= t_3 INFINITY)
(/
(*
(sqrt (* 2.0 C))
(sqrt (* 2.0 (* F (fma -4.0 (* A C) (* B_m B_m))))))
t_2)
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = 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_2;
double t_4 = sqrt((2.0 * F));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma(-0.5, ((B_m * B_m) / A), (2.0 * C))) * (sqrt(t_0) * t_4)) / t_2;
} else if (t_3 <= -2e-195) {
tmp = (sqrt(((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m))))) * (t_4 * sqrt(fma(B_m, B_m, (-4.0 * (A * C)))))) / t_2;
} else if (t_3 <= 5e+61) {
tmp = -1.0 / (t_0 / sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * t_0)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * C)) * sqrt((2.0 * (F * fma(-4.0, (A * C), (B_m * B_m)))))) / t_2;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = 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)))))) / t_2) t_4 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))) * Float64(sqrt(t_0) * t_4)) / t_2); elseif (t_3 <= -2e-195) tmp = Float64(Float64(sqrt(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))) * Float64(t_4 * sqrt(fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) / t_2); elseif (t_3 <= 5e+61) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * t_0)))))); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * C)) * sqrt(Float64(2.0 * Float64(F * fma(-4.0, Float64(A * C), Float64(B_m * B_m)))))) / t_2); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$4), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -2e-195], N[(N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$4 * N[Sqrt[N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, 5e+61], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(F * N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \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\_2}\\
t_4 := \sqrt{2 \cdot F}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)} \cdot \left(\sqrt{t\_0} \cdot t\_4\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}} \cdot \left(t\_4 \cdot \sqrt{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot t\_0\right)\right)}}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot C} \cdot \sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr9.1%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.0
Simplified21.0%
pow1/2N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6427.0
Applied egg-rr27.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))) < -2.0000000000000002e-195Initial program 96.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr96.6%
pow1/2N/A
*-commutativeN/A
+-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
pow2N/A
associate-*l*N/A
associate-*l*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr97.6%
if -2.0000000000000002e-195 < (/.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.00000000000000018e61Initial program 16.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr14.3%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.9
Simplified18.9%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr26.3%
if 5.00000000000000018e61 < (/.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 30.4%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr51.4%
Taylor expanded in A around -inf
*-lowering-*.f6436.3
Simplified36.3%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification38.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 A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(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_2)))
(if (<= t_3 (- INFINITY))
(/
(*
(sqrt (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))
(* (sqrt t_0) (sqrt (* 2.0 F))))
t_2)
(if (<= t_3 -2e-195)
(/
(*
(sqrt (* 2.0 (fma B_m B_m (* -4.0 (* A C)))))
(*
(sqrt (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))))
(sqrt F)))
t_2)
(if (<= t_3 5e+61)
(/
-1.0
(/
t_0
(sqrt
(* (fma B_m (* -0.5 (/ B_m A)) (* 2.0 C)) (* F (* 2.0 t_0))))))
(if (<= t_3 INFINITY)
(/
(*
(sqrt (* 2.0 C))
(sqrt (* 2.0 (* F (fma -4.0 (* A C) (* B_m B_m))))))
t_2)
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = 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_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma(-0.5, ((B_m * B_m) / A), (2.0 * C))) * (sqrt(t_0) * sqrt((2.0 * F)))) / t_2;
} else if (t_3 <= -2e-195) {
tmp = (sqrt((2.0 * fma(B_m, B_m, (-4.0 * (A * C))))) * (sqrt(((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m))))) * sqrt(F))) / t_2;
} else if (t_3 <= 5e+61) {
tmp = -1.0 / (t_0 / sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * t_0)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * C)) * sqrt((2.0 * (F * fma(-4.0, (A * C), (B_m * B_m)))))) / t_2;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = 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)))))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))) * Float64(sqrt(t_0) * sqrt(Float64(2.0 * F)))) / t_2); elseif (t_3 <= -2e-195) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(sqrt(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))) * sqrt(F))) / t_2); elseif (t_3 <= 5e+61) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * t_0)))))); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * C)) * sqrt(Float64(2.0 * Float64(F * fma(-4.0, Float64(A * C), Float64(B_m * B_m)))))) / t_2); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -2e-195], N[(N[(N[Sqrt[N[(2.0 * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, 5e+61], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(F * N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \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\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)} \cdot \left(\sqrt{t\_0} \cdot \sqrt{2 \cdot F}\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)} \cdot \left(\sqrt{\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}} \cdot \sqrt{F}\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot t\_0\right)\right)}}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot C} \cdot \sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr9.1%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.0
Simplified21.0%
pow1/2N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6427.0
Applied egg-rr27.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))) < -2.0000000000000002e-195Initial program 96.7%
Applied egg-rr55.6%
Applied egg-rr93.8%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr97.6%
if -2.0000000000000002e-195 < (/.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.00000000000000018e61Initial program 16.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr14.3%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.9
Simplified18.9%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr26.3%
if 5.00000000000000018e61 < (/.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 30.4%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr51.4%
Taylor expanded in A around -inf
*-lowering-*.f6436.3
Simplified36.3%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification38.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 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_1))
(t_3 (fma A (* C -4.0) (* B_m B_m)))
(t_4 (fma -4.0 (* A C) (* B_m B_m)))
(t_5 (* 2.0 (* F t_4))))
(if (<= t_2 (- INFINITY))
(/
(*
(sqrt (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))
(* (sqrt t_3) (sqrt (* 2.0 F))))
t_1)
(if (<= t_2 -2e-195)
(/
(sqrt (* (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))) t_5))
(- t_4))
(if (<= t_2 5e+61)
(/
-1.0
(/
t_3
(sqrt
(* (fma B_m (* -0.5 (/ B_m A)) (* 2.0 C)) (* F (* 2.0 t_3))))))
(if (<= t_2 INFINITY)
(/ (* (sqrt (* 2.0 C)) (sqrt t_5)) t_1)
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_1;
double t_3 = fma(A, (C * -4.0), (B_m * B_m));
double t_4 = fma(-4.0, (A * C), (B_m * B_m));
double t_5 = 2.0 * (F * t_4);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(fma(-0.5, ((B_m * B_m) / A), (2.0 * C))) * (sqrt(t_3) * sqrt((2.0 * F)))) / t_1;
} else if (t_2 <= -2e-195) {
tmp = sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) * t_5)) / -t_4;
} else if (t_2 <= 5e+61) {
tmp = -1.0 / (t_3 / sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * t_3)))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * C)) * sqrt(t_5)) / t_1;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_1) t_3 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_4 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_5 = Float64(2.0 * Float64(F * t_4)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))) * Float64(sqrt(t_3) * sqrt(Float64(2.0 * F)))) / t_1); elseif (t_2 <= -2e-195) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * t_5)) / Float64(-t_4)); elseif (t_2 <= 5e+61) tmp = Float64(-1.0 / Float64(t_3 / sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * t_3)))))); elseif (t_2 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * C)) * sqrt(t_5)) / t_1); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(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] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(2.0 * N[(F * t$95$4), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$3], $MachinePrecision] * N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$2, -2e-195], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision], If[LessEqual[t$95$2, 5e+61], N[(-1.0 / N[(t$95$3 / N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$5], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1}\\
t_3 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_4 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_5 := 2 \cdot \left(F \cdot t\_4\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)} \cdot \left(\sqrt{t\_3} \cdot \sqrt{2 \cdot F}\right)}{t\_1}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot t\_5}}{-t\_4}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\frac{-1}{\frac{t\_3}{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot t\_3\right)\right)}}}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot C} \cdot \sqrt{t\_5}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr9.1%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.0
Simplified21.0%
pow1/2N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6427.0
Applied egg-rr27.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))) < -2.0000000000000002e-195Initial program 96.7%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr96.7%
if -2.0000000000000002e-195 < (/.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.00000000000000018e61Initial program 16.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr14.3%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.9
Simplified18.9%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr26.3%
if 5.00000000000000018e61 < (/.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 30.4%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr51.4%
Taylor expanded in A around -inf
*-lowering-*.f6436.3
Simplified36.3%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification38.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 A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(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_2))
(t_4 (fma -4.0 (* A C) (* B_m B_m)))
(t_5 (* 2.0 (* F t_4))))
(if (<= t_3 (- INFINITY))
(/
(*
(sqrt (* 2.0 (fma B_m B_m (* -4.0 (* A C)))))
(* (sqrt (* C F)) (sqrt 2.0)))
t_2)
(if (<= t_3 -2e-195)
(/
(sqrt (* (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))) t_5))
(- t_4))
(if (<= t_3 5e+61)
(/
-1.0
(/
t_0
(sqrt
(* (fma B_m (* -0.5 (/ B_m A)) (* 2.0 C)) (* F (* 2.0 t_0))))))
(if (<= t_3 INFINITY)
(/ (* (sqrt (* 2.0 C)) (sqrt t_5)) t_2)
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = 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_2;
double t_4 = fma(-4.0, (A * C), (B_m * B_m));
double t_5 = 2.0 * (F * t_4);
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt((2.0 * fma(B_m, B_m, (-4.0 * (A * C))))) * (sqrt((C * F)) * sqrt(2.0))) / t_2;
} else if (t_3 <= -2e-195) {
tmp = sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) * t_5)) / -t_4;
} else if (t_3 <= 5e+61) {
tmp = -1.0 / (t_0 / sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * t_0)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * C)) * sqrt(t_5)) / t_2;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = 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)))))) / t_2) t_4 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_5 = Float64(2.0 * Float64(F * t_4)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(sqrt(Float64(C * F)) * sqrt(2.0))) / t_2); elseif (t_3 <= -2e-195) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * t_5)) / Float64(-t_4)); elseif (t_3 <= 5e+61) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * t_0)))))); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * C)) * sqrt(t_5)) / t_2); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(2.0 * N[(F * t$95$4), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -2e-195], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision], If[LessEqual[t$95$3, 5e+61], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$5], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \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\_2}\\
t_4 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_5 := 2 \cdot \left(F \cdot t\_4\right)\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)} \cdot \left(\sqrt{C \cdot F} \cdot \sqrt{2}\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot t\_5}}{-t\_4}\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot t\_0\right)\right)}}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot C} \cdot \sqrt{t\_5}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
Applied egg-rr1.0%
Applied egg-rr20.8%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6425.7
Simplified25.7%
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))) < -2.0000000000000002e-195Initial program 96.7%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr96.7%
if -2.0000000000000002e-195 < (/.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.00000000000000018e61Initial program 16.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr14.3%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.9
Simplified18.9%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr26.3%
if 5.00000000000000018e61 < (/.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 30.4%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr51.4%
Taylor expanded in A around -inf
*-lowering-*.f6436.3
Simplified36.3%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification38.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 -4.0 (* A C) (* B_m B_m)))
(t_1 (* 2.0 (* F t_0)))
(t_2 (fma A (* C -4.0) (* B_m B_m)))
(t_3 (* (* 4.0 A) C))
(t_4 (- t_3 (pow B_m 2.0)))
(t_5
(/
(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_4))
(t_6 (/ (* (sqrt (* 2.0 C)) (sqrt t_1)) t_4)))
(if (<= t_5 (- INFINITY))
t_6
(if (<= t_5 -2e-195)
(/
(sqrt (* (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))) t_1))
(- t_0))
(if (<= t_5 5e+61)
(/
-1.0
(/
t_2
(sqrt
(* (fma B_m (* -0.5 (/ B_m A)) (* 2.0 C)) (* F (* 2.0 t_2))))))
(if (<= t_5 INFINITY) t_6 (/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = 2.0 * (F * t_0);
double t_2 = fma(A, (C * -4.0), (B_m * B_m));
double t_3 = (4.0 * A) * C;
double t_4 = t_3 - pow(B_m, 2.0);
double t_5 = 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_4;
double t_6 = (sqrt((2.0 * C)) * sqrt(t_1)) / t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = t_6;
} else if (t_5 <= -2e-195) {
tmp = sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) * t_1)) / -t_0;
} else if (t_5 <= 5e+61) {
tmp = -1.0 / (t_2 / sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * t_2)))));
} else if (t_5 <= ((double) INFINITY)) {
tmp = t_6;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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), Float64(B_m * B_m)) t_1 = Float64(2.0 * Float64(F * t_0)) t_2 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(t_3 - (B_m ^ 2.0)) t_5 = 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)))))) / t_4) t_6 = Float64(Float64(sqrt(Float64(2.0 * C)) * sqrt(t_1)) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = t_6; elseif (t_5 <= -2e-195) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * t_1)) / Float64(-t_0)); elseif (t_5 <= 5e+61) tmp = Float64(-1.0 / Float64(t_2 / sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * t_2)))))); elseif (t_5 <= Inf) tmp = t_6; else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = 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] / t$95$4), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], t$95$6, If[LessEqual[t$95$5, -2e-195], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$5, 5e+61], N[(-1.0 / N[(t$95$2 / N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], t$95$6, N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 \cdot B\_m\right)\\
t_1 := 2 \cdot \left(F \cdot t\_0\right)\\
t_2 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := t\_3 - {B\_m}^{2}\\
t_5 := \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\_4}\\
t_6 := \frac{\sqrt{2 \cdot C} \cdot \sqrt{t\_1}}{t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot t\_1}}{-t\_0}\\
\mathbf{elif}\;t\_5 \leq 5 \cdot 10^{+61}:\\
\;\;\;\;\frac{-1}{\frac{t\_2}{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot t\_2\right)\right)}}}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0 or 5.00000000000000018e61 < (/.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.4%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr20.4%
Taylor expanded in A around -inf
*-lowering-*.f6424.1
Simplified24.1%
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))) < -2.0000000000000002e-195Initial program 96.7%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr96.7%
if -2.0000000000000002e-195 < (/.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.00000000000000018e61Initial program 16.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr14.3%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.9
Simplified18.9%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr26.3%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification37.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 (* -0.5 (/ B_m A)) (* 2.0 C)))
(t_1 (fma A (* C -4.0) (* B_m B_m)))
(t_2 (* F (* 2.0 t_1)))
(t_3 (fma -4.0 (* A C) (* B_m B_m)))
(t_4 (* (sqrt t_0) (/ (sqrt t_2) (fma B_m (- B_m) (* A (* 4.0 C))))))
(t_5 (* (* 4.0 A) C))
(t_6
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_5) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_5 (pow B_m 2.0)))))
(if (<= t_6 (- INFINITY))
t_4
(if (<= t_6 -2e-195)
(/
(sqrt
(*
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))
(* 2.0 (* F t_3))))
(- t_3))
(if (<= t_6 1e-78)
(/ -1.0 (/ t_1 (sqrt (* t_0 t_2))))
(if (<= t_6 INFINITY) t_4 (/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(B_m, (-0.5 * (B_m / A)), (2.0 * C));
double t_1 = fma(A, (C * -4.0), (B_m * B_m));
double t_2 = F * (2.0 * t_1);
double t_3 = fma(-4.0, (A * C), (B_m * B_m));
double t_4 = sqrt(t_0) * (sqrt(t_2) / fma(B_m, -B_m, (A * (4.0 * C))));
double t_5 = (4.0 * A) * C;
double t_6 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_5) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_5 - pow(B_m, 2.0));
double tmp;
if (t_6 <= -((double) INFINITY)) {
tmp = t_4;
} else if (t_6 <= -2e-195) {
tmp = sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) * (2.0 * (F * t_3)))) / -t_3;
} else if (t_6 <= 1e-78) {
tmp = -1.0 / (t_1 / sqrt((t_0 * t_2)));
} else if (t_6 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) t_1 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_2 = Float64(F * Float64(2.0 * t_1)) t_3 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_4 = Float64(sqrt(t_0) * Float64(sqrt(t_2) / fma(B_m, Float64(-B_m), Float64(A * Float64(4.0 * C))))) t_5 = Float64(Float64(4.0 * A) * C) t_6 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_5) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_5 - (B_m ^ 2.0))) tmp = 0.0 if (t_6 <= Float64(-Inf)) tmp = t_4; elseif (t_6 <= -2e-195) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * Float64(2.0 * Float64(F * t_3)))) / Float64(-t_3)); elseif (t_6 <= 1e-78) tmp = Float64(-1.0 / Float64(t_1 / sqrt(Float64(t_0 * t_2)))); elseif (t_6 <= Inf) tmp = t_4; else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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 * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(N[Sqrt[t$95$2], $MachinePrecision] / N[(B$95$m * (-B$95$m) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$5), $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$5 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$6, (-Infinity)], t$95$4, If[LessEqual[t$95$6, -2e-195], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$6, 1e-78], N[(-1.0 / N[(t$95$1 / N[Sqrt[N[(t$95$0 * t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, Infinity], t$95$4, N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right)\\
t_1 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_2 := F \cdot \left(2 \cdot t\_1\right)\\
t_3 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_4 := \sqrt{t\_0} \cdot \frac{\sqrt{t\_2}}{\mathsf{fma}\left(B\_m, -B\_m, A \cdot \left(4 \cdot C\right)\right)}\\
t_5 := \left(4 \cdot A\right) \cdot C\\
t_6 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_5\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_5 - {B\_m}^{2}}\\
\mathbf{if}\;t\_6 \leq -\infty:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_6 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot \left(2 \cdot \left(F \cdot t\_3\right)\right)}}{-t\_3}\\
\mathbf{elif}\;t\_6 \leq 10^{-78}:\\
\;\;\;\;\frac{-1}{\frac{t\_1}{\sqrt{t\_0 \cdot t\_2}}}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0 or 9.99999999999999999e-79 < (/.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 13.0%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr22.7%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.9
Simplified25.9%
Applied egg-rr24.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))) < -2.0000000000000002e-195Initial program 96.7%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr96.7%
if -2.0000000000000002e-195 < (/.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))) < 9.99999999999999999e-79Initial program 12.2%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr9.7%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6417.1
Simplified17.1%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr25.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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification37.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 -4.0 (* A C) (* B_m B_m)))
(t_1 (* 2.0 (* F t_0)))
(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))))
(t_4 (fma A (* C -4.0) (* B_m B_m))))
(if (<= t_3 (- INFINITY))
(* (* (sqrt F) (- (/ (sqrt 2.0) B_m))) (sqrt (/ (* B_m (* B_m -0.5)) A)))
(if (<= t_3 -2e-195)
(/
(sqrt (* (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))) t_1))
(- t_0))
(if (<= t_3 1e+96)
(/
-1.0
(/
t_4
(sqrt
(* (fma B_m (* -0.5 (/ B_m A)) (* 2.0 C)) (* F (* 2.0 t_4))))))
(if (<= t_3 INFINITY)
(/
(* (sqrt (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))) (sqrt t_1))
(* -4.0 (* A (- C))))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = 2.0 * (F * t_0);
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 t_4 = fma(A, (C * -4.0), (B_m * B_m));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(F) * -(sqrt(2.0) / B_m)) * sqrt(((B_m * (B_m * -0.5)) / A));
} else if (t_3 <= -2e-195) {
tmp = sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) * t_1)) / -t_0;
} else if (t_3 <= 1e+96) {
tmp = -1.0 / (t_4 / sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * t_4)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt(fma(-0.5, ((B_m * B_m) / A), (2.0 * C))) * sqrt(t_1)) / (-4.0 * (A * -C));
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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), Float64(B_m * B_m)) t_1 = Float64(2.0 * Float64(F * t_0)) 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))) t_4 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(F) * Float64(-Float64(sqrt(2.0) / B_m))) * sqrt(Float64(Float64(B_m * Float64(B_m * -0.5)) / A))); elseif (t_3 <= -2e-195) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * t_1)) / Float64(-t_0)); elseif (t_3 <= 1e+96) tmp = Float64(-1.0 / Float64(t_4 / sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * t_4)))))); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))) * sqrt(t_1)) / Float64(-4.0 * Float64(A * Float64(-C)))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $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]}, Block[{t$95$4 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[F], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision] * N[Sqrt[N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -2e-195], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, 1e+96], N[(-1.0 / N[(t$95$4 / N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * (-C)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 \cdot B\_m\right)\\
t_1 := 2 \cdot \left(F \cdot t\_0\right)\\
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}}\\
t_4 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\left(\sqrt{F} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\right) \cdot \sqrt{\frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot t\_1}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq 10^{+96}:\\
\;\;\;\;\frac{-1}{\frac{t\_4}{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot t\_4\right)\right)}}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)} \cdot \sqrt{t\_1}}{-4 \cdot \left(A \cdot \left(-C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6410.3
Simplified10.3%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6411.3
Simplified11.3%
distribute-lft-neg-inN/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6411.2
Applied egg-rr11.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))) < -2.0000000000000002e-195Initial program 96.7%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr96.7%
if -2.0000000000000002e-195 < (/.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))) < 1.00000000000000005e96Initial program 18.9%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr16.5%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.6
Simplified18.6%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
Applied egg-rr25.8%
if 1.00000000000000005e96 < (/.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 26.3%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.6%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.1
Simplified38.1%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6438.1
Simplified38.1%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification35.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) (* B_m B_m)))
(t_1 (* 2.0 (* F t_0)))
(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 (- INFINITY))
(* (* (sqrt F) (- (/ (sqrt 2.0) B_m))) (sqrt (/ (* B_m (* B_m -0.5)) A)))
(if (<= t_3 -2e-195)
(/
(sqrt (* (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))) t_1))
(- t_0))
(if (<= t_3 1e+96)
(/
(sqrt
(*
(fma B_m (* -0.5 (/ B_m A)) (* 2.0 C))
(* F (* 2.0 (fma A (* C -4.0) (* B_m B_m))))))
(fma B_m (- B_m) (* A (* 4.0 C))))
(if (<= t_3 INFINITY)
(/
(* (sqrt (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))) (sqrt t_1))
(* -4.0 (* A (- C))))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = 2.0 * (F * t_0);
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 <= -((double) INFINITY)) {
tmp = (sqrt(F) * -(sqrt(2.0) / B_m)) * sqrt(((B_m * (B_m * -0.5)) / A));
} else if (t_3 <= -2e-195) {
tmp = sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) * t_1)) / -t_0;
} else if (t_3 <= 1e+96) {
tmp = sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * fma(A, (C * -4.0), (B_m * B_m)))))) / fma(B_m, -B_m, (A * (4.0 * C)));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt(fma(-0.5, ((B_m * B_m) / A), (2.0 * C))) * sqrt(t_1)) / (-4.0 * (A * -C));
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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), Float64(B_m * B_m)) t_1 = Float64(2.0 * Float64(F * t_0)) 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 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(F) * Float64(-Float64(sqrt(2.0) / B_m))) * sqrt(Float64(Float64(B_m * Float64(B_m * -0.5)) / A))); elseif (t_3 <= -2e-195) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * t_1)) / Float64(-t_0)); elseif (t_3 <= 1e+96) tmp = Float64(sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))))) / fma(B_m, Float64(-B_m), Float64(A * Float64(4.0 * C)))); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))) * sqrt(t_1)) / Float64(-4.0 * Float64(A * Float64(-C)))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $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, (-Infinity)], N[(N[(N[Sqrt[F], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision] * N[Sqrt[N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -2e-195], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, 1e+96], N[(N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * (-C)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 \cdot B\_m\right)\\
t_1 := 2 \cdot \left(F \cdot t\_0\right)\\
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 -\infty:\\
\;\;\;\;\left(\sqrt{F} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\right) \cdot \sqrt{\frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot t\_1}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq 10^{+96}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\right)\right)}}{\mathsf{fma}\left(B\_m, -B\_m, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)} \cdot \sqrt{t\_1}}{-4 \cdot \left(A \cdot \left(-C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6410.3
Simplified10.3%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6411.3
Simplified11.3%
distribute-lft-neg-inN/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6411.2
Applied egg-rr11.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))) < -2.0000000000000002e-195Initial program 96.7%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr96.7%
if -2.0000000000000002e-195 < (/.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))) < 1.00000000000000005e96Initial program 18.9%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr16.5%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6418.6
Simplified18.6%
Applied egg-rr25.7%
if 1.00000000000000005e96 < (/.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 26.3%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr48.6%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.1
Simplified38.1%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6438.1
Simplified38.1%
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
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.6
Simplified13.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6421.2
Applied egg-rr21.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.2
Applied egg-rr21.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6421.2
Applied egg-rr21.2%
Final simplification35.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B_m 2.0)))))
(if (<= t_1 -5e+164)
(* (* (sqrt F) (- (/ (sqrt 2.0) B_m))) (sqrt (/ (* B_m (* B_m -0.5)) A)))
(if (<= t_1 -4e-138)
(*
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C)))))
(- (sqrt 2.0)))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = (4.0 * A) * C;
double t_1 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B_m, 2.0));
double tmp;
if (t_1 <= -5e+164) {
tmp = (sqrt(F) * -(sqrt(2.0) / B_m)) * sqrt(((B_m * (B_m * -0.5)) / A));
} else if (t_1 <= -4e-138) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C))))) * -sqrt(2.0);
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B_m ^ 2.0))) tmp = 0.0 if (t_1 <= -5e+164) tmp = Float64(Float64(sqrt(F) * Float64(-Float64(sqrt(2.0) / B_m))) * sqrt(Float64(Float64(B_m * Float64(B_m * -0.5)) / A))); elseif (t_1 <= -4e-138) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(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$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+164], N[(N[(N[Sqrt[F], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision] * N[Sqrt[N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e-138], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+164}:\\
\;\;\;\;\left(\sqrt{F} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\right) \cdot \sqrt{\frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}}\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{-138}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -4.9999999999999995e164Initial program 13.0%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6414.5
Simplified14.5%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6410.2
Simplified10.2%
distribute-lft-neg-inN/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6410.1
Applied egg-rr10.1%
if -4.9999999999999995e164 < (/.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.00000000000000027e-138Initial program 96.6%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified97.9%
if -4.00000000000000027e-138 < (/.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 11.9%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f649.6
Simplified9.6%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6414.7
Applied egg-rr14.7%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6414.6
Applied egg-rr14.6%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6414.6
Applied egg-rr14.6%
Final simplification25.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 (* (* 4.0 A) C))
(t_1
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B_m 2.0)))))
(if (<= t_1 (- INFINITY))
(* (* (sqrt F) (- (/ (sqrt 2.0) B_m))) (sqrt (/ (* B_m (* B_m -0.5)) A)))
(if (<= t_1 -4e-178)
(/
(* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m)))))))
(- B_m))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = (4.0 * A) * C;
double t_1 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B_m, 2.0));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (sqrt(F) * -(sqrt(2.0) / B_m)) * sqrt(((B_m * (B_m * -0.5)) / A));
} else if (t_1 <= -4e-178) {
tmp = (sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / -B_m;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B_m ^ 2.0))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(F) * Float64(-Float64(sqrt(2.0) / B_m))) * sqrt(Float64(Float64(B_m * Float64(B_m * -0.5)) / A))); elseif (t_1 <= -4e-178) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(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$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[Sqrt[F], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision] * N[Sqrt[N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e-178], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\left(\sqrt{F} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\right) \cdot \sqrt{\frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}}\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{-178}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -inf.0Initial program 3.1%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6410.3
Simplified10.3%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6411.3
Simplified11.3%
distribute-lft-neg-inN/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6411.2
Applied egg-rr11.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))) < -3.9999999999999998e-178Initial program 96.6%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified29.3%
if -3.9999999999999998e-178 < (/.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 8.6%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f649.9
Simplified9.9%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6415.2
Applied egg-rr15.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.2
Applied egg-rr15.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6415.2
Applied egg-rr15.2%
Final simplification17.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B_m 2.0)))
-4e+124)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (* -0.5 (/ (* B_m B_m) A)))))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B_m, 2.0))) <= -4e+124) {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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) :: t_0
real(8) :: tmp
t_0 = (4.0d0 * a) * c
if ((sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * ((a + c) + sqrt(((b_m ** 2.0d0) + ((a - c) ** 2.0d0)))))) / (t_0 - (b_m ** 2.0d0))) <= (-4d+124)) then
tmp = -(sqrt(2.0d0) / b_m) * sqrt((f * ((-0.5d0) * ((b_m * b_m) / a))))
else
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
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 t_0 = (4.0 * A) * C;
double tmp;
if ((Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * ((A + C) + Math.sqrt((Math.pow(B_m, 2.0) + Math.pow((A - C), 2.0)))))) / (t_0 - Math.pow(B_m, 2.0))) <= -4e+124) {
tmp = -(Math.sqrt(2.0) / B_m) * Math.sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} else {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if (math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * ((A + C) + math.sqrt((math.pow(B_m, 2.0) + math.pow((A - C), 2.0)))))) / (t_0 - math.pow(B_m, 2.0))) <= -4e+124: tmp = -(math.sqrt(2.0) / B_m) * math.sqrt((F * (-0.5 * ((B_m * B_m) / A)))) else: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B_m ^ 2.0))) <= -4e+124) tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(-0.5 * Float64(Float64(B_m * B_m) / A))))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * ((A + C) + sqrt(((B_m ^ 2.0) + ((A - C) ^ 2.0)))))) / (t_0 - (B_m ^ 2.0))) <= -4e+124)
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
else
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(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$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e+124], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}} \leq -4 \cdot 10^{+124}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B\_m}\right) \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -3.99999999999999979e124Initial program 16.0%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6414.1
Simplified14.1%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f649.9
Simplified9.9%
if -3.99999999999999979e124 < (/.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 25.9%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.1
Simplified12.1%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6416.4
Applied egg-rr16.4%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6416.3
Applied egg-rr16.3%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6416.3
Applied egg-rr16.3%
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
(let* ((t_0 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B_m 2.0)))
-4e+124)
(* (sqrt (* 2.0 (/ (* F (* B_m (* B_m -0.5))) A))) (/ -1.0 B_m))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B_m, 2.0))) <= -4e+124) {
tmp = sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) * (-1.0 / B_m);
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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) :: t_0
real(8) :: tmp
t_0 = (4.0d0 * a) * c
if ((sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * ((a + c) + sqrt(((b_m ** 2.0d0) + ((a - c) ** 2.0d0)))))) / (t_0 - (b_m ** 2.0d0))) <= (-4d+124)) then
tmp = sqrt((2.0d0 * ((f * (b_m * (b_m * (-0.5d0)))) / a))) * ((-1.0d0) / b_m)
else
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
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 t_0 = (4.0 * A) * C;
double tmp;
if ((Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * ((A + C) + Math.sqrt((Math.pow(B_m, 2.0) + Math.pow((A - C), 2.0)))))) / (t_0 - Math.pow(B_m, 2.0))) <= -4e+124) {
tmp = Math.sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) * (-1.0 / B_m);
} else {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if (math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * ((A + C) + math.sqrt((math.pow(B_m, 2.0) + math.pow((A - C), 2.0)))))) / (t_0 - math.pow(B_m, 2.0))) <= -4e+124: tmp = math.sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) * (-1.0 / B_m) else: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B_m ^ 2.0))) <= -4e+124) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * Float64(B_m * Float64(B_m * -0.5))) / A))) * Float64(-1.0 / B_m)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * ((A + C) + sqrt(((B_m ^ 2.0) + ((A - C) ^ 2.0)))))) / (t_0 - (B_m ^ 2.0))) <= -4e+124)
tmp = sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) * (-1.0 / B_m);
else
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(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$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e+124], N[(N[Sqrt[N[(2.0 * N[(N[(F * N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}} \leq -4 \cdot 10^{+124}:\\
\;\;\;\;\sqrt{2 \cdot \frac{F \cdot \left(B\_m \cdot \left(B\_m \cdot -0.5\right)\right)}{A}} \cdot \frac{-1}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -3.99999999999999979e124Initial program 16.0%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6414.1
Simplified14.1%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f649.9
Simplified9.9%
associate-*l/N/A
distribute-neg-frac2N/A
div-invN/A
*-lowering-*.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
Applied egg-rr9.9%
if -3.99999999999999979e124 < (/.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 25.9%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.1
Simplified12.1%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6416.4
Applied egg-rr16.4%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6416.3
Applied egg-rr16.3%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6416.3
Applied egg-rr16.3%
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
(let* ((t_0 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B_m 2.0)))
-4e+124)
(/ (sqrt (* 2.0 (/ (* F (* B_m (* B_m -0.5))) A))) (- B_m))
(/ (- (sqrt F)) (sqrt (* 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) {
double t_0 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B_m, 2.0))) <= -4e+124) {
tmp = sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) / -B_m;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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) :: t_0
real(8) :: tmp
t_0 = (4.0d0 * a) * c
if ((sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * ((a + c) + sqrt(((b_m ** 2.0d0) + ((a - c) ** 2.0d0)))))) / (t_0 - (b_m ** 2.0d0))) <= (-4d+124)) then
tmp = sqrt((2.0d0 * ((f * (b_m * (b_m * (-0.5d0)))) / a))) / -b_m
else
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
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 t_0 = (4.0 * A) * C;
double tmp;
if ((Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * ((A + C) + Math.sqrt((Math.pow(B_m, 2.0) + Math.pow((A - C), 2.0)))))) / (t_0 - Math.pow(B_m, 2.0))) <= -4e+124) {
tmp = Math.sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) / -B_m;
} else {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if (math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * ((A + C) + math.sqrt((math.pow(B_m, 2.0) + math.pow((A - C), 2.0)))))) / (t_0 - math.pow(B_m, 2.0))) <= -4e+124: tmp = math.sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) / -B_m else: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B_m ^ 2.0))) <= -4e+124) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * Float64(B_m * Float64(B_m * -0.5))) / A))) / Float64(-B_m)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * ((A + C) + sqrt(((B_m ^ 2.0) + ((A - C) ^ 2.0)))))) / (t_0 - (B_m ^ 2.0))) <= -4e+124)
tmp = sqrt((2.0 * ((F * (B_m * (B_m * -0.5))) / A))) / -B_m;
else
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(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$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e+124], N[(N[Sqrt[N[(2.0 * N[(N[(F * N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}} \leq -4 \cdot 10^{+124}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \frac{F \cdot \left(B\_m \cdot \left(B\_m \cdot -0.5\right)\right)}{A}}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\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))) < -3.99999999999999979e124Initial program 16.0%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6414.1
Simplified14.1%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f649.9
Simplified9.9%
associate-*l/N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f649.9
Applied egg-rr9.9%
if -3.99999999999999979e124 < (/.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 25.9%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.1
Simplified12.1%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6416.4
Applied egg-rr16.4%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6416.3
Applied egg-rr16.3%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6416.3
Applied egg-rr16.3%
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
(if (<= (pow B_m 2.0) 5e-99)
(/
(sqrt
(*
(fma B_m (* -0.5 (/ B_m A)) (* 2.0 C))
(* F (* 2.0 (fma A (* C -4.0) (* B_m B_m))))))
(fma B_m (- B_m) (* A (* 4.0 C))))
(if (<= (pow B_m 2.0) 5e+262)
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) (- B_m))
(/ (- (sqrt F)) (sqrt (* 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) {
double tmp;
if (pow(B_m, 2.0) <= 5e-99) {
tmp = sqrt((fma(B_m, (-0.5 * (B_m / A)), (2.0 * C)) * (F * (2.0 * fma(A, (C * -4.0), (B_m * B_m)))))) / fma(B_m, -B_m, (A * (4.0 * C)));
} else if (pow(B_m, 2.0) <= 5e+262) {
tmp = (sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / -B_m;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-99) tmp = Float64(sqrt(Float64(fma(B_m, Float64(-0.5 * Float64(B_m / A)), Float64(2.0 * C)) * Float64(F * Float64(2.0 * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))))) / fma(B_m, Float64(-B_m), Float64(A * Float64(4.0 * C)))); elseif ((B_m ^ 2.0) <= 5e+262) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-99], N[(N[Sqrt[N[(N[(B$95$m * N[(-0.5 * N[(B$95$m / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+262], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-99}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(B\_m, -0.5 \cdot \frac{B\_m}{A}, 2 \cdot C\right) \cdot \left(F \cdot \left(2 \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\right)\right)}}{\mathsf{fma}\left(B\_m, -B\_m, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+262}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999969e-99Initial program 22.6%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr24.4%
Taylor expanded in A around -inf
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6420.5
Simplified20.5%
Applied egg-rr24.4%
if 4.99999999999999969e-99 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000008e262Initial program 45.4%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified17.5%
if 5.00000000000000008e262 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.0%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6420.5
Simplified20.5%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6431.7
Applied egg-rr31.7%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6431.6
Applied egg-rr31.6%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6431.6
Applied egg-rr31.6%
Final simplification24.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 6.5e-50)
(- (* (/ (sqrt 2.0) B_m) (sqrt (* F (/ (* B_m -0.5) (/ A B_m))))))
(if (<= B_m 4.3e+131)
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) (- B_m))
(/ (- (sqrt F)) (sqrt (* 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) {
double tmp;
if (B_m <= 6.5e-50) {
tmp = -((sqrt(2.0) / B_m) * sqrt((F * ((B_m * -0.5) / (A / B_m)))));
} else if (B_m <= 4.3e+131) {
tmp = (sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / -B_m;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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 <= 6.5e-50) tmp = Float64(-Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(Float64(B_m * -0.5) / Float64(A / B_m)))))); elseif (B_m <= 4.3e+131) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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, 6.5e-50], (-N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(B$95$m * -0.5), $MachinePrecision] / N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), If[LessEqual[B$95$m, 4.3e+131], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 6.5 \cdot 10^{-50}:\\
\;\;\;\;-\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \frac{B\_m \cdot -0.5}{\frac{A}{B\_m}}}\\
\mathbf{elif}\;B\_m \leq 4.3 \cdot 10^{+131}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 6.49999999999999987e-50Initial program 23.4%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f644.3
Simplified4.3%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f646.9
Simplified6.9%
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f647.9
Applied egg-rr7.9%
if 6.49999999999999987e-50 < B < 4.3000000000000001e131Initial program 45.4%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified40.2%
if 4.3000000000000001e131 < B Initial program 3.6%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6448.1
Simplified48.1%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6478.1
Applied egg-rr78.1%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6477.9
Applied egg-rr77.9%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6477.9
Applied egg-rr77.9%
Final simplification20.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 8.4e-50)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (* (/ B_m A) (* B_m -0.5)))))
(if (<= B_m 1.9e+131)
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) (- B_m))
(/ (- (sqrt F)) (sqrt (* 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) {
double tmp;
if (B_m <= 8.4e-50) {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * ((B_m / A) * (B_m * -0.5))));
} else if (B_m <= 1.9e+131) {
tmp = (sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / -B_m;
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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 <= 8.4e-50) tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(Float64(B_m / A) * Float64(B_m * -0.5))))); elseif (B_m <= 1.9e+131) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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, 8.4e-50], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(N[(B$95$m / A), $MachinePrecision] * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.9e+131], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 8.4 \cdot 10^{-50}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B\_m}\right) \cdot \sqrt{F \cdot \left(\frac{B\_m}{A} \cdot \left(B\_m \cdot -0.5\right)\right)}\\
\mathbf{elif}\;B\_m \leq 1.9 \cdot 10^{+131}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 8.4000000000000003e-50Initial program 23.4%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f644.3
Simplified4.3%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f646.9
Simplified6.9%
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f647.9
Applied egg-rr7.9%
if 8.4000000000000003e-50 < B < 1.9000000000000002e131Initial program 45.4%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified40.2%
if 1.9000000000000002e131 < B Initial program 3.6%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6448.1
Simplified48.1%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6478.1
Applied egg-rr78.1%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6477.9
Applied egg-rr77.9%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6477.9
Applied egg-rr77.9%
Final simplification20.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 9e-50) (* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (* (/ B_m A) (* B_m -0.5))))) (/ (- (sqrt F)) (sqrt (* 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) {
double tmp;
if (B_m <= 9e-50) {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * ((B_m / A) * (B_m * -0.5))));
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
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 <= 9d-50) then
tmp = -(sqrt(2.0d0) / b_m) * sqrt((f * ((b_m / a) * (b_m * (-0.5d0)))))
else
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
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 <= 9e-50) {
tmp = -(Math.sqrt(2.0) / B_m) * Math.sqrt((F * ((B_m / A) * (B_m * -0.5))));
} else {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
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 <= 9e-50: tmp = -(math.sqrt(2.0) / B_m) * math.sqrt((F * ((B_m / A) * (B_m * -0.5)))) else: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) 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 <= 9e-50) tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(Float64(B_m / A) * Float64(B_m * -0.5))))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); 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 <= 9e-50)
tmp = -(sqrt(2.0) / B_m) * sqrt((F * ((B_m / A) * (B_m * -0.5))));
else
tmp = -sqrt(F) / sqrt((B_m * 0.5));
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, 9e-50], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(N[(B$95$m / A), $MachinePrecision] * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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 9 \cdot 10^{-50}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B\_m}\right) \cdot \sqrt{F \cdot \left(\frac{B\_m}{A} \cdot \left(B\_m \cdot -0.5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 8.99999999999999924e-50Initial program 23.4%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f644.3
Simplified4.3%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f646.9
Simplified6.9%
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f647.9
Applied egg-rr7.9%
if 8.99999999999999924e-50 < B Initial program 24.9%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6439.5
Simplified39.5%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6454.3
Applied egg-rr54.3%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6454.2
Applied egg-rr54.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6454.2
Applied egg-rr54.2%
Final simplification19.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 (/ (- (sqrt F)) (sqrt (* 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 -sqrt(F) / sqrt((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 = -sqrt(f) / sqrt((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.sqrt(F) / Math.sqrt((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.sqrt(F) / math.sqrt((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(-sqrt(F)) / sqrt(Float64(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 = -sqrt(F) / sqrt((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[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}
\end{array}
Initial program 23.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6411.5
Simplified11.5%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6415.5
Applied egg-rr15.5%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.5
Applied egg-rr15.5%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6415.5
Applied egg-rr15.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (- (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(Float64(-sqrt(F)) * 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])\\
\\
\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B\_m}}
\end{array}
Initial program 23.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6411.5
Simplified11.5%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6415.5
Applied egg-rr15.5%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.5
Applied egg-rr15.5%
Final simplification15.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (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(Float64(2.0 * 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[(N[(2.0 * F), $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])\\
\\
-\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 23.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6411.5
Simplified11.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6411.5
Applied egg-rr11.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (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 23.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6411.5
Simplified11.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6411.5
Applied egg-rr11.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6411.5
Applied egg-rr11.5%
Final simplification11.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (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 23.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6411.5
Simplified11.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6411.5
Applied egg-rr11.5%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6411.5
Applied egg-rr11.5%
herbie shell --seed 2024205
(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))))