
(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 (* (* 4.0 A) C)) (t_1 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-35)
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+
A
(+ A (* -0.5 (/ (- (+ (pow B_m 2.0) (pow A 2.0)) (pow A 2.0)) C))))))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+114)
(/ (sqrt (* t_1 (* F (* 2.0 (+ C (- A (hypot (- A C) B_m))))))) (- t_1))
(/ (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 = (4.0 * A) * C;
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 5e-35) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (A + (A + (-0.5 * (((pow(B_m, 2.0) + pow(A, 2.0)) - pow(A, 2.0)) / C)))))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+114) {
tmp = sqrt((t_1 * (F * (2.0 * (C + (A - hypot((A - C), B_m))))))) / -t_1;
} 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 = Float64(Float64(4.0 * A) * C) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-35) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64(Float64((B_m ^ 2.0) + (A ^ 2.0)) - (A ^ 2.0)) / C)))))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+114) tmp = Float64(sqrt(Float64(t_1 * Float64(F * Float64(2.0 * Float64(C + Float64(A - hypot(Float64(A - C), B_m))))))) / Float64(-t_1)); else tmp = Float64(sqrt(Float64(Float64(2.0 * 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = 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-35], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(A + N[(A + N[(-0.5 * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[A, 2.0], $MachinePrecision]), $MachinePrecision] - N[Power[A, 2.0], $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+114], N[(N[Sqrt[N[(t$95$1 * N[(F * N[(2.0 * N[(C + N[(A - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-35}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(A + \left(A + -0.5 \cdot \frac{\left({B\_m}^{2} + {A}^{2}\right) - {A}^{2}}{C}\right)\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+114}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(F \cdot \left(2 \cdot \left(C + \left(A - \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 4.99999999999999964e-35Initial program 29.6%
Taylor expanded in C around inf 23.6%
associate--l+23.6%
+-commutative23.6%
unpow223.6%
mul-1-neg23.6%
mul-1-neg23.6%
sqr-neg23.6%
unpow223.6%
mul-1-neg23.6%
Simplified23.6%
if 4.99999999999999964e-35 < (pow.f64 B 2) < 1e114Initial program 38.0%
Simplified53.3%
distribute-frac-neg253.3%
Applied egg-rr54.9%
if 1e114 < (pow.f64 B 2) Initial program 8.6%
Taylor expanded in C around 0 9.5%
mul-1-neg9.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define23.6%
Simplified23.6%
associate-*l/23.6%
pow1/223.6%
pow1/223.6%
pow-prod-down23.7%
hypot-undefine9.5%
unpow29.5%
unpow29.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define23.7%
Applied egg-rr23.7%
unpow1/223.7%
associate-*r*23.7%
*-commutative23.7%
hypot-undefine9.5%
unpow29.5%
unpow29.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define23.7%
Simplified23.7%
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 (* (* 4.0 A) C)) (t_1 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-35)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+114)
(/ (sqrt (* t_1 (* F (* 2.0 (+ C (- A (hypot (- A C) B_m))))))) (- t_1))
(/ (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 = (4.0 * A) * C;
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 5e-35) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+114) {
tmp = sqrt((t_1 * (F * (2.0 * (C + (A - hypot((A - C), B_m))))))) / -t_1;
} 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 = Float64(Float64(4.0 * A) * C) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-35) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+114) tmp = Float64(sqrt(Float64(t_1 * Float64(F * Float64(2.0 * Float64(C + Float64(A - hypot(Float64(A - C), B_m))))))) / Float64(-t_1)); else tmp = Float64(sqrt(Float64(Float64(2.0 * 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = 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-35], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+114], N[(N[Sqrt[N[(t$95$1 * N[(F * N[(2.0 * N[(C + N[(A - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-35}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+114}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(F \cdot \left(2 \cdot \left(C + \left(A - \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 4.99999999999999964e-35Initial program 29.6%
Taylor expanded in A around -inf 25.0%
if 4.99999999999999964e-35 < (pow.f64 B 2) < 1e114Initial program 38.0%
Simplified53.3%
distribute-frac-neg253.3%
Applied egg-rr54.9%
if 1e114 < (pow.f64 B 2) Initial program 8.6%
Taylor expanded in C around 0 9.5%
mul-1-neg9.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define23.6%
Simplified23.6%
associate-*l/23.6%
pow1/223.6%
pow1/223.6%
pow-prod-down23.7%
hypot-undefine9.5%
unpow29.5%
unpow29.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define23.7%
Applied egg-rr23.7%
unpow1/223.7%
associate-*r*23.7%
*-commutative23.7%
hypot-undefine9.5%
unpow29.5%
unpow29.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define23.7%
Simplified23.7%
Final simplification27.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= B_m 4.25e-16)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A)))
(- t_0 (pow B_m 2.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 = (4.0 * A) * C;
double tmp;
if (B_m <= 4.25e-16) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
} 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 t_0 = (4.0 * A) * C;
double tmp;
if (B_m <= 4.25e-16) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - Math.pow(B_m, 2.0));
} 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): t_0 = (4.0 * A) * C tmp = 0 if B_m <= 4.25e-16: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - math.pow(B_m, 2.0)) 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) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (B_m <= 4.25e-16) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(Float64(2.0 * 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)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if (B_m <= 4.25e-16)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - (B_m ^ 2.0));
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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 4.25e-16], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 4.25 \cdot 10^{-16}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 4.25e-16Initial program 24.3%
Taylor expanded in A around -inf 17.4%
if 4.25e-16 < B Initial program 11.2%
Taylor expanded in C around 0 17.5%
mul-1-neg17.5%
+-commutative17.5%
unpow217.5%
unpow217.5%
hypot-define40.7%
Simplified40.7%
associate-*l/40.6%
pow1/240.6%
pow1/240.6%
pow-prod-down40.8%
hypot-undefine17.6%
unpow217.6%
unpow217.6%
+-commutative17.6%
unpow217.6%
unpow217.6%
hypot-define40.8%
Applied egg-rr40.8%
unpow1/240.8%
associate-*r*40.8%
*-commutative40.8%
hypot-undefine17.5%
unpow217.5%
unpow217.5%
+-commutative17.5%
unpow217.5%
unpow217.5%
hypot-define40.8%
Simplified40.8%
Final simplification23.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 5e-57)
(/
(sqrt (* 2.0 (* -4.0 (* A (* C (* F (* 2.0 A)))))))
(- (* 4.0 (* A C)) (pow B_m 2.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 tmp;
if (pow(B_m, 2.0) <= 5e-57) {
tmp = sqrt((2.0 * (-4.0 * (A * (C * (F * (2.0 * A))))))) / ((4.0 * (A * C)) - pow(B_m, 2.0));
} 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) <= 5e-57) {
tmp = Math.sqrt((2.0 * (-4.0 * (A * (C * (F * (2.0 * A))))))) / ((4.0 * (A * C)) - Math.pow(B_m, 2.0));
} 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) <= 5e-57: tmp = math.sqrt((2.0 * (-4.0 * (A * (C * (F * (2.0 * A))))))) / ((4.0 * (A * C)) - math.pow(B_m, 2.0)) 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) <= 5e-57) tmp = Float64(sqrt(Float64(2.0 * Float64(-4.0 * Float64(A * Float64(C * Float64(F * Float64(2.0 * A))))))) / Float64(Float64(4.0 * Float64(A * C)) - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(Float64(2.0 * 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) <= 5e-57)
tmp = sqrt((2.0 * (-4.0 * (A * (C * (F * (2.0 * A))))))) / ((4.0 * (A * C)) - (B_m ^ 2.0));
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], 5e-57], N[(N[Sqrt[N[(2.0 * N[(-4.0 * N[(A * N[(C * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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 5 \cdot 10^{-57}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(-4 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)\right)\right)}}{4 \cdot \left(A \cdot C\right) - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 5.0000000000000002e-57Initial program 26.8%
Simplified28.8%
Taylor expanded in C around inf 22.9%
mul-1-neg22.9%
Simplified22.9%
pow122.9%
neg-mul-122.9%
cancel-sign-sub-inv22.9%
metadata-eval22.9%
*-un-lft-identity22.9%
Applied egg-rr22.9%
unpow122.9%
count-222.9%
*-commutative22.9%
Simplified22.9%
if 5.0000000000000002e-57 < (pow.f64 B 2) Initial program 16.5%
Taylor expanded in C around 0 9.0%
mul-1-neg9.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.1%
Simplified20.1%
associate-*l/20.1%
pow1/220.1%
pow1/220.1%
pow-prod-down20.2%
hypot-undefine9.0%
unpow29.0%
unpow29.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.2%
Applied egg-rr20.2%
unpow1/220.2%
associate-*r*20.2%
*-commutative20.2%
hypot-undefine9.0%
unpow29.0%
unpow29.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.2%
Simplified20.2%
Final simplification21.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 (<= (pow B_m 2.0) 5e-57)
(/
(sqrt (* -8.0 (* (* 2.0 A) (* A (* C F)))))
(- (* (* 4.0 A) C) (pow B_m 2.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 tmp;
if (pow(B_m, 2.0) <= 5e-57) {
tmp = sqrt((-8.0 * ((2.0 * A) * (A * (C * F))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} 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) <= 5e-57) {
tmp = Math.sqrt((-8.0 * ((2.0 * A) * (A * (C * F))))) / (((4.0 * A) * C) - Math.pow(B_m, 2.0));
} 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) <= 5e-57: tmp = math.sqrt((-8.0 * ((2.0 * A) * (A * (C * F))))) / (((4.0 * A) * C) - math.pow(B_m, 2.0)) 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) <= 5e-57) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(2.0 * A) * Float64(A * Float64(C * F))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(Float64(2.0 * 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) <= 5e-57)
tmp = sqrt((-8.0 * ((2.0 * A) * (A * (C * F))))) / (((4.0 * A) * C) - (B_m ^ 2.0));
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], 5e-57], N[(N[Sqrt[N[(-8.0 * N[(N[(2.0 * A), $MachinePrecision] * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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 5 \cdot 10^{-57}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(2 \cdot A\right) \cdot \left(A \cdot \left(C \cdot F\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 5.0000000000000002e-57Initial program 26.8%
Simplified28.8%
Taylor expanded in C around inf 22.9%
mul-1-neg22.9%
Simplified22.9%
div-inv22.8%
associate-*r*22.8%
metadata-eval22.8%
associate-*r*22.9%
neg-mul-122.9%
cancel-sign-sub-inv22.9%
metadata-eval22.9%
*-un-lft-identity22.9%
Applied egg-rr22.9%
associate-*r/22.9%
*-commutative22.9%
*-lft-identity22.9%
associate-*r*23.9%
associate-*r*20.2%
*-commutative20.2%
count-220.2%
*-commutative20.2%
associate-*r*20.2%
Simplified20.2%
if 5.0000000000000002e-57 < (pow.f64 B 2) Initial program 16.5%
Taylor expanded in C around 0 9.0%
mul-1-neg9.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.1%
Simplified20.1%
associate-*l/20.1%
pow1/220.1%
pow1/220.1%
pow-prod-down20.2%
hypot-undefine9.0%
unpow29.0%
unpow29.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.2%
Applied egg-rr20.2%
unpow1/220.2%
associate-*r*20.2%
*-commutative20.2%
hypot-undefine9.0%
unpow29.0%
unpow29.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.2%
Simplified20.2%
Final simplification20.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 5e-57)
(/
(sqrt (* (* F (* 2.0 A)) (* (* A C) -8.0)))
(- (* (* 4.0 A) C) (pow B_m 2.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 tmp;
if (pow(B_m, 2.0) <= 5e-57) {
tmp = sqrt(((F * (2.0 * A)) * ((A * C) * -8.0))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} 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) <= 5e-57) {
tmp = Math.sqrt(((F * (2.0 * A)) * ((A * C) * -8.0))) / (((4.0 * A) * C) - Math.pow(B_m, 2.0));
} 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) <= 5e-57: tmp = math.sqrt(((F * (2.0 * A)) * ((A * C) * -8.0))) / (((4.0 * A) * C) - math.pow(B_m, 2.0)) 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) <= 5e-57) tmp = Float64(sqrt(Float64(Float64(F * Float64(2.0 * A)) * Float64(Float64(A * C) * -8.0))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(Float64(2.0 * 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) <= 5e-57)
tmp = sqrt(((F * (2.0 * A)) * ((A * C) * -8.0))) / (((4.0 * A) * C) - (B_m ^ 2.0));
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], 5e-57], N[(N[Sqrt[N[(N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision] * N[(N[(A * C), $MachinePrecision] * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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 5 \cdot 10^{-57}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \left(2 \cdot A\right)\right) \cdot \left(\left(A \cdot C\right) \cdot -8\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 5.0000000000000002e-57Initial program 26.8%
Simplified28.8%
Taylor expanded in C around inf 22.9%
mul-1-neg22.9%
Simplified22.9%
div-inv22.8%
associate-*r*22.8%
metadata-eval22.8%
associate-*r*22.9%
neg-mul-122.9%
cancel-sign-sub-inv22.9%
metadata-eval22.9%
*-un-lft-identity22.9%
Applied egg-rr22.9%
associate-*r/22.9%
*-commutative22.9%
*-lft-identity22.9%
associate-*r*22.9%
count-222.9%
*-commutative22.9%
associate-*r*22.9%
Simplified22.9%
if 5.0000000000000002e-57 < (pow.f64 B 2) Initial program 16.5%
Taylor expanded in C around 0 9.0%
mul-1-neg9.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.1%
Simplified20.1%
associate-*l/20.1%
pow1/220.1%
pow1/220.1%
pow-prod-down20.2%
hypot-undefine9.0%
unpow29.0%
unpow29.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.2%
Applied egg-rr20.2%
unpow1/220.2%
associate-*r*20.2%
*-commutative20.2%
hypot-undefine9.0%
unpow29.0%
unpow29.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-define20.2%
Simplified20.2%
Final simplification21.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 (<= A -4e+244) (* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* 2.0 A))))) (* (sqrt (* B_m (- F))) (/ (sqrt 2.0) (- B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -4e+244) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (2.0 * A)));
} else {
tmp = sqrt((B_m * -F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-4d+244)) then
tmp = (sqrt(2.0d0) / b_m) * -sqrt((f * (2.0d0 * a)))
else
tmp = sqrt((b_m * -f)) * (sqrt(2.0d0) / -b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -4e+244) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (2.0 * A)));
} else {
tmp = Math.sqrt((B_m * -F)) * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -4e+244: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (2.0 * A))) else: tmp = math.sqrt((B_m * -F)) * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= -4e+244) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(2.0 * A))))); else tmp = Float64(sqrt(Float64(B_m * Float64(-F))) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (A <= -4e+244)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (2.0 * A)));
else
tmp = sqrt((B_m * -F)) * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -4e+244], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -4 \cdot 10^{+244}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(2 \cdot A\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{B\_m \cdot \left(-F\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if A < -4.0000000000000003e244Initial program 0.4%
Taylor expanded in C around 0 0.9%
mul-1-neg0.9%
+-commutative0.9%
unpow20.9%
unpow20.9%
hypot-define20.5%
Simplified20.5%
Taylor expanded in A around -inf 20.5%
associate-*r*20.5%
count-220.5%
*-commutative20.5%
count-220.5%
*-commutative20.5%
Simplified20.5%
if -4.0000000000000003e244 < A Initial program 21.6%
Taylor expanded in C around 0 7.8%
mul-1-neg7.8%
+-commutative7.8%
unpow27.8%
unpow27.8%
hypot-define14.5%
Simplified14.5%
Taylor expanded in A around 0 13.3%
mul-1-neg13.3%
Simplified13.3%
Final simplification13.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 (/ (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) {
return sqrt(((2.0 * F) * (A - hypot(B_m, A)))) / -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(((2.0 * F) * (A - Math.hypot(B_m, 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 * F) * (A - math.hypot(B_m, 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(sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A)))) / 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 * F) * (A - hypot(B_m, 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[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}
\end{array}
Initial program 20.8%
Taylor expanded in C around 0 7.6%
mul-1-neg7.6%
+-commutative7.6%
unpow27.6%
unpow27.6%
hypot-define14.7%
Simplified14.7%
associate-*l/14.7%
pow1/214.7%
pow1/214.8%
pow-prod-down14.9%
hypot-undefine7.7%
unpow27.7%
unpow27.7%
+-commutative7.7%
unpow27.7%
unpow27.7%
hypot-define14.9%
Applied egg-rr14.9%
unpow1/214.8%
associate-*r*14.8%
*-commutative14.8%
hypot-undefine7.6%
unpow27.6%
unpow27.6%
+-commutative7.6%
unpow27.6%
unpow27.6%
hypot-define14.8%
Simplified14.8%
Final simplification14.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 (* B_m (- F))) (/ (sqrt 2.0) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((B_m * -F)) * (sqrt(2.0) / -B_m);
}
B_m = abs(B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((b_m * -f)) * (sqrt(2.0d0) / -b_m)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((B_m * -F)) * (Math.sqrt(2.0) / -B_m);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((B_m * -F)) * (math.sqrt(2.0) / -B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(B_m * Float64(-F))) * Float64(sqrt(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)) * (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[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{B\_m \cdot \left(-F\right)} \cdot \frac{\sqrt{2}}{-B\_m}
\end{array}
Initial program 20.8%
Taylor expanded in C around 0 7.6%
mul-1-neg7.6%
+-commutative7.6%
unpow27.6%
unpow27.6%
hypot-define14.7%
Simplified14.7%
Taylor expanded in A around 0 12.9%
mul-1-neg12.9%
Simplified12.9%
Final simplification12.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (* B_m F)) (/ (sqrt 2.0) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((B_m * F)) * (sqrt(2.0) / -B_m);
}
B_m = abs(B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((b_m * f)) * (sqrt(2.0d0) / -b_m)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((B_m * F)) * (Math.sqrt(2.0) / -B_m);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((B_m * F)) * (math.sqrt(2.0) / -B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(B_m * F)) * Float64(sqrt(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)) * (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[(B$95$m * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{B\_m \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}
\end{array}
Initial program 20.8%
Taylor expanded in C around 0 7.6%
mul-1-neg7.6%
+-commutative7.6%
unpow27.6%
unpow27.6%
hypot-define14.7%
Simplified14.7%
Taylor expanded in B around -inf 1.5%
Final simplification1.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 (* (* 0.25 (sqrt (/ F C))) (sqrt -16.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) {
return (0.25 * sqrt((F / C))) * sqrt(-16.0);
}
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 = (0.25d0 * sqrt((f / c))) * sqrt((-16.0d0))
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 (0.25 * Math.sqrt((F / C))) * Math.sqrt(-16.0);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return (0.25 * math.sqrt((F / C))) * math.sqrt(-16.0)
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(0.25 * sqrt(Float64(F / C))) * sqrt(-16.0)) 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 = (0.25 * sqrt((F / C))) * sqrt(-16.0);
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[(0.25 * N[Sqrt[N[(F / C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[-16.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\left(0.25 \cdot \sqrt{\frac{F}{C}}\right) \cdot \sqrt{-16}
\end{array}
Initial program 20.8%
Simplified20.4%
Taylor expanded in C around inf 12.4%
mul-1-neg12.4%
Simplified12.4%
Taylor expanded in A around inf 0.0%
associate-*r*0.0%
Simplified0.0%
Final simplification0.0%
herbie shell --seed 2024044
(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))))