
(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 21 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* C (* A -4.0))))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3 (* 2.0 (* (- (pow B_m 2.0) t_2) F)))
(t_4 (- t_2 (pow B_m 2.0)))
(t_5
(/
(sqrt (* t_3 (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_4)))
(if (<= t_5 (- INFINITY))
(* (* (sqrt t_0) (- (* 2.0 (sqrt F)))) (/ (sqrt C) t_1))
(if (<= t_5 -1e-171)
(/
(sqrt
(*
t_3
(fma
(* (+ A C) (- A C))
(/ -1.0 (- C A))
(sqrt (fma (- A C) (- A C) (* B_m B_m))))))
t_4)
(if (<= t_5 0.0)
(/
(*
(sqrt F)
(sqrt (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* 2.0 t_1))))
t_4)
(if (<= t_5 INFINITY)
(* (sqrt C) (* (/ 1.0 t_0) (* (sqrt (* F t_0)) -2.0)))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (C * (A * -4.0)));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = 2.0 * ((pow(B_m, 2.0) - t_2) * F);
double t_4 = t_2 - pow(B_m, 2.0);
double t_5 = sqrt((t_3 * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * -(2.0 * sqrt(F))) * (sqrt(C) / t_1);
} else if (t_5 <= -1e-171) {
tmp = sqrt((t_3 * fma(((A + C) * (A - C)), (-1.0 / (C - A)), sqrt(fma((A - C), (A - C), (B_m * B_m)))))) / t_4;
} else if (t_5 <= 0.0) {
tmp = (sqrt(F) * sqrt((fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (2.0 * t_1)))) / t_4;
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt(C) * ((1.0 / t_0) * (sqrt((F * t_0)) * -2.0));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) t_4 = Float64(t_2 - (B_m ^ 2.0)) t_5 = Float64(sqrt(Float64(t_3 * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_1)); elseif (t_5 <= -1e-171) tmp = Float64(sqrt(Float64(t_3 * fma(Float64(Float64(A + C) * Float64(A - C)), Float64(-1.0 / Float64(C - A)), sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) / t_4); elseif (t_5 <= 0.0) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(2.0 * t_1)))) / t_4); elseif (t_5 <= Inf) tmp = Float64(sqrt(C) * Float64(Float64(1.0 / t_0) * Float64(sqrt(Float64(F * t_0)) * -2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(t$95$3 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, -1e-171], N[(N[Sqrt[N[(t$95$3 * N[(N[(N[(A + C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(C - A), $MachinePrecision]), $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$4), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[C], $MachinePrecision] * N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := 2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\\
t_4 := t\_2 - {B\_m}^{2}\\
t_5 := \frac{\sqrt{t\_3 \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\left(\sqrt{t\_0} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_1}\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \mathsf{fma}\left(\left(A + C\right) \cdot \left(A - C\right), \frac{-1}{C - A}, \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\frac{\sqrt{F} \cdot \sqrt{\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(2 \cdot t\_1\right)}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\sqrt{C} \cdot \left(\frac{1}{t\_0} \cdot \left(\sqrt{F \cdot t\_0} \cdot -2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
flip-+N/A
div-invN/A
accelerator-lowering-fma.f64N/A
difference-of-squaresN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
--lowering--.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.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.7%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.1
Simplified29.1%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr41.4%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 23.6%
Taylor expanded in A around -inf
*-lowering-*.f6432.4
Simplified32.4%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.6%
*-commutativeN/A
frac-2negN/A
metadata-evalN/A
div-invN/A
/-rgt-identityN/A
associate-*l*N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr36.9%
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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification43.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* C (* A -4.0))))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3 (- t_2 (pow B_m 2.0)))
(t_4
(/
(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_3)))
(if (<= t_4 (- INFINITY))
(* (* (sqrt t_0) (- (* 2.0 (sqrt F)))) (/ (sqrt C) t_1))
(if (<= t_4 -1e-171)
(/
(sqrt
(*
(* t_1 (* 2.0 F))
(+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
(- t_1))
(if (<= t_4 0.0)
(/
(*
(sqrt F)
(sqrt (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* 2.0 t_1))))
t_3)
(if (<= t_4 INFINITY)
(* (sqrt C) (* (/ 1.0 t_0) (* (sqrt (* F t_0)) -2.0)))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (C * (A * -4.0)));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = t_2 - pow(B_m, 2.0);
double t_4 = 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_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * -(2.0 * sqrt(F))) * (sqrt(C) / t_1);
} else if (t_4 <= -1e-171) {
tmp = sqrt(((t_1 * (2.0 * F)) * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / -t_1;
} else if (t_4 <= 0.0) {
tmp = (sqrt(F) * sqrt((fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (2.0 * t_1)))) / t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(C) * ((1.0 / t_0) * (sqrt((F * t_0)) * -2.0));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(t_2 - (B_m ^ 2.0)) t_4 = 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)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_1)); elseif (t_4 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(t_1 * Float64(2.0 * F)) * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / Float64(-t_1)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(2.0 * t_1)))) / t_3); elseif (t_4 <= Inf) tmp = Float64(sqrt(C) * Float64(Float64(1.0 / t_0) * Float64(sqrt(Float64(F * t_0)) * -2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = 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] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-171], N[(N[Sqrt[N[(N[(t$95$1 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * 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]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[C], $MachinePrecision] * N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := t\_2 - {B\_m}^{2}\\
t_4 := \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\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\left(\sqrt{t\_0} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_1}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{\left(t\_1 \cdot \left(2 \cdot F\right)\right) \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)}}{-t\_1}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{F} \cdot \sqrt{\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(2 \cdot t\_1\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{C} \cdot \left(\frac{1}{t\_0} \cdot \left(\sqrt{F \cdot t\_0} \cdot -2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.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.7%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.1
Simplified29.1%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr41.4%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 23.6%
Taylor expanded in A around -inf
*-lowering-*.f6432.4
Simplified32.4%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.6%
*-commutativeN/A
frac-2negN/A
metadata-evalN/A
div-invN/A
/-rgt-identityN/A
associate-*l*N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr36.9%
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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification43.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* C (* A -4.0))))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3 (- t_2 (pow B_m 2.0)))
(t_4
(/
(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_3)))
(if (<= t_4 (- INFINITY))
(* (* (sqrt t_0) (- (* 2.0 (sqrt F)))) (/ (sqrt C) t_1))
(if (<= t_4 -1e-171)
(/
(sqrt
(*
(* t_1 (* 2.0 F))
(+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
(- t_1))
(if (<= t_4 0.0)
(/ (* (sqrt F) (sqrt (* (* 2.0 t_1) (* 2.0 C)))) t_3)
(if (<= t_4 INFINITY)
(* (sqrt C) (* (/ 1.0 t_0) (* (sqrt (* F t_0)) -2.0)))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (C * (A * -4.0)));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = t_2 - pow(B_m, 2.0);
double t_4 = 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_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * -(2.0 * sqrt(F))) * (sqrt(C) / t_1);
} else if (t_4 <= -1e-171) {
tmp = sqrt(((t_1 * (2.0 * F)) * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / -t_1;
} else if (t_4 <= 0.0) {
tmp = (sqrt(F) * sqrt(((2.0 * t_1) * (2.0 * C)))) / t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(C) * ((1.0 / t_0) * (sqrt((F * t_0)) * -2.0));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(t_2 - (B_m ^ 2.0)) t_4 = 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)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_1)); elseif (t_4 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(t_1 * Float64(2.0 * F)) * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / Float64(-t_1)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(Float64(2.0 * t_1) * Float64(2.0 * C)))) / t_3); elseif (t_4 <= Inf) tmp = Float64(sqrt(C) * Float64(Float64(1.0 / t_0) * Float64(sqrt(Float64(F * t_0)) * -2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = 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] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-171], N[(N[Sqrt[N[(N[(t$95$1 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * 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]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * t$95$1), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[C], $MachinePrecision] * N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := t\_2 - {B\_m}^{2}\\
t_4 := \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\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\left(\sqrt{t\_0} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_1}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{\left(t\_1 \cdot \left(2 \cdot F\right)\right) \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)}}{-t\_1}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{F} \cdot \sqrt{\left(2 \cdot t\_1\right) \cdot \left(2 \cdot C\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{C} \cdot \left(\frac{1}{t\_0} \cdot \left(\sqrt{F \cdot t\_0} \cdot -2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.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.7%
Taylor expanded in A around -inf
*-lowering-*.f6425.5
Simplified25.5%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr34.6%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 23.6%
Taylor expanded in A around -inf
*-lowering-*.f6432.4
Simplified32.4%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.6%
*-commutativeN/A
frac-2negN/A
metadata-evalN/A
div-invN/A
/-rgt-identityN/A
associate-*l*N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
Applied egg-rr36.9%
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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification42.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* t_0 (* 2.0 F)))
(t_2 (- t_0))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 (- INFINITY))
(*
(* (sqrt (fma B_m B_m (* C (* A -4.0)))) (- (* 2.0 (sqrt F))))
(/ (sqrt C) t_0))
(if (<= t_4 -1e-171)
(/
(sqrt (* t_1 (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
t_2)
(if (<= t_4 INFINITY)
(* (/ (sqrt t_1) t_2) (sqrt (fma 2.0 C (/ (* B_m (* B_m -0.5)) A))))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = t_0 * (2.0 * F);
double t_2 = -t_0;
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(fma(B_m, B_m, (C * (A * -4.0)))) * -(2.0 * sqrt(F))) * (sqrt(C) / t_0);
} else if (t_4 <= -1e-171) {
tmp = sqrt((t_1 * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / t_2;
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt(t_1) / t_2) * sqrt(fma(2.0, C, ((B_m * (B_m * -0.5)) / A)));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(t_0 * Float64(2.0 * F)) t_2 = Float64(-t_0) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(B_m, B_m, Float64(C * Float64(A * -4.0)))) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_0)); elseif (t_4 <= -1e-171) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / t_2); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(t_1) / t_2) * sqrt(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-171], N[(N[Sqrt[N[(t$95$1 * 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]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] / t$95$2), $MachinePrecision] * N[Sqrt[N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := t\_0 \cdot \left(2 \cdot F\right)\\
t_2 := -t\_0\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_0}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{t\_1 \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)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1}}{t\_2} \cdot \sqrt{\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right)}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.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.4%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.5
Simplified30.5%
Applied egg-rr32.9%
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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification41.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (- t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(*
(* (sqrt (fma B_m B_m (* C (* A -4.0)))) (- (* 2.0 (sqrt F))))
(/ (sqrt C) t_0))
(if (<= t_3 -1e-171)
(/
(sqrt
(*
(* t_0 (* 2.0 F))
(+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
t_1)
(if (<= t_3 INFINITY)
(/
(sqrt (* 2.0 (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* F t_0))))
t_1)
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = -t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma(B_m, B_m, (C * (A * -4.0)))) * -(2.0 * sqrt(F))) * (sqrt(C) / t_0);
} else if (t_3 <= -1e-171) {
tmp = sqrt(((t_0 * (2.0 * F)) * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * (fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (F * t_0)))) / t_1;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(-t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(B_m, B_m, Float64(C * Float64(A * -4.0)))) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_0)); elseif (t_3 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / t_1); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(F * t_0)))) / t_1); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-171], N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * 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]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := -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 -\infty:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \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)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(F \cdot t\_0\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.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.4%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.5
Simplified30.5%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr30.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) 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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification41.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(*
(* (sqrt (fma B_m B_m (* C (* A -4.0)))) (- (* 2.0 (sqrt F))))
(/ (sqrt C) t_1))
(if (<= t_3 -1e-171)
(/
(sqrt
(*
(* 2.0 (* F t_0))
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
(- t_0))
(if (<= t_3 INFINITY)
(/
(sqrt (* 2.0 (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* F t_1))))
(- t_1))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma(B_m, B_m, (C * (A * -4.0)))) * -(2.0 * sqrt(F))) * (sqrt(C) / t_1);
} else if (t_3 <= -1e-171) {
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 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * (fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (F * t_1)))) / -t_1;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(B_m, B_m, Float64(C * Float64(A * -4.0)))) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_1)); elseif (t_3 <= -1e-171) 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 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(F * t_1)))) / Float64(-t_1)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-171], 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, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\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 \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(F \cdot t\_1\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr99.3%
if -9.9999999999999998e-172 < (/.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.4%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.5
Simplified30.5%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr30.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) 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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification41.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(*
(* (sqrt (fma B_m B_m (* C (* A -4.0)))) (- (* 2.0 (sqrt F))))
(/ (sqrt C) t_1))
(if (<= t_3 -1e-171)
(*
(sqrt (* (* 2.0 (* F t_0)) (+ (+ A C) (sqrt (fma B_m B_m (* C C))))))
(/ -1.0 t_0))
(if (<= t_3 INFINITY)
(/
(sqrt (* 2.0 (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* F t_1))))
(- t_1))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma(B_m, B_m, (C * (A * -4.0)))) * -(2.0 * sqrt(F))) * (sqrt(C) / t_1);
} else if (t_3 <= -1e-171) {
tmp = sqrt(((2.0 * (F * t_0)) * ((A + C) + sqrt(fma(B_m, B_m, (C * C)))))) * (-1.0 / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * (fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (F * t_1)))) / -t_1;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(B_m, B_m, Float64(C * Float64(A * -4.0)))) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_1)); elseif (t_3 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(-1.0 / t_0)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(F * t_1)))) / Float64(-t_1)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-171], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(F \cdot t\_0\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(F \cdot t\_1\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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.3%
Taylor expanded in A around -inf
*-lowering-*.f6424.7
Simplified24.7%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr36.7%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9
Applied egg-rr46.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
Taylor expanded in A around 0
sqrt-lowering-sqrt.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6486.0
Simplified86.0%
if -9.9999999999999998e-172 < (/.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.4%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.5
Simplified30.5%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr30.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) 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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification39.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 B_m B_m (* A (* C -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 -2e+154)
(*
(* (sqrt (fma B_m B_m (* C (* A -4.0)))) (- (* 2.0 (sqrt F))))
(/ (sqrt C) t_0))
(if (<= t_2 -5e-165)
(*
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C)))))
(- (sqrt 2.0)))
(if (<= t_2 INFINITY)
(/
(sqrt (* 2.0 (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* F t_0))))
(- t_0))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -2e+154) {
tmp = (sqrt(fma(B_m, B_m, (C * (A * -4.0)))) * -(2.0 * sqrt(F))) * (sqrt(C) / t_0);
} else if (t_2 <= -5e-165) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C))))) * -sqrt(2.0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * (fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (F * t_0)))) / -t_0;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= -2e+154) tmp = Float64(Float64(sqrt(fma(B_m, B_m, Float64(C * Float64(A * -4.0)))) * Float64(-Float64(2.0 * sqrt(F)))) * Float64(sqrt(C) / t_0)); elseif (t_2 <= -5e-165) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(2.0))); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(F * t_0)))) / Float64(-t_0)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+154], N[(N[(N[Sqrt[N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 * N[Sqrt[F], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-165], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+154}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(-2 \cdot \sqrt{F}\right)\right) \cdot \frac{\sqrt{C}}{t\_0}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-165}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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))) < -2.00000000000000007e154Initial program 11.2%
Taylor expanded in A around -inf
*-lowering-*.f6426.3
Simplified26.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr37.3%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
unpow1/2N/A
metadata-evalN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.7
Applied egg-rr46.7%
if -2.00000000000000007e154 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999981e-165Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified95.9%
if -4.99999999999999981e-165 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 13.9%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.2
Simplified30.2%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr30.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification39.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* C (* A -4.0))))
(t_1 (fma B_m B_m (* A (* C -4.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 -2e+154)
(* (* (sqrt (* F t_0)) -2.0) (/ (sqrt C) t_0))
(if (<= t_3 -5e-165)
(*
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C)))))
(- (sqrt 2.0)))
(if (<= t_3 INFINITY)
(/
(sqrt (* 2.0 (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* F t_1))))
(- t_1))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (C * (A * -4.0)));
double t_1 = fma(B_m, B_m, (A * (C * -4.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 <= -2e+154) {
tmp = (sqrt((F * t_0)) * -2.0) * (sqrt(C) / t_0);
} else if (t_3 <= -5e-165) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C))))) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * (fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (F * t_1)))) / -t_1;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.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 <= -2e+154) tmp = Float64(Float64(sqrt(Float64(F * t_0)) * -2.0) * Float64(sqrt(C) / t_0)); elseif (t_3 <= -5e-165) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) * Float64(F * t_1)))) / Float64(-t_1)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+154], N[(N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-165], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\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 -2 \cdot 10^{+154}:\\
\;\;\;\;\left(\sqrt{F \cdot t\_0} \cdot -2\right) \cdot \frac{\sqrt{C}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-165}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right) \cdot \left(F \cdot t\_1\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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))) < -2.00000000000000007e154Initial program 11.2%
Taylor expanded in A around -inf
*-lowering-*.f6426.3
Simplified26.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr37.3%
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-prodN/A
Applied egg-rr38.8%
if -2.00000000000000007e154 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999981e-165Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified95.9%
if -4.99999999999999981e-165 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 13.9%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.2
Simplified30.2%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr30.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification37.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 B_m B_m (* C (* A -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0))))
(t_3 (fma B_m B_m (* A (* C -4.0)))))
(if (<= t_2 -2e+154)
(* (* (sqrt (* F t_0)) -2.0) (/ (sqrt C) t_0))
(if (<= t_2 -5e-134)
(*
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C)))))
(- (sqrt 2.0)))
(if (<= t_2 INFINITY)
(* (sqrt 2.0) (/ (sqrt (* t_3 (* F (* 2.0 C)))) (- t_3)))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (C * (A * -4.0)));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (t_2 <= -2e+154) {
tmp = (sqrt((F * t_0)) * -2.0) * (sqrt(C) / t_0);
} else if (t_2 <= -5e-134) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C))))) * -sqrt(2.0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(2.0) * (sqrt((t_3 * (F * (2.0 * C)))) / -t_3);
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (t_2 <= -2e+154) tmp = Float64(Float64(sqrt(Float64(F * t_0)) * -2.0) * Float64(sqrt(C) / t_0)); elseif (t_2 <= -5e-134) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(2.0))); elseif (t_2 <= Inf) tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(t_3 * Float64(F * Float64(2.0 * C)))) / Float64(-t_3))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+154], N[(N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-134], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(t$95$3 * N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+154}:\\
\;\;\;\;\left(\sqrt{F \cdot t\_0} \cdot -2\right) \cdot \frac{\sqrt{C}}{t\_0}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-134}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{t\_3 \cdot \left(F \cdot \left(2 \cdot C\right)\right)}}{-t\_3}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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))) < -2.00000000000000007e154Initial program 11.2%
Taylor expanded in A around -inf
*-lowering-*.f6426.3
Simplified26.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr37.3%
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-prodN/A
Applied egg-rr38.8%
if -2.00000000000000007e154 < (/.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.0000000000000003e-134Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified99.4%
if -5.0000000000000003e-134 < (/.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 15.4%
Taylor expanded in A around -inf
*-lowering-*.f6429.3
Simplified29.3%
frac-2negN/A
remove-double-negN/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr29.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-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification37.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 B_m B_m (* A (* C -4.0))))
(t_1 (fma B_m B_m (* C (* A -4.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 -2e+154)
(* (* (sqrt (* F t_1)) -2.0) (/ (sqrt C) t_1))
(if (<= t_3 -5e-134)
(*
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C)))))
(- (sqrt 2.0)))
(if (<= t_3 INFINITY)
(* (sqrt (* C (* 4.0 (* F t_0)))) (/ -1.0 t_0))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = fma(B_m, B_m, (C * (A * -4.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 <= -2e+154) {
tmp = (sqrt((F * t_1)) * -2.0) * (sqrt(C) / t_1);
} else if (t_3 <= -5e-134) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C))))) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((C * (4.0 * (F * t_0)))) * (-1.0 / t_0);
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = fma(B_m, B_m, Float64(C * Float64(A * -4.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 <= -2e+154) tmp = Float64(Float64(sqrt(Float64(F * t_1)) * -2.0) * Float64(sqrt(C) / t_1)); elseif (t_3 <= -5e-134) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * t_0)))) * Float64(-1.0 / t_0)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $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, -2e+154], N[(N[(N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-134], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(C * N[(4.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\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 -2 \cdot 10^{+154}:\\
\;\;\;\;\left(\sqrt{F \cdot t\_1} \cdot -2\right) \cdot \frac{\sqrt{C}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-134}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{C \cdot \left(4 \cdot \left(F \cdot t\_0\right)\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\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))) < -2.00000000000000007e154Initial program 11.2%
Taylor expanded in A around -inf
*-lowering-*.f6426.3
Simplified26.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr37.3%
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-prodN/A
Applied egg-rr38.8%
if -2.00000000000000007e154 < (/.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.0000000000000003e-134Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified99.4%
if -5.0000000000000003e-134 < (/.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 15.4%
Taylor expanded in A around -inf
*-lowering-*.f6429.3
Simplified29.3%
frac-2negN/A
div-invN/A
remove-double-negN/A
metadata-evalN/A
frac-2negN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr29.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.8
Simplified17.8%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification37.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 B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-32)
(/ (sqrt (* C (* 4.0 (* F t_0)))) (- t_0))
(if (<= (pow B_m 2.0) 1e+262)
(*
(/ -1.0 (fma -4.0 (* A C) (* B_m B_m)))
(* B_m (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma B_m B_m (* C C)))))))))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = sqrt((C * (4.0 * (F * t_0)))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+262) {
tmp = (-1.0 / fma(-4.0, (A * C), (B_m * B_m))) * (B_m * (sqrt(2.0) * sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))))));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * t_0)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e+262) tmp = Float64(Float64(-1.0 / fma(-4.0, Float64(A * C), Float64(B_m * B_m))) * Float64(B_m * Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C))))))))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], 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+262], N[(N[(-1.0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(B$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(4 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+262}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)} \cdot \left(B\_m \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-lowering-*.f6429.6
Simplified29.6%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr29.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) < 1e262Initial program 34.1%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr34.1%
Taylor expanded in A around 0
associate-*l*N/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-*.f6417.4
Simplified17.4%
if 1e262 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
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-/.f6428.9
Simplified28.9%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6442.7
Applied egg-rr42.7%
Final simplification30.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-32)
(/ (sqrt (* C (* 4.0 (* F t_0)))) (- t_0))
(if (<= (pow B_m 2.0) 1e+262)
(/
(* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m)))))))
(- B_m))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = sqrt((C * (4.0 * (F * t_0)))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+262) {
tmp = (sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / -B_m;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * t_0)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e+262) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], 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+262], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(4 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+262}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-lowering-*.f6429.6
Simplified29.6%
frac-2negN/A
remove-double-negN/A
/-lowering-/.f64N/A
Applied egg-rr29.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) < 1e262Initial program 34.1%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified17.6%
if 1e262 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
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-/.f6428.9
Simplified28.9%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6442.7
Applied egg-rr42.7%
Final simplification30.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-32)
(*
(/ -1.0 (fma -4.0 (* A C) (* B_m B_m)))
(sqrt (* (* C (* A -16.0)) (* C F))))
(if (<= (pow B_m 2.0) 1e+262)
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) (- B_m))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = (-1.0 / fma(-4.0, (A * C), (B_m * B_m))) * sqrt(((C * (A * -16.0)) * (C * F)));
} else if (pow(B_m, 2.0) <= 1e+262) {
tmp = (sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / -B_m;
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(Float64(-1.0 / fma(-4.0, Float64(A * C), Float64(B_m * B_m))) * sqrt(Float64(Float64(C * Float64(A * -16.0)) * Float64(C * F)))); elseif ((B_m ^ 2.0) <= 1e+262) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(N[(-1.0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(C * N[(A * -16.0), $MachinePrecision]), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+262], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)} \cdot \sqrt{\left(C \cdot \left(A \cdot -16\right)\right) \cdot \left(C \cdot F\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+262}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr16.2%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6414.8
Simplified14.8%
associate-*r*N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6428.6
Applied egg-rr28.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) < 1e262Initial program 34.1%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified17.6%
if 1e262 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
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-/.f6428.9
Simplified28.9%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6442.7
Applied egg-rr42.7%
Final simplification29.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-32)
(*
(/ -1.0 (fma -4.0 (* A C) (* B_m B_m)))
(sqrt (* (* C (* A -16.0)) (* C F))))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = (-1.0 / fma(-4.0, (A * C), (B_m * B_m))) * sqrt(((C * (A * -16.0)) * (C * F)));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(Float64(-1.0 / fma(-4.0, Float64(A * C), Float64(B_m * B_m))) * sqrt(Float64(Float64(C * Float64(A * -16.0)) * Float64(C * F)))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(N[(-1.0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(C * N[(A * -16.0), $MachinePrecision]), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)} \cdot \sqrt{\left(C \cdot \left(A \cdot -16\right)\right) \cdot \left(C \cdot F\right)}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr16.2%
Taylor expanded in A around -inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6414.8
Simplified14.8%
associate-*r*N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6428.6
Applied egg-rr28.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.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-/.f6422.1
Simplified22.1%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6430.3
Applied egg-rr30.3%
Final simplification29.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 1e-32) (* -2.0 (sqrt (/ (* C F) (fma B_m B_m (* -4.0 (* A C)))))) (- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = -2.0 * sqrt(((C * F) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-lowering-*.f6429.6
Simplified29.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.8
Simplified21.8%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.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-/.f6422.1
Simplified22.1%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6430.3
Applied egg-rr30.3%
Final simplification26.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 8.8e+192) (- (/ (sqrt (* 2.0 F)) (sqrt B_m))) (* -2.0 (/ (sqrt (* C F)) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 8.8e+192) {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
} else {
tmp = -2.0 * (sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 8.8d+192) then
tmp = -(sqrt((2.0d0 * f)) / sqrt(b_m))
else
tmp = (-2.0d0) * (sqrt((c * f)) / b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 8.8e+192) {
tmp = -(Math.sqrt((2.0 * F)) / Math.sqrt(B_m));
} else {
tmp = -2.0 * (Math.sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 8.8e+192: tmp = -(math.sqrt((2.0 * F)) / math.sqrt(B_m)) else: tmp = -2.0 * (math.sqrt((C * F)) / B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 8.8e+192) tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * F)) / B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 8.8e+192)
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
else
tmp = -2.0 * (sqrt((C * F)) / B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 8.8e+192], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 8.8 \cdot 10^{+192}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 8.8000000000000003e192Initial 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-/.f6415.2
Simplified15.2%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6420.1
Applied egg-rr20.1%
if 8.8000000000000003e192 < C Initial program 1.8%
Taylor expanded in A around -inf
*-lowering-*.f6435.0
Simplified35.0%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr45.0%
Taylor expanded in B around inf
*-lowering-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.8
Simplified8.8%
Final simplification18.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1.25e+193) (- (* (sqrt F) (sqrt (/ 2.0 B_m)))) (* -2.0 (/ (sqrt (* C F)) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.25e+193) {
tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
} else {
tmp = -2.0 * (sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 1.25d+193) then
tmp = -(sqrt(f) * sqrt((2.0d0 / b_m)))
else
tmp = (-2.0d0) * (sqrt((c * f)) / b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.25e+193) {
tmp = -(Math.sqrt(F) * Math.sqrt((2.0 / B_m)));
} else {
tmp = -2.0 * (Math.sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 1.25e+193: tmp = -(math.sqrt(F) * math.sqrt((2.0 / B_m))) else: tmp = -2.0 * (math.sqrt((C * F)) / B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 1.25e+193) tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / B_m)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * F)) / B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 1.25e+193)
tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
else
tmp = -2.0 * (sqrt((C * F)) / B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 1.25e+193], (-N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 1.25 \cdot 10^{+193}:\\
\;\;\;\;-\sqrt{F} \cdot \sqrt{\frac{2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 1.24999999999999993e193Initial 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-/.f6415.2
Simplified15.2%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
pow1/2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
pow-prod-downN/A
pow1/2N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6420.1
Applied egg-rr20.1%
sqrt-prodN/A
pow1/2N/A
associate-/l*N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6420.0
Applied egg-rr20.0%
if 1.24999999999999993e193 < C Initial program 1.8%
Taylor expanded in A around -inf
*-lowering-*.f6435.0
Simplified35.0%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr45.0%
Taylor expanded in B around inf
*-lowering-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.8
Simplified8.8%
Final simplification18.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 5e+109) (- (sqrt (/ (* 2.0 F) B_m))) (* -2.0 (/ (sqrt (* C F)) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 5e+109) {
tmp = -sqrt(((2.0 * F) / B_m));
} else {
tmp = -2.0 * (sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 5d+109) then
tmp = -sqrt(((2.0d0 * f) / b_m))
else
tmp = (-2.0d0) * (sqrt((c * f)) / b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 5e+109) {
tmp = -Math.sqrt(((2.0 * F) / B_m));
} else {
tmp = -2.0 * (Math.sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 5e+109: tmp = -math.sqrt(((2.0 * F) / B_m)) else: tmp = -2.0 * (math.sqrt((C * F)) / B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 5e+109) tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / B_m))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * F)) / B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 5e+109)
tmp = -sqrt(((2.0 * F) / B_m));
else
tmp = -2.0 * (sqrt((C * F)) / B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 5e+109], (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 5 \cdot 10^{+109}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 5.0000000000000001e109Initial program 18.5%
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-/.f6415.9
Simplified15.9%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6416.0
Applied egg-rr16.0%
if 5.0000000000000001e109 < C Initial program 6.3%
Taylor expanded in A around -inf
*-lowering-*.f6432.3
Simplified32.3%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*r*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr48.6%
Taylor expanded in B around inf
*-lowering-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.5
Simplified8.5%
Final simplification14.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 (- (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 16.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.8
Simplified13.8%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6413.9
Applied egg-rr13.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 16.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.8
Simplified13.8%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6413.9
Applied egg-rr13.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6413.9
Applied egg-rr13.9%
herbie shell --seed 2024198
(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))))