
(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 10 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)))
(if (<= B_m 4.8e-7)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(/ (- (sqrt F)) (sqrt (* B_m 0.5))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (B_m <= 4.8e-7) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
real(8) :: tmp
t_0 = (4.0d0 * a) * c
if (b_m <= 4.8d-7) then
tmp = sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * (2.0d0 * c))) / (t_0 - (b_m ** 2.0d0))
else
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (B_m <= 4.8e-7) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if B_m <= 4.8e-7: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (B_m <= 4.8e-7) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if (B_m <= 4.8e-7)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 4.8e-7], 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] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 4.79999999999999957e-7Initial program 20.5%
Taylor expanded in A around -inf
lower-*.f6417.5
Simplified17.5%
if 4.79999999999999957e-7 < B Initial program 16.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6443.6
Simplified43.6%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6457.8
Applied egg-rr57.8%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6458.0
Applied egg-rr58.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6458.0
Applied egg-rr58.0%
Final simplification26.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 (<= B_m 4.8e-7)
(/
(*
(sqrt (* (* F (fma 0.0 A (* 2.0 C))) (fma -4.0 (* A C) (* B_m B_m))))
(sqrt 2.0))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(/ (- (sqrt F)) (sqrt (* B_m 0.5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.8e-7) {
tmp = (sqrt(((F * fma(0.0, A, (2.0 * C))) * fma(-4.0, (A * C), (B_m * B_m)))) * sqrt(2.0)) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.8e-7) tmp = Float64(Float64(sqrt(Float64(Float64(F * fma(0.0, A, Float64(2.0 * C))) * fma(-4.0, Float64(A * C), Float64(B_m * B_m)))) * sqrt(2.0)) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.8e-7], N[(N[(N[Sqrt[N[(N[(F * N[(0.0 * A + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(0, A, 2 \cdot C\right)\right) \cdot \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)} \cdot \sqrt{2}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 4.79999999999999957e-7Initial program 20.5%
Taylor expanded in C around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6411.4
Simplified11.4%
Taylor expanded in F around 0
lower-*.f64N/A
Simplified17.7%
if 4.79999999999999957e-7 < B Initial program 16.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6443.6
Simplified43.6%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6457.8
Applied egg-rr57.8%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6458.0
Applied egg-rr58.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6458.0
Applied egg-rr58.0%
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 (if (<= (pow B_m 2.0) 2e-13) (* (sqrt (* F (/ (* (* B_m B_m) -0.5) 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 * (((B_m * B_m) * -0.5) / 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 * (((b_m * b_m) * (-0.5d0)) / 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 * (((B_m * B_m) * -0.5) / 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 * (((B_m * B_m) * -0.5) / 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(Float64(B_m * B_m) * -0.5) / 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 * (((B_m * B_m) * -0.5) / 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[(N[(B$95$m * B$95$m), $MachinePrecision] * -0.5), $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{\left(B\_m \cdot B\_m\right) \cdot -0.5}{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
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f646.7
Simplified6.7%
Taylor expanded in A around -inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6419.2
Simplified19.2%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.2
Applied egg-rr24.2%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6424.2
Applied egg-rr24.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.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 (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 4.8e-7)
(* (/ (sqrt 2.0) -1.0) (/ (sqrt (* t_0 (* F (* 2.0 C)))) t_0))
(/ (- (sqrt F)) (sqrt (* B_m 0.5))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double tmp;
if (B_m <= 4.8e-7) {
tmp = (sqrt(2.0) / -1.0) * (sqrt((t_0 * (F * (2.0 * C)))) / t_0);
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B_m <= 4.8e-7) tmp = Float64(Float64(sqrt(2.0) / -1.0) * Float64(sqrt(Float64(t_0 * Float64(F * Float64(2.0 * C)))) / t_0)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.8e-7], N[(N[(N[Sqrt[2.0], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(t$95$0 * N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{2}}{-1} \cdot \frac{\sqrt{t\_0 \cdot \left(F \cdot \left(2 \cdot C\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 4.79999999999999957e-7Initial program 20.5%
Applied egg-rr20.9%
Taylor expanded in A around -inf
lower-*.f6417.7
Simplified17.7%
if 4.79999999999999957e-7 < B Initial program 16.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6443.6
Simplified43.6%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6457.8
Applied egg-rr57.8%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6458.0
Applied egg-rr58.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6458.0
Applied egg-rr58.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
(if (<= B_m 5.4e-49)
(*
(sqrt (/ (* F (fma 0.0 A (* 2.0 C))) (fma -4.0 (* A C) (* B_m B_m))))
(- (sqrt 2.0)))
(/ (- (sqrt F)) (sqrt (* B_m 0.5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 5.4e-49) {
tmp = sqrt(((F * fma(0.0, A, (2.0 * C))) / fma(-4.0, (A * C), (B_m * B_m)))) * -sqrt(2.0);
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 5.4e-49) tmp = Float64(sqrt(Float64(Float64(F * fma(0.0, A, Float64(2.0 * C))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m)))) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 5.4e-49], N[(N[Sqrt[N[(N[(F * N[(0.0 * A + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 5.4 \cdot 10^{-49}:\\
\;\;\;\;\sqrt{\frac{F \cdot \mathsf{fma}\left(0, A, 2 \cdot C\right)}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 5.3999999999999999e-49Initial program 19.8%
Taylor expanded in C around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6411.2
Simplified11.2%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Simplified12.4%
if 5.3999999999999999e-49 < B Initial program 19.5%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6441.7
Simplified41.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6454.1
Applied egg-rr54.1%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6454.3
Applied egg-rr54.3%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6454.3
Applied egg-rr54.3%
Final simplification22.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 (* 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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6412.5
Simplified12.5%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6415.8
Applied egg-rr15.8%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6415.9
Applied egg-rr15.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.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])\\
\\
-\sqrt{F} \cdot \sqrt{\frac{2}{B\_m}}
\end{array}
Initial program 19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6412.5
Simplified12.5%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
unpow-prod-downN/A
pow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6415.8
Applied egg-rr15.8%
lift-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-prodN/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.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 (if (<= C 1.8e+239) (- (sqrt (fabs (/ (* 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 <= 1.8e+239) {
tmp = -sqrt(fabs(((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 <= 1.8d+239) then
tmp = -sqrt(abs(((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 <= 1.8e+239) {
tmp = -Math.sqrt(Math.abs(((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 <= 1.8e+239: tmp = -math.sqrt(math.fabs(((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 <= 1.8e+239) tmp = Float64(-sqrt(abs(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 <= 1.8e+239)
tmp = -sqrt(abs(((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, 1.8e+239], (-N[Sqrt[N[Abs[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $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 1.8 \cdot 10^{+239}:\\
\;\;\;\;-\sqrt{\left|\frac{2 \cdot F}{B\_m}\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{C \cdot F} \cdot \frac{-2}{B\_m}\\
\end{array}
\end{array}
if C < 1.8e239Initial program 21.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6413.2
Simplified13.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6413.2
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f6413.3
Applied egg-rr13.3%
lift-/.f64N/A
lift-*.f6413.3
rem-square-sqrtN/A
sqrt-unprodN/A
rem-sqrt-squareN/A
lower-fabs.f6427.9
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
lower-/.f6427.9
Applied egg-rr27.9%
if 1.8e239 < C Initial program 1.4%
Taylor expanded in C around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6412.8
Simplified12.8%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
associate-+r+N/A
distribute-rgt1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f641.6
Simplified1.6%
Taylor expanded in B around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
unpow2N/A
rem-square-sqrtN/A
metadata-evalN/A
lower-/.f646.7
Simplified6.7%
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 (- (sqrt (fabs (/ (* 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(fabs(((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(abs(((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(Math.abs(((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(math.fabs(((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(abs(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(abs(((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[Abs[N[(N[(2.0 * F), $MachinePrecision] / 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{\left|\frac{2 \cdot F}{B\_m}\right|}
\end{array}
Initial program 19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6412.5
Simplified12.5%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6412.5
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f6412.6
Applied egg-rr12.6%
lift-/.f64N/A
lift-*.f6412.6
rem-square-sqrtN/A
sqrt-unprodN/A
rem-sqrt-squareN/A
lower-fabs.f6426.6
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
lower-/.f6426.6
Applied egg-rr26.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(2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6412.5
Simplified12.5%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6412.5
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.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))))