
(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 11 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)))))
(if (<= (pow B_m 2.0) 5e+52)
(/
(-
(sqrt (* t_0 (* F (* 2.0 (+ (* 2.0 A) (/ (* (pow B_m 2.0) -0.5) C)))))))
t_0)
(* (sqrt (* F (- A (hypot B_m A)))) (/ -1.0 (/ B_m (sqrt 2.0)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 5e+52) {
tmp = -sqrt((t_0 * (F * (2.0 * ((2.0 * A) + ((pow(B_m, 2.0) * -0.5) / C)))))) / t_0;
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+52) tmp = Float64(Float64(-sqrt(Float64(t_0 * Float64(F * Float64(2.0 * Float64(Float64(2.0 * A) + Float64(Float64((B_m ^ 2.0) * -0.5) / C))))))) / t_0); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(-1.0 / Float64(B_m / sqrt(2.0)))); 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], 5e+52], N[((-N[Sqrt[N[(t$95$0 * N[(F * N[(2.0 * N[(N[(2.0 * A), $MachinePrecision] + N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * -0.5), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $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 5 \cdot 10^{+52}:\\
\;\;\;\;\frac{-\sqrt{t_0 \cdot \left(F \cdot \left(2 \cdot \left(2 \cdot A + \frac{{B_m}^{2} \cdot -0.5}{C}\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-1}{\frac{B_m}{\sqrt{2}}}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 5e52Initial program 18.7%
Simplified29.6%
Taylor expanded in C around inf 21.2%
associate-*r/21.2%
associate--l+21.2%
mul-1-neg21.2%
Simplified21.2%
Taylor expanded in A around 0 24.4%
distribute-frac-neg24.4%
associate-*l*26.1%
associate-+r+26.1%
add-log-exp9.1%
add-log-exp7.0%
sum-log7.0%
exp-lft-sqr7.0%
add-log-exp26.1%
Applied egg-rr26.1%
if 5e52 < (pow.f64 B 2) Initial program 17.5%
Simplified13.3%
Taylor expanded in C around 0 14.5%
mul-1-neg14.5%
distribute-rgt-neg-in14.5%
+-commutative14.5%
unpow214.5%
unpow214.5%
hypot-def24.3%
Simplified24.3%
clear-num24.3%
inv-pow24.3%
Applied egg-rr24.3%
unpow-124.3%
Simplified24.3%
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
(let* ((t_0
(/
(- (sqrt (* -8.0 (* A (* C (* F (+ A A)))))))
(fma A (* C -4.0) (pow B_m 2.0)))))
(if (<= (pow B_m 2.0) 1e-285)
t_0
(if (<= (pow B_m 2.0) 2e-218)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* -0.5 (/ (pow B_m 2.0) (/ C F))))))
(if (<= (pow B_m 2.0) 1e-76)
t_0
(if (<= (pow B_m 2.0) 5e+52)
(* (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))) (/ (- (sqrt 2.0)) B_m))
(*
(sqrt (* F (- A (hypot B_m A))))
(/ -1.0 (/ B_m (sqrt 2.0))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt((-8.0 * (A * (C * (F * (A + A)))))) / fma(A, (C * -4.0), pow(B_m, 2.0));
double tmp;
if (pow(B_m, 2.0) <= 1e-285) {
tmp = t_0;
} else if (pow(B_m, 2.0) <= 2e-218) {
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * (pow(B_m, 2.0) / (C / F))));
} else if (pow(B_m, 2.0) <= 1e-76) {
tmp = t_0;
} else if (pow(B_m, 2.0) <= 5e+52) {
tmp = sqrt((F * (-0.5 * (pow(B_m, 2.0) / C)))) * (-sqrt(2.0) / B_m);
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(-sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A))))))) / fma(A, Float64(C * -4.0), (B_m ^ 2.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-285) tmp = t_0; elseif ((B_m ^ 2.0) <= 2e-218) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(-0.5 * Float64((B_m ^ 2.0) / Float64(C / F)))))); elseif ((B_m ^ 2.0) <= 1e-76) tmp = t_0; elseif ((B_m ^ 2.0) <= 5e+52) tmp = Float64(sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(-1.0 / Float64(B_m / sqrt(2.0)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[((-N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-285], t$95$0, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-218], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / N[(C / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-76], t$95$0, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+52], N[(N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $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 := \frac{-\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{\mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)}\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-285}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;{B_m}^{2} \leq 2 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B_m}^{2}}{\frac{C}{F}}}\right)\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{-76}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+52}:\\
\;\;\;\;\sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-1}{\frac{B_m}{\sqrt{2}}}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000007e-285 or 2.0000000000000001e-218 < (pow.f64 B 2) < 9.99999999999999927e-77Initial program 17.9%
Simplified22.1%
Taylor expanded in C around inf 23.4%
if 1.00000000000000007e-285 < (pow.f64 B 2) < 2.0000000000000001e-218Initial program 12.0%
Simplified14.6%
Taylor expanded in A around 0 8.4%
mul-1-neg8.4%
*-commutative8.4%
distribute-rgt-neg-in8.4%
unpow28.4%
unpow28.4%
hypot-def9.5%
Simplified9.5%
Taylor expanded in C around inf 18.2%
associate-/l*18.1%
Simplified18.1%
if 9.99999999999999927e-77 < (pow.f64 B 2) < 5e52Initial program 25.6%
Simplified23.1%
Taylor expanded in A around 0 10.7%
mul-1-neg10.7%
*-commutative10.7%
distribute-rgt-neg-in10.7%
unpow210.7%
unpow210.7%
hypot-def10.9%
Simplified10.9%
Taylor expanded in C around inf 19.9%
if 5e52 < (pow.f64 B 2) Initial program 17.5%
Simplified13.3%
Taylor expanded in C around 0 14.5%
mul-1-neg14.5%
distribute-rgt-neg-in14.5%
+-commutative14.5%
unpow214.5%
unpow214.5%
hypot-def24.3%
Simplified24.3%
clear-num24.3%
inv-pow24.3%
Applied egg-rr24.3%
unpow-124.3%
Simplified24.3%
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
(if (<= (pow B_m 2.0) 1e-285)
(/
(- (sqrt (* (* A -8.0) (* (+ A A) (* C F)))))
(fma A (* C -4.0) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 5e+52)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* -0.5 (/ (pow B_m 2.0) (/ C F))))))
(* (sqrt (* F (- A (hypot B_m A)))) (/ -1.0 (/ B_m (sqrt 2.0)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-285) {
tmp = -sqrt(((A * -8.0) * ((A + A) * (C * F)))) / fma(A, (C * -4.0), pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 5e+52) {
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * (pow(B_m, 2.0) / (C / F))));
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-285) tmp = Float64(Float64(-sqrt(Float64(Float64(A * -8.0) * Float64(Float64(A + A) * Float64(C * F))))) / fma(A, Float64(C * -4.0), (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 5e+52) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(-0.5 * Float64((B_m ^ 2.0) / Float64(C / F)))))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(-1.0 / Float64(B_m / sqrt(2.0)))); 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-285], N[((-N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(N[(A + A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+52], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / N[(C / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $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^{-285}:\\
\;\;\;\;\frac{-\sqrt{\left(A \cdot -8\right) \cdot \left(\left(A + A\right) \cdot \left(C \cdot F\right)\right)}}{\mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+52}:\\
\;\;\;\;\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B_m}^{2}}{\frac{C}{F}}}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-1}{\frac{B_m}{\sqrt{2}}}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000007e-285Initial program 13.7%
Simplified17.4%
Taylor expanded in C around inf 21.4%
associate-*r*21.4%
rem-square-sqrt0.0%
unpow20.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt21.4%
associate-*r*17.0%
*-commutative17.0%
sub-neg17.0%
mul-1-neg17.0%
remove-double-neg17.0%
Simplified17.0%
if 1.00000000000000007e-285 < (pow.f64 B 2) < 5e52Initial program 22.7%
Simplified24.6%
Taylor expanded in A around 0 8.1%
mul-1-neg8.1%
*-commutative8.1%
distribute-rgt-neg-in8.1%
unpow28.1%
unpow28.1%
hypot-def8.7%
Simplified8.7%
Taylor expanded in C around inf 15.2%
associate-/l*15.1%
Simplified15.1%
if 5e52 < (pow.f64 B 2) Initial program 17.5%
Simplified13.3%
Taylor expanded in C around 0 14.5%
mul-1-neg14.5%
distribute-rgt-neg-in14.5%
+-commutative14.5%
unpow214.5%
unpow214.5%
hypot-def24.3%
Simplified24.3%
clear-num24.3%
inv-pow24.3%
Applied egg-rr24.3%
unpow-124.3%
Simplified24.3%
Final simplification19.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 (- (pow B_m 2.0) (* C (* A 4.0)))))
(if (<= (pow B_m 2.0) 1e-84)
(/ (- (sqrt (* (* 2.0 (* F t_0)) (+ A A)))) t_0)
(if (<= (pow B_m 2.0) 5e+52)
(* (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))) (/ (- (sqrt 2.0)) B_m))
(* (sqrt (* F (- A (hypot B_m A)))) (/ -1.0 (/ B_m (sqrt 2.0))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = pow(B_m, 2.0) - (C * (A * 4.0));
double tmp;
if (pow(B_m, 2.0) <= 1e-84) {
tmp = -sqrt(((2.0 * (F * t_0)) * (A + A))) / t_0;
} else if (pow(B_m, 2.0) <= 5e+52) {
tmp = sqrt((F * (-0.5 * (pow(B_m, 2.0) / C)))) * (-sqrt(2.0) / B_m);
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
}
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 t_0 = Math.pow(B_m, 2.0) - (C * (A * 4.0));
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-84) {
tmp = -Math.sqrt(((2.0 * (F * t_0)) * (A + A))) / t_0;
} else if (Math.pow(B_m, 2.0) <= 5e+52) {
tmp = Math.sqrt((F * (-0.5 * (Math.pow(B_m, 2.0) / C)))) * (-Math.sqrt(2.0) / B_m);
} else {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (-1.0 / (B_m / Math.sqrt(2.0)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = math.pow(B_m, 2.0) - (C * (A * 4.0)) tmp = 0 if math.pow(B_m, 2.0) <= 1e-84: tmp = -math.sqrt(((2.0 * (F * t_0)) * (A + A))) / t_0 elif math.pow(B_m, 2.0) <= 5e+52: tmp = math.sqrt((F * (-0.5 * (math.pow(B_m, 2.0) / C)))) * (-math.sqrt(2.0) / B_m) else: tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (-1.0 / (B_m / math.sqrt(2.0))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64((B_m ^ 2.0) - Float64(C * Float64(A * 4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-84) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(A + A)))) / t_0); elseif ((B_m ^ 2.0) <= 5e+52) tmp = Float64(sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C)))) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(-1.0 / Float64(B_m / sqrt(2.0)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (B_m ^ 2.0) - (C * (A * 4.0));
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-84)
tmp = -sqrt(((2.0 * (F * t_0)) * (A + A))) / t_0;
elseif ((B_m ^ 2.0) <= 5e+52)
tmp = sqrt((F * (-0.5 * ((B_m ^ 2.0) / C)))) * (-sqrt(2.0) / B_m);
else
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-84], N[((-N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+52], N[(N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $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 := {B_m}^{2} - C \cdot \left(A \cdot 4\right)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-84}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(F \cdot t_0\right)\right) \cdot \left(A + A\right)}}{t_0}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+52}:\\
\;\;\;\;\sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-1}{\frac{B_m}{\sqrt{2}}}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-84Initial program 17.2%
+-commutative17.2%
unpow217.2%
unpow217.2%
hypot-udef27.7%
add-exp-log26.1%
Applied egg-rr26.1%
Taylor expanded in C around inf 25.2%
sub-neg25.2%
mul-1-neg25.2%
remove-double-neg25.2%
Simplified25.2%
if 1e-84 < (pow.f64 B 2) < 5e52Initial program 24.1%
Simplified22.3%
Taylor expanded in A around 0 10.2%
mul-1-neg10.2%
*-commutative10.2%
distribute-rgt-neg-in10.2%
unpow210.2%
unpow210.2%
hypot-def10.4%
Simplified10.4%
Taylor expanded in C around inf 18.8%
if 5e52 < (pow.f64 B 2) Initial program 17.5%
Simplified13.3%
Taylor expanded in C around 0 14.5%
mul-1-neg14.5%
distribute-rgt-neg-in14.5%
+-commutative14.5%
unpow214.5%
unpow214.5%
hypot-def24.3%
Simplified24.3%
clear-num24.3%
inv-pow24.3%
Applied egg-rr24.3%
unpow-124.3%
Simplified24.3%
Final simplification24.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 -2.55e+29) (* (/ (sqrt 2.0) B_m) (- (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) C))))) (* (sqrt (* F (- A (hypot B_m A)))) (/ (- (sqrt 2.0)) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -2.55e+29) {
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * ((pow(B_m, 2.0) * F) / C)));
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-sqrt(2.0) / 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 <= -2.55e+29) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((-0.5 * ((Math.pow(B_m, 2.0) * F) / C)));
} else {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (-Math.sqrt(2.0) / B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= -2.55e+29: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((-0.5 * ((math.pow(B_m, 2.0) * F) / C))) else: tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (-math.sqrt(2.0) / B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= -2.55e+29) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / C))))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= -2.55e+29)
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * (((B_m ^ 2.0) * F) / C)));
else
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, -2.55e+29], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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}
\mathbf{if}\;F \leq -2.55 \cdot 10^{+29}:\\
\;\;\;\;\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B_m}^{2} \cdot F}{C}}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if F < -2.55e29Initial program 7.1%
Simplified7.3%
Taylor expanded in A around 0 5.8%
mul-1-neg5.8%
*-commutative5.8%
distribute-rgt-neg-in5.8%
unpow25.8%
unpow25.8%
hypot-def9.3%
Simplified9.3%
Taylor expanded in C around inf 13.7%
if -2.55e29 < F Initial program 24.9%
Simplified24.3%
Taylor expanded in C around 0 12.2%
mul-1-neg12.2%
distribute-rgt-neg-in12.2%
+-commutative12.2%
unpow212.2%
unpow212.2%
hypot-def19.5%
Simplified19.5%
Final simplification17.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 (<= F -2.55e+29) (* (/ (sqrt 2.0) B_m) (- (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) C))))) (* (sqrt (* F (- A (hypot B_m A)))) (/ -1.0 (/ B_m (sqrt 2.0))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -2.55e+29) {
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * ((pow(B_m, 2.0) * F) / C)));
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
}
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 <= -2.55e+29) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((-0.5 * ((Math.pow(B_m, 2.0) * F) / C)));
} else {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (-1.0 / (B_m / Math.sqrt(2.0)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= -2.55e+29: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((-0.5 * ((math.pow(B_m, 2.0) * F) / C))) else: tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (-1.0 / (B_m / math.sqrt(2.0))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= -2.55e+29) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / C))))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(-1.0 / Float64(B_m / sqrt(2.0)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= -2.55e+29)
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * (((B_m ^ 2.0) * F) / C)));
else
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-1.0 / (B_m / sqrt(2.0)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, -2.55e+29], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $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 -2.55 \cdot 10^{+29}:\\
\;\;\;\;\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B_m}^{2} \cdot F}{C}}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-1}{\frac{B_m}{\sqrt{2}}}\\
\end{array}
\end{array}
if F < -2.55e29Initial program 7.1%
Simplified7.3%
Taylor expanded in A around 0 5.8%
mul-1-neg5.8%
*-commutative5.8%
distribute-rgt-neg-in5.8%
unpow25.8%
unpow25.8%
hypot-def9.3%
Simplified9.3%
Taylor expanded in C around inf 13.7%
if -2.55e29 < F Initial program 24.9%
Simplified24.3%
Taylor expanded in C around 0 12.2%
mul-1-neg12.2%
distribute-rgt-neg-in12.2%
+-commutative12.2%
unpow212.2%
unpow212.2%
hypot-def19.5%
Simplified19.5%
clear-num19.5%
inv-pow19.5%
Applied egg-rr19.5%
unpow-119.5%
Simplified19.5%
Final simplification17.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (* F (- A (hypot B_m A)))) (/ (- (sqrt 2.0)) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((F * (A - hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (-Math.sqrt(2.0) / B_m);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((F * (A - math.hypot(B_m, A)))) * (-math.sqrt(2.0) / B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(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 * (A - hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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])\\
\\
\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}
\end{array}
Initial program 18.2%
Simplified17.9%
Taylor expanded in C around 0 9.6%
mul-1-neg9.6%
distribute-rgt-neg-in9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-def15.0%
Simplified15.0%
Final simplification15.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (/ (- (sqrt 2.0)) B_m) (sqrt (* F (- 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) {
return (-sqrt(2.0) / B_m) * sqrt((F * (A - 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) / b_m) * sqrt((f * (a - 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) / B_m) * Math.sqrt((F * (A - 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) / B_m) * math.sqrt((F * (A - B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(F * Float64(A - 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) / B_m) * sqrt((F * (A - 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[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-\sqrt{2}}{B_m} \cdot \sqrt{F \cdot \left(A - B_m\right)}
\end{array}
Initial program 18.2%
Simplified17.9%
Taylor expanded in C around 0 9.6%
mul-1-neg9.6%
distribute-rgt-neg-in9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-def15.0%
Simplified15.0%
Taylor expanded in A around 0 12.8%
mul-1-neg12.8%
unsub-neg12.8%
Simplified12.8%
Final simplification12.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 (* (/ (sqrt 2.0) B_m) (- (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) {
return (sqrt(2.0) / B_m) * -sqrt((B_m * -F));
}
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) / b_m) * -sqrt((b_m * -f))
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) / B_m) * -Math.sqrt((B_m * -F));
}
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) / B_m) * -math.sqrt((B_m * -F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(B_m * Float64(-F))))) 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) / B_m) * -sqrt((B_m * -F));
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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{B_m \cdot \left(-F\right)}\right)
\end{array}
Initial program 18.2%
Simplified17.9%
Taylor expanded in C around 0 9.6%
mul-1-neg9.6%
distribute-rgt-neg-in9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-def15.0%
Simplified15.0%
Taylor expanded in A around 0 13.3%
associate-*r*13.3%
mul-1-neg13.3%
Simplified13.3%
Final simplification13.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* -2.0 (/ (pow (* A F) 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) {
return -2.0 * (pow((A * F), 0.5) / 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 = (-2.0d0) * (((a * f) ** 0.5d0) / 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 -2.0 * (Math.pow((A * F), 0.5) / 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 -2.0 * (math.pow((A * F), 0.5) / 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(-2.0 * Float64((Float64(A * F) ^ 0.5) / 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 = -2.0 * (((A * F) ^ 0.5) / 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[(-2.0 * N[(N[Power[N[(A * F), $MachinePrecision], 0.5], $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])\\
\\
-2 \cdot \frac{{\left(A \cdot F\right)}^{0.5}}{B_m}
\end{array}
Initial program 18.2%
Simplified17.9%
Taylor expanded in A around -inf 7.9%
Taylor expanded in C around 0 3.0%
associate-*r/3.0%
*-rgt-identity3.0%
*-commutative3.0%
Simplified3.0%
pow1/23.1%
*-commutative3.1%
Applied egg-rr3.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 (* -2.0 (/ (sqrt (* A 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 -2.0 * (sqrt((A * 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 = (-2.0d0) * (sqrt((a * 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 -2.0 * (Math.sqrt((A * 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 -2.0 * (math.sqrt((A * 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(-2.0 * Float64(sqrt(Float64(A * 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 = -2.0 * (sqrt((A * 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[(-2.0 * N[(N[Sqrt[N[(A * F), $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])\\
\\
-2 \cdot \frac{\sqrt{A \cdot F}}{B_m}
\end{array}
Initial program 18.2%
Simplified17.9%
Taylor expanded in A around -inf 7.9%
Taylor expanded in C around 0 3.0%
associate-*r/3.0%
*-rgt-identity3.0%
*-commutative3.0%
Simplified3.0%
Final simplification3.0%
herbie shell --seed 2023339
(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))))