
(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 19 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 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 (- INFINITY))
(*
(sqrt
(*
F
(/ (+ (+ A C) (hypot B_m (- A C))) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_2 -1e-179)
t_2
(if (<= t_2 INFINITY)
(/
(*
(sqrt (* 2.0 (* F t_0)))
(sqrt (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(- t_0))
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (exp (* (log 2.0) 0.5)) (- 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 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt((F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_2 <= -1e-179) {
tmp = t_2;
} else if (t_2 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * (F * t_0))) * sqrt(((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / -t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (exp((log(2.0) * 0.5)) / -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(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_2 <= -1e-179) tmp = t_2; elseif (t_2 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(exp(Float64(log(2.0) * 0.5)) / Float64(-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 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $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$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -1e-179], t$95$2, If[LessEqual[t$95$2, Infinity], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(N[Log[2.0], $MachinePrecision] * 0.5), $MachinePrecision]], $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-179}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{e^{\log 2 \cdot 0.5}}{-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))) < -inf.0Initial program 3.2%
Taylor expanded in F around 0 23.6%
Simplified66.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))) < -1e-179Initial program 99.1%
if -1e-179 < (/.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 18.7%
Simplified35.6%
associate-*r*35.6%
associate-+r+34.2%
hypot-undefine18.7%
unpow218.7%
unpow218.7%
+-commutative18.7%
sqrt-prod21.7%
*-commutative21.7%
associate-+l+23.4%
Applied egg-rr50.1%
Taylor expanded in A around -inf 42.1%
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 A around 0 2.1%
mul-1-neg2.1%
*-commutative2.1%
*-commutative2.1%
Simplified2.1%
sqrt-prod2.0%
+-commutative2.0%
unpow22.0%
unpow22.0%
hypot-define25.9%
Applied egg-rr25.9%
pow1/225.9%
pow-to-exp25.9%
Applied egg-rr25.9%
Final simplification48.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-303)
(/
(sqrt (* (* A -16.0) (* F (pow C 2.0))))
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2000000000.0)
(* (sqrt (/ (* C F) (fma -4.0 (* A C) (pow B_m 2.0)))) (- 2.0))
(if (<= (pow B_m 2.0) 5e+283)
(/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt 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-303) {
tmp = sqrt(((A * -16.0) * (F * pow(C, 2.0)))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (pow(B_m, 2.0) <= 2000000000.0) {
tmp = sqrt(((C * F) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * -2.0;
} else if (pow(B_m, 2.0) <= 5e+283) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(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-303) tmp = Float64(sqrt(Float64(Float64(A * -16.0) * Float64(F * (C ^ 2.0)))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif ((B_m ^ 2.0) <= 2000000000.0) tmp = Float64(sqrt(Float64(Float64(C * F) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-2.0)); elseif ((B_m ^ 2.0) <= 5e+283) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(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-303], N[(N[Sqrt[N[(N[(A * -16.0), $MachinePrecision] * N[(F * N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2000000000.0], N[(N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-2.0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+283], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[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 2 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -16\right) \cdot \left(F \cdot {C}^{2}\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2000000000:\\
\;\;\;\;\sqrt{\frac{C \cdot F}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-2\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+283}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999986e-303Initial program 23.5%
Simplified34.0%
Taylor expanded in B around 0 29.8%
associate-*r*29.8%
Simplified29.8%
Taylor expanded in A around -inf 19.9%
associate-*r*19.9%
Simplified19.9%
if 1.99999999999999986e-303 < (pow.f64 B #s(literal 2 binary64)) < 2e9Initial program 29.8%
Simplified43.0%
associate-*r*43.0%
associate-+r+41.5%
hypot-undefine29.8%
unpow229.8%
unpow229.8%
+-commutative29.8%
sqrt-prod34.6%
*-commutative34.6%
associate-+l+35.5%
Applied egg-rr48.9%
Taylor expanded in A around -inf 31.1%
Taylor expanded in F around 0 17.1%
mul-1-neg17.1%
*-commutative17.1%
unpow217.1%
rem-square-sqrt17.3%
*-commutative17.3%
fma-define17.3%
*-commutative17.3%
Simplified17.3%
if 2e9 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e283Initial program 22.4%
Taylor expanded in A around 0 17.2%
mul-1-neg17.2%
*-commutative17.2%
*-commutative17.2%
Simplified17.2%
neg-sub017.2%
associate-*r/17.2%
pow1/217.3%
*-commutative17.3%
pow1/217.3%
pow-prod-down17.4%
+-commutative17.4%
unpow217.4%
unpow217.4%
hypot-define17.9%
Applied egg-rr17.9%
neg-sub017.9%
distribute-neg-frac217.9%
unpow1/217.9%
Simplified17.9%
if 5.0000000000000004e283 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
Taylor expanded in A around 0 3.2%
mul-1-neg3.2%
*-commutative3.2%
*-commutative3.2%
Simplified3.2%
sqrt-prod3.3%
+-commutative3.3%
unpow23.3%
unpow23.3%
hypot-define39.4%
Applied egg-rr39.4%
Taylor expanded in C around 0 35.0%
Final simplification23.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 200000.0)
(/ (* (sqrt (* 2.0 (* F t_0))) (sqrt (* 2.0 C))) (- t_0))
(* (* (sqrt (+ C (hypot C B_m))) (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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 200000.0) {
tmp = (sqrt((2.0 * (F * t_0))) * sqrt((2.0 * C))) / -t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 200000.0) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(2.0 * C))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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], 200000.0], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 200000:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{2 \cdot C}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e5Initial program 26.8%
Simplified38.6%
associate-*r*38.6%
associate-+r+37.3%
hypot-undefine26.8%
unpow226.8%
unpow226.8%
+-commutative26.8%
sqrt-prod28.7%
*-commutative28.7%
associate-+l+29.4%
Applied egg-rr45.2%
Taylor expanded in A around -inf 28.0%
if 2e5 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.2%
Taylor expanded in A around 0 9.5%
mul-1-neg9.5%
*-commutative9.5%
*-commutative9.5%
Simplified9.5%
sqrt-prod9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-define30.9%
Applied egg-rr30.9%
Final simplification29.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 200000.0)
(* (sqrt (* F (* 2.0 t_0))) (/ (sqrt (* 2.0 C)) (- t_0)))
(* (* (sqrt (+ C (hypot C B_m))) (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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 200000.0) {
tmp = sqrt((F * (2.0 * t_0))) * (sqrt((2.0 * C)) / -t_0);
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 200000.0) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * Float64(sqrt(Float64(2.0 * C)) / Float64(-t_0))); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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], 200000.0], N[(N[Sqrt[N[(F * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 200000:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \frac{\sqrt{2 \cdot C}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e5Initial program 26.8%
Simplified38.6%
associate-*r*38.6%
associate-+r+37.3%
hypot-undefine26.8%
unpow226.8%
unpow226.8%
+-commutative26.8%
sqrt-prod28.7%
*-commutative28.7%
associate-+l+29.4%
Applied egg-rr45.2%
Taylor expanded in A around -inf 28.0%
associate-/l*28.0%
associate-*l*28.0%
*-commutative28.0%
Applied egg-rr28.0%
if 2e5 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.2%
Taylor expanded in A around 0 9.5%
mul-1-neg9.5%
*-commutative9.5%
*-commutative9.5%
Simplified9.5%
sqrt-prod9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-define30.9%
Applied egg-rr30.9%
Final simplification29.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 2000000000.0)
(* (sqrt (/ (* C F) (fma -4.0 (* A C) (pow B_m 2.0)))) (- 2.0))
(if (<= (pow B_m 2.0) 5e+283)
(/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt 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) <= 2000000000.0) {
tmp = sqrt(((C * F) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * -2.0;
} else if (pow(B_m, 2.0) <= 5e+283) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(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) <= 2000000000.0) tmp = Float64(sqrt(Float64(Float64(C * F) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-2.0)); elseif ((B_m ^ 2.0) <= 5e+283) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(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], 2000000000.0], N[(N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-2.0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+283], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[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 2000000000:\\
\;\;\;\;\sqrt{\frac{C \cdot F}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-2\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+283}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e9Initial program 26.5%
Simplified38.3%
associate-*r*38.3%
associate-+r+37.0%
hypot-undefine26.5%
unpow226.5%
unpow226.5%
+-commutative26.5%
sqrt-prod28.5%
*-commutative28.5%
associate-+l+29.2%
Applied egg-rr44.9%
Taylor expanded in A around -inf 27.8%
Taylor expanded in F around 0 14.0%
mul-1-neg14.0%
*-commutative14.0%
unpow214.0%
rem-square-sqrt14.1%
*-commutative14.1%
fma-define14.1%
*-commutative14.1%
Simplified14.1%
if 2e9 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e283Initial program 22.4%
Taylor expanded in A around 0 17.2%
mul-1-neg17.2%
*-commutative17.2%
*-commutative17.2%
Simplified17.2%
neg-sub017.2%
associate-*r/17.2%
pow1/217.3%
*-commutative17.3%
pow1/217.3%
pow-prod-down17.4%
+-commutative17.4%
unpow217.4%
unpow217.4%
hypot-define17.9%
Applied egg-rr17.9%
neg-sub017.9%
distribute-neg-frac217.9%
unpow1/217.9%
Simplified17.9%
if 5.0000000000000004e283 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
Taylor expanded in A around 0 3.2%
mul-1-neg3.2%
*-commutative3.2%
*-commutative3.2%
Simplified3.2%
sqrt-prod3.3%
+-commutative3.3%
unpow23.3%
unpow23.3%
hypot-define39.4%
Applied egg-rr39.4%
Taylor expanded in C around 0 35.0%
Final simplification20.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 200000.0)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(* (* (sqrt (+ C (hypot C B_m))) (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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 200000.0) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 200000.0) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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], 200000.0], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 200000:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e5Initial program 26.8%
Simplified38.6%
Taylor expanded in A around -inf 27.3%
*-commutative27.3%
Simplified27.3%
if 2e5 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.2%
Taylor expanded in A around 0 9.5%
mul-1-neg9.5%
*-commutative9.5%
*-commutative9.5%
Simplified9.5%
sqrt-prod9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-define30.9%
Applied egg-rr30.9%
Final simplification29.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 370.0)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(if (<= B_m 9.2e+141)
(/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt 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 <= 370.0) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else if (B_m <= 9.2e+141) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(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 <= 370.0) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); elseif (B_m <= 9.2e+141) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(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, 370.0], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 9.2e+141], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 370:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 9.2 \cdot 10^{+141}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 370Initial program 20.8%
Simplified29.0%
Taylor expanded in A around -inf 19.5%
*-commutative19.5%
Simplified19.5%
if 370 < B < 9.2000000000000006e141Initial program 24.0%
Taylor expanded in A around 0 35.7%
mul-1-neg35.7%
*-commutative35.7%
*-commutative35.7%
Simplified35.7%
neg-sub035.7%
associate-*r/35.8%
pow1/235.8%
*-commutative35.8%
pow1/235.8%
pow-prod-down36.0%
+-commutative36.0%
unpow236.0%
unpow236.0%
hypot-define36.5%
Applied egg-rr36.5%
neg-sub036.5%
distribute-neg-frac236.5%
unpow1/236.5%
Simplified36.5%
if 9.2000000000000006e141 < B Initial program 0.2%
Taylor expanded in A around 0 5.3%
mul-1-neg5.3%
*-commutative5.3%
*-commutative5.3%
Simplified5.3%
sqrt-prod5.6%
+-commutative5.6%
unpow25.6%
unpow25.6%
hypot-define76.9%
Applied egg-rr76.9%
Taylor expanded in C around 0 71.1%
Final simplification28.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3e-120)
(/
(sqrt (* (* -8.0 (* F (* A C))) (+ C (hypot B_m C))))
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 3700000.0)
(* (sqrt (/ (* C F) (fma -4.0 (* A C) (pow B_m 2.0)))) (- 2.0))
(if (<= B_m 3.4e+143)
(/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt 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 (B_m <= 3e-120) {
tmp = sqrt(((-8.0 * (F * (A * C))) * (C + hypot(B_m, C)))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 3700000.0) {
tmp = sqrt(((C * F) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * -2.0;
} else if (B_m <= 3.4e+143) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(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 <= 3e-120) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(F * Float64(A * C))) * Float64(C + hypot(B_m, C)))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 3700000.0) tmp = Float64(sqrt(Float64(Float64(C * F) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-2.0)); elseif (B_m <= 3.4e+143) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(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[B$95$m, 3e-120], N[(N[Sqrt[N[(N[(-8.0 * N[(F * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 3700000.0], N[(N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-2.0)), $MachinePrecision], If[LessEqual[B$95$m, 3.4e+143], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[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 3 \cdot 10^{-120}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(F \cdot \left(A \cdot C\right)\right)\right) \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 3700000:\\
\;\;\;\;\sqrt{\frac{C \cdot F}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-2\right)\\
\mathbf{elif}\;B\_m \leq 3.4 \cdot 10^{+143}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 3.00000000000000011e-120Initial program 19.7%
Simplified27.6%
Taylor expanded in B around 0 19.5%
associate-*r*19.5%
Simplified19.5%
Taylor expanded in A around 0 8.5%
associate-*r*8.5%
unpow28.5%
unpow28.5%
hypot-undefine9.1%
Simplified9.1%
Taylor expanded in A around 0 8.5%
associate-*r*8.5%
unpow28.5%
unpow28.5%
hypot-undefine9.1%
associate-*l*12.2%
associate-*r*12.2%
associate-*r*12.6%
Simplified12.6%
if 3.00000000000000011e-120 < B < 3.7e6Initial program 30.1%
Simplified40.6%
associate-*r*40.6%
associate-+r+39.7%
hypot-undefine30.1%
unpow230.1%
unpow230.1%
+-commutative30.1%
sqrt-prod34.5%
*-commutative34.5%
associate-+l+35.3%
Applied egg-rr49.0%
Taylor expanded in A around -inf 25.5%
Taylor expanded in F around 0 16.7%
mul-1-neg16.7%
*-commutative16.7%
unpow216.7%
rem-square-sqrt17.0%
*-commutative17.0%
fma-define17.0%
*-commutative17.0%
Simplified17.0%
if 3.7e6 < B < 3.39999999999999982e143Initial program 24.0%
Taylor expanded in A around 0 35.7%
mul-1-neg35.7%
*-commutative35.7%
*-commutative35.7%
Simplified35.7%
neg-sub035.7%
associate-*r/35.8%
pow1/235.8%
*-commutative35.8%
pow1/235.8%
pow-prod-down36.0%
+-commutative36.0%
unpow236.0%
unpow236.0%
hypot-define36.5%
Applied egg-rr36.5%
neg-sub036.5%
distribute-neg-frac236.5%
unpow1/236.5%
Simplified36.5%
if 3.39999999999999982e143 < B Initial program 0.2%
Taylor expanded in A around 0 5.3%
mul-1-neg5.3%
*-commutative5.3%
*-commutative5.3%
Simplified5.3%
sqrt-prod5.6%
+-commutative5.6%
unpow25.6%
unpow25.6%
hypot-define76.9%
Applied egg-rr76.9%
Taylor expanded in C around 0 71.1%
Final simplification23.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 2.1e-149)
(/
(sqrt (* -8.0 (* (+ C (hypot B_m C)) (* A (* C F)))))
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 48000.0)
(* (sqrt (/ (* C F) (fma -4.0 (* A C) (pow B_m 2.0)))) (- 2.0))
(if (<= B_m 1.4e+142)
(/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt 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 (B_m <= 2.1e-149) {
tmp = sqrt((-8.0 * ((C + hypot(B_m, C)) * (A * (C * F))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 48000.0) {
tmp = sqrt(((C * F) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * -2.0;
} else if (B_m <= 1.4e+142) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt(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.1e-149) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(C + hypot(B_m, C)) * Float64(A * Float64(C * F))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 48000.0) tmp = Float64(sqrt(Float64(Float64(C * F) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-2.0)); elseif (B_m <= 1.4e+142) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(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[B$95$m, 2.1e-149], N[(N[Sqrt[N[(-8.0 * N[(N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision] * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 48000.0], N[(N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-2.0)), $MachinePrecision], If[LessEqual[B$95$m, 1.4e+142], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[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 2.1 \cdot 10^{-149}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(C + \mathsf{hypot}\left(B\_m, C\right)\right) \cdot \left(A \cdot \left(C \cdot F\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 48000:\\
\;\;\;\;\sqrt{\frac{C \cdot F}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-2\right)\\
\mathbf{elif}\;B\_m \leq 1.4 \cdot 10^{+142}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \left(-\sqrt{B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 2.10000000000000011e-149Initial program 19.0%
Simplified26.6%
Taylor expanded in B around 0 18.9%
associate-*r*18.9%
Simplified18.9%
Taylor expanded in A around 0 8.6%
associate-*r*8.6%
unpow28.6%
unpow28.6%
hypot-undefine9.3%
Simplified9.3%
distribute-frac-neg29.3%
associate-*r*11.9%
Applied egg-rr11.9%
if 2.10000000000000011e-149 < B < 48000Initial program 32.2%
Simplified44.5%
associate-*r*44.5%
associate-+r+43.6%
hypot-undefine32.2%
unpow232.2%
unpow232.2%
+-commutative32.2%
sqrt-prod39.5%
*-commutative39.5%
associate-+l+40.3%
Applied egg-rr55.0%
Taylor expanded in A around -inf 28.6%
Taylor expanded in F around 0 14.0%
mul-1-neg14.0%
*-commutative14.0%
unpow214.0%
rem-square-sqrt14.2%
*-commutative14.2%
fma-define14.2%
*-commutative14.2%
Simplified14.2%
if 48000 < B < 1.4e142Initial program 24.0%
Taylor expanded in A around 0 35.7%
mul-1-neg35.7%
*-commutative35.7%
*-commutative35.7%
Simplified35.7%
neg-sub035.7%
associate-*r/35.8%
pow1/235.8%
*-commutative35.8%
pow1/235.8%
pow-prod-down36.0%
+-commutative36.0%
unpow236.0%
unpow236.0%
hypot-define36.5%
Applied egg-rr36.5%
neg-sub036.5%
distribute-neg-frac236.5%
unpow1/236.5%
Simplified36.5%
if 1.4e142 < B Initial program 0.2%
Taylor expanded in A around 0 5.3%
mul-1-neg5.3%
*-commutative5.3%
*-commutative5.3%
Simplified5.3%
sqrt-prod5.6%
+-commutative5.6%
unpow25.6%
unpow25.6%
hypot-define76.9%
Applied egg-rr76.9%
Taylor expanded in C around 0 71.1%
Final simplification22.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 (<= F 9.2e+52) (/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m)) (* (sqrt 2.0) (/ (sqrt 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 (F <= 9.2e+52) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 9.2e+52) {
tmp = Math.sqrt((2.0 * (F * (C + Math.hypot(C, B_m))))) / -B_m;
} else {
tmp = Math.sqrt(2.0) * (Math.sqrt(F) / -Math.sqrt(B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 9.2e+52: tmp = math.sqrt((2.0 * (F * (C + math.hypot(C, B_m))))) / -B_m else: tmp = math.sqrt(2.0) * (math.sqrt(F) / -math.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 (F <= 9.2e+52) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(sqrt(2.0) * Float64(sqrt(F) / Float64(-sqrt(B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 9.2e+52)
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
else
tmp = sqrt(2.0) * (sqrt(F) / -sqrt(B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 9.2e+52], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[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}\;F \leq 9.2 \cdot 10^{+52}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if F < 9.1999999999999999e52Initial program 19.5%
Taylor expanded in A around 0 8.0%
mul-1-neg8.0%
*-commutative8.0%
*-commutative8.0%
Simplified8.0%
neg-sub08.0%
associate-*r/8.1%
pow1/28.3%
*-commutative8.3%
pow1/28.3%
pow-prod-down8.3%
+-commutative8.3%
unpow28.3%
unpow28.3%
hypot-define19.0%
Applied egg-rr19.0%
neg-sub019.0%
distribute-neg-frac219.0%
unpow1/218.9%
Simplified18.9%
if 9.1999999999999999e52 < F Initial program 16.6%
Taylor expanded in B around inf 15.9%
mul-1-neg15.9%
*-commutative15.9%
Simplified15.9%
sqrt-div16.6%
Applied egg-rr16.6%
Final simplification18.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 1.22e+44) (/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m)) (* (sqrt 2.0) (/ -1.0 (sqrt (/ B_m 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 (F <= 1.22e+44) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = sqrt(2.0) * (-1.0 / sqrt((B_m / F)));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.22e+44) {
tmp = Math.sqrt((2.0 * (F * (C + Math.hypot(C, B_m))))) / -B_m;
} else {
tmp = Math.sqrt(2.0) * (-1.0 / Math.sqrt((B_m / 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 F <= 1.22e+44: tmp = math.sqrt((2.0 * (F * (C + math.hypot(C, B_m))))) / -B_m else: tmp = math.sqrt(2.0) * (-1.0 / math.sqrt((B_m / 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 (F <= 1.22e+44) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(sqrt(2.0) * Float64(-1.0 / sqrt(Float64(B_m / 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 (F <= 1.22e+44)
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
else
tmp = sqrt(2.0) * (-1.0 / sqrt((B_m / 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[F, 1.22e+44], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / N[Sqrt[N[(B$95$m / 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}\;F \leq 1.22 \cdot 10^{+44}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{-1}{\sqrt{\frac{B\_m}{F}}}\\
\end{array}
\end{array}
if F < 1.22e44Initial program 19.1%
Taylor expanded in A around 0 7.5%
mul-1-neg7.5%
*-commutative7.5%
*-commutative7.5%
Simplified7.5%
neg-sub07.5%
associate-*r/7.5%
pow1/27.7%
*-commutative7.7%
pow1/27.7%
pow-prod-down7.7%
+-commutative7.7%
unpow27.7%
unpow27.7%
hypot-define18.6%
Applied egg-rr18.6%
neg-sub018.6%
distribute-neg-frac218.6%
unpow1/218.5%
Simplified18.5%
if 1.22e44 < F Initial program 17.3%
Taylor expanded in B around inf 16.5%
mul-1-neg16.5%
*-commutative16.5%
Simplified16.5%
add-cbrt-cube12.3%
pow1/311.7%
add-sqr-sqrt11.7%
pow111.7%
pow1/212.1%
pow-prod-up12.1%
metadata-eval12.1%
Applied egg-rr12.1%
unpow1/312.7%
Simplified12.7%
pow1/312.1%
pow-pow16.9%
metadata-eval16.9%
pow1/216.5%
clear-num16.5%
sqrt-div17.1%
metadata-eval17.1%
Applied egg-rr17.1%
Final simplification17.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 1.5e+29) (* (sqrt (* F (+ B_m C))) (/ (sqrt 2.0) (- B_m))) (* (sqrt 2.0) (/ -1.0 (sqrt (/ B_m 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 (F <= 1.5e+29) {
tmp = sqrt((F * (B_m + C))) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt(2.0) * (-1.0 / sqrt((B_m / 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 (f <= 1.5d+29) then
tmp = sqrt((f * (b_m + c))) * (sqrt(2.0d0) / -b_m)
else
tmp = sqrt(2.0d0) * ((-1.0d0) / sqrt((b_m / 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 (F <= 1.5e+29) {
tmp = Math.sqrt((F * (B_m + C))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = Math.sqrt(2.0) * (-1.0 / Math.sqrt((B_m / 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 F <= 1.5e+29: tmp = math.sqrt((F * (B_m + C))) * (math.sqrt(2.0) / -B_m) else: tmp = math.sqrt(2.0) * (-1.0 / math.sqrt((B_m / 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 (F <= 1.5e+29) tmp = Float64(sqrt(Float64(F * Float64(B_m + C))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(2.0) * Float64(-1.0 / sqrt(Float64(B_m / 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 (F <= 1.5e+29)
tmp = sqrt((F * (B_m + C))) * (sqrt(2.0) / -B_m);
else
tmp = sqrt(2.0) * (-1.0 / sqrt((B_m / 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[F, 1.5e+29], N[(N[Sqrt[N[(F * N[(B$95$m + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / N[Sqrt[N[(B$95$m / 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}\;F \leq 1.5 \cdot 10^{+29}:\\
\;\;\;\;\sqrt{F \cdot \left(B\_m + C\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{-1}{\sqrt{\frac{B\_m}{F}}}\\
\end{array}
\end{array}
if F < 1.5e29Initial program 19.1%
Taylor expanded in A around 0 7.0%
mul-1-neg7.0%
*-commutative7.0%
*-commutative7.0%
Simplified7.0%
Taylor expanded in C around 0 15.3%
distribute-rgt-out15.3%
Simplified15.3%
if 1.5e29 < F Initial program 17.3%
Taylor expanded in B around inf 16.6%
mul-1-neg16.6%
*-commutative16.6%
Simplified16.6%
add-cbrt-cube12.6%
pow1/312.0%
add-sqr-sqrt12.0%
pow112.0%
pow1/212.4%
pow-prod-up12.4%
metadata-eval12.4%
Applied egg-rr12.4%
unpow1/313.0%
Simplified13.0%
pow1/312.4%
pow-pow17.0%
metadata-eval17.0%
pow1/216.6%
clear-num16.6%
sqrt-div17.2%
metadata-eval17.2%
Applied egg-rr17.2%
Final simplification16.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 1.15e-15) (* (sqrt (* B_m F)) (/ (sqrt 2.0) (- B_m))) (* (sqrt 2.0) (/ -1.0 (sqrt (/ B_m 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 (F <= 1.15e-15) {
tmp = sqrt((B_m * F)) * (sqrt(2.0) / -B_m);
} else {
tmp = sqrt(2.0) * (-1.0 / sqrt((B_m / 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 (f <= 1.15d-15) then
tmp = sqrt((b_m * f)) * (sqrt(2.0d0) / -b_m)
else
tmp = sqrt(2.0d0) * ((-1.0d0) / sqrt((b_m / 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 (F <= 1.15e-15) {
tmp = Math.sqrt((B_m * F)) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = Math.sqrt(2.0) * (-1.0 / Math.sqrt((B_m / 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 F <= 1.15e-15: tmp = math.sqrt((B_m * F)) * (math.sqrt(2.0) / -B_m) else: tmp = math.sqrt(2.0) * (-1.0 / math.sqrt((B_m / 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 (F <= 1.15e-15) tmp = Float64(sqrt(Float64(B_m * F)) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(sqrt(2.0) * Float64(-1.0 / sqrt(Float64(B_m / 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 (F <= 1.15e-15)
tmp = sqrt((B_m * F)) * (sqrt(2.0) / -B_m);
else
tmp = sqrt(2.0) * (-1.0 / sqrt((B_m / 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[F, 1.15e-15], N[(N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / N[Sqrt[N[(B$95$m / 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}\;F \leq 1.15 \cdot 10^{-15}:\\
\;\;\;\;\sqrt{B\_m \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{-1}{\sqrt{\frac{B\_m}{F}}}\\
\end{array}
\end{array}
if F < 1.14999999999999995e-15Initial program 18.4%
Taylor expanded in A around 0 6.4%
mul-1-neg6.4%
*-commutative6.4%
*-commutative6.4%
Simplified6.4%
Taylor expanded in C around 0 16.1%
if 1.14999999999999995e-15 < F Initial program 18.2%
Taylor expanded in B around inf 16.8%
mul-1-neg16.8%
*-commutative16.8%
Simplified16.8%
add-cbrt-cube12.8%
pow1/312.1%
add-sqr-sqrt12.1%
pow112.1%
pow1/212.4%
pow-prod-up12.4%
metadata-eval12.4%
Applied egg-rr12.4%
unpow1/313.1%
Simplified13.1%
pow1/312.4%
pow-pow17.1%
metadata-eval17.1%
pow1/216.8%
clear-num16.8%
sqrt-div17.3%
metadata-eval17.3%
Applied egg-rr17.3%
Final simplification16.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 (<= C 3.3e+192) (- (sqrt (* 2.0 (fabs (/ F B_m))))) (* (/ 2.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 <= 3.3e+192) {
tmp = -sqrt((2.0 * fabs((F / B_m))));
} else {
tmp = (2.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 <= 3.3d+192) then
tmp = -sqrt((2.0d0 * abs((f / b_m))))
else
tmp = (2.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 <= 3.3e+192) {
tmp = -Math.sqrt((2.0 * Math.abs((F / B_m))));
} else {
tmp = (2.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 <= 3.3e+192: tmp = -math.sqrt((2.0 * math.fabs((F / B_m)))) else: tmp = (2.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 <= 3.3e+192) tmp = Float64(-sqrt(Float64(2.0 * abs(Float64(F / B_m))))); else tmp = Float64(Float64(2.0 / Float64(-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 <= 3.3e+192)
tmp = -sqrt((2.0 * abs((F / B_m))));
else
tmp = (2.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, 3.3e+192], (-N[Sqrt[N[(2.0 * N[Abs[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C * F), $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 3.3 \cdot 10^{+192}:\\
\;\;\;\;-\sqrt{2 \cdot \left|\frac{F}{B\_m}\right|}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 3.3000000000000001e192Initial program 20.1%
Taylor expanded in B around inf 15.0%
mul-1-neg15.0%
*-commutative15.0%
Simplified15.0%
*-commutative15.0%
pow1/215.2%
pow1/215.2%
pow-prod-down15.3%
Applied egg-rr15.3%
unpow1/215.1%
Simplified15.1%
add-sqr-sqrt15.1%
sqrt-unprod18.7%
pow218.7%
Applied egg-rr18.7%
unpow218.7%
rem-sqrt-square31.4%
Simplified31.4%
if 3.3000000000000001e192 < C Initial program 2.4%
Taylor expanded in A around 0 0.9%
mul-1-neg0.9%
*-commutative0.9%
*-commutative0.9%
Simplified0.9%
sqrt-prod0.9%
+-commutative0.9%
unpow20.9%
unpow20.9%
hypot-define16.4%
Applied egg-rr16.4%
Taylor expanded in C around inf 6.3%
associate-*r*6.3%
neg-mul-16.3%
unpow26.3%
rem-square-sqrt6.3%
Simplified6.3%
Final simplification28.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1.6e+189) (- (pow (* 2.0 (/ F B_m)) 0.5)) (* (/ 2.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 <= 1.6e+189) {
tmp = -pow((2.0 * (F / B_m)), 0.5);
} else {
tmp = (2.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 <= 1.6d+189) then
tmp = -((2.0d0 * (f / b_m)) ** 0.5d0)
else
tmp = (2.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 <= 1.6e+189) {
tmp = -Math.pow((2.0 * (F / B_m)), 0.5);
} else {
tmp = (2.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 <= 1.6e+189: tmp = -math.pow((2.0 * (F / B_m)), 0.5) else: tmp = (2.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 <= 1.6e+189) tmp = Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5)); else tmp = Float64(Float64(2.0 / Float64(-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 <= 1.6e+189)
tmp = -((2.0 * (F / B_m)) ^ 0.5);
else
tmp = (2.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, 1.6e+189], (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C * F), $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 1.6 \cdot 10^{+189}:\\
\;\;\;\;-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 1.6e189Initial program 20.2%
Taylor expanded in B around inf 15.1%
mul-1-neg15.1%
*-commutative15.1%
Simplified15.1%
*-commutative15.1%
pow1/215.3%
pow1/215.3%
pow-prod-down15.3%
Applied egg-rr15.3%
if 1.6e189 < C Initial program 2.5%
Taylor expanded in A around 0 1.0%
mul-1-neg1.0%
*-commutative1.0%
*-commutative1.0%
Simplified1.0%
sqrt-prod1.0%
+-commutative1.0%
unpow21.0%
unpow21.0%
hypot-define15.9%
Applied egg-rr15.9%
Taylor expanded in C around inf 6.2%
associate-*r*6.2%
neg-mul-16.2%
unpow26.2%
rem-square-sqrt6.2%
Simplified6.2%
Final simplification14.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 (- (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 18.3%
Taylor expanded in B around inf 14.1%
mul-1-neg14.1%
*-commutative14.1%
Simplified14.1%
*-commutative14.1%
pow1/214.3%
pow1/214.3%
pow-prod-down14.3%
Applied egg-rr14.3%
Final simplification14.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 (* 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 18.3%
Taylor expanded in B around inf 14.1%
mul-1-neg14.1%
*-commutative14.1%
Simplified14.1%
*-commutative14.1%
pow1/214.3%
pow1/214.3%
pow-prod-down14.3%
Applied egg-rr14.3%
unpow1/214.1%
Simplified14.1%
Final simplification14.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 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 18.3%
Taylor expanded in B around inf 14.1%
mul-1-neg14.1%
*-commutative14.1%
Simplified14.1%
*-commutative14.1%
pow1/214.3%
pow1/214.3%
pow-prod-down14.3%
Applied egg-rr14.3%
unpow1/214.1%
Simplified14.1%
associate-*l/14.1%
Applied egg-rr14.1%
associate-/l*14.1%
Simplified14.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 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 18.3%
Taylor expanded in B around inf 14.1%
mul-1-neg14.1%
*-commutative14.1%
Simplified14.1%
*-commutative14.1%
pow1/214.3%
pow1/214.3%
pow-prod-down14.3%
Applied egg-rr14.3%
unpow1/214.1%
Simplified14.1%
add-sqr-sqrt0.5%
sqrt-unprod1.6%
sqr-neg1.6%
add-sqr-sqrt1.6%
*-un-lft-identity1.6%
*-commutative1.6%
Applied egg-rr1.6%
*-lft-identity1.6%
Simplified1.6%
herbie shell --seed 2024186
(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))))