
(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 12 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 (+ A (+ C (hypot B_m (- A C)))))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0))))
(t_4 (+ (pow B_m 2.0) (* -4.0 (* A C)))))
(if (<= t_3 -5e-158)
(* (sqrt (* F (/ t_0 (fma -4.0 (* A C) (pow B_m 2.0))))) (- (sqrt 2.0)))
(if (<= t_3 2e+215)
(/
-1.0
(/
t_4
(sqrt
(* (* t_4 (* 2.0 F)) (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C))))))
(if (<= t_3 INFINITY)
(/ (* (sqrt (* F (* 2.0 t_1))) (sqrt t_0)) (- t_1))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (+ C (hypot C B_m))) (- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = A + (C + hypot(B_m, (A - C)));
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double t_4 = pow(B_m, 2.0) + (-4.0 * (A * C));
double tmp;
if (t_3 <= -5e-158) {
tmp = sqrt((F * (t_0 / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_3 <= 2e+215) {
tmp = -1.0 / (t_4 / sqrt(((t_4 * (2.0 * F)) * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((F * (2.0 * t_1))) * sqrt(t_0)) / -t_1;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) t_4 = Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (t_3 <= -5e-158) tmp = Float64(sqrt(Float64(F * Float64(t_0 / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_3 <= 2e+215) tmp = Float64(-1.0 / Float64(t_4 / sqrt(Float64(Float64(t_4 * Float64(2.0 * F)) * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C)))))); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(F * Float64(2.0 * t_1))) * sqrt(t_0)) / Float64(-t_1)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F)))); 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[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -5e-158], N[(N[Sqrt[N[(F * N[(t$95$0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 2e+215], N[(-1.0 / N[(t$95$4 / N[Sqrt[N[(N[(t$95$4 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
t_4 := {B\_m}^{2} + -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-158}:\\
\;\;\;\;\sqrt{F \cdot \frac{t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+215}:\\
\;\;\;\;\frac{-1}{\frac{t\_4}{\sqrt{\left(t\_4 \cdot \left(2 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)}}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(2 \cdot t\_1\right)} \cdot \sqrt{t\_0}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999972e-158Initial program 37.7%
Taylor expanded in F around 0 44.4%
mul-1-neg44.4%
Simplified68.9%
if -4.99999999999999972e-158 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 1.99999999999999981e215Initial program 25.6%
Taylor expanded in A around -inf 42.9%
clear-num42.9%
inv-pow42.9%
Applied egg-rr42.9%
unpow-142.9%
*-commutative42.9%
associate-*r*42.9%
cancel-sign-sub-inv42.9%
metadata-eval42.9%
*-commutative42.9%
associate-*r*42.9%
Simplified43.0%
if 1.99999999999999981e215 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 4.3%
Simplified28.4%
pow1/228.4%
associate-*r*28.4%
associate-+r+28.4%
hypot-undefine4.3%
unpow24.3%
unpow24.3%
+-commutative4.3%
unpow-prod-down4.3%
*-commutative4.3%
pow1/24.3%
Applied egg-rr75.9%
unpow1/275.9%
associate-*l*75.9%
hypot-undefine4.3%
unpow24.3%
unpow24.3%
+-commutative4.3%
unpow24.3%
unpow24.3%
hypot-undefine75.9%
Simplified75.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in A around 0 1.8%
mul-1-neg1.8%
unpow21.8%
unpow21.8%
hypot-define23.0%
Simplified23.0%
pow1/223.1%
*-commutative23.1%
hypot-undefine1.9%
unpow21.9%
unpow21.9%
unpow-prod-down1.8%
Applied egg-rr33.9%
Final simplification48.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 (* (* 4.0 A) C)) (t_1 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-59)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 5e+196)
(/
(* (sqrt (* F (* 2.0 t_1))) (sqrt (+ A (+ C (hypot B_m (- A C))))))
(- t_1))
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ C (hypot C B_m))) (- (sqrt F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double 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) <= 1e-59) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 5e+196) {
tmp = (sqrt((F * (2.0 * t_1))) * sqrt((A + (C + hypot(B_m, (A - C)))))) / -t_1;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) 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) <= 1e-59) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 5e+196) tmp = Float64(Float64(sqrt(Float64(F * Float64(2.0 * t_1))) * sqrt(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))))) / Float64(-t_1)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F)))); 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], 1e-59], 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 * C), $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], 5e+196], N[(N[(N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
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 10^{-59}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+196}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(2 \cdot t\_1\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-59Initial program 21.8%
Taylor expanded in A around -inf 30.6%
if 1e-59 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e196Initial program 33.8%
Simplified37.0%
pow1/237.1%
associate-*r*37.1%
associate-+r+36.2%
hypot-undefine33.8%
unpow233.8%
unpow233.8%
+-commutative33.8%
unpow-prod-down42.6%
*-commutative42.6%
pow1/242.6%
Applied egg-rr54.5%
unpow1/254.5%
associate-*l*54.5%
hypot-undefine42.6%
unpow242.6%
unpow242.6%
+-commutative42.6%
unpow242.6%
unpow242.6%
hypot-undefine54.5%
Simplified54.5%
if 4.9999999999999998e196 < (pow.f64 B #s(literal 2 binary64)) Initial program 2.8%
Taylor expanded in A around 0 5.2%
mul-1-neg5.2%
unpow25.2%
unpow25.2%
hypot-define32.0%
Simplified32.0%
pow1/232.0%
*-commutative32.0%
hypot-undefine5.2%
unpow25.2%
unpow25.2%
unpow-prod-down6.8%
Applied egg-rr49.1%
Final simplification41.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-43)
(/
(sqrt (* (* -8.0 (* A (* C F))) (+ A (+ C (hypot B_m (- C A))))))
(- (* 4.0 (* A C)) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 5e+275)
(- (sqrt (* F (/ (* 2.0 (+ C (hypot B_m C))) (pow B_m 2.0)))))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (* B_m (+ (/ C B_m) 1.0))) (- (sqrt F)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e-43) {
tmp = sqrt(((-8.0 * (A * (C * F))) * (A + (C + hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 5e+275) {
tmp = -sqrt((F * ((2.0 * (C + hypot(B_m, C))) / pow(B_m, 2.0))));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m * ((C / B_m) + 1.0))) * -sqrt(F));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-43) {
tmp = Math.sqrt(((-8.0 * (A * (C * F))) * (A + (C + Math.hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - Math.pow(B_m, 2.0));
} else if (Math.pow(B_m, 2.0) <= 5e+275) {
tmp = -Math.sqrt((F * ((2.0 * (C + Math.hypot(B_m, C))) / Math.pow(B_m, 2.0))));
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((B_m * ((C / B_m) + 1.0))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 5e-43: tmp = math.sqrt(((-8.0 * (A * (C * F))) * (A + (C + math.hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - math.pow(B_m, 2.0)) elif math.pow(B_m, 2.0) <= 5e+275: tmp = -math.sqrt((F * ((2.0 * (C + math.hypot(B_m, C))) / math.pow(B_m, 2.0)))) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((B_m * ((C / B_m) + 1.0))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-43) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(A + Float64(C + hypot(B_m, Float64(C - A)))))) / Float64(Float64(4.0 * Float64(A * C)) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 5e+275) tmp = Float64(-sqrt(Float64(F * Float64(Float64(2.0 * Float64(C + hypot(B_m, C))) / (B_m ^ 2.0))))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m * Float64(Float64(C / B_m) + 1.0))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-43)
tmp = sqrt(((-8.0 * (A * (C * F))) * (A + (C + hypot(B_m, (C - A)))))) / ((4.0 * (A * C)) - (B_m ^ 2.0));
elseif ((B_m ^ 2.0) <= 5e+275)
tmp = -sqrt((F * ((2.0 * (C + hypot(B_m, C))) / (B_m ^ 2.0))));
else
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m * ((C / B_m) + 1.0))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-43], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(C - A), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+275], (-N[Sqrt[N[(F * N[(N[(2.0 * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m * N[(N[(C / B$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-43}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, C - A\right)\right)\right)}}{4 \cdot \left(A \cdot C\right) - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+275}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2 \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}{{B\_m}^{2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m \cdot \left(\frac{C}{B\_m} + 1\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000019e-43Initial program 21.2%
Simplified29.0%
Taylor expanded in A around inf 22.4%
if 5.00000000000000019e-43 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e275Initial program 28.6%
Taylor expanded in A around 0 23.0%
mul-1-neg23.0%
unpow223.0%
unpow223.0%
hypot-define25.2%
Simplified25.2%
pow1/225.2%
*-commutative25.2%
hypot-undefine23.0%
unpow223.0%
unpow223.0%
unpow-prod-down25.5%
Applied egg-rr31.0%
*-un-lft-identity31.0%
metadata-eval31.0%
add-cbrt-cube20.1%
unpow220.1%
cbrt-prod30.9%
times-frac30.8%
metadata-eval30.8%
unpow230.8%
cbrt-prod30.8%
pow230.8%
Applied egg-rr30.8%
associate-*l/30.9%
*-lft-identity30.9%
Simplified30.9%
add-sqr-sqrt30.4%
sqrt-unprod40.6%
swap-sqr33.2%
Applied egg-rr33.7%
associate-*r*41.2%
*-commutative41.2%
associate-*l/41.2%
hypot-undefine35.7%
unpow235.7%
unpow235.7%
+-commutative35.7%
unpow235.7%
unpow235.7%
hypot-define41.2%
Simplified41.2%
if 5.0000000000000003e275 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in A around 0 3.2%
mul-1-neg3.2%
unpow23.2%
unpow23.2%
hypot-define35.7%
Simplified35.7%
pow1/235.7%
*-commutative35.7%
hypot-undefine3.2%
unpow23.2%
unpow23.2%
unpow-prod-down3.2%
Applied egg-rr52.8%
Taylor expanded in B around inf 46.6%
Final simplification33.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 5e-44)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 5e+275)
(- (sqrt (* F (/ (* 2.0 (+ C (hypot B_m C))) (pow B_m 2.0)))))
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (* B_m (+ (/ C B_m) 1.0))) (- (sqrt F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 5e-44) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 5e+275) {
tmp = -sqrt((F * ((2.0 * (C + hypot(B_m, C))) / pow(B_m, 2.0))));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m * ((C / B_m) + 1.0))) * -sqrt(F));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-44) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else if (Math.pow(B_m, 2.0) <= 5e+275) {
tmp = -Math.sqrt((F * ((2.0 * (C + Math.hypot(B_m, C))) / Math.pow(B_m, 2.0))));
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((B_m * ((C / B_m) + 1.0))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 5e-44: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) elif math.pow(B_m, 2.0) <= 5e+275: tmp = -math.sqrt((F * ((2.0 * (C + math.hypot(B_m, C))) / math.pow(B_m, 2.0)))) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((B_m * ((C / B_m) + 1.0))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-44) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 5e+275) tmp = Float64(-sqrt(Float64(F * Float64(Float64(2.0 * Float64(C + hypot(B_m, C))) / (B_m ^ 2.0))))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m * Float64(Float64(C / B_m) + 1.0))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-44)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
elseif ((B_m ^ 2.0) <= 5e+275)
tmp = -sqrt((F * ((2.0 * (C + hypot(B_m, C))) / (B_m ^ 2.0))));
else
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m * ((C / B_m) + 1.0))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-44], 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 * C), $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], 5e+275], (-N[Sqrt[N[(F * N[(N[(2.0 * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m * N[(N[(C / B$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-44}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+275}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2 \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}{{B\_m}^{2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m \cdot \left(\frac{C}{B\_m} + 1\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000039e-44Initial program 21.3%
Taylor expanded in A around -inf 29.9%
if 5.00000000000000039e-44 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e275Initial program 28.2%
Taylor expanded in A around 0 22.6%
mul-1-neg22.6%
unpow222.6%
unpow222.6%
hypot-define24.8%
Simplified24.8%
pow1/224.8%
*-commutative24.8%
hypot-undefine22.7%
unpow222.7%
unpow222.7%
unpow-prod-down25.1%
Applied egg-rr30.6%
*-un-lft-identity30.6%
metadata-eval30.6%
add-cbrt-cube19.8%
unpow219.8%
cbrt-prod30.4%
times-frac30.3%
metadata-eval30.3%
unpow230.3%
cbrt-prod30.4%
pow230.4%
Applied egg-rr30.4%
associate-*l/30.4%
*-lft-identity30.4%
Simplified30.4%
add-sqr-sqrt30.0%
sqrt-unprod40.0%
swap-sqr32.7%
Applied egg-rr33.2%
associate-*r*40.5%
*-commutative40.5%
associate-*l/40.5%
hypot-undefine35.1%
unpow235.1%
unpow235.1%
+-commutative35.1%
unpow235.1%
unpow235.1%
hypot-define40.5%
Simplified40.5%
if 5.0000000000000003e275 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in A around 0 3.2%
mul-1-neg3.2%
unpow23.2%
unpow23.2%
hypot-define35.7%
Simplified35.7%
pow1/235.7%
*-commutative35.7%
hypot-undefine3.2%
unpow23.2%
unpow23.2%
unpow-prod-down3.2%
Applied egg-rr52.8%
Taylor expanded in B around inf 46.6%
Final simplification37.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 5e-44)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ C (hypot C B_m))) (- (sqrt F)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 5e-44) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-44) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + Math.hypot(C, B_m))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 5e-44: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + math.hypot(C, B_m))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-44) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-44)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-44], 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 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-44}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000039e-44Initial program 21.3%
Taylor expanded in A around -inf 29.9%
if 5.00000000000000039e-44 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.6%
Taylor expanded in A around 0 11.8%
mul-1-neg11.8%
unpow211.8%
unpow211.8%
hypot-define30.9%
Simplified30.9%
pow1/230.9%
*-commutative30.9%
hypot-undefine11.8%
unpow211.8%
unpow211.8%
unpow-prod-down12.9%
Applied egg-rr42.9%
Final simplification36.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 1.2e+144) (/ (sqrt (* (* 2.0 F) (+ C (hypot C B_m)))) (- B_m)) (* (/ (sqrt 2.0) B_m) (* (sqrt (* B_m (+ (/ C B_m) 1.0))) (- (sqrt F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.2e+144) {
tmp = sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m * ((C / B_m) + 1.0))) * -sqrt(F));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.2e+144) {
tmp = Math.sqrt(((2.0 * F) * (C + Math.hypot(C, B_m)))) / -B_m;
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((B_m * ((C / B_m) + 1.0))) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 1.2e+144: tmp = math.sqrt(((2.0 * F) * (C + math.hypot(C, B_m)))) / -B_m else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((B_m * ((C / B_m) + 1.0))) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 1.2e+144) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(C, B_m)))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m * Float64(Float64(C / B_m) + 1.0))) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 1.2e+144)
tmp = sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / -B_m;
else
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m * ((C / B_m) + 1.0))) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 1.2e+144], 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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m * N[(N[(C / B$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 1.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m \cdot \left(\frac{C}{B\_m} + 1\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if F < 1.2e144Initial program 20.6%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define22.7%
Simplified22.7%
associate-*l/22.7%
sqrt-unprod22.8%
hypot-undefine9.3%
unpow29.3%
unpow29.3%
+-commutative9.3%
unpow29.3%
unpow29.3%
hypot-define22.8%
Applied egg-rr22.8%
associate-*r*22.8%
*-commutative22.8%
Simplified22.8%
if 1.2e144 < F Initial program 5.5%
Taylor expanded in A around 0 6.8%
mul-1-neg6.8%
unpow26.8%
unpow26.8%
hypot-define7.1%
Simplified7.1%
pow1/27.1%
*-commutative7.1%
hypot-undefine6.8%
unpow26.8%
unpow26.8%
unpow-prod-down9.1%
Applied egg-rr30.6%
Taylor expanded in B around inf 25.8%
Final simplification23.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 1.2e+144) (/ (sqrt (* (* 2.0 F) (+ C (hypot C B_m)))) (- B_m)) (* (/ (sqrt 2.0) B_m) (* (sqrt (+ B_m C)) (- (sqrt F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.2e+144) {
tmp = sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m + C)) * -sqrt(F));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.2e+144) {
tmp = Math.sqrt(((2.0 * F) * (C + Math.hypot(C, B_m)))) / -B_m;
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((B_m + C)) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 1.2e+144: tmp = math.sqrt(((2.0 * F) * (C + math.hypot(C, B_m)))) / -B_m else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((B_m + C)) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 1.2e+144) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(C, B_m)))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m + C)) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 1.2e+144)
tmp = sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / -B_m;
else
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m + C)) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 1.2e+144], 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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 1.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m + C} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if F < 1.2e144Initial program 20.6%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define22.7%
Simplified22.7%
associate-*l/22.7%
sqrt-unprod22.8%
hypot-undefine9.3%
unpow29.3%
unpow29.3%
+-commutative9.3%
unpow29.3%
unpow29.3%
hypot-define22.8%
Applied egg-rr22.8%
associate-*r*22.8%
*-commutative22.8%
Simplified22.8%
if 1.2e144 < F Initial program 5.5%
Taylor expanded in A around 0 6.8%
mul-1-neg6.8%
unpow26.8%
unpow26.8%
hypot-define7.1%
Simplified7.1%
pow1/27.1%
*-commutative7.1%
hypot-undefine6.8%
unpow26.8%
unpow26.8%
unpow-prod-down9.1%
Applied egg-rr30.6%
Taylor expanded in C around 0 25.8%
Final simplification23.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 1.2e+144) (/ (sqrt (* (* 2.0 F) (+ C (hypot C B_m)))) (- B_m)) (* (sqrt F) (- (sqrt (/ 2.0 B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.2e+144) {
tmp = sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / -B_m;
} else {
tmp = sqrt(F) * -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 <= 1.2e+144) {
tmp = Math.sqrt(((2.0 * F) * (C + Math.hypot(C, B_m)))) / -B_m;
} else {
tmp = Math.sqrt(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 F <= 1.2e+144: tmp = math.sqrt(((2.0 * F) * (C + math.hypot(C, B_m)))) / -B_m else: tmp = math.sqrt(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 (F <= 1.2e+144) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(C, B_m)))) / Float64(-B_m)); else tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(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 <= 1.2e+144)
tmp = sqrt(((2.0 * F) * (C + hypot(C, B_m)))) / -B_m;
else
tmp = sqrt(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[F, 1.2e+144], 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[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 1.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if F < 1.2e144Initial program 20.6%
Taylor expanded in A around 0 9.2%
mul-1-neg9.2%
unpow29.2%
unpow29.2%
hypot-define22.7%
Simplified22.7%
associate-*l/22.7%
sqrt-unprod22.8%
hypot-undefine9.3%
unpow29.3%
unpow29.3%
+-commutative9.3%
unpow29.3%
unpow29.3%
hypot-define22.8%
Applied egg-rr22.8%
associate-*r*22.8%
*-commutative22.8%
Simplified22.8%
if 1.2e144 < F Initial program 5.5%
Taylor expanded in B around inf 25.2%
mul-1-neg25.2%
Simplified25.2%
sqrt-unprod25.2%
Applied egg-rr25.2%
*-commutative25.2%
clear-num25.2%
un-div-inv25.2%
Applied egg-rr25.2%
associate-/r/25.2%
Simplified25.2%
sqrt-prod25.2%
Applied egg-rr25.2%
Final simplification23.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 (if (<= C 7.8e+244) (* (sqrt F) (- (sqrt (/ 2.0 B_m)))) (* (/ (sqrt (* C F)) B_m) (- 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 (C <= 7.8e+244) {
tmp = sqrt(F) * -sqrt((2.0 / B_m));
} else {
tmp = (sqrt((C * F)) / B_m) * -2.0;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 7.8d+244) then
tmp = sqrt(f) * -sqrt((2.0d0 / b_m))
else
tmp = (sqrt((c * f)) / b_m) * -2.0d0
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 7.8e+244) {
tmp = Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
} else {
tmp = (Math.sqrt((C * F)) / B_m) * -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 C <= 7.8e+244: tmp = math.sqrt(F) * -math.sqrt((2.0 / B_m)) else: tmp = (math.sqrt((C * F)) / B_m) * -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 (C <= 7.8e+244) tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))); else tmp = Float64(Float64(sqrt(Float64(C * F)) / B_m) * Float64(-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 (C <= 7.8e+244)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
else
tmp = (sqrt((C * F)) / B_m) * -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[C, 7.8e+244], N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-2.0)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 7.8 \cdot 10^{+244}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C \cdot F}}{B\_m} \cdot \left(-2\right)\\
\end{array}
\end{array}
if C < 7.8000000000000001e244Initial program 17.5%
Taylor expanded in B around inf 17.0%
mul-1-neg17.0%
Simplified17.0%
sqrt-unprod17.1%
Applied egg-rr17.1%
*-commutative17.1%
clear-num16.0%
un-div-inv16.0%
Applied egg-rr16.0%
associate-/r/17.2%
Simplified17.2%
sqrt-prod22.2%
Applied egg-rr22.2%
if 7.8000000000000001e244 < C Initial program 1.4%
Taylor expanded in A around 0 1.3%
mul-1-neg1.3%
unpow21.3%
unpow21.3%
hypot-define25.7%
Simplified25.7%
pow1/226.3%
*-commutative26.3%
hypot-undefine2.4%
unpow22.4%
unpow22.4%
unpow-prod-down1.3%
Applied egg-rr33.6%
*-un-lft-identity33.6%
metadata-eval33.6%
add-cbrt-cube1.8%
unpow21.8%
cbrt-prod9.7%
times-frac9.7%
metadata-eval9.7%
unpow29.7%
cbrt-prod33.5%
pow233.5%
Applied egg-rr33.5%
associate-*l/33.6%
*-lft-identity33.6%
Simplified33.6%
Taylor expanded in B around 0 23.8%
associate-*l/23.8%
unpow223.8%
rem-square-sqrt23.8%
associate-/l*23.8%
Simplified23.8%
Final simplification22.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 (<= C 8e+174) (- (pow (/ (* 2.0 F) B_m) 0.5)) (* (/ (sqrt (* C F)) B_m) (- 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 (C <= 8e+174) {
tmp = -pow(((2.0 * F) / B_m), 0.5);
} else {
tmp = (sqrt((C * F)) / B_m) * -2.0;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 8d+174) then
tmp = -(((2.0d0 * f) / b_m) ** 0.5d0)
else
tmp = (sqrt((c * f)) / b_m) * -2.0d0
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 8e+174) {
tmp = -Math.pow(((2.0 * F) / B_m), 0.5);
} else {
tmp = (Math.sqrt((C * F)) / B_m) * -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 C <= 8e+174: tmp = -math.pow(((2.0 * F) / B_m), 0.5) else: tmp = (math.sqrt((C * F)) / B_m) * -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 (C <= 8e+174) tmp = Float64(-(Float64(Float64(2.0 * F) / B_m) ^ 0.5)); else tmp = Float64(Float64(sqrt(Float64(C * F)) / B_m) * Float64(-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 (C <= 8e+174)
tmp = -(((2.0 * F) / B_m) ^ 0.5);
else
tmp = (sqrt((C * F)) / B_m) * -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[C, 8e+174], (-N[Power[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision], 0.5], $MachinePrecision]), N[(N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-2.0)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 8 \cdot 10^{+174}:\\
\;\;\;\;-{\left(\frac{2 \cdot F}{B\_m}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C \cdot F}}{B\_m} \cdot \left(-2\right)\\
\end{array}
\end{array}
if C < 8.00000000000000055e174Initial program 18.5%
Taylor expanded in B around inf 17.9%
mul-1-neg17.9%
Simplified17.9%
sqrt-unprod18.0%
Applied egg-rr18.0%
*-commutative18.0%
clear-num16.9%
un-div-inv16.9%
Applied egg-rr16.9%
associate-/r/18.1%
Simplified18.1%
pow1/218.2%
associate-*l/18.2%
Applied egg-rr18.2%
if 8.00000000000000055e174 < C Initial program 1.8%
Taylor expanded in A around 0 1.4%
mul-1-neg1.4%
unpow21.4%
unpow21.4%
hypot-define19.5%
Simplified19.5%
pow1/219.9%
*-commutative19.9%
hypot-undefine2.3%
unpow22.3%
unpow22.3%
unpow-prod-down1.4%
Applied egg-rr30.1%
*-un-lft-identity30.1%
metadata-eval30.1%
add-cbrt-cube1.9%
unpow21.9%
cbrt-prod12.5%
times-frac12.5%
metadata-eval12.5%
unpow212.5%
cbrt-prod29.9%
pow229.9%
Applied egg-rr29.9%
associate-*l/30.0%
*-lft-identity30.0%
Simplified30.0%
Taylor expanded in B around 0 15.3%
associate-*l/15.3%
unpow215.3%
rem-square-sqrt15.3%
associate-/l*15.3%
Simplified15.3%
Final simplification17.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (pow (/ (* 2.0 F) B_m) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -pow(((2.0 * F) / B_m), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -(((2.0d0 * f) / b_m) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.pow(((2.0 * F) / B_m), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.pow(((2.0 * F) / B_m), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(Float64(2.0 * F) / B_m) ^ 0.5)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -(((2.0 * F) / B_m) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Power[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(\frac{2 \cdot F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 16.8%
Taylor expanded in B around inf 16.4%
mul-1-neg16.4%
Simplified16.4%
sqrt-unprod16.5%
Applied egg-rr16.5%
*-commutative16.5%
clear-num15.4%
un-div-inv15.4%
Applied egg-rr15.4%
associate-/r/16.6%
Simplified16.6%
pow1/216.7%
associate-*l/16.7%
Applied egg-rr16.7%
Final simplification16.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 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 16.8%
Taylor expanded in B around inf 16.4%
mul-1-neg16.4%
Simplified16.4%
sqrt-unprod16.5%
Applied egg-rr16.5%
*-commutative16.5%
clear-num15.4%
un-div-inv15.4%
Applied egg-rr15.4%
associate-/r/16.6%
Simplified16.6%
Final simplification16.6%
herbie shell --seed 2024100
(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))))