
(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 12 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 (* F (+ A A)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0))))
(t_3 (fma B_m B_m (* (* A C) -4.0))))
(if (<= t_2 (- INFINITY))
(/ -1.0 (* (sqrt (* -2.0 (/ C F))) (/ 1.0 (sqrt 2.0))))
(if (<= t_2 -2e-161)
(/
(sqrt
(*
(* t_3 (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
(fma B_m (- B_m) t_1))
(if (<= t_2 0.0)
(/ -1.0 (/ t_3 (* (sqrt (* (* A -8.0) t_0)) (sqrt C))))
(if (<= t_2 INFINITY)
(/ -1.0 (/ t_3 (* (sqrt (* A C)) (sqrt (* -8.0 t_0)))))
(/
-1.0
(*
(sqrt B_m)
(sqrt
(/ (+ (/ (* (+ A C) (/ -1.0 F)) B_m) (/ -1.0 F)) 2.0))))))))))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 = F * (A + A);
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(B_m, B_m, ((A * C) * -4.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = -1.0 / (sqrt((-2.0 * (C / F))) * (1.0 / sqrt(2.0)));
} else if (t_2 <= -2e-161) {
tmp = sqrt(((t_3 * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B_m * B_m)))))) / fma(B_m, -B_m, t_1);
} else if (t_2 <= 0.0) {
tmp = -1.0 / (t_3 / (sqrt(((A * -8.0) * t_0)) * sqrt(C)));
} else if (t_2 <= ((double) INFINITY)) {
tmp = -1.0 / (t_3 / (sqrt((A * C)) * sqrt((-8.0 * t_0))));
} else {
tmp = -1.0 / (sqrt(B_m) * sqrt((((((A + C) * (-1.0 / F)) / B_m) + (-1.0 / F)) / 2.0)));
}
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(F * Float64(A + A)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(B_m, B_m, Float64(Float64(A * C) * -4.0)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(sqrt(Float64(-2.0 * Float64(C / F))) * Float64(1.0 / sqrt(2.0)))); elseif (t_2 <= -2e-161) tmp = Float64(sqrt(Float64(Float64(t_3 * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) / fma(B_m, Float64(-B_m), t_1)); elseif (t_2 <= 0.0) tmp = Float64(-1.0 / Float64(t_3 / Float64(sqrt(Float64(Float64(A * -8.0) * t_0)) * sqrt(C)))); elseif (t_2 <= Inf) tmp = Float64(-1.0 / Float64(t_3 / Float64(sqrt(Float64(A * C)) * sqrt(Float64(-8.0 * t_0))))); else tmp = Float64(-1.0 / Float64(sqrt(B_m) * sqrt(Float64(Float64(Float64(Float64(Float64(A + C) * Float64(-1.0 / F)) / B_m) + Float64(-1.0 / F)) / 2.0)))); 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[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(-1.0 / N[(N[Sqrt[N[(-2.0 * N[(C / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -2e-161], N[(N[Sqrt[N[(N[(t$95$3 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * 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]], $MachinePrecision] / N[(B$95$m * (-B$95$m) + t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(-1.0 / N[(t$95$3 / N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(-1.0 / N[(t$95$3 / N[(N[Sqrt[N[(A * C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(-8.0 * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[N[(N[(N[(N[(N[(A + C), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision] + N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := F \cdot \left(A + A\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{-1}{\sqrt{-2 \cdot \frac{C}{F}} \cdot \frac{1}{\sqrt{2}}}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-161}:\\
\;\;\;\;\frac{\sqrt{\left(t\_3 \cdot \left(2 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}}{\mathsf{fma}\left(B\_m, -B\_m, t\_1\right)}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{-1}{\frac{t\_3}{\sqrt{\left(A \cdot -8\right) \cdot t\_0} \cdot \sqrt{C}}}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{-1}{\frac{t\_3}{\sqrt{A \cdot C} \cdot \sqrt{-8 \cdot t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\sqrt{B\_m} \cdot \sqrt{\frac{\frac{\left(A + C\right) \cdot \frac{-1}{F}}{B\_m} + \frac{-1}{F}}{2}}}\\
\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.2%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr3.2%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified29.0%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f6434.5
Simplified34.5%
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.00000000000000006e-161Initial program 99.5%
remove-double-negN/A
frac-2negN/A
/-lowering-/.f64N/A
Applied egg-rr99.5%
if -2.00000000000000006e-161 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 0.0Initial program 6.5%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr6.5%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6421.6
Simplified21.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
remove-double-negN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6429.8
Applied egg-rr29.8%
if 0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 47.8%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr47.8%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6432.4
Simplified32.4%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sub-negN/A
remove-double-negN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6436.7
Applied egg-rr36.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))) Initial program 0.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.0%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified0.4%
Taylor expanded in B around inf
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6417.4
Simplified17.4%
un-div-invN/A
pow1/2N/A
unpow-prod-downN/A
associate-/l*N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.1%
Final simplification36.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 (* A C) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 2000.0)
(/
(sqrt (* (* F (* 2.0 t_0)) (fma B_m (* (/ B_m C) -0.5) (+ A A))))
(- t_0))
(/
-1.0
(*
(sqrt B_m)
(sqrt (/ (+ (/ (* (+ A C) (/ -1.0 F)) B_m) (/ -1.0 F)) 2.0)))))))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 tmp;
if (pow(B_m, 2.0) <= 2000.0) {
tmp = sqrt(((F * (2.0 * t_0)) * fma(B_m, ((B_m / C) * -0.5), (A + A)))) / -t_0;
} else {
tmp = -1.0 / (sqrt(B_m) * sqrt((((((A + C) * (-1.0 / F)) / B_m) + (-1.0 / F)) / 2.0)));
}
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(Float64(A * C), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2000.0) tmp = Float64(sqrt(Float64(Float64(F * Float64(2.0 * t_0)) * fma(B_m, Float64(Float64(B_m / C) * -0.5), Float64(A + A)))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(sqrt(B_m) * sqrt(Float64(Float64(Float64(Float64(Float64(A + C) * Float64(-1.0 / F)) / B_m) + Float64(-1.0 / F)) / 2.0)))); 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[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2000.0], N[(N[Sqrt[N[(N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(B$95$m * N[(N[(B$95$m / C), $MachinePrecision] * -0.5), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[N[(N[(N[(N[(N[(A + C), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision] + N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2000:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \left(2 \cdot t\_0\right)\right) \cdot \mathsf{fma}\left(B\_m, \frac{B\_m}{C} \cdot -0.5, A + A\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\sqrt{B\_m} \cdot \sqrt{\frac{\frac{\left(A + C\right) \cdot \frac{-1}{F}}{B\_m} + \frac{-1}{F}}{2}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e3Initial program 24.9%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6418.9
Simplified18.9%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr18.9%
if 2e3 < (pow.f64 B #s(literal 2 binary64)) Initial program 15.6%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr15.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified22.3%
Taylor expanded in B around inf
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6424.3
Simplified24.3%
un-div-invN/A
pow1/2N/A
unpow-prod-downN/A
associate-/l*N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr24.9%
Final simplification21.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 (<= B_m 1.75e-170)
(/
(sqrt (* (* A C) (* -8.0 (* F (+ A A)))))
(- (fma A (* C -4.0) (* B_m B_m))))
(if (<= B_m 64000.0)
(/ -1.0 (* (sqrt (* -2.0 (/ C F))) (/ 1.0 (sqrt 2.0))))
(if (<= B_m 1.08e+126)
(/
-1.0
(*
(/ B_m (sqrt 2.0))
(sqrt (/ -1.0 (* F (- (sqrt (fma A A (* B_m B_m))) A))))))
(-
(sqrt
(/ 2.0 (fma B_m (/ (* (+ A C) (/ -1.0 F)) B_m) (/ B_m (- F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.75e-170) {
tmp = sqrt(((A * C) * (-8.0 * (F * (A + A))))) / -fma(A, (C * -4.0), (B_m * B_m));
} else if (B_m <= 64000.0) {
tmp = -1.0 / (sqrt((-2.0 * (C / F))) * (1.0 / sqrt(2.0)));
} else if (B_m <= 1.08e+126) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((-1.0 / (F * (sqrt(fma(A, A, (B_m * B_m))) - A)))));
} else {
tmp = -sqrt((2.0 / fma(B_m, (((A + C) * (-1.0 / F)) / B_m), (B_m / -F))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.75e-170) tmp = Float64(sqrt(Float64(Float64(A * C) * Float64(-8.0 * Float64(F * Float64(A + A))))) / Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m)))); elseif (B_m <= 64000.0) tmp = Float64(-1.0 / Float64(sqrt(Float64(-2.0 * Float64(C / F))) * Float64(1.0 / sqrt(2.0)))); elseif (B_m <= 1.08e+126) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(-1.0 / Float64(F * Float64(sqrt(fma(A, A, Float64(B_m * B_m))) - A)))))); else tmp = Float64(-sqrt(Float64(2.0 / fma(B_m, Float64(Float64(Float64(A + C) * Float64(-1.0 / F)) / B_m), Float64(B_m / Float64(-F)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.75e-170], N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * N[(-8.0 * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 64000.0], N[(-1.0 / N[(N[Sqrt[N[(-2.0 * N[(C / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.08e+126], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-1.0 / N[(F * N[(N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(2.0 / N[(B$95$m * N[(N[(N[(A + C), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision] + N[(B$95$m / (-F)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.75 \cdot 10^{-170}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot C\right) \cdot \left(-8 \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 64000:\\
\;\;\;\;\frac{-1}{\sqrt{-2 \cdot \frac{C}{F}} \cdot \frac{1}{\sqrt{2}}}\\
\mathbf{elif}\;B\_m \leq 1.08 \cdot 10^{+126}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{-1}{F \cdot \left(\sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)} - A\right)}}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2}{\mathsf{fma}\left(B\_m, \frac{\left(A + C\right) \cdot \frac{-1}{F}}{B\_m}, \frac{B\_m}{-F}\right)}}\\
\end{array}
\end{array}
if B < 1.74999999999999992e-170Initial program 19.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.9%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6412.0
Simplified12.0%
associate-/r/N/A
+-commutativeN/A
associate-*l/N/A
neg-mul-1N/A
/-lowering-/.f64N/A
Applied egg-rr13.5%
if 1.74999999999999992e-170 < B < 64000Initial program 30.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr29.9%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified17.2%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f6419.7
Simplified19.7%
if 64000 < B < 1.0799999999999999e126Initial program 44.1%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr44.1%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified47.9%
Taylor expanded in C around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6446.0
Simplified46.0%
if 1.0799999999999999e126 < B Initial program 0.5%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified6.5%
Taylor expanded in B around inf
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6464.5
Simplified64.5%
div-invN/A
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-rgt-identityN/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
Applied egg-rr65.2%
Final simplification23.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.65e-170)
(/
(sqrt (* (* A C) (* -8.0 (* F (+ A A)))))
(- (fma A (* C -4.0) (* B_m B_m))))
(if (<= B_m 340000.0)
(/ -1.0 (* (sqrt (* -2.0 (/ C F))) (/ 1.0 (sqrt 2.0))))
(/
-1.0
(*
(sqrt B_m)
(sqrt (/ (+ (/ (* (+ A C) (/ -1.0 F)) B_m) (/ -1.0 F)) 2.0)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.65e-170) {
tmp = sqrt(((A * C) * (-8.0 * (F * (A + A))))) / -fma(A, (C * -4.0), (B_m * B_m));
} else if (B_m <= 340000.0) {
tmp = -1.0 / (sqrt((-2.0 * (C / F))) * (1.0 / sqrt(2.0)));
} else {
tmp = -1.0 / (sqrt(B_m) * sqrt((((((A + C) * (-1.0 / F)) / B_m) + (-1.0 / F)) / 2.0)));
}
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.65e-170) tmp = Float64(sqrt(Float64(Float64(A * C) * Float64(-8.0 * Float64(F * Float64(A + A))))) / Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m)))); elseif (B_m <= 340000.0) tmp = Float64(-1.0 / Float64(sqrt(Float64(-2.0 * Float64(C / F))) * Float64(1.0 / sqrt(2.0)))); else tmp = Float64(-1.0 / Float64(sqrt(B_m) * sqrt(Float64(Float64(Float64(Float64(Float64(A + C) * Float64(-1.0 / F)) / B_m) + Float64(-1.0 / F)) / 2.0)))); 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, 2.65e-170], N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * N[(-8.0 * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 340000.0], N[(-1.0 / N[(N[Sqrt[N[(-2.0 * N[(C / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[N[(N[(N[(N[(N[(A + C), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision] + N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-170}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot C\right) \cdot \left(-8 \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 340000:\\
\;\;\;\;\frac{-1}{\sqrt{-2 \cdot \frac{C}{F}} \cdot \frac{1}{\sqrt{2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\sqrt{B\_m} \cdot \sqrt{\frac{\frac{\left(A + C\right) \cdot \frac{-1}{F}}{B\_m} + \frac{-1}{F}}{2}}}\\
\end{array}
\end{array}
if B < 2.65e-170Initial program 19.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.9%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6412.0
Simplified12.0%
associate-/r/N/A
+-commutativeN/A
associate-*l/N/A
neg-mul-1N/A
/-lowering-/.f64N/A
Applied egg-rr13.5%
if 2.65e-170 < B < 3.4e5Initial program 30.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr29.9%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified17.2%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f6419.7
Simplified19.7%
if 3.4e5 < B Initial program 18.7%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified23.8%
Taylor expanded in B around inf
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6453.8
Simplified53.8%
un-div-invN/A
pow1/2N/A
unpow-prod-downN/A
associate-/l*N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
Applied egg-rr57.5%
Final simplification23.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.2e-170)
(/
(sqrt (* (* A C) (* -8.0 (* F (+ A A)))))
(- (fma A (* C -4.0) (* B_m B_m))))
(if (<= B_m 24000.0)
(/ -1.0 (* (sqrt (* -2.0 (/ C F))) (/ 1.0 (sqrt 2.0))))
(if (<= B_m 8.6e+124)
(/ (sqrt (* 2.0 (* F (- A (sqrt (fma B_m B_m (* A A))))))) (- B_m))
(-
(sqrt
(/ 2.0 (fma B_m (/ (* (+ A C) (/ -1.0 F)) B_m) (/ B_m (- F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.2e-170) {
tmp = sqrt(((A * C) * (-8.0 * (F * (A + A))))) / -fma(A, (C * -4.0), (B_m * B_m));
} else if (B_m <= 24000.0) {
tmp = -1.0 / (sqrt((-2.0 * (C / F))) * (1.0 / sqrt(2.0)));
} else if (B_m <= 8.6e+124) {
tmp = sqrt((2.0 * (F * (A - sqrt(fma(B_m, B_m, (A * A))))))) / -B_m;
} else {
tmp = -sqrt((2.0 / fma(B_m, (((A + C) * (-1.0 / F)) / B_m), (B_m / -F))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.2e-170) tmp = Float64(sqrt(Float64(Float64(A * C) * Float64(-8.0 * Float64(F * Float64(A + A))))) / Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m)))); elseif (B_m <= 24000.0) tmp = Float64(-1.0 / Float64(sqrt(Float64(-2.0 * Float64(C / F))) * Float64(1.0 / sqrt(2.0)))); elseif (B_m <= 8.6e+124) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A))))))) / Float64(-B_m)); else tmp = Float64(-sqrt(Float64(2.0 / fma(B_m, Float64(Float64(Float64(A + C) * Float64(-1.0 / F)) / B_m), Float64(B_m / Float64(-F)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.2e-170], N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * N[(-8.0 * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 24000.0], N[(-1.0 / N[(N[Sqrt[N[(-2.0 * N[(C / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 8.6e+124], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[Sqrt[N[(2.0 / N[(B$95$m * N[(N[(N[(A + C), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision] + N[(B$95$m / (-F)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.2 \cdot 10^{-170}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot C\right) \cdot \left(-8 \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 24000:\\
\;\;\;\;\frac{-1}{\sqrt{-2 \cdot \frac{C}{F}} \cdot \frac{1}{\sqrt{2}}}\\
\mathbf{elif}\;B\_m \leq 8.6 \cdot 10^{+124}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2}{\mathsf{fma}\left(B\_m, \frac{\left(A + C\right) \cdot \frac{-1}{F}}{B\_m}, \frac{B\_m}{-F}\right)}}\\
\end{array}
\end{array}
if B < 2.20000000000000015e-170Initial program 19.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.9%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6412.0
Simplified12.0%
associate-/r/N/A
+-commutativeN/A
associate-*l/N/A
neg-mul-1N/A
/-lowering-/.f64N/A
Applied egg-rr13.5%
if 2.20000000000000015e-170 < B < 24000Initial program 30.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr29.9%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified17.2%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f6419.7
Simplified19.7%
if 24000 < B < 8.6e124Initial program 44.1%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr44.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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6445.8
Simplified45.8%
associate-*l/N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
Applied egg-rr46.2%
if 8.6e124 < B Initial program 0.5%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified6.5%
Taylor expanded in B around inf
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6464.5
Simplified64.5%
div-invN/A
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
associate-/r*N/A
clear-numN/A
/-rgt-identityN/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sub-negN/A
Applied egg-rr65.2%
Final simplification23.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 (/ 1.0 (sqrt 2.0))))
(if (<= B_m 2.2e-170)
(/
(sqrt (* (* A C) (* -8.0 (* F (+ A A)))))
(- (fma A (* C -4.0) (* B_m B_m))))
(if (<= B_m 3500.0)
(/ -1.0 (* (sqrt (* -2.0 (/ C F))) t_0))
(if (<= B_m 1.95e+124)
(/ (sqrt (* 2.0 (* F (- A (sqrt (fma B_m B_m (* A A))))))) (- B_m))
(/ -1.0 (* t_0 (sqrt (/ B_m (- F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = 1.0 / sqrt(2.0);
double tmp;
if (B_m <= 2.2e-170) {
tmp = sqrt(((A * C) * (-8.0 * (F * (A + A))))) / -fma(A, (C * -4.0), (B_m * B_m));
} else if (B_m <= 3500.0) {
tmp = -1.0 / (sqrt((-2.0 * (C / F))) * t_0);
} else if (B_m <= 1.95e+124) {
tmp = sqrt((2.0 * (F * (A - sqrt(fma(B_m, B_m, (A * A))))))) / -B_m;
} else {
tmp = -1.0 / (t_0 * sqrt((B_m / -F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(1.0 / sqrt(2.0)) tmp = 0.0 if (B_m <= 2.2e-170) tmp = Float64(sqrt(Float64(Float64(A * C) * Float64(-8.0 * Float64(F * Float64(A + A))))) / Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m)))); elseif (B_m <= 3500.0) tmp = Float64(-1.0 / Float64(sqrt(Float64(-2.0 * Float64(C / F))) * t_0)); elseif (B_m <= 1.95e+124) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A))))))) / Float64(-B_m)); else tmp = Float64(-1.0 / Float64(t_0 * sqrt(Float64(B_m / Float64(-F))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.2e-170], N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * N[(-8.0 * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 3500.0], N[(-1.0 / N[(N[Sqrt[N[(-2.0 * N[(C / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.95e+124], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(-1.0 / N[(t$95$0 * N[Sqrt[N[(B$95$m / (-F)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{1}{\sqrt{2}}\\
\mathbf{if}\;B\_m \leq 2.2 \cdot 10^{-170}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot C\right) \cdot \left(-8 \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 3500:\\
\;\;\;\;\frac{-1}{\sqrt{-2 \cdot \frac{C}{F}} \cdot t\_0}\\
\mathbf{elif}\;B\_m \leq 1.95 \cdot 10^{+124}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{t\_0 \cdot \sqrt{\frac{B\_m}{-F}}}\\
\end{array}
\end{array}
if B < 2.20000000000000015e-170Initial program 19.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.9%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6412.0
Simplified12.0%
associate-/r/N/A
+-commutativeN/A
associate-*l/N/A
neg-mul-1N/A
/-lowering-/.f64N/A
Applied egg-rr13.5%
if 2.20000000000000015e-170 < B < 3500Initial program 30.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr29.9%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified17.2%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
/-lowering-/.f6419.7
Simplified19.7%
if 3500 < B < 1.95e124Initial program 44.1%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr44.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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6445.8
Simplified45.8%
associate-*l/N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
Applied egg-rr46.2%
if 1.95e124 < B Initial program 0.5%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified6.5%
Taylor expanded in B around inf
associate-*r/N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-lowering-neg.f6463.3
Simplified63.3%
Final simplification23.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.9e-81)
(/
(sqrt (* (* A C) (* -8.0 (* F (+ A A)))))
(- (fma A (* C -4.0) (* B_m B_m))))
(if (<= B_m 4.6e+130)
(/ (sqrt (* 2.0 (* F (- A (sqrt (fma B_m B_m (* A A))))))) (- B_m))
(/ -1.0 (* (/ 1.0 (sqrt 2.0)) (sqrt (/ B_m (- F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.9e-81) {
tmp = sqrt(((A * C) * (-8.0 * (F * (A + A))))) / -fma(A, (C * -4.0), (B_m * B_m));
} else if (B_m <= 4.6e+130) {
tmp = sqrt((2.0 * (F * (A - sqrt(fma(B_m, B_m, (A * A))))))) / -B_m;
} else {
tmp = -1.0 / ((1.0 / sqrt(2.0)) * sqrt((B_m / -F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.9e-81) tmp = Float64(sqrt(Float64(Float64(A * C) * Float64(-8.0 * Float64(F * Float64(A + A))))) / Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m)))); elseif (B_m <= 4.6e+130) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A))))))) / Float64(-B_m)); else tmp = Float64(-1.0 / Float64(Float64(1.0 / sqrt(2.0)) * sqrt(Float64(B_m / Float64(-F))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.9e-81], N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * N[(-8.0 * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 4.6e+130], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(-1.0 / N[(N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(B$95$m / (-F)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.9 \cdot 10^{-81}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot C\right) \cdot \left(-8 \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 4.6 \cdot 10^{+130}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{1}{\sqrt{2}} \cdot \sqrt{\frac{B\_m}{-F}}}\\
\end{array}
\end{array}
if B < 2.89999999999999989e-81Initial program 18.6%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr18.6%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f6412.3
Simplified12.3%
associate-/r/N/A
+-commutativeN/A
associate-*l/N/A
neg-mul-1N/A
/-lowering-/.f64N/A
Applied egg-rr13.7%
if 2.89999999999999989e-81 < B < 4.60000000000000042e130Initial program 44.3%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr44.3%
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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6437.9
Simplified37.9%
associate-*l/N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
Applied egg-rr38.1%
if 4.60000000000000042e130 < B Initial program 0.5%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified6.5%
Taylor expanded in B around inf
associate-*r/N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-lowering-neg.f6463.3
Simplified63.3%
Final simplification23.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1.1e-130)
(/ (sqrt (* -16.0 (* (* A A) (* C F)))) (- (fma (* A C) -4.0 (* B_m B_m))))
(if (<= B_m 1.05e+130)
(/ (sqrt (* 2.0 (* F (- A (sqrt (fma B_m B_m (* A A))))))) (- B_m))
(/ -1.0 (* (/ 1.0 (sqrt 2.0)) (sqrt (/ B_m (- F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.1e-130) {
tmp = sqrt((-16.0 * ((A * A) * (C * F)))) / -fma((A * C), -4.0, (B_m * B_m));
} else if (B_m <= 1.05e+130) {
tmp = sqrt((2.0 * (F * (A - sqrt(fma(B_m, B_m, (A * A))))))) / -B_m;
} else {
tmp = -1.0 / ((1.0 / sqrt(2.0)) * sqrt((B_m / -F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.1e-130) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F)))) / Float64(-fma(Float64(A * C), -4.0, Float64(B_m * B_m)))); elseif (B_m <= 1.05e+130) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A))))))) / Float64(-B_m)); else tmp = Float64(-1.0 / Float64(Float64(1.0 / sqrt(2.0)) * sqrt(Float64(B_m / Float64(-F))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.1e-130], N[(N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.05e+130], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(-1.0 / N[(N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(B$95$m / (-F)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.1 \cdot 10^{-130}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 1.05 \cdot 10^{+130}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{1}{\sqrt{2}} \cdot \sqrt{\frac{B\_m}{-F}}}\\
\end{array}
\end{array}
if B < 1.0999999999999999e-130Initial program 18.2%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6411.5
Simplified11.5%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr11.5%
Taylor expanded in A around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f649.6
Simplified9.6%
if 1.0999999999999999e-130 < B < 1.04999999999999995e130Initial program 42.3%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr42.3%
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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6434.7
Simplified34.7%
associate-*l/N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
Applied egg-rr34.9%
if 1.04999999999999995e130 < B Initial program 0.5%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
Simplified6.5%
Taylor expanded in B around inf
associate-*r/N/A
/-lowering-/.f64N/A
mul-1-negN/A
neg-lowering-neg.f6463.3
Simplified63.3%
Final simplification20.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 (<= B_m 1.16e-130) (/ (sqrt (* -16.0 (* (* A A) (* C F)))) (- (fma (* A C) -4.0 (* B_m B_m)))) (* (sqrt (* F (- A B_m))) (- (/ (sqrt 2.0) B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.16e-130) {
tmp = sqrt((-16.0 * ((A * A) * (C * F)))) / -fma((A * C), -4.0, (B_m * B_m));
} else {
tmp = sqrt((F * (A - B_m))) * -(sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.16e-130) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F)))) / Float64(-fma(Float64(A * C), -4.0, Float64(B_m * B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(A - B_m))) * Float64(-Float64(sqrt(2.0) / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.16e-130], N[(N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.16 \cdot 10^{-130}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - B\_m\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\end{array}
\end{array}
if B < 1.1600000000000001e-130Initial program 18.2%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6411.5
Simplified11.5%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr11.5%
Taylor expanded in A around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f649.6
Simplified9.6%
if 1.1600000000000001e-130 < B Initial program 25.1%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr25.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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6424.1
Simplified24.1%
Taylor expanded in A around 0
Simplified34.2%
Final simplification17.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (* F (- A B_m))) (- (/ (sqrt 2.0) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((F * (A - B_m))) * -(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 * (a - b_m))) * -(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 * (A - B_m))) * -(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 * (A - B_m))) * -(math.sqrt(2.0) / B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(F * Float64(A - B_m))) * Float64(-Float64(sqrt(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 * (A - B_m))) * -(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[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{F \cdot \left(A - B\_m\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)
\end{array}
Initial program 20.3%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr20.3%
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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f648.4
Simplified8.4%
Taylor expanded in A around 0
Simplified10.9%
Final simplification10.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 (* (sqrt (* A 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((A * 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((a * 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((A * 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((A * 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(A * 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((A * 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[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}
\end{array}
Initial program 20.3%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr20.3%
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
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f648.4
Simplified8.4%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
unpow2N/A
unpow2N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
metadata-evalN/A
/-lowering-/.f642.1
Simplified2.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* 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 sqrt(Float64(2.0 * Float64(F / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.3%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f641.8
Simplified1.8%
mul-1-negN/A
remove-double-negN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8
Applied egg-rr1.8%
Final simplification1.8%
herbie shell --seed 2024205
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))