
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* 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 (* 4.0 (* F (fma A (* C -4.0) (* B_m B_m))))) (sqrt C))
t_2)))
(if (<= t_3 (- INFINITY))
t_4
(if (<= t_3 -1e-228)
(*
(/ (sqrt (* 2.0 (* F t_0))) -1.0)
(/ (sqrt (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))) t_0))
(if (<= t_3 0.0)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_3 INFINITY)
t_4
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = fma(-4.0, (A * C), (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((4.0 * (F * fma(A, (C * -4.0), (B_m * B_m))))) * sqrt(C)) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_4;
} else if (t_3 <= -1e-228) {
tmp = (sqrt((2.0 * (F * t_0))) / -1.0) * (sqrt(((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m))))) / t_0);
} else if (t_3 <= 0.0) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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 = fma(-4.0, Float64(A * C), 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 = Float64(Float64(sqrt(Float64(4.0 * Float64(F * fma(A, Float64(C * -4.0), Float64(B_m * B_m))))) * sqrt(C)) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_4; elseif (t_3 <= -1e-228) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) / -1.0) * Float64(sqrt(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))) / t_0)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = t_4; else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(-4.0 * N[(A * C), $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[(N[(N[Sqrt[N[(4.0 * N[(F * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$4, If[LessEqual[t$95$3, -1e-228], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / -1.0), $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] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \mathsf{fma}\left(-4, A \cdot C, 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 := \frac{\sqrt{4 \cdot \left(F \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\right)} \cdot \sqrt{C}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-228}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)}}{-1} \cdot \frac{\sqrt{\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\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 -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 11.8%
Taylor expanded in A around -inf
*-lowering-*.f6427.7
Simplified27.7%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.8%
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))) < -1.00000000000000003e-228Initial program 98.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr98.3%
if -1.00000000000000003e-228 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.5%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified18.8%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6414.5
Simplified14.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6414.5
Applied egg-rr14.5%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6414.5
Applied egg-rr14.5%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9
Applied egg-rr19.9%
Final simplification38.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1
(/
(* (sqrt C) (* (sqrt (* F (fma A (* C -4.0) (* B_m B_m)))) -2.0))
(fma (* C -4.0) A (* B_m B_m))))
(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))
t_1
(if (<= t_3 -1e-228)
(*
(/ (sqrt (* 2.0 (* F t_0))) -1.0)
(/ (sqrt (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))) t_0))
(if (<= t_3 0.0)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_3 INFINITY)
t_1
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = (sqrt(C) * (sqrt((F * fma(A, (C * -4.0), (B_m * B_m)))) * -2.0)) / fma((C * -4.0), A, (B_m * B_m));
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 = t_1;
} else if (t_3 <= -1e-228) {
tmp = (sqrt((2.0 * (F * t_0))) / -1.0) * (sqrt(((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m))))) / t_0);
} else if (t_3 <= 0.0) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(sqrt(C) * Float64(sqrt(Float64(F * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))) * -2.0)) / fma(Float64(C * -4.0), A, Float64(B_m * B_m))) 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 = t_1; elseif (t_3 <= -1e-228) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) / -1.0) * Float64(sqrt(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))) / t_0)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = t_1; else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[C], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $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)], t$95$1, If[LessEqual[t$95$3, -1e-228], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / -1.0), $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] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$1, N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \frac{\sqrt{C} \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot -2\right)}{\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\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:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-228}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)}}{-1} \cdot \frac{\sqrt{\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\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 -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 11.8%
Taylor expanded in A around -inf
*-lowering-*.f6427.7
Simplified27.7%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.8%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.8
Applied egg-rr38.8%
distribute-lft-neg-inN/A
*-lowering-*.f64N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6438.8
Applied egg-rr38.8%
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))) < -1.00000000000000003e-228Initial program 98.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr98.3%
if -1.00000000000000003e-228 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.5%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified18.8%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6414.5
Simplified14.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6414.5
Applied egg-rr14.5%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6414.5
Applied egg-rr14.5%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9
Applied egg-rr19.9%
Final simplification38.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1
(/
(* (sqrt C) (* (sqrt (* F (fma A (* C -4.0) (* B_m B_m)))) -2.0))
(fma (* C -4.0) A (* B_m B_m))))
(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 -5e+222)
t_1
(if (<= t_3 -1e-228)
(/
(sqrt
(*
(* 2.0 (* F t_0))
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
(- t_0))
(if (<= t_3 0.0)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_3 INFINITY)
t_1
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = (sqrt(C) * (sqrt((F * fma(A, (C * -4.0), (B_m * B_m)))) * -2.0)) / fma((C * -4.0), A, (B_m * B_m));
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 <= -5e+222) {
tmp = t_1;
} else if (t_3 <= -1e-228) {
tmp = sqrt(((2.0 * (F * t_0)) * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))))) / -t_0;
} else if (t_3 <= 0.0) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(sqrt(C) * Float64(sqrt(Float64(F * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))) * -2.0)) / fma(Float64(C * -4.0), A, Float64(B_m * B_m))) 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 <= -5e+222) tmp = t_1; elseif (t_3 <= -1e-228) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) / Float64(-t_0)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = t_1; else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[C], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $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, -5e+222], t$95$1, If[LessEqual[t$95$3, -1e-228], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $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] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$1, N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \frac{\sqrt{C} \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot -2\right)}{\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\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 -5 \cdot 10^{+222}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-228}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(F \cdot t\_0\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000023e222 or -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 12.9%
Taylor expanded in A around -inf
*-lowering-*.f6427.4
Simplified27.4%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.3%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.3
Applied egg-rr38.3%
distribute-lft-neg-inN/A
*-lowering-*.f64N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6438.3
Applied egg-rr38.3%
if -5.00000000000000023e222 < (/.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.00000000000000003e-228Initial program 98.3%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr98.3%
if -1.00000000000000003e-228 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.5%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified18.8%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6414.5
Simplified14.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6414.5
Applied egg-rr14.5%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6414.5
Applied egg-rr14.5%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9
Applied egg-rr19.9%
Final simplification38.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))))
(t_2
(/
(* (sqrt C) (* (sqrt (* F (fma A (* C -4.0) (* B_m B_m)))) -2.0))
(fma (* C -4.0) A (* B_m B_m))))
(t_3 (- (sqrt 2.0))))
(if (<= t_1 -5e+222)
t_2
(if (<= t_1 -1e-228)
(*
t_3
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C))))))
(if (<= t_1 0.0)
(* (sqrt (/ (* F -0.5) A)) t_3)
(if (<= t_1 INFINITY)
t_2
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = (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 t_2 = (sqrt(C) * (sqrt((F * fma(A, (C * -4.0), (B_m * B_m)))) * -2.0)) / fma((C * -4.0), A, (B_m * B_m));
double t_3 = -sqrt(2.0);
double tmp;
if (t_1 <= -5e+222) {
tmp = t_2;
} else if (t_1 <= -1e-228) {
tmp = t_3 * sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else if (t_1 <= 0.0) {
tmp = sqrt(((F * -0.5) / A)) * t_3;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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(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))) t_2 = Float64(Float64(sqrt(C) * Float64(sqrt(Float64(F * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))) * -2.0)) / fma(Float64(C * -4.0), A, Float64(B_m * B_m))) t_3 = Float64(-sqrt(2.0)) tmp = 0.0 if (t_1 <= -5e+222) tmp = t_2; elseif (t_1 <= -1e-228) tmp = Float64(t_3 * 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)))))); elseif (t_1 <= 0.0) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * t_3); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(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]}, Block[{t$95$2 = N[(N[(N[Sqrt[C], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[t$95$1, -5e+222], t$95$2, If[LessEqual[t$95$1, -1e-228], N[(t$95$3 * 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]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \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}}\\
t_2 := \frac{\sqrt{C} \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot -2\right)}{\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)}\\
t_3 := -\sqrt{2}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+222}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-228}:\\
\;\;\;\;t\_3 \cdot \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)}}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot t\_3\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000023e222 or -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 12.9%
Taylor expanded in A around -inf
*-lowering-*.f6427.4
Simplified27.4%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.3%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.3
Applied egg-rr38.3%
distribute-lft-neg-inN/A
*-lowering-*.f64N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6438.3
Applied egg-rr38.3%
if -5.00000000000000023e222 < (/.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.00000000000000003e-228Initial program 98.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified96.6%
if -1.00000000000000003e-228 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.5%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified18.8%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6414.5
Simplified14.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6414.5
Applied egg-rr14.5%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6414.5
Applied egg-rr14.5%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9
Applied egg-rr19.9%
Final simplification37.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
(/
(* (sqrt C) (* (sqrt (* F (fma A (* C -4.0) (* B_m B_m)))) -2.0))
(fma (* C -4.0) A (* B_m B_m))))
(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)))))
(if (<= t_2 -5e+222)
t_0
(if (<= t_2 -1e-228)
(*
(sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
(if (<= t_2 0.0)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_2 INFINITY)
t_0
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = (sqrt(C) * (sqrt((F * fma(A, (C * -4.0), (B_m * B_m)))) * -2.0)) / fma((C * -4.0), A, (B_m * B_m));
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 tmp;
if (t_2 <= -5e+222) {
tmp = t_0;
} else if (t_2 <= -1e-228) {
tmp = sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else if (t_2 <= 0.0) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_0;
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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(Float64(sqrt(C) * Float64(sqrt(Float64(F * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))) * -2.0)) / fma(Float64(C * -4.0), A, Float64(B_m * B_m))) 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))) tmp = 0.0 if (t_2 <= -5e+222) tmp = t_0; elseif (t_2 <= -1e-228) tmp = Float64(sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); elseif (t_2 <= 0.0) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_2 <= Inf) tmp = t_0; else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(N[(N[Sqrt[C], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+222], t$95$0, If[LessEqual[t$95$2, -1e-228], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$0, N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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{\sqrt{C} \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot -2\right)}{\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\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}}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+222}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-228}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000023e222 or -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 12.9%
Taylor expanded in A around -inf
*-lowering-*.f6427.4
Simplified27.4%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.3%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.3
Applied egg-rr38.3%
distribute-lft-neg-inN/A
*-lowering-*.f64N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6438.3
Applied egg-rr38.3%
if -5.00000000000000023e222 < (/.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.00000000000000003e-228Initial program 98.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr93.6%
Taylor expanded in A 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-*.f6430.5
Simplified30.5%
if -1.00000000000000003e-228 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.5%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified18.8%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6414.5
Simplified14.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6414.5
Applied egg-rr14.5%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6414.5
Applied egg-rr14.5%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9
Applied egg-rr19.9%
Final simplification28.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (* (* (sqrt (* F t_0)) -2.0) (/ (sqrt C) 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 -5e+222)
t_1
(if (<= t_3 -1e-228)
(*
(sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
(if (<= t_3 0.0)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_3 INFINITY)
t_1
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (sqrt((F * t_0)) * -2.0) * (sqrt(C) / 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 <= -5e+222) {
tmp = t_1;
} else if (t_3 <= -1e-228) {
tmp = sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else if (t_3 <= 0.0) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(sqrt(Float64(F * t_0)) * -2.0) * Float64(sqrt(C) / 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 <= -5e+222) tmp = t_1; elseif (t_3 <= -1e-228) tmp = Float64(sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = t_1; else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / 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, -5e+222], t$95$1, If[LessEqual[t$95$3, -1e-228], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$1, N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(\sqrt{F \cdot t\_0} \cdot -2\right) \cdot \frac{\sqrt{C}}{t\_0}\\
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 -5 \cdot 10^{+222}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-228}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000023e222 or -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 12.9%
Taylor expanded in A around -inf
*-lowering-*.f6427.4
Simplified27.4%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.3%
distribute-lft-neg-inN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr38.2%
if -5.00000000000000023e222 < (/.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.00000000000000003e-228Initial program 98.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr93.6%
Taylor expanded in A 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-*.f6430.5
Simplified30.5%
if -1.00000000000000003e-228 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.5%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified18.8%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.4
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6414.5
Simplified14.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6414.5
Applied egg-rr14.5%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6414.5
Applied egg-rr14.5%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9
Applied egg-rr19.9%
Final simplification28.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)))
(- INFINITY))
(* -2.0 (* (/ 1.0 B_m) (sqrt (* C F))))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double 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))) <= -((double) INFINITY)) {
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double 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))) <= -Double.POSITIVE_INFINITY) {
tmp = -2.0 * ((1.0 / B_m) * Math.sqrt((C * F)));
} else {
tmp = Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): 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))) <= -math.inf: tmp = -2.0 * ((1.0 / B_m) * math.sqrt((C * F))) else: tmp = math.sqrt((2.0 / B_m)) * -math.sqrt(F) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) 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))) <= Float64(-Inf)) tmp = Float64(-2.0 * Float64(Float64(1.0 / B_m) * sqrt(Float64(C * F)))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
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))) <= -Inf)
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
else
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := 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], (-Infinity)], N[(-2.0 * N[(N[(1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
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 -\infty:\\
\;\;\;\;-2 \cdot \left(\frac{1}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
Taylor expanded in A around -inf
*-lowering-*.f6420.7
Simplified20.7%
Taylor expanded in B around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f647.6
Simplified7.6%
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 21.8%
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.3
Simplified13.3%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6413.3
Applied egg-rr13.3%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6413.3
Applied egg-rr13.3%
associate-/l*N/A
clear-numN/A
div-invN/A
associate-/r/N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6416.3
Applied egg-rr16.3%
Final simplification14.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))))
(if (<= (pow B_m 2.0) 5e-242)
(/ (* -2.0 (sqrt (* (* C F) (fma B_m B_m t_0)))) t_0)
(if (<= (pow B_m 2.0) 1.8e-110)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= (pow B_m 2.0) 1e+184)
(*
(sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = -4.0 * (A * C);
double tmp;
if (pow(B_m, 2.0) <= 5e-242) {
tmp = (-2.0 * sqrt(((C * F) * fma(B_m, B_m, t_0)))) / t_0;
} else if (pow(B_m, 2.0) <= 1.8e-110) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (pow(B_m, 2.0) <= 1e+184) {
tmp = sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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(-4.0 * Float64(A * C)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-242) tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(C * F) * fma(B_m, B_m, t_0)))) / t_0); elseif ((B_m ^ 2.0) <= 1.8e-110) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif ((B_m ^ 2.0) <= 1e+184) tmp = Float64(sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-242], N[(N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] * N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1.8e-110], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+184], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-242}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(C \cdot F\right) \cdot \mathsf{fma}\left(B\_m, B\_m, t\_0\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 1.8 \cdot 10^{-110}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+184}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e-242Initial program 18.7%
Taylor expanded in A around -inf
*-lowering-*.f6431.2
Simplified31.2%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr31.3%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6431.2
Simplified31.2%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.1
Simplified31.1%
if 4.9999999999999998e-242 < (pow.f64 B #s(literal 2 binary64)) < 1.79999999999999997e-110Initial program 16.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified28.9%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6426.0
Simplified26.0%
if 1.79999999999999997e-110 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e184Initial program 33.4%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.7%
Taylor expanded in A 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-*.f6413.9
Simplified13.9%
if 1.00000000000000002e184 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.2%
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.9
Simplified20.9%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6420.9
Applied egg-rr20.9%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6420.9
Applied egg-rr20.9%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6429.2
Applied egg-rr29.2%
Final simplification25.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) 5e-64)
(/ (sqrt (* C (* t_0 (* 4.0 F)))) (- t_0))
(if (<= (pow B_m 2.0) 1e+184)
(*
(sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = fma(A, (C * -4.0), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 5e-64) {
tmp = sqrt((C * (t_0 * (4.0 * F)))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+184) {
tmp = sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-64) tmp = Float64(sqrt(Float64(C * Float64(t_0 * Float64(4.0 * F)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e+184) tmp = Float64(sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-64], N[(N[Sqrt[N[(C * N[(t$95$0 * N[(4.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+184], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-64}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(t\_0 \cdot \left(4 \cdot F\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+184}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000033e-64Initial program 18.7%
Taylor expanded in A around -inf
*-lowering-*.f6425.7
Simplified25.7%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr24.1%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr25.7%
if 5.00000000000000033e-64 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e184Initial program 36.0%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr35.9%
Taylor expanded in A 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-*.f6415.3
Simplified15.3%
if 1.00000000000000002e184 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.2%
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.9
Simplified20.9%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6420.9
Applied egg-rr20.9%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6420.9
Applied egg-rr20.9%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6429.2
Applied egg-rr29.2%
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
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e-64)
(/ (sqrt (* C (* 4.0 (* F t_0)))) (- t_0))
(if (<= (pow B_m 2.0) 1e+184)
(*
(sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
(/ -1.0 (/ (sqrt B_m) (sqrt (* 2.0 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 = fma(A, (C * -4.0), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 5e-64) {
tmp = sqrt((C * (4.0 * (F * t_0)))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+184) {
tmp = sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else {
tmp = -1.0 / (sqrt(B_m) / sqrt((2.0 * 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 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-64) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * t_0)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e+184) tmp = Float64(sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(-1.0 / Float64(sqrt(B_m) / sqrt(Float64(2.0 * 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-64], N[(N[Sqrt[N[(C * N[(4.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+184], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[B$95$m], $MachinePrecision] / N[Sqrt[N[(2.0 * 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 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-64}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(4 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+184}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{\sqrt{B\_m}}{\sqrt{2 \cdot F}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000033e-64Initial program 18.7%
Taylor expanded in A around -inf
*-lowering-*.f6425.7
Simplified25.7%
frac-2negN/A
remove-double-negN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr25.7%
if 5.00000000000000033e-64 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e184Initial program 36.0%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr35.9%
Taylor expanded in A 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-*.f6415.3
Simplified15.3%
if 1.00000000000000002e184 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.2%
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.9
Simplified20.9%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6420.9
Applied egg-rr20.9%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6420.9
Applied egg-rr20.9%
sqrt-divN/A
distribute-neg-fracN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6429.2
Applied egg-rr29.2%
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
(let* ((t_0 (* -4.0 (* A C))))
(if (<= (pow B_m 2.0) 5e-242)
(/ (* -2.0 (sqrt (* (* C F) (fma B_m B_m t_0)))) t_0)
(if (<= (pow B_m 2.0) 1e+38)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -4.0 * (A * C);
double tmp;
if (pow(B_m, 2.0) <= 5e-242) {
tmp = (-2.0 * sqrt(((C * F) * fma(B_m, B_m, t_0)))) / t_0;
} else if (pow(B_m, 2.0) <= 1e+38) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-242) tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(C * F) * fma(B_m, B_m, t_0)))) / t_0); elseif ((B_m ^ 2.0) <= 1e+38) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-242], N[(N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] * N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+38], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-242}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(C \cdot F\right) \cdot \mathsf{fma}\left(B\_m, B\_m, t\_0\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+38}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e-242Initial program 18.7%
Taylor expanded in A around -inf
*-lowering-*.f6431.2
Simplified31.2%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr31.3%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6431.2
Simplified31.2%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.1
Simplified31.1%
if 4.9999999999999998e-242 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999977e37Initial program 25.1%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified32.9%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6412.3
Simplified12.3%
if 9.99999999999999977e37 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.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-/.f6418.6
Simplified18.6%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.7
Applied egg-rr18.7%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6418.7
Applied egg-rr18.7%
associate-/l*N/A
clear-numN/A
div-invN/A
associate-/r/N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6424.4
Applied egg-rr24.4%
Final simplification23.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 5e-242)
(/
(sqrt (* C (* 4.0 (* F (fma A (* C -4.0) (* B_m B_m))))))
(* 4.0 (* A C)))
(if (<= (pow B_m 2.0) 1e+38)
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e-242) {
tmp = sqrt((C * (4.0 * (F * fma(A, (C * -4.0), (B_m * B_m)))))) / (4.0 * (A * C));
} else if (pow(B_m, 2.0) <= 1e+38) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-242) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * fma(A, Float64(C * -4.0), Float64(B_m * B_m)))))) / Float64(4.0 * Float64(A * C))); elseif ((B_m ^ 2.0) <= 1e+38) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-242], N[(N[Sqrt[N[(C * N[(4.0 * N[(F * N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+38], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-242}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(4 \cdot \left(F \cdot \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+38}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e-242Initial program 18.7%
Taylor expanded in A around -inf
*-lowering-*.f6431.2
Simplified31.2%
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr31.3%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6431.2
Simplified31.2%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr31.1%
if 4.9999999999999998e-242 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999977e37Initial program 25.1%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified32.9%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6412.3
Simplified12.3%
if 9.99999999999999977e37 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.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-/.f6418.6
Simplified18.6%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.7
Applied egg-rr18.7%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6418.7
Applied egg-rr18.7%
associate-/l*N/A
clear-numN/A
div-invN/A
associate-/r/N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6424.4
Applied egg-rr24.4%
Final simplification23.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 1e+38) (* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0))) (* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e+38) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 1d+38) then
tmp = sqrt(((f * (-0.5d0)) / a)) * -sqrt(2.0d0)
else
tmp = sqrt((2.0d0 / b_m)) * -sqrt(f)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e+38) {
tmp = Math.sqrt(((F * -0.5) / A)) * -Math.sqrt(2.0);
} else {
tmp = Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e+38: tmp = math.sqrt(((F * -0.5) / A)) * -math.sqrt(2.0) else: tmp = math.sqrt((2.0 / B_m)) * -math.sqrt(F) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e+38) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e+38)
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
else
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+38], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{+38}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999977e37Initial program 21.6%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified21.5%
Taylor expanded in C around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6418.0
Simplified18.0%
if 9.99999999999999977e37 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.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-/.f6418.6
Simplified18.6%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6418.7
Applied egg-rr18.7%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6418.7
Applied egg-rr18.7%
associate-/l*N/A
clear-numN/A
div-invN/A
associate-/r/N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6424.4
Applied egg-rr24.4%
Final simplification20.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 6.5e+55) (- (sqrt (/ (* 2.0 F) B_m))) (* -2.0 (* (/ 1.0 B_m) (sqrt (* C 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 (C <= 6.5e+55) {
tmp = -sqrt(((2.0 * F) / B_m));
} else {
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 6.5d+55) then
tmp = -sqrt(((2.0d0 * f) / b_m))
else
tmp = (-2.0d0) * ((1.0d0 / b_m) * sqrt((c * f)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 6.5e+55) {
tmp = -Math.sqrt(((2.0 * F) / B_m));
} else {
tmp = -2.0 * ((1.0 / B_m) * Math.sqrt((C * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 6.5e+55: tmp = -math.sqrt(((2.0 * F) / B_m)) else: tmp = -2.0 * ((1.0 / B_m) * math.sqrt((C * 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 (C <= 6.5e+55) tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / B_m))); else tmp = Float64(-2.0 * Float64(Float64(1.0 / B_m) * sqrt(Float64(C * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 6.5e+55)
tmp = -sqrt(((2.0 * F) / B_m));
else
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 6.5e+55], (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[(1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * 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}\;C \leq 6.5 \cdot 10^{+55}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(\frac{1}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\end{array}
\end{array}
if C < 6.50000000000000027e55Initial program 18.2%
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.3
Simplified13.3%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6413.3
Applied egg-rr13.3%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6413.3
Applied egg-rr13.3%
if 6.50000000000000027e55 < C Initial program 17.0%
Taylor expanded in A around -inf
*-lowering-*.f6431.7
Simplified31.7%
Taylor expanded in B around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f648.3
Simplified8.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (* 2.0 F) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(((2.0 * F) / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((2.0d0 * f) / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((2.0 * F) / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((2.0 * F) / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(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 18.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-/.f6411.4
Simplified11.4%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6411.4
Applied egg-rr11.4%
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6411.4
Applied egg-rr11.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* 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 18.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-/.f6411.4
Simplified11.4%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6411.4
Applied egg-rr11.4%
herbie shell --seed 2024199
(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))))