
(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 13 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)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* A (* C -4.0)))
(t_1 (fma B_m B_m t_0))
(t_2 (sqrt (+ A (+ C (hypot B_m (- A C))))))
(t_3 (/ (* t_2 (- (sqrt (* t_1 (* 2.0 F))))) t_1)))
(if (<= (pow B_m 2.0) 2e-167)
t_3
(if (<= (pow B_m 2.0) 5e-93)
(/
(*
(pow (sqrt (* (hypot B_m (sqrt t_0)) (sqrt (* 2.0 F)))) 2.0)
(- t_2))
t_1)
(if (<= (pow B_m 2.0) 1e+130)
t_3
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (- (sqrt 2.0)) B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = A * (C * -4.0);
double t_1 = fma(B_m, B_m, t_0);
double t_2 = sqrt((A + (C + hypot(B_m, (A - C)))));
double t_3 = (t_2 * -sqrt((t_1 * (2.0 * F)))) / t_1;
double tmp;
if (pow(B_m, 2.0) <= 2e-167) {
tmp = t_3;
} else if (pow(B_m, 2.0) <= 5e-93) {
tmp = (pow(sqrt((hypot(B_m, sqrt(t_0)) * sqrt((2.0 * F)))), 2.0) * -t_2) / t_1;
} else if (pow(B_m, 2.0) <= 1e+130) {
tmp = t_3;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = Float64(A * Float64(C * -4.0)) t_1 = fma(B_m, B_m, t_0) t_2 = sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) t_3 = Float64(Float64(t_2 * Float64(-sqrt(Float64(t_1 * Float64(2.0 * F))))) / t_1) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-167) tmp = t_3; elseif ((B_m ^ 2.0) <= 5e-93) tmp = Float64(Float64((sqrt(Float64(hypot(B_m, sqrt(t_0)) * sqrt(Float64(2.0 * F)))) ^ 2.0) * Float64(-t_2)) / t_1); elseif ((B_m ^ 2.0) <= 1e+130) tmp = t_3; else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[(t$95$2 * (-N[Sqrt[N[(t$95$1 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-167], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-93], N[(N[(N[Power[N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + N[Sqrt[t$95$0], $MachinePrecision] ^ 2], $MachinePrecision] * N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision] * (-t$95$2)), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+130], t$95$3, N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := A \cdot \left(C \cdot -4\right)\\
t_1 := \mathsf{fma}\left(B_m, B_m, t_0\right)\\
t_2 := \sqrt{A + \left(C + \mathsf{hypot}\left(B_m, A - C\right)\right)}\\
t_3 := \frac{t_2 \cdot \left(-\sqrt{t_1 \cdot \left(2 \cdot F\right)}\right)}{t_1}\\
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{-167}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{-93}:\\
\;\;\;\;\frac{{\left(\sqrt{\mathsf{hypot}\left(B_m, \sqrt{t_0}\right) \cdot \sqrt{2 \cdot F}}\right)}^{2} \cdot \left(-t_2\right)}{t_1}\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{+130}:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B_m\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 2e-167 or 4.99999999999999994e-93 < (pow.f64 B 2) < 1.0000000000000001e130Initial program 32.0%
Simplified39.6%
pow1/239.6%
*-commutative39.6%
unpow-prod-down46.1%
pow1/246.1%
pow1/246.1%
*-commutative46.1%
Applied egg-rr46.1%
if 2e-167 < (pow.f64 B 2) < 4.99999999999999994e-93Initial program 11.6%
Simplified14.7%
pow1/214.7%
*-commutative14.7%
unpow-prod-down21.3%
pow1/221.3%
pow1/221.3%
*-commutative21.3%
Applied egg-rr21.3%
add-sqr-sqrt21.4%
pow221.4%
sqrt-prod48.7%
fma-udef48.7%
add-sqr-sqrt48.7%
hypot-def48.7%
Applied egg-rr48.7%
if 1.0000000000000001e130 < (pow.f64 B 2) Initial program 8.5%
Simplified11.8%
Taylor expanded in A around 0 9.4%
mul-1-neg9.4%
distribute-rgt-neg-in9.4%
unpow29.4%
unpow29.4%
hypot-def28.2%
Simplified28.2%
pow1/228.3%
*-commutative28.3%
hypot-udef9.5%
unpow29.5%
unpow29.5%
unpow-prod-down13.1%
Applied egg-rr35.9%
Final simplification42.2%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* A (* C -4.0)))
(t_1 (fma B_m B_m t_0))
(t_2 (sqrt (+ A (+ C (hypot B_m (- A C))))))
(t_3 (/ (* t_2 (- (sqrt (* t_1 (* 2.0 F))))) t_1)))
(if (<= (pow B_m 2.0) 2e-167)
t_3
(if (<= (pow B_m 2.0) 5e-93)
(/ (* t_2 (* (hypot B_m (sqrt t_0)) (- (sqrt (* 2.0 F))))) t_1)
(if (<= (pow B_m 2.0) 1e+130)
t_3
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (- (sqrt 2.0)) B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = A * (C * -4.0);
double t_1 = fma(B_m, B_m, t_0);
double t_2 = sqrt((A + (C + hypot(B_m, (A - C)))));
double t_3 = (t_2 * -sqrt((t_1 * (2.0 * F)))) / t_1;
double tmp;
if (pow(B_m, 2.0) <= 2e-167) {
tmp = t_3;
} else if (pow(B_m, 2.0) <= 5e-93) {
tmp = (t_2 * (hypot(B_m, sqrt(t_0)) * -sqrt((2.0 * F)))) / t_1;
} else if (pow(B_m, 2.0) <= 1e+130) {
tmp = t_3;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = Float64(A * Float64(C * -4.0)) t_1 = fma(B_m, B_m, t_0) t_2 = sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) t_3 = Float64(Float64(t_2 * Float64(-sqrt(Float64(t_1 * Float64(2.0 * F))))) / t_1) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-167) tmp = t_3; elseif ((B_m ^ 2.0) <= 5e-93) tmp = Float64(Float64(t_2 * Float64(hypot(B_m, sqrt(t_0)) * Float64(-sqrt(Float64(2.0 * F))))) / t_1); elseif ((B_m ^ 2.0) <= 1e+130) tmp = t_3; else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[(t$95$2 * (-N[Sqrt[N[(t$95$1 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-167], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-93], N[(N[(t$95$2 * N[(N[Sqrt[B$95$m ^ 2 + N[Sqrt[t$95$0], $MachinePrecision] ^ 2], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+130], t$95$3, N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := A \cdot \left(C \cdot -4\right)\\
t_1 := \mathsf{fma}\left(B_m, B_m, t_0\right)\\
t_2 := \sqrt{A + \left(C + \mathsf{hypot}\left(B_m, A - C\right)\right)}\\
t_3 := \frac{t_2 \cdot \left(-\sqrt{t_1 \cdot \left(2 \cdot F\right)}\right)}{t_1}\\
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{-167}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{-93}:\\
\;\;\;\;\frac{t_2 \cdot \left(\mathsf{hypot}\left(B_m, \sqrt{t_0}\right) \cdot \left(-\sqrt{2 \cdot F}\right)\right)}{t_1}\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{+130}:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B_m\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 2e-167 or 4.99999999999999994e-93 < (pow.f64 B 2) < 1.0000000000000001e130Initial program 32.0%
Simplified39.6%
pow1/239.6%
*-commutative39.6%
unpow-prod-down46.1%
pow1/246.1%
pow1/246.1%
*-commutative46.1%
Applied egg-rr46.1%
if 2e-167 < (pow.f64 B 2) < 4.99999999999999994e-93Initial program 11.6%
Simplified14.7%
pow1/214.7%
*-commutative14.7%
unpow-prod-down21.3%
pow1/221.3%
pow1/221.3%
*-commutative21.3%
Applied egg-rr21.3%
expm1-log1p-u20.7%
expm1-udef10.7%
sqrt-prod19.0%
fma-udef19.0%
add-sqr-sqrt19.0%
hypot-def19.0%
Applied egg-rr19.0%
expm1-def47.2%
expm1-log1p48.6%
Simplified48.6%
if 1.0000000000000001e130 < (pow.f64 B 2) Initial program 8.5%
Simplified11.8%
Taylor expanded in A around 0 9.4%
mul-1-neg9.4%
distribute-rgt-neg-in9.4%
unpow29.4%
unpow29.4%
hypot-def28.2%
Simplified28.2%
pow1/228.3%
*-commutative28.3%
hypot-udef9.5%
unpow29.5%
unpow29.5%
unpow-prod-down13.1%
Applied egg-rr35.9%
Final simplification42.2%
B_m = (fabs.f64 B)
(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+130)
(/
(* (sqrt (+ A (+ C (hypot B_m (- A C))))) (- (sqrt (* t_0 (* 2.0 F)))))
t_0)
(* (* (sqrt (+ C (hypot C B_m))) (sqrt F)) (/ (- (sqrt 2.0)) B_m)))))B_m = fabs(B);
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+130) {
tmp = (sqrt((A + (C + hypot(B_m, (A - C))))) * -sqrt((t_0 * (2.0 * F)))) / t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) 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+130) tmp = Float64(Float64(sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) * Float64(-sqrt(Float64(t_0 * Float64(2.0 * F))))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
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+130], N[(N[(N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\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^{+130}:\\
\;\;\;\;\frac{\sqrt{A + \left(C + \mathsf{hypot}\left(B_m, A - C\right)\right)} \cdot \left(-\sqrt{t_0 \cdot \left(2 \cdot F\right)}\right)}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B_m\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.0000000000000001e130Initial program 29.2%
Simplified36.2%
pow1/236.2%
*-commutative36.2%
unpow-prod-down42.7%
pow1/242.7%
pow1/242.7%
*-commutative42.7%
Applied egg-rr42.7%
if 1.0000000000000001e130 < (pow.f64 B 2) Initial program 8.5%
Simplified11.8%
Taylor expanded in A around 0 9.4%
mul-1-neg9.4%
distribute-rgt-neg-in9.4%
unpow29.4%
unpow29.4%
hypot-def28.2%
Simplified28.2%
pow1/228.3%
*-commutative28.3%
hypot-udef9.5%
unpow29.5%
unpow29.5%
unpow-prod-down13.1%
Applied egg-rr35.9%
Final simplification40.0%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))) (t_1 (* t_0 (* 2.0 F))))
(if (<= (pow B_m 2.0) 1e-228)
(/ (- (sqrt (* t_1 (+ A A)))) t_0)
(if (<= (pow B_m 2.0) 1e-34)
(/ (* (sqrt t_1) (- (sqrt (* 2.0 C)))) t_0)
(* (* (sqrt (+ C (hypot C B_m))) (sqrt F)) (/ (- (sqrt 2.0)) B_m))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = t_0 * (2.0 * F);
double tmp;
if (pow(B_m, 2.0) <= 1e-228) {
tmp = -sqrt((t_1 * (A + A))) / t_0;
} else if (pow(B_m, 2.0) <= 1e-34) {
tmp = (sqrt(t_1) * -sqrt((2.0 * C))) / t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(t_0 * Float64(2.0 * F)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-228) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(A + A)))) / t_0); elseif ((B_m ^ 2.0) <= 1e-34) tmp = Float64(Float64(sqrt(t_1) * Float64(-sqrt(Float64(2.0 * C)))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
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[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-228], N[((-N[Sqrt[N[(t$95$1 * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-34], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * (-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := t_0 \cdot \left(2 \cdot F\right)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-228}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(A + A\right)}}{t_0}\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{-34}:\\
\;\;\;\;\frac{\sqrt{t_1} \cdot \left(-\sqrt{2 \cdot C}\right)}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B_m\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000003e-228Initial program 27.5%
Simplified34.8%
Taylor expanded in C around -inf 32.9%
if 1.00000000000000003e-228 < (pow.f64 B 2) < 9.99999999999999928e-35Initial program 16.5%
Simplified23.3%
pow1/223.3%
*-commutative23.3%
unpow-prod-down32.8%
pow1/232.8%
pow1/232.8%
*-commutative32.8%
Applied egg-rr32.8%
Taylor expanded in A around -inf 29.9%
if 9.99999999999999928e-35 < (pow.f64 B 2) Initial program 18.5%
Simplified22.7%
Taylor expanded in A around 0 12.4%
mul-1-neg12.4%
distribute-rgt-neg-in12.4%
unpow212.4%
unpow212.4%
hypot-def26.7%
Simplified26.7%
pow1/226.7%
*-commutative26.7%
hypot-udef12.5%
unpow212.5%
unpow212.5%
unpow-prod-down15.9%
Applied egg-rr33.1%
Final simplification32.5%
B_m = (fabs.f64 B)
(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+133)
(/ (- (sqrt (* (+ A (+ C (hypot B_m (- A C)))) (* t_0 (* 2.0 F))))) t_0)
(* (* (sqrt (+ C (hypot C B_m))) (sqrt F)) (/ (- (sqrt 2.0)) B_m)))))B_m = fabs(B);
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+133) {
tmp = -sqrt(((A + (C + hypot(B_m, (A - C)))) * (t_0 * (2.0 * F)))) / t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) 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+133) tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) * Float64(t_0 * Float64(2.0 * F))))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
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+133], N[((-N[Sqrt[N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\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^{+133}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(C + \mathsf{hypot}\left(B_m, A - C\right)\right)\right) \cdot \left(t_0 \cdot \left(2 \cdot F\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B_m\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 4.99999999999999961e133Initial program 29.3%
Simplified36.2%
if 4.99999999999999961e133 < (pow.f64 B 2) Initial program 7.8%
Simplified11.1%
Taylor expanded in A around 0 8.7%
mul-1-neg8.7%
distribute-rgt-neg-in8.7%
unpow28.7%
unpow28.7%
hypot-def28.1%
Simplified28.1%
pow1/228.1%
*-commutative28.1%
hypot-udef8.7%
unpow28.7%
unpow28.7%
unpow-prod-down12.4%
Applied egg-rr35.9%
Final simplification36.1%
B_m = (fabs.f64 B)
(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-228)
(/ (- (sqrt (* (* t_0 (* 2.0 F)) (+ A A)))) t_0)
(* (* (sqrt (+ C (hypot C B_m))) (sqrt F)) (/ (- (sqrt 2.0)) B_m)))))B_m = fabs(B);
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-228) {
tmp = -sqrt(((t_0 * (2.0 * F)) * (A + A))) / t_0;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) 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-228) tmp = Float64(Float64(-sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(A + A)))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
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-228], N[((-N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\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^{-228}:\\
\;\;\;\;\frac{-\sqrt{\left(t_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(A + A\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B_m\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000003e-228Initial program 27.5%
Simplified34.8%
Taylor expanded in C around -inf 32.9%
if 1.00000000000000003e-228 < (pow.f64 B 2) Initial program 18.0%
Simplified22.8%
Taylor expanded in A around 0 11.6%
mul-1-neg11.6%
distribute-rgt-neg-in11.6%
unpow211.6%
unpow211.6%
hypot-def22.6%
Simplified22.6%
pow1/222.6%
*-commutative22.6%
hypot-udef11.7%
unpow211.7%
unpow211.7%
unpow-prod-down14.9%
Applied egg-rr28.2%
Final simplification29.6%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 9e-18)
(- (/ (sqrt (* (* t_0 (* 2.0 F)) (* 2.0 C))) t_0))
(* (sqrt (* F (+ A (hypot B_m A)))) (/ (- (sqrt 2.0)) B_m)))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 9e-18) {
tmp = -(sqrt(((t_0 * (2.0 * F)) * (2.0 * C))) / t_0);
} else {
tmp = sqrt((F * (A + hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) 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 <= 9e-18) tmp = Float64(-Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(2.0 * C))) / t_0)); 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 = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 9e-18], (-N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $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[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B_m \leq 9 \cdot 10^{-18}:\\
\;\;\;\;-\frac{\sqrt{\left(t_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t_0}\\
\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 B < 8.99999999999999987e-18Initial program 21.1%
Simplified27.5%
Taylor expanded in A around -inf 16.1%
if 8.99999999999999987e-18 < B Initial program 20.5%
Simplified24.0%
Taylor expanded in C around 0 25.0%
mul-1-neg25.0%
distribute-rgt-neg-in25.0%
+-commutative25.0%
unpow225.0%
unpow225.0%
hypot-def48.7%
Simplified48.7%
Final simplification25.2%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1.5e-73)
(/ (- (sqrt (* (* t_0 (* 2.0 F)) (+ A A)))) t_0)
(* (sqrt (* F (+ A (hypot B_m A)))) (/ (- (sqrt 2.0)) B_m)))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.5e-73) {
tmp = -sqrt(((t_0 * (2.0 * F)) * (A + A))) / t_0;
} else {
tmp = sqrt((F * (A + hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 1.5e-73) tmp = Float64(Float64(-sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(A + A)))) / t_0); 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 = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.5e-73], N[((-N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(A + A), $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[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B_m \leq 1.5 \cdot 10^{-73}:\\
\;\;\;\;\frac{-\sqrt{\left(t_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(A + A\right)}}{t_0}\\
\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 B < 1.5e-73Initial program 20.9%
Simplified26.4%
Taylor expanded in C around -inf 19.1%
if 1.5e-73 < B Initial program 21.0%
Simplified26.7%
Taylor expanded in C around 0 23.8%
mul-1-neg23.8%
distribute-rgt-neg-in23.8%
+-commutative23.8%
unpow223.8%
unpow223.8%
hypot-def43.6%
Simplified43.6%
Final simplification27.2%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 2.4e+54) (* (sqrt (* F (+ A (hypot B_m A)))) (/ (- (sqrt 2.0)) B_m)) (* (sqrt 2.0) (- (sqrt (/ F B_m))))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 2.4e+54) {
tmp = sqrt((F * (A + hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
} else {
tmp = sqrt(2.0) * -sqrt((F / B_m));
}
return tmp;
}
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 2.4e+54) {
tmp = Math.sqrt((F * (A + Math.hypot(B_m, A)))) * (-Math.sqrt(2.0) / B_m);
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 2.4e+54: tmp = math.sqrt((F * (A + math.hypot(B_m, A)))) * (-math.sqrt(2.0) / B_m) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 2.4e+54) tmp = Float64(sqrt(Float64(F * Float64(A + hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B_m)))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 2.4e+54) tmp = sqrt((F * (A + hypot(B_m, A)))) * (-sqrt(2.0) / B_m); else tmp = sqrt(2.0) * -sqrt((F / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 2.4e+54], 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], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 2.4 \cdot 10^{+54}:\\
\;\;\;\;\sqrt{F \cdot \left(A + \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B_m}}\right)\\
\end{array}
\end{array}
if F < 2.39999999999999998e54Initial program 22.2%
Simplified29.7%
Taylor expanded in C around 0 9.0%
mul-1-neg9.0%
distribute-rgt-neg-in9.0%
+-commutative9.0%
unpow29.0%
unpow29.0%
hypot-def19.3%
Simplified19.3%
if 2.39999999999999998e54 < F Initial program 18.2%
Simplified19.7%
Taylor expanded in A around 0 9.5%
mul-1-neg9.5%
Simplified9.5%
Taylor expanded in C around 0 21.0%
Final simplification19.9%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 2.7e+28) (- (/ (sqrt (* (* 2.0 F) (+ C (hypot C B_m)))) B_m)) (* (sqrt 2.0) (- (sqrt (/ F B_m))))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 2.7e+28) {
tmp = -(sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / B_m);
} else {
tmp = sqrt(2.0) * -sqrt((F / B_m));
}
return tmp;
}
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 2.7e+28) {
tmp = -(Math.sqrt(((2.0 * F) * (C + Math.hypot(C, B_m)))) / B_m);
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 2.7e+28: tmp = -(math.sqrt(((2.0 * F) * (C + math.hypot(C, B_m)))) / B_m) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 2.7e+28) tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(C, B_m)))) / B_m)); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B_m)))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 2.7e+28) tmp = -(sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / B_m); else tmp = sqrt(2.0) * -sqrt((F / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 2.7e+28], (-N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 2.7 \cdot 10^{+28}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(C, B_m\right)\right)}}{B_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B_m}}\right)\\
\end{array}
\end{array}
if F < 2.7000000000000002e28Initial program 22.0%
Simplified29.8%
Taylor expanded in A around 0 7.7%
mul-1-neg7.7%
distribute-rgt-neg-in7.7%
unpow27.7%
unpow27.7%
hypot-def18.2%
Simplified18.2%
Applied egg-rr3.7%
expm1-def17.5%
expm1-log1p18.3%
distribute-neg-frac18.3%
unpow1/218.2%
associate-*r*18.2%
Simplified18.2%
if 2.7000000000000002e28 < F Initial program 19.2%
Simplified20.9%
Taylor expanded in A around 0 10.7%
mul-1-neg10.7%
Simplified10.7%
Taylor expanded in C around 0 22.6%
Final simplification19.9%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 5.2e-25) (* (/ (sqrt 2.0) B_m) (- (sqrt (* B_m F)))) (* (sqrt 2.0) (- (sqrt (/ F B_m))))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 5.2e-25) {
tmp = (sqrt(2.0) / B_m) * -sqrt((B_m * F));
} else {
tmp = sqrt(2.0) * -sqrt((F / B_m));
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= 5.2d-25) then
tmp = (sqrt(2.0d0) / b_m) * -sqrt((b_m * f))
else
tmp = sqrt(2.0d0) * -sqrt((f / b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 5.2e-25) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((B_m * F));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 5.2e-25: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((B_m * F)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 5.2e-25) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(B_m * F)))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B_m)))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 5.2e-25) tmp = (sqrt(2.0) / B_m) * -sqrt((B_m * F)); else tmp = sqrt(2.0) * -sqrt((F / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 5.2e-25], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 5.2 \cdot 10^{-25}:\\
\;\;\;\;\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{B_m \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B_m}}\right)\\
\end{array}
\end{array}
if F < 5.2e-25Initial program 21.6%
Simplified30.0%
Taylor expanded in A around 0 7.1%
mul-1-neg7.1%
distribute-rgt-neg-in7.1%
unpow27.1%
unpow27.1%
hypot-def16.6%
Simplified16.6%
Taylor expanded in C around 0 14.5%
if 5.2e-25 < F Initial program 20.1%
Simplified21.9%
Taylor expanded in A around 0 11.1%
mul-1-neg11.1%
Simplified11.1%
Taylor expanded in C around 0 24.0%
Final simplification18.6%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (* (sqrt 2.0) (- (sqrt (/ F B_m)))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
return sqrt(2.0) * -sqrt((F / B_m));
}
B_m = abs(B)
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) * -sqrt((f / b_m))
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(2.0) * -Math.sqrt((F / B_m));
}
B_m = math.fabs(B) def code(A, B_m, C, F): return math.sqrt(2.0) * -math.sqrt((F / B_m))
B_m = abs(B) function code(A, B_m, C, F) return Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B_m)))) end
B_m = abs(B); function tmp = code(A, B_m, C, F) tmp = sqrt(2.0) * -sqrt((F / B_m)); end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B_m}}\right)
\end{array}
Initial program 21.0%
Simplified26.5%
Taylor expanded in A around 0 8.8%
mul-1-neg8.8%
Simplified8.8%
Taylor expanded in C around 0 16.9%
Final simplification16.9%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (* (sqrt (* C F)) (/ (- 2.0) B_m)))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
return sqrt((C * F)) * (-2.0 / B_m);
}
B_m = abs(B)
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((c * f)) * (-2.0d0 / b_m)
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((C * F)) * (-2.0 / B_m);
}
B_m = math.fabs(B) def code(A, B_m, C, F): return math.sqrt((C * F)) * (-2.0 / B_m)
B_m = abs(B) function code(A, B_m, C, F) return Float64(sqrt(Float64(C * F)) * Float64(Float64(-2.0) / B_m)) end
B_m = abs(B); function tmp = code(A, B_m, C, F) tmp = sqrt((C * F)) * (-2.0 / B_m); end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
\sqrt{C \cdot F} \cdot \frac{-2}{B_m}
\end{array}
Initial program 21.0%
Simplified26.5%
Taylor expanded in A around 0 8.8%
mul-1-neg8.8%
distribute-rgt-neg-in8.8%
unpow28.8%
unpow28.8%
hypot-def17.0%
Simplified17.0%
Taylor expanded in B around 0 2.8%
mul-1-neg2.8%
*-commutative2.8%
*-commutative2.8%
unpow22.8%
rem-square-sqrt2.8%
Simplified2.8%
Final simplification2.8%
herbie shell --seed 2023337
(FPCore (A B C F)
:name "ABCF->ab-angle a"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))