
(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 13 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 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2 (sqrt (* 2.0 F))))
(if (<= B_m 4.2e-87)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C))) t_1)
(if (<= B_m 4.8e-7)
(/
(*
(sqrt (* 2.0 (fma 2.0 C (/ (* B_m (* B_m -0.5)) A))))
(sqrt (* F (fma B_m B_m (* -4.0 (* A C))))))
t_1)
(if (<= B_m 4.75e+123)
(* (/ t_2 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_2 (sqrt (/ 1.0 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = sqrt((2.0 * F));
double tmp;
if (B_m <= 4.2e-87) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
} else if (B_m <= 4.8e-7) {
tmp = (sqrt((2.0 * fma(2.0, C, ((B_m * (B_m * -0.5)) / A)))) * sqrt((F * fma(B_m, B_m, (-4.0 * (A * C)))))) / t_1;
} else if (B_m <= 4.75e+123) {
tmp = (t_2 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_2 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (B_m <= 4.2e-87) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / t_1); elseif (B_m <= 4.8e-7) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)))) * sqrt(Float64(F * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) / t_1); elseif (B_m <= 4.75e+123) tmp = Float64(Float64(t_2 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_2 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 4.2e-87], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 4.8e-7], N[(N[(N[Sqrt[N[(2.0 * N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 4.75e+123], N[(N[(t$95$2 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$2 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \sqrt{2 \cdot F}\\
\mathbf{if}\;B\_m \leq 4.2 \cdot 10^{-87}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 4.8 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right)} \cdot \sqrt{F \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 4.75 \cdot 10^{+123}:\\
\;\;\;\;\frac{t\_2}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_2 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 4.20000000000000014e-87Initial program 19.6%
Taylor expanded in A around -inf
*-lowering-*.f6415.5
Simplified15.5%
if 4.20000000000000014e-87 < B < 4.79999999999999957e-7Initial program 28.0%
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-*.f6434.6
Simplified34.6%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr29.3%
if 4.79999999999999957e-7 < B < 4.7499999999999998e123Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 4.7499999999999998e123 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification26.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 (* -4.0 (* A C))))
(t_1 (* F t_0))
(t_2 (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)))
(t_3 (sqrt (* 2.0 F))))
(if (<= B_m 6.8e-199)
(/ (sqrt (* 2.0 (* t_2 t_1))) (- t_0))
(if (<= B_m 4.7e-7)
(/ (* (sqrt t_2) (sqrt (* 2.0 t_1))) (- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= B_m 5.2e+122)
(* (/ t_3 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_3 (sqrt (/ 1.0 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = F * t_0;
double t_2 = fma(2.0, C, ((B_m * (B_m * -0.5)) / A));
double t_3 = sqrt((2.0 * F));
double tmp;
if (B_m <= 6.8e-199) {
tmp = sqrt((2.0 * (t_2 * t_1))) / -t_0;
} else if (B_m <= 4.7e-7) {
tmp = (sqrt(t_2) * sqrt((2.0 * t_1))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (B_m <= 5.2e+122) {
tmp = (t_3 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_3 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = Float64(F * t_0) t_2 = fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) t_3 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (B_m <= 6.8e-199) tmp = Float64(sqrt(Float64(2.0 * Float64(t_2 * t_1))) / Float64(-t_0)); elseif (B_m <= 4.7e-7) tmp = Float64(Float64(sqrt(t_2) * sqrt(Float64(2.0 * t_1))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif (B_m <= 5.2e+122) tmp = Float64(Float64(t_3 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_3 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 6.8e-199], N[(N[Sqrt[N[(2.0 * N[(t$95$2 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 4.7e-7], N[(N[(N[Sqrt[t$95$2], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.2e+122], N[(N[(t$95$3 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$3 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := F \cdot t\_0\\
t_2 := \mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right)\\
t_3 := \sqrt{2 \cdot F}\\
\mathbf{if}\;B\_m \leq 6.8 \cdot 10^{-199}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_2 \cdot t\_1\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 4.7 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{t\_2} \cdot \sqrt{2 \cdot t\_1}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 5.2 \cdot 10^{+122}:\\
\;\;\;\;\frac{t\_3}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_3 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 6.80000000000000011e-199Initial program 18.8%
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-*.f6416.4
Simplified16.4%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
distribute-frac-negN/A
distribute-frac-neg2N/A
/-lowering-/.f64N/A
Applied egg-rr16.4%
if 6.80000000000000011e-199 < B < 4.7e-7Initial program 26.6%
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-*.f6420.7
Simplified20.7%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
Applied egg-rr24.2%
if 4.7e-7 < B < 5.20000000000000015e122Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 5.20000000000000015e122 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification27.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (* F t_0))
(t_2 (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)))
(t_3 (sqrt (* 2.0 F))))
(if (<= B_m 2.2e-202)
(/ (sqrt (* 2.0 (* t_2 t_1))) (- t_0))
(if (<= B_m 4.5e-7)
(/ (* (sqrt (* 2.0 t_2)) (sqrt t_1)) (- (* (* 4.0 A) C) (pow B_m 2.0)))
(if (<= B_m 9.5e+122)
(* (/ t_3 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_3 (sqrt (/ 1.0 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = F * t_0;
double t_2 = fma(2.0, C, ((B_m * (B_m * -0.5)) / A));
double t_3 = sqrt((2.0 * F));
double tmp;
if (B_m <= 2.2e-202) {
tmp = sqrt((2.0 * (t_2 * t_1))) / -t_0;
} else if (B_m <= 4.5e-7) {
tmp = (sqrt((2.0 * t_2)) * sqrt(t_1)) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else if (B_m <= 9.5e+122) {
tmp = (t_3 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_3 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = Float64(F * t_0) t_2 = fma(2.0, C, Float64(Float64(B_m * Float64(B_m * -0.5)) / A)) t_3 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (B_m <= 2.2e-202) tmp = Float64(sqrt(Float64(2.0 * Float64(t_2 * t_1))) / Float64(-t_0)); elseif (B_m <= 4.5e-7) tmp = Float64(Float64(sqrt(Float64(2.0 * t_2)) * sqrt(t_1)) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); elseif (B_m <= 9.5e+122) tmp = Float64(Float64(t_3 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_3 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * C + N[(N[(B$95$m * N[(B$95$m * -0.5), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.2e-202], N[(N[Sqrt[N[(2.0 * N[(t$95$2 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 4.5e-7], N[(N[(N[Sqrt[N[(2.0 * t$95$2), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 9.5e+122], N[(N[(t$95$3 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$3 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := F \cdot t\_0\\
t_2 := \mathsf{fma}\left(2, C, \frac{B\_m \cdot \left(B\_m \cdot -0.5\right)}{A}\right)\\
t_3 := \sqrt{2 \cdot F}\\
\mathbf{if}\;B\_m \leq 2.2 \cdot 10^{-202}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_2 \cdot t\_1\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 4.5 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{2 \cdot t\_2} \cdot \sqrt{t\_1}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 9.5 \cdot 10^{+122}:\\
\;\;\;\;\frac{t\_3}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_3 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 2.20000000000000008e-202Initial program 18.3%
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-*.f6416.5
Simplified16.5%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
distribute-frac-negN/A
distribute-frac-neg2N/A
/-lowering-/.f64N/A
Applied egg-rr16.5%
if 2.20000000000000008e-202 < B < 4.4999999999999998e-7Initial program 28.2%
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-*.f6420.3
Simplified20.3%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr23.7%
if 4.4999999999999998e-7 < B < 9.49999999999999986e122Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 9.49999999999999986e122 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification27.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 (<= (pow B_m 2.0) 2e-13) (* (sqrt (* F (/ (* -0.5 (* B_m B_m)) A))) (- (/ (sqrt 2.0) B_m))) (/ (- (sqrt F)) (sqrt (* B_m 0.5)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-13) {
tmp = sqrt((F * ((-0.5 * (B_m * B_m)) / A))) * -(sqrt(2.0) / B_m);
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 2d-13) then
tmp = sqrt((f * (((-0.5d0) * (b_m * b_m)) / a))) * -(sqrt(2.0d0) / b_m)
else
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 2e-13) {
tmp = Math.sqrt((F * ((-0.5 * (B_m * B_m)) / A))) * -(Math.sqrt(2.0) / B_m);
} else {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 2e-13: tmp = math.sqrt((F * ((-0.5 * (B_m * B_m)) / A))) * -(math.sqrt(2.0) / B_m) else: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-13) tmp = Float64(sqrt(Float64(F * Float64(Float64(-0.5 * Float64(B_m * B_m)) / A))) * Float64(-Float64(sqrt(2.0) / B_m))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 2e-13)
tmp = sqrt((F * ((-0.5 * (B_m * B_m)) / A))) * -(sqrt(2.0) / B_m);
else
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-13], N[(N[Sqrt[N[(F * N[(N[(-0.5 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5 \cdot \left(B\_m \cdot B\_m\right)}{A}} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-13Initial program 24.9%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f646.7
Simplified6.7%
Taylor expanded in A around -inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f647.2
Simplified7.2%
if 2.0000000000000001e-13 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.9%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6419.2
Simplified19.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6424.2
Applied egg-rr24.2%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6424.2
Applied egg-rr24.2%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6424.2
Applied egg-rr24.2%
Final simplification16.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 (sqrt (* 2.0 F))) (t_1 (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 4.5e-7)
(/
(sqrt (* 2.0 (* (fma 2.0 C (/ (* B_m (* B_m -0.5)) A)) (* F t_1))))
(- t_1))
(if (<= B_m 3.15e+123)
(* (/ t_0 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_0 (sqrt (/ 1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((2.0 * F));
double t_1 = fma(B_m, B_m, (-4.0 * (A * C)));
double tmp;
if (B_m <= 4.5e-7) {
tmp = sqrt((2.0 * (fma(2.0, C, ((B_m * (B_m * -0.5)) / A)) * (F * t_1)))) / -t_1;
} else if (B_m <= 3.15e+123) {
tmp = (t_0 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_0 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(2.0 * F)) t_1 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B_m <= 4.5e-7) 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)); elseif (B_m <= 3.15e+123) tmp = Float64(Float64(t_0 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_0 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.5e-7], 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], If[LessEqual[B$95$m, 3.15e+123], N[(N[(t$95$0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$0 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \sqrt{2 \cdot F}\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;B\_m \leq 4.5 \cdot 10^{-7}:\\
\;\;\;\;\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{elif}\;B\_m \leq 3.15 \cdot 10^{+123}:\\
\;\;\;\;\frac{t\_0}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_0 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 4.4999999999999998e-7Initial program 20.5%
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-*.f6417.3
Simplified17.3%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
distribute-frac-negN/A
distribute-frac-neg2N/A
/-lowering-/.f64N/A
Applied egg-rr17.3%
if 4.4999999999999998e-7 < B < 3.1500000000000001e123Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 3.1500000000000001e123 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification26.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 (sqrt (* 2.0 F))))
(if (<= B_m 4.4e-7)
(*
(sqrt
(/
(* F (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))
(fma B_m B_m (* -4.0 (* A C)))))
(- (sqrt 2.0)))
(if (<= B_m 3.1e+122)
(* (/ t_0 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_0 (sqrt (/ 1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((2.0 * F));
double tmp;
if (B_m <= 4.4e-7) {
tmp = sqrt(((F * fma(-0.5, ((B_m * B_m) / A), (2.0 * C))) / fma(B_m, B_m, (-4.0 * (A * C))))) * -sqrt(2.0);
} else if (B_m <= 3.1e+122) {
tmp = (t_0 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_0 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (B_m <= 4.4e-7) tmp = Float64(sqrt(Float64(Float64(F * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(2.0))); elseif (B_m <= 3.1e+122) tmp = Float64(Float64(t_0 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_0 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 4.4e-7], N[(N[Sqrt[N[(N[(F * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $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[B$95$m, 3.1e+122], N[(N[(t$95$0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$0 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \sqrt{2 \cdot F}\\
\mathbf{if}\;B\_m \leq 4.4 \cdot 10^{-7}:\\
\;\;\;\;\sqrt{\frac{F \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 3.1 \cdot 10^{+122}:\\
\;\;\;\;\frac{t\_0}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_0 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 4.4000000000000002e-7Initial program 20.5%
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-*.f6417.3
Simplified17.3%
Taylor expanded in F around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
Simplified11.9%
if 4.4000000000000002e-7 < B < 3.09999999999999999e122Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 3.09999999999999999e122 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification22.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 -4.0 (* A C) (* B_m B_m))) (t_1 (sqrt (* 2.0 F))))
(if (<= B_m 4.65e-7)
(* (sqrt 2.0) (/ (sqrt (* F (* (* 2.0 C) t_0))) (- t_0)))
(if (<= B_m 1.75e+122)
(* (/ t_1 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_1 (sqrt (/ 1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = sqrt((2.0 * F));
double tmp;
if (B_m <= 4.65e-7) {
tmp = sqrt(2.0) * (sqrt((F * ((2.0 * C) * t_0))) / -t_0);
} else if (B_m <= 1.75e+122) {
tmp = (t_1 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_1 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (B_m <= 4.65e-7) tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(F * Float64(Float64(2.0 * C) * t_0))) / Float64(-t_0))); elseif (B_m <= 1.75e+122) tmp = Float64(Float64(t_1 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_1 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 4.65e-7], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(N[(2.0 * C), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.75e+122], N[(N[(t$95$1 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$1 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{2 \cdot F}\\
\mathbf{if}\;B\_m \leq 4.65 \cdot 10^{-7}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F \cdot \left(\left(2 \cdot C\right) \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 1.75 \cdot 10^{+122}:\\
\;\;\;\;\frac{t\_1}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_1 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 4.6499999999999999e-7Initial program 20.5%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr18.9%
Taylor expanded in A around -inf
*-lowering-*.f6413.8
Simplified13.8%
if 4.6499999999999999e-7 < B < 1.75000000000000007e122Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 1.75000000000000007e122 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification23.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (sqrt (* 2.0 F))))
(if (<= B_m 4.3e-7)
(* (sqrt (* F (/ (* -0.5 (* B_m B_m)) A))) (- (/ (sqrt 2.0) B_m)))
(if (<= B_m 7.8e+121)
(* (/ t_0 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))
(- (* t_0 (sqrt (/ 1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((2.0 * F));
double tmp;
if (B_m <= 4.3e-7) {
tmp = sqrt((F * ((-0.5 * (B_m * B_m)) / A))) * -(sqrt(2.0) / B_m);
} else if (B_m <= 7.8e+121) {
tmp = (t_0 / -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))));
} else {
tmp = -(t_0 * sqrt((1.0 / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (B_m <= 4.3e-7) tmp = Float64(sqrt(Float64(F * Float64(Float64(-0.5 * Float64(B_m * B_m)) / A))) * Float64(-Float64(sqrt(2.0) / B_m))); elseif (B_m <= 7.8e+121) tmp = Float64(Float64(t_0 / Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))); else tmp = Float64(-Float64(t_0 * sqrt(Float64(1.0 / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 4.3e-7], N[(N[Sqrt[N[(F * N[(N[(-0.5 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 7.8e+121], N[(N[(t$95$0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(t$95$0 * N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \sqrt{2 \cdot F}\\
\mathbf{if}\;B\_m \leq 4.3 \cdot 10^{-7}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5 \cdot \left(B\_m \cdot B\_m\right)}{A}} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\mathbf{elif}\;B\_m \leq 7.8 \cdot 10^{+121}:\\
\;\;\;\;\frac{t\_0}{-B\_m} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;-t\_0 \cdot \sqrt{\frac{1}{B\_m}}\\
\end{array}
\end{array}
if B < 4.3000000000000001e-7Initial program 20.5%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f644.6
Simplified4.6%
Taylor expanded in A around -inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f646.2
Simplified6.2%
if 4.3000000000000001e-7 < B < 7.79999999999999967e121Initial program 39.2%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr34.3%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f6443.1
Simplified43.1%
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.1%
if 7.79999999999999967e121 < B Initial program 3.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-/.f6447.2
Simplified47.2%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6468.4
Applied egg-rr68.4%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6468.6
Applied egg-rr68.6%
Final simplification17.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (- (sqrt F)) (sqrt (* B_m 0.5))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(F) / sqrt((B_m * 0.5));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) / sqrt((b_m * 0.5d0))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) / math.sqrt((B_m * 0.5))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}
\end{array}
Initial program 19.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.5
Simplified12.5%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6415.8
Applied egg-rr15.8%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.9
Applied egg-rr15.9%
distribute-lft-neg-inN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6415.9
Applied egg-rr15.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)) (sqrt (/ 2.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(F) * sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) * sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) * Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) * math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-sqrt(F)) * sqrt(Float64(2.0 / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) * sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B\_m}}
\end{array}
Initial program 19.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.5
Simplified12.5%
sqrt-unprodN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f6415.8
Applied egg-rr15.8%
un-div-invN/A
sqrt-divN/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.9
Applied egg-rr15.9%
Final simplification15.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 3.1e+239) (- (sqrt (/ (* 2.0 F) B_m))) (* (sqrt (* C F)) (/ -2.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 3.1e+239) {
tmp = -sqrt(((2.0 * F) / B_m));
} else {
tmp = sqrt((C * F)) * (-2.0 / B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 3.1d+239) then
tmp = -sqrt(((2.0d0 * f) / b_m))
else
tmp = sqrt((c * f)) * ((-2.0d0) / b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 3.1e+239) {
tmp = -Math.sqrt(((2.0 * F) / B_m));
} else {
tmp = Math.sqrt((C * F)) * (-2.0 / B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 3.1e+239: tmp = -math.sqrt(((2.0 * F) / B_m)) else: tmp = math.sqrt((C * F)) * (-2.0 / B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 3.1e+239) tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / B_m))); else tmp = Float64(sqrt(Float64(C * F)) * Float64(-2.0 / B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 3.1e+239)
tmp = -sqrt(((2.0 * F) / B_m));
else
tmp = sqrt((C * F)) * (-2.0 / B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 3.1e+239], (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 3.1 \cdot 10^{+239}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{C \cdot F} \cdot \frac{-2}{B\_m}\\
\end{array}
\end{array}
if C < 3.10000000000000001e239Initial program 21.0%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.2
Simplified13.2%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6413.3
Applied egg-rr13.3%
if 3.10000000000000001e239 < C Initial program 1.4%
frac-2negN/A
remove-double-negN/A
pow1/2N/A
associate-*l*N/A
unpow-prod-downN/A
neg-mul-1N/A
times-fracN/A
Applied egg-rr1.4%
Taylor expanded in A around 0
*-lowering-*.f64N/A
/-lowering-/.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-*.f641.1
Simplified1.1%
Taylor expanded in B around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f646.7
Simplified6.7%
Final simplification12.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 (/ (* 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 19.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.5
Simplified12.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6412.6
Applied egg-rr12.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 (* 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 19.7%
Taylor expanded in B around inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6412.5
Simplified12.5%
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6412.6
Applied egg-rr12.6%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6412.6
Applied egg-rr12.6%
herbie shell --seed 2024207
(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))))