
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (- t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 -5e-217)
(*
(* (sqrt (* 2.0 t_0)) (sqrt F))
(/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) t_1))
(if (<= t_3 4e+31)
(/ (sqrt (* (* F t_0) (- (* 4.0 C) (/ (pow B_m 2.0) A)))) t_1)
(if (<= t_3 INFINITY)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* -4.0 (* A C))))))
(* (sqrt C) (sqrt 2.0)))
t_1)
(/ (sqrt (* 2.0 F)) (- (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = -t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -5e-217) {
tmp = (sqrt((2.0 * t_0)) * sqrt(F)) * (sqrt(((A + C) + hypot((A - C), B_m))) / t_1);
} else if (t_3 <= 4e+31) {
tmp = sqrt(((F * t_0) * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, (-4.0 * (A * C)))))) * (sqrt(C) * sqrt(2.0))) / t_1;
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(-t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= -5e-217) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(F)) * Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / t_1)); elseif (t_3 <= 4e+31) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(Float64(4.0 * C) - Float64((B_m ^ 2.0) / A)))) / t_1); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * Float64(sqrt(C) * sqrt(2.0))) / t_1); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -5e-217], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 4e+31], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(N[(4.0 * C), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := -t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-217}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq 4 \cdot 10^{+31}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C - \frac{{B\_m}^{2}}{A}\right)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \left(\sqrt{C} \cdot \sqrt{2}\right)}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-217Initial program 48.2%
Simplified55.1%
associate-*r*55.1%
associate-+r+54.2%
hypot-undefine48.2%
unpow248.2%
unpow248.2%
+-commutative48.2%
sqrt-prod54.0%
*-commutative54.0%
associate-*r*54.0%
associate-+l+54.0%
Applied egg-rr67.0%
associate-/l*67.0%
associate-*l*67.0%
associate-*r*67.0%
associate-+r+65.9%
Applied egg-rr65.9%
pow1/265.9%
*-commutative65.9%
metadata-eval65.9%
unpow-prod-down80.9%
metadata-eval80.9%
pow1/280.9%
metadata-eval80.9%
pow1/280.9%
Applied egg-rr80.9%
if -5.0000000000000002e-217 < (/.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))) < 3.9999999999999999e31Initial program 14.1%
Simplified16.8%
Taylor expanded in A around -inf 39.5%
if 3.9999999999999999e31 < (/.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 24.1%
Simplified48.3%
associate-*r*48.3%
associate-+r+48.3%
hypot-undefine24.1%
unpow224.1%
unpow224.1%
+-commutative24.1%
sqrt-prod30.9%
*-commutative30.9%
associate-*r*30.9%
associate-+l+30.9%
Applied egg-rr75.2%
Taylor expanded in A around -inf 35.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf 17.8%
mul-1-neg17.8%
*-commutative17.8%
Simplified17.8%
*-commutative17.8%
pow1/217.9%
pow1/217.9%
pow-prod-down18.0%
Applied egg-rr18.0%
unpow1/217.8%
Simplified17.8%
*-un-lft-identity17.8%
associate-*l/17.8%
Applied egg-rr17.8%
*-lft-identity17.8%
associate-/l*17.8%
Simplified17.8%
associate-*r/17.8%
sqrt-div26.4%
Applied egg-rr26.4%
Final simplification47.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 3.1e-77)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) (- t_0))
(if (<= B_m 8.5e-20)
(/
(sqrt (* F (* 2.0 t_0)))
(/ t_0 (- (sqrt (+ (+ A C) (hypot (- A C) B_m))))))
(if (<= B_m 7.5e+129)
(*
(sqrt 2.0)
(-
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 3.1e-77) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / -t_0;
} else if (B_m <= 8.5e-20) {
tmp = sqrt((F * (2.0 * t_0))) / (t_0 / -sqrt(((A + C) + hypot((A - C), B_m))));
} else if (B_m <= 7.5e+129) {
tmp = sqrt(2.0) * -sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 3.1e-77) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / Float64(-t_0)); elseif (B_m <= 8.5e-20) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_0))) / Float64(t_0 / Float64(-sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m)))))); elseif (B_m <= 7.5e+129) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 3.1e-77], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 8.5e-20], N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 / (-N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 7.5e+129], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 3.1 \cdot 10^{-77}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{-20}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(2 \cdot t\_0\right)}}{\frac{t\_0}{-\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}}\\
\mathbf{elif}\;B\_m \leq 7.5 \cdot 10^{+129}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 3.10000000000000008e-77Initial program 21.3%
Simplified28.7%
Taylor expanded in A around -inf 18.9%
*-commutative18.9%
Simplified18.9%
*-un-lft-identity18.9%
associate-*l*18.9%
Applied egg-rr18.9%
*-lft-identity18.9%
Simplified18.9%
if 3.10000000000000008e-77 < B < 8.5000000000000005e-20Initial program 47.3%
Simplified48.4%
associate-*r*48.4%
associate-+r+47.4%
hypot-undefine47.3%
unpow247.3%
unpow247.3%
+-commutative47.3%
sqrt-prod47.2%
*-commutative47.2%
associate-*r*47.2%
associate-+l+47.1%
Applied egg-rr53.0%
associate-/l*53.0%
associate-*l*53.0%
associate-*r*53.0%
associate-+r+52.9%
Applied egg-rr52.9%
clear-num52.9%
inv-pow52.9%
associate-+l+52.9%
Applied egg-rr52.9%
unpow-152.9%
Simplified52.9%
un-div-inv53.0%
frac-2neg53.0%
*-commutative53.0%
add-sqr-sqrt6.1%
sqrt-unprod1.1%
sqr-neg1.1%
sqrt-unprod1.0%
add-sqr-sqrt1.0%
Applied egg-rr52.9%
if 8.5000000000000005e-20 < B < 7.4999999999999998e129Initial program 20.6%
Taylor expanded in F around 0 23.9%
Simplified42.9%
if 7.4999999999999998e129 < B Initial program 7.5%
Taylor expanded in B around inf 42.5%
mul-1-neg42.5%
*-commutative42.5%
Simplified42.5%
*-commutative42.5%
pow1/242.5%
pow1/242.5%
pow-prod-down42.7%
Applied egg-rr42.7%
unpow1/242.7%
Simplified42.7%
*-un-lft-identity42.7%
associate-*l/42.7%
Applied egg-rr42.7%
*-lft-identity42.7%
associate-/l*42.6%
Simplified42.6%
associate-*r/42.7%
sqrt-div70.6%
Applied egg-rr70.6%
Final simplification31.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))) (t_1 (- t_0)))
(if (<= B_m 4e-77)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) t_1)
(if (<= B_m 7e-22)
(*
(/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) t_1)
(sqrt (* F (* 2.0 t_0))))
(if (<= B_m 5.2e+129)
(*
(sqrt 2.0)
(-
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = -t_0;
double tmp;
if (B_m <= 4e-77) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / t_1;
} else if (B_m <= 7e-22) {
tmp = (sqrt(((A + C) + hypot((A - C), B_m))) / t_1) * sqrt((F * (2.0 * t_0)));
} else if (B_m <= 5.2e+129) {
tmp = sqrt(2.0) * -sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(-t_0) tmp = 0.0 if (B_m <= 4e-77) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / t_1); elseif (B_m <= 7e-22) tmp = Float64(Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / t_1) * sqrt(Float64(F * Float64(2.0 * t_0)))); elseif (B_m <= 5.2e+129) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[B$95$m, 4e-77], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 7e-22], N[(N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision] * N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.2e+129], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := -t\_0\\
\mathbf{if}\;B\_m \leq 4 \cdot 10^{-77}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{-22}:\\
\;\;\;\;\frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{t\_1} \cdot \sqrt{F \cdot \left(2 \cdot t\_0\right)}\\
\mathbf{elif}\;B\_m \leq 5.2 \cdot 10^{+129}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 3.9999999999999997e-77Initial program 21.3%
Simplified28.7%
Taylor expanded in A around -inf 18.9%
*-commutative18.9%
Simplified18.9%
*-un-lft-identity18.9%
associate-*l*18.9%
Applied egg-rr18.9%
*-lft-identity18.9%
Simplified18.9%
if 3.9999999999999997e-77 < B < 7.00000000000000011e-22Initial program 47.3%
Simplified48.4%
associate-*r*48.4%
associate-+r+47.4%
hypot-undefine47.3%
unpow247.3%
unpow247.3%
+-commutative47.3%
sqrt-prod47.2%
*-commutative47.2%
associate-*r*47.2%
associate-+l+47.1%
Applied egg-rr53.0%
associate-/l*53.0%
associate-*l*53.0%
associate-*r*53.0%
associate-+r+52.9%
Applied egg-rr52.9%
if 7.00000000000000011e-22 < B < 5.20000000000000024e129Initial program 20.6%
Taylor expanded in F around 0 23.9%
Simplified42.9%
if 5.20000000000000024e129 < B Initial program 7.5%
Taylor expanded in B around inf 42.5%
mul-1-neg42.5%
*-commutative42.5%
Simplified42.5%
*-commutative42.5%
pow1/242.5%
pow1/242.5%
pow-prod-down42.7%
Applied egg-rr42.7%
unpow1/242.7%
Simplified42.7%
*-un-lft-identity42.7%
associate-*l/42.7%
Applied egg-rr42.7%
*-lft-identity42.7%
associate-/l*42.6%
Simplified42.6%
associate-*r/42.7%
sqrt-div70.6%
Applied egg-rr70.6%
Final simplification31.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.12e-74)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) (- t_0))
(if (<= B_m 7.4e+129)
(*
(sqrt 2.0)
(-
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.12e-74) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / -t_0;
} else if (B_m <= 7.4e+129) {
tmp = sqrt(2.0) * -sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 1.12e-74) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / Float64(-t_0)); elseif (B_m <= 7.4e+129) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.12e-74], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 7.4e+129], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 1.12 \cdot 10^{-74}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 7.4 \cdot 10^{+129}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.11999999999999999e-74Initial program 21.8%
Simplified29.0%
Taylor expanded in A around -inf 19.1%
*-commutative19.1%
Simplified19.1%
*-un-lft-identity19.1%
associate-*l*19.1%
Applied egg-rr19.1%
*-lft-identity19.1%
Simplified19.1%
if 1.11999999999999999e-74 < B < 7.39999999999999956e129Initial program 29.1%
Taylor expanded in F around 0 26.4%
Simplified40.1%
if 7.39999999999999956e129 < B Initial program 7.5%
Taylor expanded in B around inf 42.5%
mul-1-neg42.5%
*-commutative42.5%
Simplified42.5%
*-commutative42.5%
pow1/242.5%
pow1/242.5%
pow-prod-down42.7%
Applied egg-rr42.7%
unpow1/242.7%
Simplified42.7%
*-un-lft-identity42.7%
associate-*l/42.7%
Applied egg-rr42.7%
*-lft-identity42.7%
associate-/l*42.6%
Simplified42.6%
associate-*r/42.7%
sqrt-div70.6%
Applied egg-rr70.6%
Final simplification30.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e-120)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(if (<= (pow B_m 2.0) 5e+189)
(* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m)))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e-120) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+189) {
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-120) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+189) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-120], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+189], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-120}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+189}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999996e-120Initial program 21.1%
Simplified31.5%
Taylor expanded in A around -inf 25.7%
*-commutative25.7%
Simplified25.7%
if 1.99999999999999996e-120 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e189Initial program 39.8%
Taylor expanded in A around 0 14.1%
mul-1-neg14.1%
unpow214.1%
unpow214.1%
hypot-define15.8%
Simplified15.8%
if 5.0000000000000004e189 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.3%
Taylor expanded in B around inf 25.0%
mul-1-neg25.0%
*-commutative25.0%
Simplified25.0%
*-commutative25.0%
pow1/225.0%
pow1/225.0%
pow-prod-down25.1%
Applied egg-rr25.1%
unpow1/225.1%
Simplified25.1%
*-un-lft-identity25.1%
associate-*l/25.1%
Applied egg-rr25.1%
*-lft-identity25.1%
associate-/l*25.1%
Simplified25.1%
associate-*r/25.1%
sqrt-div38.3%
Applied egg-rr38.3%
Final simplification27.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 2e-134)
(/
(sqrt (* (* F (fma B_m B_m (* A (* C -4.0)))) (* 4.0 C)))
(* (* 4.0 A) C))
(if (<= (pow B_m 2.0) 5e+189)
(* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m)))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-134) {
tmp = sqrt(((F * fma(B_m, B_m, (A * (C * -4.0)))) * (4.0 * C))) / ((4.0 * A) * C);
} else if (pow(B_m, 2.0) <= 5e+189) {
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-134) tmp = Float64(sqrt(Float64(Float64(F * fma(B_m, B_m, Float64(A * Float64(C * -4.0)))) * Float64(4.0 * C))) / Float64(Float64(4.0 * A) * C)); elseif ((B_m ^ 2.0) <= 5e+189) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-134], N[(N[Sqrt[N[(N[(F * N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+189], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-134}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\right) \cdot \left(4 \cdot C\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+189}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000008e-134Initial program 20.6%
Simplified31.0%
Taylor expanded in A around -inf 26.0%
*-commutative26.0%
Simplified26.0%
Taylor expanded in B around 0 25.9%
associate-*r*25.9%
Simplified25.9%
if 2.00000000000000008e-134 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e189Initial program 40.0%
Taylor expanded in A around 0 13.7%
mul-1-neg13.7%
unpow213.7%
unpow213.7%
hypot-define15.4%
Simplified15.4%
if 5.0000000000000004e189 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.3%
Taylor expanded in B around inf 25.0%
mul-1-neg25.0%
*-commutative25.0%
Simplified25.0%
*-commutative25.0%
pow1/225.0%
pow1/225.0%
pow-prod-down25.1%
Applied egg-rr25.1%
unpow1/225.1%
Simplified25.1%
*-un-lft-identity25.1%
associate-*l/25.1%
Applied egg-rr25.1%
*-lft-identity25.1%
associate-/l*25.1%
Simplified25.1%
associate-*r/25.1%
sqrt-div38.3%
Applied egg-rr38.3%
Final simplification26.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 (fma B_m B_m (* A (* C -4.0)))) (t_1 (- t_0)))
(if (<= B_m 4.8e-77)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) t_1)
(if (<= B_m 1.22e+95)
(/ (sqrt (* (* F t_0) (* 2.0 (+ A (+ C (hypot B_m (- A C))))))) t_1)
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = -t_0;
double tmp;
if (B_m <= 4.8e-77) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / t_1;
} else if (B_m <= 1.22e+95) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (C + hypot(B_m, (A - C))))))) / t_1;
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(-t_0) tmp = 0.0 if (B_m <= 4.8e-77) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / t_1); elseif (B_m <= 1.22e+95) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))))) / t_1); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[B$95$m, 4.8e-77], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.22e+95], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := -t\_0\\
\mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-77}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.22 \cdot 10^{+95}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 4.7999999999999998e-77Initial program 21.3%
Simplified28.7%
Taylor expanded in A around -inf 18.9%
*-commutative18.9%
Simplified18.9%
*-un-lft-identity18.9%
associate-*l*18.9%
Applied egg-rr18.9%
*-lft-identity18.9%
Simplified18.9%
if 4.7999999999999998e-77 < B < 1.22000000000000007e95Initial program 34.2%
Simplified39.7%
if 1.22000000000000007e95 < B Initial program 6.9%
Taylor expanded in B around inf 41.5%
mul-1-neg41.5%
*-commutative41.5%
Simplified41.5%
*-commutative41.5%
pow1/241.5%
pow1/241.5%
pow-prod-down41.7%
Applied egg-rr41.7%
unpow1/241.7%
Simplified41.7%
*-un-lft-identity41.7%
associate-*l/41.7%
Applied egg-rr41.7%
*-lft-identity41.7%
associate-/l*41.7%
Simplified41.7%
associate-*r/41.7%
sqrt-div66.5%
Applied egg-rr66.5%
Final simplification30.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 5e-63)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) (- t_0))
(if (<= B_m 1e+96)
(/
(* B_m (* (sqrt 2.0) (sqrt (* F (+ C (hypot B_m C))))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 5e-63) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / -t_0;
} else if (B_m <= 1e+96) {
tmp = (B_m * (sqrt(2.0) * sqrt((F * (C + hypot(B_m, C)))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 5e-63) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / Float64(-t_0)); elseif (B_m <= 1e+96) tmp = Float64(Float64(B_m * Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5e-63], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 1e+96], N[(N[(B$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 5 \cdot 10^{-63}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 10^{+96}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 5.0000000000000002e-63Initial program 22.1%
Simplified29.3%
Taylor expanded in A around -inf 18.9%
*-commutative18.9%
Simplified18.9%
*-un-lft-identity18.9%
associate-*l*18.9%
Applied egg-rr18.9%
*-lft-identity18.9%
Simplified18.9%
if 5.0000000000000002e-63 < B < 1.00000000000000005e96Initial program 30.9%
Taylor expanded in A around 0 25.2%
associate-*l*25.3%
unpow225.3%
unpow225.3%
hypot-define28.9%
Simplified28.9%
if 1.00000000000000005e96 < B Initial program 7.1%
Taylor expanded in B around inf 42.3%
mul-1-neg42.3%
*-commutative42.3%
Simplified42.3%
*-commutative42.3%
pow1/242.3%
pow1/242.3%
pow-prod-down42.5%
Applied egg-rr42.5%
unpow1/242.5%
Simplified42.5%
*-un-lft-identity42.5%
associate-*l/42.5%
Applied egg-rr42.5%
*-lft-identity42.5%
associate-/l*42.4%
Simplified42.4%
associate-*r/42.5%
sqrt-div67.8%
Applied egg-rr67.8%
Final simplification28.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 6.7e-46)
(/ (sqrt (* t_0 (* F (* 4.0 C)))) (- t_0))
(if (<= B_m 8e+94)
(* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m)))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 6.7e-46) {
tmp = sqrt((t_0 * (F * (4.0 * C)))) / -t_0;
} else if (B_m <= 8e+94) {
tmp = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 6.7e-46) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(4.0 * C)))) / Float64(-t_0)); elseif (B_m <= 8e+94) tmp = Float64(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 6.7e-46], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 8e+94], N[(N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 6.7 \cdot 10^{-46}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(F \cdot \left(4 \cdot C\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{+94}:\\
\;\;\;\;\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 6.7000000000000001e-46Initial program 22.3%
Simplified29.5%
Taylor expanded in A around -inf 18.6%
*-commutative18.6%
Simplified18.6%
*-un-lft-identity18.6%
associate-*l*18.6%
Applied egg-rr18.6%
*-lft-identity18.6%
Simplified18.6%
if 6.7000000000000001e-46 < B < 8.0000000000000002e94Initial program 31.6%
Taylor expanded in A around 0 25.3%
mul-1-neg25.3%
unpow225.3%
unpow225.3%
hypot-define28.9%
Simplified28.9%
if 8.0000000000000002e94 < B Initial program 6.9%
Taylor expanded in B around inf 41.5%
mul-1-neg41.5%
*-commutative41.5%
Simplified41.5%
*-commutative41.5%
pow1/241.5%
pow1/241.5%
pow-prod-down41.7%
Applied egg-rr41.7%
unpow1/241.7%
Simplified41.7%
*-un-lft-identity41.7%
associate-*l/41.7%
Applied egg-rr41.7%
*-lft-identity41.7%
associate-/l*41.7%
Simplified41.7%
associate-*r/41.7%
sqrt-div66.5%
Applied egg-rr66.5%
Final simplification28.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 (<= (pow B_m 2.0) 2e-120)
(/
(sqrt (* (* F (fma B_m B_m (* A (* C -4.0)))) (* 4.0 C)))
(* (* 4.0 A) C))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-120) {
tmp = sqrt(((F * fma(B_m, B_m, (A * (C * -4.0)))) * (4.0 * C))) / ((4.0 * A) * C);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-120) tmp = Float64(sqrt(Float64(Float64(F * fma(B_m, B_m, Float64(A * Float64(C * -4.0)))) * Float64(4.0 * C))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-120], N[(N[Sqrt[N[(N[(F * N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-120}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\right) \cdot \left(4 \cdot C\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999996e-120Initial program 21.1%
Simplified31.5%
Taylor expanded in A around -inf 25.7%
*-commutative25.7%
Simplified25.7%
Taylor expanded in B around 0 25.5%
associate-*r*25.5%
Simplified25.5%
if 1.99999999999999996e-120 < (pow.f64 B #s(literal 2 binary64)) Initial program 20.4%
Taylor expanded in B around inf 18.5%
mul-1-neg18.5%
*-commutative18.5%
Simplified18.5%
*-commutative18.5%
pow1/218.5%
pow1/218.5%
pow-prod-down18.6%
Applied egg-rr18.6%
unpow1/218.6%
Simplified18.6%
*-un-lft-identity18.6%
associate-*l/18.5%
Applied egg-rr18.5%
*-lft-identity18.5%
associate-/l*18.5%
Simplified18.5%
associate-*r/18.5%
sqrt-div26.1%
Applied egg-rr26.1%
Final simplification25.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 5e+122) (* -2.0 (sqrt (/ (* C F) (+ (pow B_m 2.0) (* -4.0 (* A C)))))) (* (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) {
double tmp;
if (pow(B_m, 2.0) <= 5e+122) {
tmp = -2.0 * sqrt(((C * F) / (pow(B_m, 2.0) + (-4.0 * (A * C)))));
} else {
tmp = sqrt(F) * -sqrt((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 ** 2.0d0) <= 5d+122) then
tmp = (-2.0d0) * sqrt(((c * f) / ((b_m ** 2.0d0) + ((-4.0d0) * (a * c)))))
else
tmp = sqrt(f) * -sqrt((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 (Math.pow(B_m, 2.0) <= 5e+122) {
tmp = -2.0 * Math.sqrt(((C * F) / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))));
} else {
tmp = Math.sqrt(F) * -Math.sqrt((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 math.pow(B_m, 2.0) <= 5e+122: tmp = -2.0 * math.sqrt(((C * F) / (math.pow(B_m, 2.0) + (-4.0 * (A * C))))) else: tmp = math.sqrt(F) * -math.sqrt((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 ^ 2.0) <= 5e+122) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))))); else tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e+122)
tmp = -2.0 * sqrt(((C * F) / ((B_m ^ 2.0) + (-4.0 * (A * C)))));
else
tmp = sqrt(F) * -sqrt((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[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+122], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+122}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999989e122Initial program 28.0%
Simplified36.9%
Taylor expanded in A around -inf 22.1%
*-commutative22.1%
Simplified22.1%
Taylor expanded in F around 0 12.3%
if 4.99999999999999989e122 < (pow.f64 B #s(literal 2 binary64)) Initial program 7.4%
Taylor expanded in B around inf 23.4%
mul-1-neg23.4%
*-commutative23.4%
Simplified23.4%
*-commutative23.4%
pow1/223.4%
pow1/223.4%
pow-prod-down23.5%
Applied egg-rr23.5%
unpow1/223.5%
Simplified23.5%
*-un-lft-identity23.5%
associate-*l/23.5%
Applied egg-rr23.5%
*-lft-identity23.5%
associate-/l*23.5%
Simplified23.5%
*-commutative23.5%
sqrt-prod34.9%
Applied egg-rr34.9%
Final simplification20.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 (<= C 5.6e+41) (- (sqrt (* 2.0 (fabs (/ F B_m))))) (* -2.0 (* (/ 1.0 B_m) (sqrt (* C F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 5.6e+41) {
tmp = -sqrt((2.0 * fabs((F / B_m))));
} else {
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 5.6d+41) then
tmp = -sqrt((2.0d0 * abs((f / b_m))))
else
tmp = (-2.0d0) * ((1.0d0 / b_m) * sqrt((c * f)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 5.6e+41) {
tmp = -Math.sqrt((2.0 * Math.abs((F / B_m))));
} else {
tmp = -2.0 * ((1.0 / B_m) * Math.sqrt((C * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 5.6e+41: tmp = -math.sqrt((2.0 * math.fabs((F / B_m)))) else: tmp = -2.0 * ((1.0 / B_m) * math.sqrt((C * F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 5.6e+41) tmp = Float64(-sqrt(Float64(2.0 * abs(Float64(F / B_m))))); else tmp = Float64(-2.0 * Float64(Float64(1.0 / B_m) * sqrt(Float64(C * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 5.6e+41)
tmp = -sqrt((2.0 * abs((F / B_m))));
else
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 5.6e+41], (-N[Sqrt[N[(2.0 * N[Abs[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[(1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $MachinePrecision]], $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}\;C \leq 5.6 \cdot 10^{+41}:\\
\;\;\;\;-\sqrt{2 \cdot \left|\frac{F}{B\_m}\right|}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(\frac{1}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\end{array}
\end{array}
if C < 5.5999999999999999e41Initial program 20.7%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
*-commutative14.2%
Simplified14.2%
*-commutative14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow1/214.3%
Simplified14.3%
add-cube-cbrt14.2%
pow314.2%
Applied egg-rr14.2%
rem-cube-cbrt14.3%
add-sqr-sqrt14.3%
sqrt-unprod15.7%
pow215.7%
Applied egg-rr15.7%
unpow215.7%
rem-sqrt-square25.5%
Simplified25.5%
if 5.5999999999999999e41 < C Initial program 20.9%
Simplified32.2%
Taylor expanded in A around -inf 29.9%
*-commutative29.9%
Simplified29.9%
Taylor expanded in B around inf 8.6%
Final simplification22.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 2.8e+42) (- (sqrt (fabs (* F (/ 2.0 B_m))))) (* -2.0 (* (/ 1.0 B_m) (sqrt (* C F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.8e+42) {
tmp = -sqrt(fabs((F * (2.0 / B_m))));
} else {
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.8d+42) then
tmp = -sqrt(abs((f * (2.0d0 / b_m))))
else
tmp = (-2.0d0) * ((1.0d0 / b_m) * sqrt((c * f)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.8e+42) {
tmp = -Math.sqrt(Math.abs((F * (2.0 / B_m))));
} else {
tmp = -2.0 * ((1.0 / B_m) * Math.sqrt((C * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.8e+42: tmp = -math.sqrt(math.fabs((F * (2.0 / B_m)))) else: tmp = -2.0 * ((1.0 / B_m) * math.sqrt((C * F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.8e+42) tmp = Float64(-sqrt(abs(Float64(F * Float64(2.0 / B_m))))); else tmp = Float64(-2.0 * Float64(Float64(1.0 / B_m) * sqrt(Float64(C * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.8e+42)
tmp = -sqrt(abs((F * (2.0 / B_m))));
else
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.8e+42], (-N[Sqrt[N[Abs[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[(1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $MachinePrecision]], $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}\;C \leq 2.8 \cdot 10^{+42}:\\
\;\;\;\;-\sqrt{\left|F \cdot \frac{2}{B\_m}\right|}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(\frac{1}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\end{array}
\end{array}
if C < 2.7999999999999999e42Initial program 20.7%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
*-commutative14.2%
Simplified14.2%
*-commutative14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow1/214.3%
Simplified14.3%
*-un-lft-identity14.3%
associate-*l/14.3%
Applied egg-rr14.3%
*-lft-identity14.3%
associate-/l*14.3%
Simplified14.3%
add-sqr-sqrt14.3%
pow1/214.3%
metadata-eval14.3%
pow1/214.4%
metadata-eval14.4%
pow-prod-down15.7%
pow215.7%
metadata-eval15.7%
Applied egg-rr15.7%
unpow1/215.7%
unpow215.7%
rem-sqrt-square25.5%
Simplified25.5%
if 2.7999999999999999e42 < C Initial program 20.9%
Simplified32.2%
Taylor expanded in A around -inf 29.9%
*-commutative29.9%
Simplified29.9%
Taylor expanded in B around inf 8.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt F) (- (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(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 11.9%
mul-1-neg11.9%
*-commutative11.9%
Simplified11.9%
*-commutative11.9%
pow1/212.0%
pow1/212.0%
pow-prod-down12.1%
Applied egg-rr12.1%
unpow1/211.9%
Simplified11.9%
*-un-lft-identity11.9%
associate-*l/11.9%
Applied egg-rr11.9%
*-lft-identity11.9%
associate-/l*11.9%
Simplified11.9%
*-commutative11.9%
sqrt-prod16.5%
Applied egg-rr16.5%
Final simplification16.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 (<= C 2.45e+42) (- (pow (/ (* 2.0 F) B_m) 0.5)) (* -2.0 (* (/ 1.0 B_m) (sqrt (* C F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.45e+42) {
tmp = -pow(((2.0 * F) / B_m), 0.5);
} else {
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.45d+42) then
tmp = -(((2.0d0 * f) / b_m) ** 0.5d0)
else
tmp = (-2.0d0) * ((1.0d0 / b_m) * sqrt((c * f)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.45e+42) {
tmp = -Math.pow(((2.0 * F) / B_m), 0.5);
} else {
tmp = -2.0 * ((1.0 / B_m) * Math.sqrt((C * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.45e+42: tmp = -math.pow(((2.0 * F) / B_m), 0.5) else: tmp = -2.0 * ((1.0 / B_m) * math.sqrt((C * F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.45e+42) tmp = Float64(-(Float64(Float64(2.0 * F) / B_m) ^ 0.5)); else tmp = Float64(-2.0 * Float64(Float64(1.0 / B_m) * sqrt(Float64(C * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.45e+42)
tmp = -(((2.0 * F) / B_m) ^ 0.5);
else
tmp = -2.0 * ((1.0 / B_m) * sqrt((C * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.45e+42], (-N[Power[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision], 0.5], $MachinePrecision]), N[(-2.0 * N[(N[(1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $MachinePrecision]], $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}\;C \leq 2.45 \cdot 10^{+42}:\\
\;\;\;\;-{\left(\frac{2 \cdot F}{B\_m}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(\frac{1}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\end{array}
\end{array}
if C < 2.4500000000000001e42Initial program 20.7%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
*-commutative14.2%
Simplified14.2%
*-commutative14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow1/214.3%
Simplified14.3%
pow1/214.4%
associate-*l/14.4%
Applied egg-rr14.4%
if 2.4500000000000001e42 < C Initial program 20.9%
Simplified32.2%
Taylor expanded in A around -inf 29.9%
*-commutative29.9%
Simplified29.9%
Taylor expanded in B around inf 8.6%
Final simplification13.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 (- (pow (* 2.0 (/ F 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 -pow((2.0 * (F / 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 = -((2.0d0 * (f / 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.pow((2.0 * (F / 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.pow((2.0 * (F / 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(2.0 * Float64(F / 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 = -((2.0 * (F / 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[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 11.9%
mul-1-neg11.9%
*-commutative11.9%
Simplified11.9%
*-commutative11.9%
pow1/212.0%
pow1/212.0%
pow-prod-down12.1%
Applied egg-rr12.1%
Final simplification12.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 (* 2.0 (/ F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((2.0d0 * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 11.9%
mul-1-neg11.9%
*-commutative11.9%
Simplified11.9%
*-commutative11.9%
pow1/212.0%
pow1/212.0%
pow-prod-down12.1%
Applied egg-rr12.1%
unpow1/211.9%
Simplified11.9%
Final simplification11.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 20.7%
Taylor expanded in B around inf 11.9%
mul-1-neg11.9%
*-commutative11.9%
Simplified11.9%
*-commutative11.9%
pow1/212.0%
pow1/212.0%
pow-prod-down12.1%
Applied egg-rr12.1%
unpow1/211.9%
Simplified11.9%
*-un-lft-identity11.9%
associate-*l/11.9%
Applied egg-rr11.9%
*-lft-identity11.9%
associate-/l*11.9%
Simplified11.9%
herbie shell --seed 2024119
(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))))