
(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 (* -4.0 C) A (* B_m B_m))))
(if (<= B_m 5e-38)
(/
(sqrt (* (* (* F 2.0) t_0) (+ (+ (* (/ (* B_m B_m) C) -0.5) A) A)))
(- t_0))
(if (<= B_m 8.5e+125)
(- (sqrt (* (* (/ (- (+ C A) (hypot (- A C) B_m)) t_0) F) 2.0)))
(if (<= B_m 7e+227)
(/
-1.0
(* (sqrt (/ 1.0 (* (- A (hypot A B_m)) F))) (/ B_m (sqrt 2.0))))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (B_m <= 5e-38) {
tmp = sqrt((((F * 2.0) * t_0) * (((((B_m * B_m) / C) * -0.5) + A) + A))) / -t_0;
} else if (B_m <= 8.5e+125) {
tmp = -sqrt((((((C + A) - hypot((A - C), B_m)) / t_0) * F) * 2.0));
} else if (B_m <= 7e+227) {
tmp = -1.0 / (sqrt((1.0 / ((A - hypot(A, B_m)) * F))) * (B_m / sqrt(2.0)));
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 5e-38) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(Float64(Float64(Float64(B_m * B_m) / C) * -0.5) + A) + A))) / Float64(-t_0)); elseif (B_m <= 8.5e+125) tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_0) * F) * 2.0))); elseif (B_m <= 7e+227) tmp = Float64(-1.0 / Float64(sqrt(Float64(1.0 / Float64(Float64(A - hypot(A, B_m)) * F))) * Float64(B_m / sqrt(2.0)))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5e-38], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 8.5e+125], (-N[Sqrt[N[(N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 7e+227], N[(-1.0 / N[(N[Sqrt[N[(1.0 / N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 5 \cdot 10^{-38}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(\frac{B\_m \cdot B\_m}{C} \cdot -0.5 + A\right) + A\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{+125}:\\
\;\;\;\;-\sqrt{\left(\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0} \cdot F\right) \cdot 2}\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{+227}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{1}{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}} \cdot \frac{B\_m}{\sqrt{2}}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 5.00000000000000033e-38Initial program 19.3%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6416.5
Applied rewrites16.5%
Applied rewrites16.5%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6417.7
Applied rewrites17.7%
if 5.00000000000000033e-38 < B < 8.49999999999999974e125Initial program 44.7%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites59.6%
Applied rewrites59.7%
if 8.49999999999999974e125 < B < 6.9999999999999998e227Initial program 9.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites9.3%
Taylor expanded in C around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6451.7
Applied rewrites51.7%
if 6.9999999999999998e227 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification29.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))))
(if (<= B_m 5e-38)
(/
(sqrt (* (* (* F 2.0) t_0) (+ (+ (* (/ (* B_m B_m) C) -0.5) A) A)))
(- t_0))
(if (<= B_m 9.5e+123)
(- (sqrt (* (* (/ (- (+ C A) (hypot (- A C) B_m)) t_0) F) 2.0)))
(if (<= B_m 7e+227)
(*
(sqrt (* (- A (hypot A B_m)) F))
(* (/ 1.0 (* (sqrt 2.0) B_m)) -2.0))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (B_m <= 5e-38) {
tmp = sqrt((((F * 2.0) * t_0) * (((((B_m * B_m) / C) * -0.5) + A) + A))) / -t_0;
} else if (B_m <= 9.5e+123) {
tmp = -sqrt((((((C + A) - hypot((A - C), B_m)) / t_0) * F) * 2.0));
} else if (B_m <= 7e+227) {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * ((1.0 / (sqrt(2.0) * B_m)) * -2.0);
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 5e-38) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(Float64(Float64(Float64(B_m * B_m) / C) * -0.5) + A) + A))) / Float64(-t_0)); elseif (B_m <= 9.5e+123) tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_0) * F) * 2.0))); elseif (B_m <= 7e+227) tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(Float64(1.0 / Float64(sqrt(2.0) * B_m)) * -2.0)); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5e-38], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 9.5e+123], (-N[Sqrt[N[(N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 7e+227], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 5 \cdot 10^{-38}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(\frac{B\_m \cdot B\_m}{C} \cdot -0.5 + A\right) + A\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 9.5 \cdot 10^{+123}:\\
\;\;\;\;-\sqrt{\left(\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0} \cdot F\right) \cdot 2}\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{+227}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \left(\frac{1}{\sqrt{2} \cdot B\_m} \cdot -2\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 5.00000000000000033e-38Initial program 19.3%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6416.5
Applied rewrites16.5%
Applied rewrites16.5%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6417.7
Applied rewrites17.7%
if 5.00000000000000033e-38 < B < 9.4999999999999996e123Initial program 44.7%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites59.6%
Applied rewrites59.7%
if 9.4999999999999996e123 < B < 6.9999999999999998e227Initial program 9.4%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites14.3%
Applied rewrites14.3%
Taylor expanded in C around 0
Applied rewrites51.7%
if 6.9999999999999998e227 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification29.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 (- A (hypot A B_m))))
(if (<= B_m 12500000.0)
(- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5)))))
(if (<= B_m 9.5e+123)
(* (sqrt (* (/ t_0 (* B_m B_m)) F)) (- (sqrt 2.0)))
(if (<= B_m 7e+227)
(* (sqrt (* t_0 F)) (* (/ 1.0 (* (sqrt 2.0) B_m)) -2.0))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = A - hypot(A, B_m);
double tmp;
if (B_m <= 12500000.0) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else if (B_m <= 9.5e+123) {
tmp = sqrt(((t_0 / (B_m * B_m)) * F)) * -sqrt(2.0);
} else if (B_m <= 7e+227) {
tmp = sqrt((t_0 * F)) * ((1.0 / (sqrt(2.0) * B_m)) * -2.0);
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(A - hypot(A, B_m)) tmp = 0.0 if (B_m <= 12500000.0) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); elseif (B_m <= 9.5e+123) tmp = Float64(sqrt(Float64(Float64(t_0 / Float64(B_m * B_m)) * F)) * Float64(-sqrt(2.0))); elseif (B_m <= 7e+227) tmp = Float64(sqrt(Float64(t_0 * F)) * Float64(Float64(1.0 / Float64(sqrt(2.0) * B_m)) * -2.0)); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 12500000.0], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 9.5e+123], N[(N[Sqrt[N[(N[(t$95$0 / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 7e+227], N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
t_0 := A - \mathsf{hypot}\left(A, B\_m\right)\\
\mathbf{if}\;B\_m \leq 12500000:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{elif}\;B\_m \leq 9.5 \cdot 10^{+123}:\\
\;\;\;\;\sqrt{\frac{t\_0}{B\_m \cdot B\_m} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{+227}:\\
\;\;\;\;\sqrt{t\_0 \cdot F} \cdot \left(\frac{1}{\sqrt{2} \cdot B\_m} \cdot -2\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.25e7Initial program 21.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
Applied rewrites34.0%
Applied rewrites34.0%
Taylor expanded in A around -inf
Applied rewrites17.7%
if 1.25e7 < B < 9.4999999999999996e123Initial program 40.2%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites57.4%
Taylor expanded in C around 0
Applied rewrites37.9%
if 9.4999999999999996e123 < B < 6.9999999999999998e227Initial program 9.4%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites14.3%
Applied rewrites14.3%
Taylor expanded in C around 0
Applied rewrites51.7%
if 6.9999999999999998e227 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification25.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 (- A (hypot A B_m))) (t_1 (- (sqrt 2.0))))
(if (<= B_m 12500000.0)
(- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5)))))
(if (<= B_m 9.5e+123)
(* (sqrt (* (/ t_0 (* B_m B_m)) F)) t_1)
(if (<= B_m 7e+227)
(* (sqrt (* t_0 F)) (/ t_1 B_m))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = A - hypot(A, B_m);
double t_1 = -sqrt(2.0);
double tmp;
if (B_m <= 12500000.0) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else if (B_m <= 9.5e+123) {
tmp = sqrt(((t_0 / (B_m * B_m)) * F)) * t_1;
} else if (B_m <= 7e+227) {
tmp = sqrt((t_0 * F)) * (t_1 / B_m);
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(A - hypot(A, B_m)) t_1 = Float64(-sqrt(2.0)) tmp = 0.0 if (B_m <= 12500000.0) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); elseif (B_m <= 9.5e+123) tmp = Float64(sqrt(Float64(Float64(t_0 / Float64(B_m * B_m)) * F)) * t_1); elseif (B_m <= 7e+227) tmp = Float64(sqrt(Float64(t_0 * F)) * Float64(t_1 / B_m)); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 12500000.0], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 9.5e+123], N[(N[Sqrt[N[(N[(t$95$0 / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 7e+227], N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] * N[(t$95$1 / B$95$m), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
t_0 := A - \mathsf{hypot}\left(A, B\_m\right)\\
t_1 := -\sqrt{2}\\
\mathbf{if}\;B\_m \leq 12500000:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{elif}\;B\_m \leq 9.5 \cdot 10^{+123}:\\
\;\;\;\;\sqrt{\frac{t\_0}{B\_m \cdot B\_m} \cdot F} \cdot t\_1\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{+227}:\\
\;\;\;\;\sqrt{t\_0 \cdot F} \cdot \frac{t\_1}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.25e7Initial program 21.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
Applied rewrites34.0%
Applied rewrites34.0%
Taylor expanded in A around -inf
Applied rewrites17.7%
if 1.25e7 < B < 9.4999999999999996e123Initial program 40.2%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites57.4%
Taylor expanded in C around 0
Applied rewrites37.9%
if 9.4999999999999996e123 < B < 6.9999999999999998e227Initial program 9.4%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6451.7
Applied rewrites51.7%
if 6.9999999999999998e227 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification25.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 (<= B_m 12500000.0)
(- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5)))))
(if (<= B_m 7e+227)
(* (sqrt (* (- A (hypot A B_m)) F)) (/ (- (sqrt 2.0)) B_m))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 12500000.0) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else if (B_m <= 7e+227) {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (-sqrt(2.0) / B_m);
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 12500000.0) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); elseif (B_m <= 7e+227) tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 12500000.0], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 7e+227], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 12500000:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{+227}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \frac{-\sqrt{2}}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.25e7Initial program 21.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
Applied rewrites34.0%
Applied rewrites34.0%
Taylor expanded in A around -inf
Applied rewrites17.7%
if 1.25e7 < B < 6.9999999999999998e227Initial program 25.4%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6444.2
Applied rewrites44.2%
if 6.9999999999999998e227 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification25.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 (<= B_m 12500000.0)
(- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5)))))
(if (<= B_m 8.5e+125)
(- (sqrt (/ (* (* (- A (hypot A B_m)) F) 2.0) (* B_m B_m))))
(if (<= B_m 1.35e+226)
(/
-1.0
(*
(sqrt (/ 1.0 (fma (- B_m) F (* (+ (* (/ (* F C) B_m) -0.5) F) C))))
(/ B_m (sqrt 2.0))))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 12500000.0) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else if (B_m <= 8.5e+125) {
tmp = -sqrt(((((A - hypot(A, B_m)) * F) * 2.0) / (B_m * B_m)));
} else if (B_m <= 1.35e+226) {
tmp = -1.0 / (sqrt((1.0 / fma(-B_m, F, (((((F * C) / B_m) * -0.5) + F) * C)))) * (B_m / sqrt(2.0)));
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 12500000.0) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); elseif (B_m <= 8.5e+125) tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 2.0) / Float64(B_m * B_m)))); elseif (B_m <= 1.35e+226) tmp = Float64(-1.0 / Float64(sqrt(Float64(1.0 / fma(Float64(-B_m), F, Float64(Float64(Float64(Float64(Float64(F * C) / B_m) * -0.5) + F) * C)))) * Float64(B_m / sqrt(2.0)))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 12500000.0], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 8.5e+125], (-N[Sqrt[N[(N[(N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 1.35e+226], N[(-1.0 / N[(N[Sqrt[N[(1.0 / N[((-B$95$m) * F + N[(N[(N[(N[(N[(F * C), $MachinePrecision] / B$95$m), $MachinePrecision] * -0.5), $MachinePrecision] + F), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 12500000:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{+125}:\\
\;\;\;\;-\sqrt{\frac{\left(\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F\right) \cdot 2}{B\_m \cdot B\_m}}\\
\mathbf{elif}\;B\_m \leq 1.35 \cdot 10^{+226}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{1}{\mathsf{fma}\left(-B\_m, F, \left(\frac{F \cdot C}{B\_m} \cdot -0.5 + F\right) \cdot C\right)}} \cdot \frac{B\_m}{\sqrt{2}}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.25e7Initial program 21.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites33.9%
Applied rewrites34.0%
Applied rewrites34.0%
Taylor expanded in A around -inf
Applied rewrites17.7%
if 1.25e7 < B < 8.49999999999999974e125Initial program 40.2%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites57.4%
Applied rewrites57.3%
Taylor expanded in C around 0
Applied rewrites37.4%
if 8.49999999999999974e125 < B < 1.3500000000000001e226Initial program 9.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites9.3%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6442.0
Applied rewrites42.0%
Taylor expanded in C around 0
Applied rewrites42.9%
if 1.3500000000000001e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification24.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 (<= B_m 1.8e+118)
(- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5)))))
(if (<= B_m 1.35e+226)
(/
-1.0
(*
(sqrt (/ 1.0 (fma (- B_m) F (* (+ (* (/ (* F C) B_m) -0.5) F) C))))
(/ B_m (sqrt 2.0))))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.8e+118) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else if (B_m <= 1.35e+226) {
tmp = -1.0 / (sqrt((1.0 / fma(-B_m, F, (((((F * C) / B_m) * -0.5) + F) * C)))) * (B_m / sqrt(2.0)));
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.8e+118) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); elseif (B_m <= 1.35e+226) tmp = Float64(-1.0 / Float64(sqrt(Float64(1.0 / fma(Float64(-B_m), F, Float64(Float64(Float64(Float64(Float64(F * C) / B_m) * -0.5) + F) * C)))) * Float64(B_m / sqrt(2.0)))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.8e+118], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 1.35e+226], N[(-1.0 / N[(N[Sqrt[N[(1.0 / N[((-B$95$m) * F + N[(N[(N[(N[(N[(F * C), $MachinePrecision] / B$95$m), $MachinePrecision] * -0.5), $MachinePrecision] + F), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.8 \cdot 10^{+118}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{elif}\;B\_m \leq 1.35 \cdot 10^{+226}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{1}{\mathsf{fma}\left(-B\_m, F, \left(\frac{F \cdot C}{B\_m} \cdot -0.5 + F\right) \cdot C\right)}} \cdot \frac{B\_m}{\sqrt{2}}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.8e118Initial program 23.5%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites36.6%
Applied rewrites36.7%
Applied rewrites36.7%
Taylor expanded in A around -inf
Applied rewrites17.4%
if 1.8e118 < B < 1.3500000000000001e226Initial program 9.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites9.0%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6440.2
Applied rewrites40.2%
Taylor expanded in C around 0
Applied rewrites41.1%
if 1.3500000000000001e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification22.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1.8e+118)
(- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5)))))
(if (<= B_m 1.35e+226)
(/ -1.0 (* (sqrt (/ 1.0 (* (- B_m) F))) (/ B_m (sqrt 2.0))))
(- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.8e+118) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else if (B_m <= 1.35e+226) {
tmp = -1.0 / (sqrt((1.0 / (-B_m * F))) * (B_m / sqrt(2.0)));
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.8e+118) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); elseif (B_m <= 1.35e+226) tmp = Float64(-1.0 / Float64(sqrt(Float64(1.0 / Float64(Float64(-B_m) * F))) * Float64(B_m / sqrt(2.0)))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.8e+118], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 1.35e+226], N[(-1.0 / N[(N[Sqrt[N[(1.0 / N[((-B$95$m) * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.8 \cdot 10^{+118}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{elif}\;B\_m \leq 1.35 \cdot 10^{+226}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{1}{\left(-B\_m\right) \cdot F}} \cdot \frac{B\_m}{\sqrt{2}}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.8e118Initial program 23.5%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites36.6%
Applied rewrites36.7%
Applied rewrites36.7%
Taylor expanded in A around -inf
Applied rewrites17.4%
if 1.8e118 < B < 1.3500000000000001e226Initial program 9.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites9.0%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6440.2
Applied rewrites40.2%
Taylor expanded in B around inf
Applied rewrites42.1%
if 1.3500000000000001e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.6%
Applied rewrites4.6%
Applied rewrites4.6%
Taylor expanded in B around inf
Applied rewrites63.3%
Final simplification22.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 (<= B_m 4e+36) (- (sqrt (/ (* F 2.0) (fma -2.0 C (* (/ (* B_m B_m) A) 0.5))))) (- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4e+36) {
tmp = -sqrt(((F * 2.0) / fma(-2.0, C, (((B_m * B_m) / A) * 0.5))));
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4e+36) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / fma(-2.0, C, Float64(Float64(Float64(B_m * B_m) / A) * 0.5))))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4e+36], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(-2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4 \cdot 10^{+36}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-2, C, \frac{B\_m \cdot B\_m}{A} \cdot 0.5\right)}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 4.00000000000000017e36Initial program 22.2%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites34.4%
Applied rewrites34.5%
Applied rewrites34.5%
Taylor expanded in A around -inf
Applied rewrites17.7%
if 4.00000000000000017e36 < B Initial program 15.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites25.6%
Applied rewrites25.7%
Applied rewrites25.8%
Taylor expanded in B around inf
Applied rewrites44.5%
Final simplification23.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.05e+18) (- (sqrt (/ (- F) C))) (- (sqrt (/ (* F 2.0) (* (fma -1.0 (/ (+ C A) B_m) -1.0) B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.05e+18) {
tmp = -sqrt((-F / C));
} else {
tmp = -sqrt(((F * 2.0) / (fma(-1.0, ((C + A) / B_m), -1.0) * B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.05e+18) tmp = Float64(-sqrt(Float64(Float64(-F) / C))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(fma(-1.0, Float64(Float64(C + A) / B_m), -1.0) * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.05e+18], (-N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / N[(N[(-1.0 * N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision] + -1.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.05 \cdot 10^{+18}:\\
\;\;\;\;-\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{\mathsf{fma}\left(-1, \frac{C + A}{B\_m}, -1\right) \cdot B\_m}}\\
\end{array}
\end{array}
if B < 1.05e18Initial program 21.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites34.1%
Applied rewrites34.2%
Taylor expanded in A around -inf
Applied rewrites15.7%
if 1.05e18 < B Initial program 17.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites27.3%
Applied rewrites27.4%
Applied rewrites27.4%
Taylor expanded in B around inf
Applied rewrites43.6%
Final simplification22.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.05e+18) (- (sqrt (/ (- F) C))) (- (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) {
double tmp;
if (B_m <= 1.05e+18) {
tmp = -sqrt((-F / C));
} else {
tmp = -sqrt(((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 (b_m <= 1.05d+18) then
tmp = -sqrt((-f / c))
else
tmp = -sqrt(((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 (B_m <= 1.05e+18) {
tmp = -Math.sqrt((-F / C));
} else {
tmp = -Math.sqrt(((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 B_m <= 1.05e+18: tmp = -math.sqrt((-F / C)) else: tmp = -math.sqrt(((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 (B_m <= 1.05e+18) tmp = Float64(-sqrt(Float64(Float64(-F) / C))); else tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / Float64(-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 (B_m <= 1.05e+18)
tmp = -sqrt((-F / C));
else
tmp = -sqrt(((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[B$95$m, 1.05e+18], (-N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(F * 2.0), $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}\;B\_m \leq 1.05 \cdot 10^{+18}:\\
\;\;\;\;-\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{-B\_m}}\\
\end{array}
\end{array}
if B < 1.05e18Initial program 21.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites34.1%
Applied rewrites34.2%
Taylor expanded in A around -inf
Applied rewrites15.7%
if 1.05e18 < B Initial program 17.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites27.3%
Applied rewrites27.4%
Applied rewrites27.4%
Taylor expanded in B around inf
Applied rewrites43.1%
Final simplification22.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.05e+18) (- (sqrt (/ (- F) C))) (- (sqrt (* (/ F B_m) -2.0)))))
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 <= 1.05e+18) {
tmp = -sqrt((-F / C));
} else {
tmp = -sqrt(((F / B_m) * -2.0));
}
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 <= 1.05d+18) then
tmp = -sqrt((-f / c))
else
tmp = -sqrt(((f / b_m) * (-2.0d0)))
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 <= 1.05e+18) {
tmp = -Math.sqrt((-F / C));
} else {
tmp = -Math.sqrt(((F / B_m) * -2.0));
}
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 <= 1.05e+18: tmp = -math.sqrt((-F / C)) else: tmp = -math.sqrt(((F / B_m) * -2.0)) 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 <= 1.05e+18) tmp = Float64(-sqrt(Float64(Float64(-F) / C))); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * -2.0))); 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 <= 1.05e+18)
tmp = -sqrt((-F / C));
else
tmp = -sqrt(((F / B_m) * -2.0));
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, 1.05e+18], (-N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * -2.0), $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 1.05 \cdot 10^{+18}:\\
\;\;\;\;-\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot -2}\\
\end{array}
\end{array}
if B < 1.05e18Initial program 21.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites34.1%
Applied rewrites34.2%
Taylor expanded in A around -inf
Applied rewrites15.7%
if 1.05e18 < B Initial program 17.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites27.3%
Applied rewrites27.4%
Taylor expanded in B around inf
Applied rewrites43.1%
Final simplification22.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (- F) C))))
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 / C));
}
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 / c))
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 / C));
}
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 / C))
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(-F) / C))) 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 / C));
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) / C), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{-F}{C}}
\end{array}
Initial program 20.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites32.5%
Applied rewrites32.6%
Taylor expanded in A around -inf
Applied rewrites15.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (- F) A))))
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 / A));
}
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 / a))
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 / A));
}
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 / A))
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(-F) / A))) 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 / A));
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) / A), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{-F}{A}}
\end{array}
Initial program 20.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites32.5%
Applied rewrites32.6%
Taylor expanded in B around 0
Applied rewrites17.4%
herbie shell --seed 2024331
(FPCore (A B C F)
:name "ABCF->ab-angle b"
: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))))