
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (pow B_m 2.0)))
(t_1 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))
(t_2 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-90)
(/ (sqrt (* (* F t_2) (* 2.0 t_1))) (- t_2))
(if (<= (pow B_m 2.0) 2e+89)
(*
(sqrt
(/
(* F (+ A (- C (hypot B_m (- A C)))))
(fma -4.0 (* A C) (pow B_m 2.0))))
(- (sqrt 2.0)))
(if (<= (pow B_m 2.0) 2e+150)
(/ (sqrt (* F (* (* 2.0 t_0) t_1))) (- t_0))
(/
-1.0
(*
(/ B_m (sqrt 2.0))
(sqrt (/ (/ -1.0 F) (- (hypot A B_m) A))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(C, (A * -4.0), pow(B_m, 2.0));
double t_1 = A + (A + (-0.5 * (pow(B_m, 2.0) / C)));
double t_2 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-90) {
tmp = sqrt(((F * t_2) * (2.0 * t_1))) / -t_2;
} else if (pow(B_m, 2.0) <= 2e+89) {
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 (pow(B_m, 2.0) <= 2e+150) {
tmp = sqrt((F * ((2.0 * t_0) * t_1))) / -t_0;
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((-1.0 / F) / (hypot(A, B_m) - A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) t_1 = Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C)))) t_2 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-90) tmp = Float64(sqrt(Float64(Float64(F * t_2) * Float64(2.0 * t_1))) / Float64(-t_2)); elseif ((B_m ^ 2.0) <= 2e+89) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-sqrt(2.0))); elseif ((B_m ^ 2.0) <= 2e+150) tmp = Float64(sqrt(Float64(F * Float64(Float64(2.0 * t_0) * t_1))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(-1.0 / F) / Float64(hypot(A, B_m) - A))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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], 1e-90], N[(N[Sqrt[N[(N[(F * t$95$2), $MachinePrecision] * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+89], N[(N[Sqrt[N[(N[(F * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+150], N[(N[Sqrt[N[(F * N[(N[(2.0 * t$95$0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-1.0 / F), $MachinePrecision] / N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision]), $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}
t_0 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
t_1 := A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\\
t_2 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-90}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_2\right) \cdot \left(2 \cdot t\_1\right)}}{-t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+89}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+150}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(\left(2 \cdot t\_0\right) \cdot t\_1\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{-1}{F}}{\mathsf{hypot}\left(A, B\_m\right) - A}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-91Initial program 13.9%
Simplified24.4%
Taylor expanded in C around inf 26.8%
mul-1-neg26.8%
Simplified26.8%
if 9.99999999999999995e-91 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999999e89Initial program 38.1%
Taylor expanded in F around 0 42.4%
mul-1-neg42.4%
cancel-sign-sub-inv42.4%
metadata-eval42.4%
+-commutative42.4%
Simplified50.8%
if 1.99999999999999999e89 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999996e150Initial program 21.2%
Simplified22.7%
Taylor expanded in C around inf 30.4%
mul-1-neg30.4%
Simplified30.4%
if 1.99999999999999996e150 < (pow.f64 B #s(literal 2 binary64)) Initial program 8.0%
Taylor expanded in C around 0 7.4%
mul-1-neg7.4%
+-commutative7.4%
Simplified7.4%
add-cbrt-cube6.6%
pow1/36.3%
Applied egg-rr24.4%
unpow1/325.5%
Simplified25.5%
associate-*l/25.5%
pow1/324.4%
pow-pow27.7%
metadata-eval27.7%
pow1/227.7%
sqrt-prod27.7%
distribute-frac-neg227.7%
clear-num27.7%
associate-*r*27.7%
Applied egg-rr27.7%
Taylor expanded in F around 0 7.4%
mul-1-neg7.4%
distribute-rgt-neg-in7.4%
associate-/r*8.1%
unpow28.1%
unpow28.1%
hypot-define28.7%
Simplified28.7%
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 (fma C (* A -4.0) (pow B_m 2.0)))
(t_2 (- (* (* 4.0 A) C) (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(- (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))
(* 2.0 (* F t_2))))
t_2)))
(if (<= t_3 -2e-206)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (sqrt (* 2.0 t_1)))
(- t_1))
(if (<= t_3 INFINITY)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- 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 = fma(C, (A * -4.0), pow(B_m, 2.0));
double t_2 = ((4.0 * A) * C) - pow(B_m, 2.0);
double t_3 = sqrt(((sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) - (A + C)) * (2.0 * (F * t_2)))) / t_2;
double tmp;
if (t_3 <= -2e-206) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * sqrt((2.0 * t_1))) / -t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -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 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) t_2 = Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)) * Float64(2.0 * Float64(F * t_2)))) / t_2) tmp = 0.0 if (t_3 <= -2e-206) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * sqrt(Float64(2.0 * t_1))) / Float64(-t_1)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / 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[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -2e-206], N[(N[(N[Sqrt[N[(F * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
t_2 := \left(4 \cdot A\right) \cdot C - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t\_2\right)\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{-206}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)} \cdot \sqrt{2 \cdot t\_1}}{-t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-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))) < -2.00000000000000006e-206Initial program 36.0%
Simplified36.2%
pow1/236.3%
associate-*r*43.9%
unpow-prod-down58.5%
associate-+r-57.2%
hypot-undefine44.8%
unpow244.8%
unpow244.8%
+-commutative44.8%
unpow244.8%
unpow244.8%
hypot-define57.2%
pow1/257.2%
Applied egg-rr57.2%
unpow1/257.2%
associate-+r-58.5%
hypot-undefine44.8%
unpow244.8%
unpow244.8%
+-commutative44.8%
unpow244.8%
unpow244.8%
hypot-undefine58.5%
Simplified58.5%
if -2.00000000000000006e-206 < (/.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 14.5%
Simplified25.0%
Taylor expanded in C around inf 35.6%
mul-1-neg35.6%
Simplified35.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0 2.0%
mul-1-neg2.0%
+-commutative2.0%
unpow22.0%
unpow22.0%
hypot-define20.4%
Simplified20.4%
neg-sub020.4%
associate-*l/20.4%
pow1/220.4%
pow1/220.4%
hypot-undefine2.0%
unpow22.0%
unpow22.0%
pow-prod-down2.0%
unpow22.0%
unpow22.0%
hypot-undefine20.5%
Applied egg-rr20.5%
neg-sub020.5%
distribute-neg-frac220.5%
unpow1/220.5%
Simplified20.5%
Final simplification37.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e-46)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ (/ -1.0 F) (- (hypot A B_m) A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e-46) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((-1.0 / F) / (hypot(A, B_m) - A))));
}
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-46) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(-1.0 / F) / Float64(hypot(A, B_m) - A))))); 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-46], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-1.0 / F), $MachinePrecision] / N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision]), $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}
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^{-46}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{-1}{F}}{\mathsf{hypot}\left(A, B\_m\right) - A}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000005e-46Initial program 14.7%
Simplified24.5%
Taylor expanded in C around inf 25.7%
mul-1-neg25.7%
Simplified25.7%
if 2.00000000000000005e-46 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.9%
Taylor expanded in C around 0 12.2%
mul-1-neg12.2%
+-commutative12.2%
Simplified12.2%
add-cbrt-cube10.3%
pow1/39.7%
Applied egg-rr22.5%
unpow1/323.6%
Simplified23.6%
associate-*l/23.5%
pow1/322.5%
pow-pow27.0%
metadata-eval27.0%
pow1/227.0%
sqrt-prod27.0%
distribute-frac-neg227.0%
clear-num27.0%
associate-*r*27.0%
Applied egg-rr27.0%
Taylor expanded in F around 0 12.1%
mul-1-neg12.1%
distribute-rgt-neg-in12.1%
associate-/r*12.6%
unpow212.6%
unpow212.6%
hypot-define27.4%
Simplified27.4%
Final simplification26.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) 1e-90)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ (/ -1.0 F) (- (hypot A B_m) A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-90) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((-1.0 / F) / (hypot(A, B_m) - A))));
}
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) <= 1e-90) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(-1.0 / F) / Float64(hypot(A, B_m) - A))))); 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], 1e-90], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-1.0 / F), $MachinePrecision] / N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision]), $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-90}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{-1}{F}}{\mathsf{hypot}\left(A, B\_m\right) - A}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-91Initial program 13.9%
Simplified24.4%
Taylor expanded in A around -inf 26.0%
if 9.99999999999999995e-91 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.4%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
Simplified11.6%
add-cbrt-cube9.8%
pow1/39.3%
Applied egg-rr21.3%
unpow1/322.3%
Simplified22.3%
associate-*l/22.3%
pow1/321.3%
pow-pow25.6%
metadata-eval25.6%
pow1/225.6%
sqrt-prod25.6%
distribute-frac-neg225.6%
clear-num25.6%
associate-*r*25.6%
Applied egg-rr25.6%
Taylor expanded in F around 0 11.5%
mul-1-neg11.5%
distribute-rgt-neg-in11.5%
associate-/r*12.0%
unpow212.0%
unpow212.0%
hypot-define25.8%
Simplified25.8%
Final simplification26.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) 1e-90)
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ (/ -1.0 F) (- (hypot A B_m) A)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-90) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((-1.0 / F) / (hypot(A, B_m) - A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-90) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(-1.0 / F) / Float64(hypot(A, B_m) - A))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-90], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-1.0 / F), $MachinePrecision] / N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision]), $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}\;{B\_m}^{2} \leq 10^{-90}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{-1}{F}}{\mathsf{hypot}\left(A, B\_m\right) - A}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-91Initial program 13.9%
Simplified20.9%
Taylor expanded in C around inf 25.1%
associate-*r*25.1%
mul-1-neg25.1%
Simplified25.1%
if 9.99999999999999995e-91 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.4%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
Simplified11.6%
add-cbrt-cube9.8%
pow1/39.3%
Applied egg-rr21.3%
unpow1/322.3%
Simplified22.3%
associate-*l/22.3%
pow1/321.3%
pow-pow25.6%
metadata-eval25.6%
pow1/225.6%
sqrt-prod25.6%
distribute-frac-neg225.6%
clear-num25.6%
associate-*r*25.6%
Applied egg-rr25.6%
Taylor expanded in F around 0 11.5%
mul-1-neg11.5%
distribute-rgt-neg-in11.5%
associate-/r*12.0%
unpow212.0%
unpow212.0%
hypot-define25.8%
Simplified25.8%
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) 1e-90) (/ (sqrt (* (* A -8.0) (* C (* F (+ A A))))) (* (* 4.0 A) C)) (/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ (/ -1.0 F) (- (hypot A B_m) A)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-90) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((-1.0 / F) / (hypot(A, B_m) - A))));
}
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 (Math.pow(B_m, 2.0) <= 1e-90) {
tmp = Math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = -1.0 / ((B_m / Math.sqrt(2.0)) * Math.sqrt(((-1.0 / F) / (Math.hypot(A, B_m) - A))));
}
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) <= 1e-90: tmp = math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C) else: tmp = -1.0 / ((B_m / math.sqrt(2.0)) * math.sqrt(((-1.0 / F) / (math.hypot(A, B_m) - A)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-90) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(-1.0 / F) / Float64(hypot(A, B_m) - A))))); 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) <= 1e-90)
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
else
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((-1.0 / F) / (hypot(A, B_m) - A))));
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], 1e-90], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-1.0 / F), $MachinePrecision] / N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision]), $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}\;{B\_m}^{2} \leq 10^{-90}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{-1}{F}}{\mathsf{hypot}\left(A, B\_m\right) - A}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-91Initial program 13.9%
Simplified20.9%
Taylor expanded in C around inf 18.1%
associate-*r*18.1%
Simplified18.1%
Taylor expanded in C around inf 25.0%
associate-*r*25.1%
mul-1-neg25.1%
Simplified25.0%
if 9.99999999999999995e-91 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.4%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
Simplified11.6%
add-cbrt-cube9.8%
pow1/39.3%
Applied egg-rr21.3%
unpow1/322.3%
Simplified22.3%
associate-*l/22.3%
pow1/321.3%
pow-pow25.6%
metadata-eval25.6%
pow1/225.6%
sqrt-prod25.6%
distribute-frac-neg225.6%
clear-num25.6%
associate-*r*25.6%
Applied egg-rr25.6%
Taylor expanded in F around 0 11.5%
mul-1-neg11.5%
distribute-rgt-neg-in11.5%
associate-/r*12.0%
unpow212.0%
unpow212.0%
hypot-define25.8%
Simplified25.8%
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) 1e-90) (/ (sqrt (* (* A -8.0) (* C (* F (+ A A))))) (* (* 4.0 A) C)) (/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- 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) <= 1e-90) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -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 (Math.pow(B_m, 2.0) <= 1e-90) {
tmp = Math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((2.0 * (F * (A - Math.hypot(B_m, A))))) / -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) <= 1e-90: tmp = math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C) else: tmp = math.sqrt((2.0 * (F * (A - math.hypot(B_m, A))))) / -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) <= 1e-90) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-90)
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
else
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -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], 1e-90], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-90}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-91Initial program 13.9%
Simplified20.9%
Taylor expanded in C around inf 18.1%
associate-*r*18.1%
Simplified18.1%
Taylor expanded in C around inf 25.0%
associate-*r*25.1%
mul-1-neg25.1%
Simplified25.0%
if 9.99999999999999995e-91 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.4%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
+-commutative11.6%
unpow211.6%
unpow211.6%
hypot-define25.5%
Simplified25.5%
neg-sub025.5%
associate-*l/25.6%
pow1/225.6%
pow1/225.6%
hypot-undefine11.7%
unpow211.7%
unpow211.7%
pow-prod-down11.7%
unpow211.7%
unpow211.7%
hypot-undefine25.6%
Applied egg-rr25.6%
neg-sub025.6%
distribute-neg-frac225.6%
unpow1/225.6%
Simplified25.6%
Final simplification25.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 3.5e-45) (/ (sqrt (* (* A -8.0) (* C (* F (+ A A))))) (* (* 4.0 A) C)) (/ (sqrt (* 2.0 (- (* A F) (* B_m F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.5e-45) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.5d-45) then
tmp = sqrt(((a * (-8.0d0)) * (c * (f * (a + a))))) / ((4.0d0 * a) * c)
else
tmp = sqrt((2.0d0 * ((a * f) - (b_m * f)))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.5e-45) {
tmp = Math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.5e-45: tmp = math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C) else: tmp = math.sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.5e-45) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(A * F) - Float64(B_m * F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.5e-45)
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
else
tmp = sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.5e-45], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(A * F), $MachinePrecision] - N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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.5 \cdot 10^{-45}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A \cdot F - B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.5e-45Initial program 13.9%
Simplified17.9%
Taylor expanded in C around inf 12.1%
associate-*r*12.1%
Simplified12.1%
Taylor expanded in C around inf 18.2%
associate-*r*17.3%
mul-1-neg17.3%
Simplified18.2%
if 3.5e-45 < B Initial program 20.5%
Taylor expanded in C around 0 21.0%
mul-1-neg21.0%
+-commutative21.0%
unpow221.0%
unpow221.0%
hypot-define46.7%
Simplified46.7%
neg-sub046.7%
associate-*l/46.7%
pow1/246.7%
pow1/246.7%
hypot-undefine21.1%
unpow221.1%
unpow221.1%
pow-prod-down21.2%
unpow221.2%
unpow221.2%
hypot-undefine46.8%
Applied egg-rr46.8%
neg-sub046.8%
distribute-neg-frac246.8%
unpow1/246.8%
Simplified46.8%
Taylor expanded in A around 0 44.4%
+-commutative44.4%
mul-1-neg44.4%
unsub-neg44.4%
*-commutative44.4%
Simplified44.4%
Final simplification26.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 2.55e-45) (/ (sqrt (* F (* -8.0 (* A (* C (+ A A)))))) (* (* 4.0 A) C)) (/ (sqrt (* 2.0 (- (* A F) (* B_m F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.55e-45) {
tmp = sqrt((F * (-8.0 * (A * (C * (A + A)))))) / ((4.0 * A) * C);
} else {
tmp = sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 2.55d-45) then
tmp = sqrt((f * ((-8.0d0) * (a * (c * (a + a)))))) / ((4.0d0 * a) * c)
else
tmp = sqrt((2.0d0 * ((a * f) - (b_m * f)))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.55e-45) {
tmp = Math.sqrt((F * (-8.0 * (A * (C * (A + A)))))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 2.55e-45: tmp = math.sqrt((F * (-8.0 * (A * (C * (A + A)))))) / ((4.0 * A) * C) else: tmp = math.sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.55e-45) tmp = Float64(sqrt(Float64(F * Float64(-8.0 * Float64(A * Float64(C * Float64(A + A)))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(A * F) - Float64(B_m * F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 2.55e-45)
tmp = sqrt((F * (-8.0 * (A * (C * (A + A)))))) / ((4.0 * A) * C);
else
tmp = sqrt((2.0 * ((A * F) - (B_m * F)))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.55e-45], N[(N[Sqrt[N[(F * N[(-8.0 * N[(A * N[(C * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(A * F), $MachinePrecision] - N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.55 \cdot 10^{-45}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(-8 \cdot \left(A \cdot \left(C \cdot \left(A + A\right)\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A \cdot F - B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 2.5499999999999999e-45Initial program 13.9%
Simplified17.9%
Taylor expanded in C around inf 12.1%
associate-*r*12.1%
Simplified12.1%
Taylor expanded in C around inf 15.7%
sub-neg15.7%
mul-1-neg15.7%
remove-double-neg15.7%
Simplified15.7%
if 2.5499999999999999e-45 < B Initial program 20.5%
Taylor expanded in C around 0 21.0%
mul-1-neg21.0%
+-commutative21.0%
unpow221.0%
unpow221.0%
hypot-define46.7%
Simplified46.7%
neg-sub046.7%
associate-*l/46.7%
pow1/246.7%
pow1/246.7%
hypot-undefine21.1%
unpow221.1%
unpow221.1%
pow-prod-down21.2%
unpow221.2%
unpow221.2%
hypot-undefine46.8%
Applied egg-rr46.8%
neg-sub046.8%
distribute-neg-frac246.8%
unpow1/246.8%
Simplified46.8%
Taylor expanded in A around 0 44.4%
+-commutative44.4%
mul-1-neg44.4%
unsub-neg44.4%
*-commutative44.4%
Simplified44.4%
Final simplification24.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 (- (* A F) (* B_m 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 * ((A * F) - (B_m * 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 * ((a * f) - (b_m * 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 * ((A * F) - (B_m * 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 * ((A * F) - (B_m * 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(Float64(A * F) - Float64(B_m * F)))) / Float64(-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 * ((A * F) - (B_m * 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[(N[Sqrt[N[(2.0 * N[(N[(A * F), $MachinePrecision] - N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2 \cdot \left(A \cdot F - B\_m \cdot F\right)}}{-B\_m}
\end{array}
Initial program 15.9%
Taylor expanded in C around 0 8.5%
mul-1-neg8.5%
+-commutative8.5%
unpow28.5%
unpow28.5%
hypot-define16.6%
Simplified16.6%
neg-sub016.6%
associate-*l/16.6%
pow1/216.6%
pow1/216.6%
hypot-undefine8.6%
unpow28.6%
unpow28.6%
pow-prod-down8.6%
unpow28.6%
unpow28.6%
hypot-undefine16.7%
Applied egg-rr16.7%
neg-sub016.7%
distribute-neg-frac216.7%
unpow1/216.6%
Simplified16.6%
Taylor expanded in A around 0 14.4%
+-commutative14.4%
mul-1-neg14.4%
unsub-neg14.4%
*-commutative14.4%
Simplified14.4%
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 (/ (sqrt (* (* B_m 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(((B_m * 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(((b_m * 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(((B_m * 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(((B_m * 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(Float64(B_m * F) * -2.0)) / Float64(-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(((B_m * 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[(N[Sqrt[N[(N[(B$95$m * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(B\_m \cdot F\right) \cdot -2}}{-B\_m}
\end{array}
Initial program 15.9%
Taylor expanded in C around 0 8.5%
mul-1-neg8.5%
+-commutative8.5%
unpow28.5%
unpow28.5%
hypot-define16.6%
Simplified16.6%
neg-sub016.6%
associate-*l/16.6%
pow1/216.6%
pow1/216.6%
hypot-undefine8.6%
unpow28.6%
unpow28.6%
pow-prod-down8.6%
unpow28.6%
unpow28.6%
hypot-undefine16.7%
Applied egg-rr16.7%
neg-sub016.7%
distribute-neg-frac216.7%
unpow1/216.6%
Simplified16.6%
Taylor expanded in A around 0 15.2%
Final simplification15.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (* A 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((A * 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((a * 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((A * 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((A * 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(A * 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((A * 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[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}
\end{array}
Initial program 15.9%
Taylor expanded in C around 0 8.5%
mul-1-neg8.5%
+-commutative8.5%
unpow28.5%
unpow28.5%
hypot-define16.6%
Simplified16.6%
add-exp-log14.4%
Applied egg-rr14.4%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
unpow20.0%
rem-square-sqrt3.0%
rem-square-sqrt3.1%
metadata-eval3.1%
Simplified3.1%
Final simplification3.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 (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(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 15.9%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.1%
Simplified2.1%
Taylor expanded in F around 0 2.1%
sqrt-unprod2.1%
pow1/22.2%
Applied egg-rr2.2%
Final simplification2.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ (* 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(Float64(2.0 * F) / B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((2.0 * F) / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 15.9%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.1%
Simplified2.1%
Taylor expanded in F around 0 2.1%
pow12.1%
sqrt-unprod2.1%
Applied egg-rr2.1%
unpow12.1%
*-commutative2.1%
associate-*r/2.1%
Simplified2.1%
herbie shell --seed 2024129
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))