
(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 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (* 2.0 (* (- (pow B_m 2.0) t_1) F)))
(t_3 (- t_1 (pow B_m 2.0)))
(t_4
(/
(sqrt (* t_2 (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_4 -5e-193)
(/
(sqrt
(*
2.0
(* (* F t_0) (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))))))
(- t_0))
(if (<= t_4 INFINITY)
(/ (sqrt (* t_2 (fma 2.0 C (* -0.5 (/ (* B_m B_m) A))))) t_3)
(/ (- (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(C, (A * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = 2.0 * ((pow(B_m, 2.0) - t_1) * F);
double t_3 = t_1 - pow(B_m, 2.0);
double t_4 = sqrt((t_2 * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_4 <= -5e-193) {
tmp = sqrt((2.0 * ((F * t_0) * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m))))))) / -t_0;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * fma(2.0, C, (-0.5 * ((B_m * B_m) / A))))) / t_3;
} 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(C, Float64(A * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) t_3 = Float64(t_1 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(t_2 * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_4 <= -5e-193) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))))) / Float64(-t_0)); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_2 * fma(2.0, C, Float64(-0.5 * Float64(Float64(B_m * B_m) / A))))) / t_3); 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[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$2 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$4, -5e-193], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$2 * N[(2.0 * C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $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(C, A \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := 2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\\
t_3 := t\_1 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{t\_2 \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-193}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_0\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)\right)}}{-t\_0}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \mathsf{fma}\left(2, C, -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified21.4%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6428.0
Simplified28.0%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000005e-193Initial program 98.7%
Applied egg-rr98.7%
if -5.0000000000000005e-193 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 13.1%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6428.7
Simplified28.7%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
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-/.f6417.2
Simplified17.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6421.2
Applied egg-rr21.2%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6421.2
Applied egg-rr21.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-*.f6421.2
Applied egg-rr21.2%
Final simplification36.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B_m B_m)))
(t_1 (* F t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_3 -5e-193)
(/
(sqrt
(* 2.0 (* t_1 (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))))))
(- t_0))
(if (<= t_3 INFINITY)
(*
(sqrt (* 2.0 (* t_1 (fma 2.0 C (/ (* -0.5 (* B_m B_m)) A)))))
(/ -1.0 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(C, (A * -4.0), (B_m * B_m));
double t_1 = F * t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_3 <= -5e-193) {
tmp = sqrt((2.0 * (t_1 * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m))))))) / -t_0;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * (t_1 * fma(2.0, C, ((-0.5 * (B_m * B_m)) / A))))) * (-1.0 / 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(C, Float64(A * -4.0), Float64(B_m * B_m)) t_1 = Float64(F * t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_3 <= -5e-193) tmp = Float64(sqrt(Float64(2.0 * Float64(t_1 * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))))) / Float64(-t_0)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(t_1 * fma(2.0, C, Float64(Float64(-0.5 * Float64(B_m * B_m)) / A))))) * Float64(-1.0 / 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[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -5e-193], N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(2.0 * C + N[(N[(-0.5 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / 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(C, A \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := F \cdot t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-193}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_1 \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{2 \cdot \left(t\_1 \cdot \mathsf{fma}\left(2, C, \frac{-0.5 \cdot \left(B\_m \cdot B\_m\right)}{A}\right)\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified21.4%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6428.0
Simplified28.0%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000005e-193Initial program 98.7%
Applied egg-rr98.7%
if -5.0000000000000005e-193 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 13.1%
Applied egg-rr13.0%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6428.6
Simplified28.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.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-/.f6417.2
Simplified17.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6421.2
Applied egg-rr21.2%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6421.2
Applied egg-rr21.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-*.f6421.2
Applied egg-rr21.2%
Final simplification36.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 F)))
(t_1 (fma C (* A -4.0) (* B_m B_m)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(* (sqrt (/ (* F -0.5) A)) (- (sqrt 2.0)))
(if (<= t_3 -5e-193)
(*
(sqrt 2.0)
(*
t_0
(sqrt
(/
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))
(fma A (* C -4.0) (* B_m B_m))))))
(if (<= t_3 INFINITY)
(*
(sqrt (* 2.0 (* (* F t_1) (fma 2.0 C (/ (* -0.5 (* B_m B_m)) A)))))
(/ -1.0 t_1))
(/ t_0 (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 = -sqrt(F);
double t_1 = fma(C, (A * -4.0), (B_m * B_m));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(2.0);
} else if (t_3 <= -5e-193) {
tmp = sqrt(2.0) * (t_0 * sqrt((((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))) / fma(A, (C * -4.0), (B_m * B_m)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * ((F * t_1) * fma(2.0, C, ((-0.5 * (B_m * B_m)) / A))))) * (-1.0 / t_1);
} else {
tmp = t_0 / 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(-sqrt(F)) t_1 = fma(C, Float64(A * -4.0), Float64(B_m * B_m)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(2.0))); elseif (t_3 <= -5e-193) tmp = Float64(sqrt(2.0) * Float64(t_0 * sqrt(Float64(Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) / fma(A, Float64(C * -4.0), Float64(B_m * B_m)))))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_1) * fma(2.0, C, Float64(Float64(-0.5 * Float64(B_m * B_m)) / A))))) * Float64(-1.0 / t_1)); else tmp = Float64(t_0 / 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[Sqrt[F], $MachinePrecision])}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -5e-193], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$0 * N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$1), $MachinePrecision] * N[(2.0 * C + N[(N[(-0.5 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / 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 := -\sqrt{F}\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, B\_m \cdot B\_m\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-193}:\\
\;\;\;\;\sqrt{2} \cdot \left(t\_0 \cdot \sqrt{\frac{\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(F \cdot t\_1\right) \cdot \mathsf{fma}\left(2, C, \frac{-0.5 \cdot \left(B\_m \cdot B\_m\right)}{A}\right)\right)} \cdot \frac{-1}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified21.4%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6428.0
Simplified28.0%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000005e-193Initial program 98.7%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified88.8%
Applied egg-rr98.3%
if -5.0000000000000005e-193 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 13.1%
Applied egg-rr13.0%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6428.6
Simplified28.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.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-/.f6417.2
Simplified17.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6421.2
Applied egg-rr21.2%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6421.2
Applied egg-rr21.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-*.f6421.2
Applied egg-rr21.2%
Final simplification36.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0)))
(t_1 (fma C (* A -4.0) (* B_m B_m)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(* (sqrt (/ (* F -0.5) A)) t_0)
(if (<= t_3 -5e-193)
(*
t_0
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C))))))
(if (<= t_3 INFINITY)
(*
(sqrt (* 2.0 (* (* F t_1) (fma 2.0 C (/ (* -0.5 (* B_m B_m)) A)))))
(/ -1.0 t_1))
(/ (- (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 = -sqrt(2.0);
double t_1 = fma(C, (A * -4.0), (B_m * B_m));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt(((F * -0.5) / A)) * t_0;
} else if (t_3 <= -5e-193) {
tmp = t_0 * sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((2.0 * ((F * t_1) * fma(2.0, C, ((-0.5 * (B_m * B_m)) / A))))) * (-1.0 / t_1);
} 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 = Float64(-sqrt(2.0)) t_1 = fma(C, Float64(A * -4.0), Float64(B_m * B_m)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * t_0); elseif (t_3 <= -5e-193) tmp = Float64(t_0 * sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_1) * fma(2.0, C, Float64(Float64(-0.5 * Float64(B_m * B_m)) / A))))) * Float64(-1.0 / t_1)); 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[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$3, -5e-193], N[(t$95$0 * N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$1), $MachinePrecision] * N[(2.0 * C + N[(N[(-0.5 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $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 := -\sqrt{2}\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, B\_m \cdot B\_m\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot t\_0\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-193}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(F \cdot t\_1\right) \cdot \mathsf{fma}\left(2, C, \frac{-0.5 \cdot \left(B\_m \cdot B\_m\right)}{A}\right)\right)} \cdot \frac{-1}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified21.4%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6428.0
Simplified28.0%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000005e-193Initial program 98.7%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified88.8%
if -5.0000000000000005e-193 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 13.1%
Applied egg-rr13.0%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6428.6
Simplified28.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.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-/.f6417.2
Simplified17.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6421.2
Applied egg-rr21.2%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6421.2
Applied egg-rr21.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-*.f6421.2
Applied egg-rr21.2%
Final simplification34.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0))))
(if (<= (pow B_m 2.0) 1e-308)
(/
(sqrt (* 2.0 (* (fma B_m B_m (* A (* C -4.0))) (* F (* 2.0 C)))))
(- (* (* 4.0 A) C) (* B_m B_m)))
(if (<= (pow B_m 2.0) 5e-10)
(* (sqrt (/ (* F -0.5) A)) t_0)
(if (<= (pow B_m 2.0) 2e+133)
(*
t_0
(sqrt
(/
(* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
(fma B_m B_m (* -4.0 (* A C))))))
(/ (- (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 = -sqrt(2.0);
double tmp;
if (pow(B_m, 2.0) <= 1e-308) {
tmp = sqrt((2.0 * (fma(B_m, B_m, (A * (C * -4.0))) * (F * (2.0 * C))))) / (((4.0 * A) * C) - (B_m * B_m));
} else if (pow(B_m, 2.0) <= 5e-10) {
tmp = sqrt(((F * -0.5) / A)) * t_0;
} else if (pow(B_m, 2.0) <= 2e+133) {
tmp = t_0 * sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / fma(B_m, B_m, (-4.0 * (A * C)))));
} 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 = Float64(-sqrt(2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-308) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) * Float64(F * Float64(2.0 * C))))) / Float64(Float64(Float64(4.0 * A) * C) - Float64(B_m * B_m))); elseif ((B_m ^ 2.0) <= 5e-10) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * t_0); elseif ((B_m ^ 2.0) <= 2e+133) tmp = Float64(t_0 * sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); 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[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-308], N[(N[Sqrt[N[(2.0 * N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-10], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+133], N[(t$95$0 * N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 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 := -\sqrt{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-308}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right) \cdot \left(F \cdot \left(2 \cdot C\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - B\_m \cdot B\_m}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{-10}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot t\_0\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+133}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999991e-309Initial program 14.0%
Applied egg-rr13.9%
Taylor expanded in A around -inf
lower-*.f6429.6
Simplified29.6%
Applied egg-rr29.7%
if 9.9999999999999991e-309 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000031e-10Initial program 28.6%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified24.5%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6427.9
Simplified27.9%
if 5.00000000000000031e-10 < (pow.f64 B #s(literal 2 binary64)) < 2e133Initial program 39.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified44.4%
if 2e133 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.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-/.f6426.4
Simplified26.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6430.6
Applied egg-rr30.6%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6430.5
Applied egg-rr30.5%
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-*.f6430.6
Applied egg-rr30.6%
Final simplification31.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-308)
(/
(sqrt (* 2.0 (* (fma B_m B_m (* A (* C -4.0))) (* F (* 2.0 C)))))
(- (* (* 4.0 A) C) (* B_m B_m)))
(if (<= (pow B_m 2.0) 4e-28)
(* (sqrt (/ (* F -0.5) A)) (- (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 (pow(B_m, 2.0) <= 1e-308) {
tmp = sqrt((2.0 * (fma(B_m, B_m, (A * (C * -4.0))) * (F * (2.0 * C))))) / (((4.0 * A) * C) - (B_m * B_m));
} else if (pow(B_m, 2.0) <= 4e-28) {
tmp = sqrt(((F * -0.5) / A)) * -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 ^ 2.0) <= 1e-308) tmp = Float64(sqrt(Float64(2.0 * Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) * Float64(F * Float64(2.0 * C))))) / Float64(Float64(Float64(4.0 * A) * C) - Float64(B_m * B_m))); elseif ((B_m ^ 2.0) <= 4e-28) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * 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[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-308], N[(N[Sqrt[N[(2.0 * N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-28], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $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}^{2} \leq 10^{-308}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right) \cdot \left(F \cdot \left(2 \cdot C\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - B\_m \cdot B\_m}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{-28}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999991e-309Initial program 14.0%
Applied egg-rr13.9%
Taylor expanded in A around -inf
lower-*.f6429.6
Simplified29.6%
Applied egg-rr29.7%
if 9.9999999999999991e-309 < (pow.f64 B #s(literal 2 binary64)) < 3.99999999999999988e-28Initial program 28.2%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified23.9%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6427.6
Simplified27.6%
if 3.99999999999999988e-28 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.2%
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-/.f6424.2
Simplified24.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6427.2
Applied egg-rr27.2%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6427.2
Applied egg-rr27.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-*.f6427.3
Applied egg-rr27.3%
Final simplification27.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.55e-219)
(*
(/ -1.0 (fma C (* A -4.0) (* B_m B_m)))
(* 2.0 (sqrt (* C (* F (fma -4.0 (* A C) (* B_m B_m)))))))
(if (<= B_m 6.2e-12)
(* (sqrt (/ (* F -0.5) A)) (- (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 <= 2.55e-219) {
tmp = (-1.0 / fma(C, (A * -4.0), (B_m * B_m))) * (2.0 * sqrt((C * (F * fma(-4.0, (A * C), (B_m * B_m))))));
} else if (B_m <= 6.2e-12) {
tmp = sqrt(((F * -0.5) / A)) * -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 <= 2.55e-219) tmp = Float64(Float64(-1.0 / fma(C, Float64(A * -4.0), Float64(B_m * B_m))) * Float64(2.0 * sqrt(Float64(C * Float64(F * fma(-4.0, Float64(A * C), Float64(B_m * B_m))))))); elseif (B_m <= 6.2e-12) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * 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, 2.55e-219], N[(N[(-1.0 / N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[Sqrt[N[(C * N[(F * N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.2e-12], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $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 2.55 \cdot 10^{-219}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(C, A \cdot -4, B\_m \cdot B\_m\right)} \cdot \left(2 \cdot \sqrt{C \cdot \left(F \cdot \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\right)}\right)\\
\mathbf{elif}\;B\_m \leq 6.2 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 2.5499999999999999e-219Initial program 17.3%
Applied egg-rr17.2%
Taylor expanded in A around -inf
lower-*.f6416.4
Simplified16.4%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.4
Simplified16.4%
if 2.5499999999999999e-219 < B < 6.2000000000000002e-12Initial program 25.6%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified25.4%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6418.0
Simplified18.0%
if 6.2000000000000002e-12 < B Initial program 19.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-/.f6453.4
Simplified53.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6462.8
Applied egg-rr62.8%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6462.8
Applied egg-rr62.8%
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-*.f6462.9
Applied egg-rr62.9%
Final simplification27.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.55e-219)
(*
(/ -1.0 (fma C (* A -4.0) (* B_m B_m)))
(sqrt (* 2.0 (* (* 2.0 C) (* -4.0 (* A (* C F)))))))
(if (<= B_m 6.2e-12)
(* (sqrt (/ (* F -0.5) A)) (- (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 <= 2.55e-219) {
tmp = (-1.0 / fma(C, (A * -4.0), (B_m * B_m))) * sqrt((2.0 * ((2.0 * C) * (-4.0 * (A * (C * F))))));
} else if (B_m <= 6.2e-12) {
tmp = sqrt(((F * -0.5) / A)) * -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 <= 2.55e-219) tmp = Float64(Float64(-1.0 / fma(C, Float64(A * -4.0), Float64(B_m * B_m))) * sqrt(Float64(2.0 * Float64(Float64(2.0 * C) * Float64(-4.0 * Float64(A * Float64(C * F))))))); elseif (B_m <= 6.2e-12) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * 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, 2.55e-219], N[(N[(-1.0 / N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(N[(2.0 * C), $MachinePrecision] * N[(-4.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.2e-12], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $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 2.55 \cdot 10^{-219}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(C, A \cdot -4, B\_m \cdot B\_m\right)} \cdot \sqrt{2 \cdot \left(\left(2 \cdot C\right) \cdot \left(-4 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right)\right)}\\
\mathbf{elif}\;B\_m \leq 6.2 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 2.5499999999999999e-219Initial program 17.3%
Applied egg-rr17.2%
Taylor expanded in A around -inf
lower-*.f6416.4
Simplified16.4%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6415.4
Simplified15.4%
if 2.5499999999999999e-219 < B < 6.2000000000000002e-12Initial program 25.6%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified25.4%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6418.0
Simplified18.0%
if 6.2000000000000002e-12 < B Initial program 19.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-/.f6453.4
Simplified53.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6462.8
Applied egg-rr62.8%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6462.8
Applied egg-rr62.8%
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-*.f6462.9
Applied egg-rr62.9%
Final simplification27.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 6.2e-12) (* (sqrt (/ (* F -0.5) A)) (- (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 <= 6.2e-12) {
tmp = sqrt(((F * -0.5) / A)) * -sqrt(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) :: tmp
if (b_m <= 6.2d-12) then
tmp = sqrt(((f * (-0.5d0)) / a)) * -sqrt(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 tmp;
if (B_m <= 6.2e-12) {
tmp = Math.sqrt(((F * -0.5) / A)) * -Math.sqrt(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): tmp = 0 if B_m <= 6.2e-12: tmp = math.sqrt(((F * -0.5) / A)) * -math.sqrt(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) tmp = 0.0 if (B_m <= 6.2e-12) tmp = Float64(sqrt(Float64(Float64(F * -0.5) / A)) * Float64(-sqrt(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)
tmp = 0.0;
if (B_m <= 6.2e-12)
tmp = sqrt(((F * -0.5) / A)) * -sqrt(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_] := If[LessEqual[B$95$m, 6.2e-12], N[(N[Sqrt[N[(N[(F * -0.5), $MachinePrecision] / A), $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 6.2 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{\frac{F \cdot -0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\end{array}
\end{array}
if B < 6.2000000000000002e-12Initial program 18.8%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified17.8%
Taylor expanded in C around inf
associate-*r/N/A
lower-/.f64N/A
rem-square-sqrtN/A
unpow2N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f6417.9
Simplified17.9%
if 6.2000000000000002e-12 < B Initial program 19.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-/.f6453.4
Simplified53.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6462.8
Applied egg-rr62.8%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6462.8
Applied egg-rr62.8%
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-*.f6462.9
Applied egg-rr62.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 (<= F 3.9e-58) (/ (sqrt (* 2.0 (* F (+ B_m A)))) (- B_m)) (- (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) {
double tmp;
if (F <= 3.9e-58) {
tmp = sqrt((2.0 * (F * (B_m + A)))) / -B_m;
} else {
tmp = -sqrt(((2.0 * F) / B_m));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= 3.9d-58) then
tmp = sqrt((2.0d0 * (f * (b_m + a)))) / -b_m
else
tmp = -sqrt(((2.0d0 * f) / b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 3.9e-58) {
tmp = Math.sqrt((2.0 * (F * (B_m + A)))) / -B_m;
} else {
tmp = -Math.sqrt(((2.0 * F) / B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 3.9e-58: tmp = math.sqrt((2.0 * (F * (B_m + A)))) / -B_m else: tmp = -math.sqrt(((2.0 * F) / B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 3.9e-58) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(B_m + A)))) / Float64(-B_m)); else tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 3.9e-58)
tmp = sqrt((2.0 * (F * (B_m + A)))) / -B_m;
else
tmp = -sqrt(((2.0 * F) / B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 3.9e-58], N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-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])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 3.9 \cdot 10^{-58}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(B\_m + A\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\end{array}
\end{array}
if F < 3.89999999999999992e-58Initial program 22.6%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Simplified9.1%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f6414.4
Simplified14.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6414.4
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
Applied egg-rr14.6%
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
/-rgt-identityN/A
lift-/.f64N/A
clear-numN/A
lower-/.f6414.6
lift-fma.f64N/A
*-rgt-identityN/A
+-commutativeN/A
lower-+.f6414.6
Applied egg-rr14.6%
if 3.89999999999999992e-58 < F Initial program 15.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-/.f6421.1
Simplified21.1%
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6421.2
Applied egg-rr21.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 (/ (- (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.1%
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-/.f6416.3
Simplified16.3%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6418.0
Applied egg-rr18.0%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6418.0
Applied egg-rr18.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-*.f6418.1
Applied egg-rr18.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (- (sqrt F)) (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.1%
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-/.f6416.3
Simplified16.3%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
lower-/.f64N/A
pow1/2N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6418.0
Applied egg-rr18.0%
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6418.0
Applied egg-rr18.0%
Final simplification18.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 (- (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.1%
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-/.f6416.3
Simplified16.3%
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6416.4
Applied egg-rr16.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* 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.1%
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-/.f6416.3
Simplified16.3%
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6416.4
Applied egg-rr16.4%
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6416.4
Applied egg-rr16.4%
herbie shell --seed 2024215
(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))))