
(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 10 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 (* -0.5 (/ (pow B_m 2.0) A)))
(t_1 (fma B_m B_m (* C (* A -4.0))))
(t_2 (* (* 4.0 A) C))
(t_3 (* 2.0 (* (- (pow B_m 2.0) t_2) F)))
(t_4 (- t_2 (pow B_m 2.0)))
(t_5
(/
(sqrt (* t_3 (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_4)))
(if (<= t_5 (- INFINITY))
(/ (* (sqrt (fma 2.0 C t_0)) (* (sqrt (* 2.0 t_1)) (sqrt F))) t_4)
(if (<= t_5 -5e-219)
(/
(sqrt
(* t_3 (fma (pow (cbrt A) 2.0) (cbrt A) (+ C (hypot (- A C) B_m)))))
t_4)
(if (<= t_5 4e+62)
(/ (sqrt (* (* 2.0 (* F t_1)) (+ t_0 (* 2.0 C)))) t_4)
(if (<= t_5 INFINITY)
(*
-2.0
(* (/ -0.25 A) (sqrt (* F (- (/ (pow B_m 2.0) C) (* 4.0 A))))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -0.5 * (pow(B_m, 2.0) / A);
double t_1 = fma(B_m, B_m, (C * (A * -4.0)));
double t_2 = (4.0 * A) * C;
double t_3 = 2.0 * ((pow(B_m, 2.0) - t_2) * F);
double t_4 = t_2 - pow(B_m, 2.0);
double t_5 = sqrt((t_3 * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = (sqrt(fma(2.0, C, t_0)) * (sqrt((2.0 * t_1)) * sqrt(F))) / t_4;
} else if (t_5 <= -5e-219) {
tmp = sqrt((t_3 * fma(pow(cbrt(A), 2.0), cbrt(A), (C + hypot((A - C), B_m))))) / t_4;
} else if (t_5 <= 4e+62) {
tmp = sqrt(((2.0 * (F * t_1)) * (t_0 + (2.0 * C)))) / t_4;
} else if (t_5 <= ((double) INFINITY)) {
tmp = -2.0 * ((-0.25 / A) * sqrt((F * ((pow(B_m, 2.0) / C) - (4.0 * A)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-0.5 * Float64((B_m ^ 2.0) / A)) t_1 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) t_4 = Float64(t_2 - (B_m ^ 2.0)) t_5 = Float64(sqrt(Float64(t_3 * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(2.0, C, t_0)) * Float64(sqrt(Float64(2.0 * t_1)) * sqrt(F))) / t_4); elseif (t_5 <= -5e-219) tmp = Float64(sqrt(Float64(t_3 * fma((cbrt(A) ^ 2.0), cbrt(A), Float64(C + hypot(Float64(A - C), B_m))))) / t_4); elseif (t_5 <= 4e+62) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_1)) * Float64(t_0 + Float64(2.0 * C)))) / t_4); elseif (t_5 <= Inf) tmp = Float64(-2.0 * Float64(Float64(-0.25 / A) * sqrt(Float64(F * Float64(Float64((B_m ^ 2.0) / C) - Float64(4.0 * A)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(t$95$3 * 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] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * C + t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, -5e-219], N[(N[Sqrt[N[(t$95$3 * N[(N[Power[N[Power[A, 1/3], $MachinePrecision], 2.0], $MachinePrecision] * N[Power[A, 1/3], $MachinePrecision] + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, 4e+62], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(-2.0 * N[(N[(-0.25 / A), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -0.5 \cdot \frac{{B\_m}^{2}}{A}\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := 2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\\
t_4 := t\_2 - {B\_m}^{2}\\
t_5 := \frac{\sqrt{t\_3 \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, C, t\_0\right)} \cdot \left(\sqrt{2 \cdot t\_1} \cdot \sqrt{F}\right)}{t\_4}\\
\mathbf{elif}\;t\_5 \leq -5 \cdot 10^{-219}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \mathsf{fma}\left({\left(\sqrt[3]{A}\right)}^{2}, \sqrt[3]{A}, C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq 4 \cdot 10^{+62}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(F \cdot t\_1\right)\right) \cdot \left(t\_0 + 2 \cdot C\right)}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;-2 \cdot \left(\frac{-0.25}{A} \cdot \sqrt{F \cdot \left(\frac{{B\_m}^{2}}{C} - 4 \cdot A\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
Taylor expanded in A around -inf 21.8%
pow1/222.6%
*-commutative22.6%
unpow-prod-down33.6%
pow1/233.4%
+-commutative33.4%
fma-define33.4%
pow1/233.4%
associate-*r*33.4%
associate-*l*33.4%
Applied egg-rr33.4%
cancel-sign-sub-inv33.4%
unpow233.4%
metadata-eval33.4%
fma-undefine33.4%
associate-*r*33.4%
Simplified33.4%
sqrt-prod35.6%
*-commutative35.6%
*-commutative35.6%
Applied egg-rr35.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-219Initial program 98.4%
associate-+l+98.5%
add-cube-cbrt98.4%
+-commutative98.4%
unpow298.4%
unpow298.4%
hypot-undefine98.4%
fma-define98.4%
pow298.4%
hypot-undefine98.4%
unpow298.4%
unpow298.4%
+-commutative98.4%
unpow298.4%
unpow298.4%
hypot-define98.4%
Applied egg-rr98.4%
if -5.0000000000000002e-219 < (/.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.00000000000000014e62Initial program 8.8%
Taylor expanded in A around -inf 29.0%
Taylor expanded in B around 0 29.0%
cancel-sign-sub-inv29.0%
unpow229.0%
metadata-eval29.0%
fma-undefine29.0%
associate-*r*29.0%
Simplified29.0%
if 4.00000000000000014e62 < (/.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 16.0%
Simplified53.7%
Taylor expanded in C around -inf 41.0%
mul-1-neg41.0%
distribute-rgt-neg-in41.0%
+-commutative41.0%
mul-1-neg41.0%
unsub-neg41.0%
associate-*r*41.0%
associate-/l*36.1%
Simplified36.1%
Taylor expanded in A around -inf 23.8%
Taylor expanded in F around 0 42.0%
Taylor expanded in C around inf 42.1%
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 B around inf 21.1%
mul-1-neg21.1%
distribute-rgt-neg-in21.1%
Simplified21.1%
pow121.1%
distribute-rgt-neg-out21.1%
pow1/221.2%
pow1/221.2%
pow-prod-down21.3%
Applied egg-rr21.3%
unpow121.3%
unpow1/221.1%
Simplified21.1%
*-un-lft-identity21.1%
associate-*l/21.1%
Applied egg-rr21.1%
*-lft-identity21.1%
associate-/l*21.1%
Simplified21.1%
associate-*r/21.1%
sqrt-div26.8%
*-commutative26.8%
Applied egg-rr26.8%
Final simplification41.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* -0.5 (/ (pow B_m 2.0) A)))
(t_1 (fma B_m B_m (* A (* C -4.0))))
(t_2 (fma B_m B_m (* C (* A -4.0))))
(t_3 (* (* 4.0 A) C))
(t_4 (- t_3 (pow B_m 2.0)))
(t_5
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_4)))
(if (<= t_5 (- INFINITY))
(/ (* (sqrt (fma 2.0 C t_0)) (* (sqrt (* 2.0 t_2)) (sqrt F))) t_4)
(if (<= t_5 -5e-219)
(/ (sqrt (* (* F t_1) (* 2.0 (+ A (+ C (hypot B_m (- A C))))))) (- t_1))
(if (<= t_5 4e+62)
(/ (sqrt (* (* 2.0 (* F t_2)) (+ t_0 (* 2.0 C)))) t_4)
(if (<= t_5 INFINITY)
(*
-2.0
(* (/ -0.25 A) (sqrt (* F (- (/ (pow B_m 2.0) C) (* 4.0 A))))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -0.5 * (pow(B_m, 2.0) / A);
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = fma(B_m, B_m, (C * (A * -4.0)));
double t_3 = (4.0 * A) * C;
double t_4 = t_3 - pow(B_m, 2.0);
double t_5 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = (sqrt(fma(2.0, C, t_0)) * (sqrt((2.0 * t_2)) * sqrt(F))) / t_4;
} else if (t_5 <= -5e-219) {
tmp = sqrt(((F * t_1) * (2.0 * (A + (C + hypot(B_m, (A - C))))))) / -t_1;
} else if (t_5 <= 4e+62) {
tmp = sqrt(((2.0 * (F * t_2)) * (t_0 + (2.0 * C)))) / t_4;
} else if (t_5 <= ((double) INFINITY)) {
tmp = -2.0 * ((-0.25 / A) * sqrt((F * ((pow(B_m, 2.0) / C) - (4.0 * A)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-0.5 * Float64((B_m ^ 2.0) / A)) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(t_3 - (B_m ^ 2.0)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(2.0, C, t_0)) * Float64(sqrt(Float64(2.0 * t_2)) * sqrt(F))) / t_4); elseif (t_5 <= -5e-219) tmp = Float64(sqrt(Float64(Float64(F * t_1) * Float64(2.0 * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))))) / Float64(-t_1)); elseif (t_5 <= 4e+62) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_2)) * Float64(t_0 + Float64(2.0 * C)))) / t_4); elseif (t_5 <= Inf) tmp = Float64(-2.0 * Float64(Float64(-0.25 / A) * sqrt(Float64(F * Float64(Float64((B_m ^ 2.0) / C) - Float64(4.0 * A)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $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[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $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] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * C + t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(2.0 * t$95$2), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, -5e-219], N[(N[Sqrt[N[(N[(F * t$95$1), $MachinePrecision] * N[(2.0 * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$5, 4e+62], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$2), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(-2.0 * N[(N[(-0.25 / A), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -0.5 \cdot \frac{{B\_m}^{2}}{A}\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := t\_3 - {B\_m}^{2}\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, C, t\_0\right)} \cdot \left(\sqrt{2 \cdot t\_2} \cdot \sqrt{F}\right)}{t\_4}\\
\mathbf{elif}\;t\_5 \leq -5 \cdot 10^{-219}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_1\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{-t\_1}\\
\mathbf{elif}\;t\_5 \leq 4 \cdot 10^{+62}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(F \cdot t\_2\right)\right) \cdot \left(t\_0 + 2 \cdot C\right)}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;-2 \cdot \left(\frac{-0.25}{A} \cdot \sqrt{F \cdot \left(\frac{{B\_m}^{2}}{C} - 4 \cdot A\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
Taylor expanded in A around -inf 21.8%
pow1/222.6%
*-commutative22.6%
unpow-prod-down33.6%
pow1/233.4%
+-commutative33.4%
fma-define33.4%
pow1/233.4%
associate-*r*33.4%
associate-*l*33.4%
Applied egg-rr33.4%
cancel-sign-sub-inv33.4%
unpow233.4%
metadata-eval33.4%
fma-undefine33.4%
associate-*r*33.4%
Simplified33.4%
sqrt-prod35.6%
*-commutative35.6%
*-commutative35.6%
Applied egg-rr35.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-219Initial program 98.4%
Simplified98.5%
if -5.0000000000000002e-219 < (/.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.00000000000000014e62Initial program 8.8%
Taylor expanded in A around -inf 29.0%
Taylor expanded in B around 0 29.0%
cancel-sign-sub-inv29.0%
unpow229.0%
metadata-eval29.0%
fma-undefine29.0%
associate-*r*29.0%
Simplified29.0%
if 4.00000000000000014e62 < (/.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 16.0%
Simplified53.7%
Taylor expanded in C around -inf 41.0%
mul-1-neg41.0%
distribute-rgt-neg-in41.0%
+-commutative41.0%
mul-1-neg41.0%
unsub-neg41.0%
associate-*r*41.0%
associate-/l*36.1%
Simplified36.1%
Taylor expanded in A around -inf 23.8%
Taylor expanded in F around 0 42.0%
Taylor expanded in C around inf 42.1%
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 B around inf 21.1%
mul-1-neg21.1%
distribute-rgt-neg-in21.1%
Simplified21.1%
pow121.1%
distribute-rgt-neg-out21.1%
pow1/221.2%
pow1/221.2%
pow-prod-down21.3%
Applied egg-rr21.3%
unpow121.3%
unpow1/221.1%
Simplified21.1%
*-un-lft-identity21.1%
associate-*l/21.1%
Applied egg-rr21.1%
*-lft-identity21.1%
associate-/l*21.1%
Simplified21.1%
associate-*r/21.1%
sqrt-div26.8%
*-commutative26.8%
Applied egg-rr26.8%
Final simplification41.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2))
(t_4 (/ (pow B_m 2.0) C)))
(if (<= t_3 (- INFINITY))
(*
-2.0
(*
(/ C (+ (pow B_m 2.0) (* -4.0 (* A C))))
(* (sqrt F) (sqrt (+ (* A -4.0) t_4)))))
(if (<= t_3 -5e-219)
(/ (sqrt (* (* F t_0) (* 2.0 (+ A (+ C (hypot B_m (- A C))))))) (- t_0))
(if (<= t_3 4e+62)
(/
(sqrt
(*
(* 2.0 (* F (fma B_m B_m (* C (* A -4.0)))))
(+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
t_2)
(if (<= t_3 INFINITY)
(* -2.0 (* (/ -0.25 A) (sqrt (* F (- t_4 (* 4.0 A))))))
(/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_4 = pow(B_m, 2.0) / C;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = -2.0 * ((C / (pow(B_m, 2.0) + (-4.0 * (A * C)))) * (sqrt(F) * sqrt(((A * -4.0) + t_4))));
} else if (t_3 <= -5e-219) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (C + hypot(B_m, (A - C))))))) / -t_0;
} else if (t_3 <= 4e+62) {
tmp = sqrt(((2.0 * (F * fma(B_m, B_m, (C * (A * -4.0))))) * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = -2.0 * ((-0.25 / A) * sqrt((F * (t_4 - (4.0 * A)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) t_4 = Float64((B_m ^ 2.0) / C) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(-2.0 * Float64(Float64(C / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C)))) * Float64(sqrt(F) * sqrt(Float64(Float64(A * -4.0) + t_4))))); elseif (t_3 <= -5e-219) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))))) / Float64(-t_0)); elseif (t_3 <= 4e+62) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(C * Float64(A * -4.0))))) * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / t_2); elseif (t_3 <= Inf) tmp = Float64(-2.0 * Float64(Float64(-0.25 / A) * sqrt(Float64(F * Float64(t_4 - Float64(4.0 * A)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $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] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(-2.0 * N[(N[(C / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(A * -4.0), $MachinePrecision] + t$95$4), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-219], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, 4e+62], N[(N[Sqrt[N[(N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(-2.0 * N[(N[(-0.25 / A), $MachinePrecision] * N[Sqrt[N[(F * N[(t$95$4 - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
t_4 := \frac{{B\_m}^{2}}{C}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;-2 \cdot \left(\frac{C}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)} \cdot \left(\sqrt{F} \cdot \sqrt{A \cdot -4 + t\_4}\right)\right)\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-219}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq 4 \cdot 10^{+62}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\right)\right) \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;-2 \cdot \left(\frac{-0.25}{A} \cdot \sqrt{F \cdot \left(t\_4 - 4 \cdot A\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
Simplified14.0%
Taylor expanded in C around -inf 9.6%
mul-1-neg9.6%
distribute-rgt-neg-in9.6%
+-commutative9.6%
mul-1-neg9.6%
unsub-neg9.6%
associate-*r*9.6%
associate-/l*9.7%
Simplified9.7%
Taylor expanded in A around -inf 14.3%
Taylor expanded in F around 0 31.1%
pow1/231.1%
*-commutative31.1%
unpow-prod-down36.8%
pow1/236.7%
cancel-sign-sub-inv36.7%
metadata-eval36.7%
pow1/236.7%
Applied egg-rr36.7%
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))) < -5.0000000000000002e-219Initial program 98.4%
Simplified98.5%
if -5.0000000000000002e-219 < (/.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.00000000000000014e62Initial program 8.8%
Taylor expanded in A around -inf 29.0%
Taylor expanded in B around 0 29.0%
cancel-sign-sub-inv29.0%
unpow229.0%
metadata-eval29.0%
fma-undefine29.0%
associate-*r*29.0%
Simplified29.0%
if 4.00000000000000014e62 < (/.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 16.0%
Simplified53.7%
Taylor expanded in C around -inf 41.0%
mul-1-neg41.0%
distribute-rgt-neg-in41.0%
+-commutative41.0%
mul-1-neg41.0%
unsub-neg41.0%
associate-*r*41.0%
associate-/l*36.1%
Simplified36.1%
Taylor expanded in A around -inf 23.8%
Taylor expanded in F around 0 42.0%
Taylor expanded in C around inf 42.1%
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 B around inf 21.1%
mul-1-neg21.1%
distribute-rgt-neg-in21.1%
Simplified21.1%
pow121.1%
distribute-rgt-neg-out21.1%
pow1/221.2%
pow1/221.2%
pow-prod-down21.3%
Applied egg-rr21.3%
unpow121.3%
unpow1/221.1%
Simplified21.1%
*-un-lft-identity21.1%
associate-*l/21.1%
Applied egg-rr21.1%
*-lft-identity21.1%
associate-/l*21.1%
Simplified21.1%
associate-*r/21.1%
sqrt-div26.8%
*-commutative26.8%
Applied egg-rr26.8%
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+199) (* -2.0 (* (/ -0.25 A) (sqrt (* F (- (/ (pow B_m 2.0) C) (* 4.0 A)))))) (/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e+199) {
tmp = -2.0 * ((-0.25 / A) * sqrt((F * ((pow(B_m, 2.0) / C) - (4.0 * A)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 5d+199) then
tmp = (-2.0d0) * (((-0.25d0) / a) * sqrt((f * (((b_m ** 2.0d0) / c) - (4.0d0 * a)))))
else
tmp = sqrt((2.0d0 * f)) / -sqrt(b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 5e+199) {
tmp = -2.0 * ((-0.25 / A) * Math.sqrt((F * ((Math.pow(B_m, 2.0) / C) - (4.0 * A)))));
} else {
tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 5e+199: tmp = -2.0 * ((-0.25 / A) * math.sqrt((F * ((math.pow(B_m, 2.0) / C) - (4.0 * A))))) else: tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+199) tmp = Float64(-2.0 * Float64(Float64(-0.25 / A) * sqrt(Float64(F * Float64(Float64((B_m ^ 2.0) / C) - Float64(4.0 * A)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e+199)
tmp = -2.0 * ((-0.25 / A) * sqrt((F * (((B_m ^ 2.0) / C) - (4.0 * A)))));
else
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+199], N[(-2.0 * N[(N[(-0.25 / A), $MachinePrecision] * N[Sqrt[N[(F * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+199}:\\
\;\;\;\;-2 \cdot \left(\frac{-0.25}{A} \cdot \sqrt{F \cdot \left(\frac{{B\_m}^{2}}{C} - 4 \cdot A\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e199Initial program 23.4%
Simplified32.1%
Taylor expanded in C around -inf 26.6%
mul-1-neg26.6%
distribute-rgt-neg-in26.6%
+-commutative26.6%
mul-1-neg26.6%
unsub-neg26.6%
associate-*r*26.6%
associate-/l*23.4%
Simplified23.4%
Taylor expanded in A around -inf 18.0%
Taylor expanded in F around 0 25.5%
Taylor expanded in C around inf 27.1%
if 4.9999999999999998e199 < (pow.f64 B #s(literal 2 binary64)) Initial program 8.5%
Taylor expanded in B around inf 29.5%
mul-1-neg29.5%
distribute-rgt-neg-in29.5%
Simplified29.5%
pow129.5%
distribute-rgt-neg-out29.5%
pow1/229.5%
pow1/229.5%
pow-prod-down29.6%
Applied egg-rr29.6%
unpow129.6%
unpow1/229.6%
Simplified29.6%
*-un-lft-identity29.6%
associate-*l/29.5%
Applied egg-rr29.5%
*-lft-identity29.5%
associate-/l*29.6%
Simplified29.6%
associate-*r/29.5%
sqrt-div38.7%
*-commutative38.7%
Applied egg-rr38.7%
Final simplification31.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 1e+222) (* -2.0 (sqrt (/ (* C F) (- (pow B_m 2.0) (* 4.0 (* A C)))))) (/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e+222) {
tmp = -2.0 * sqrt(((C * F) / (pow(B_m, 2.0) - (4.0 * (A * C)))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 1d+222) then
tmp = (-2.0d0) * sqrt(((c * f) / ((b_m ** 2.0d0) - (4.0d0 * (a * c)))))
else
tmp = sqrt((2.0d0 * f)) / -sqrt(b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e+222) {
tmp = -2.0 * Math.sqrt(((C * F) / (Math.pow(B_m, 2.0) - (4.0 * (A * C)))));
} else {
tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e+222: tmp = -2.0 * math.sqrt(((C * F) / (math.pow(B_m, 2.0) - (4.0 * (A * C))))) else: tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e+222) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / Float64((B_m ^ 2.0) - Float64(4.0 * Float64(A * C)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e+222)
tmp = -2.0 * sqrt(((C * F) / ((B_m ^ 2.0) - (4.0 * (A * C)))));
else
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+222], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{+222}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{{B\_m}^{2} - 4 \cdot \left(A \cdot C\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e222Initial program 23.5%
Taylor expanded in A around -inf 23.3%
Taylor expanded in F around 0 14.2%
if 1e222 < (pow.f64 B #s(literal 2 binary64)) Initial program 7.6%
Taylor expanded in B around inf 30.6%
mul-1-neg30.6%
distribute-rgt-neg-in30.6%
Simplified30.6%
pow130.6%
distribute-rgt-neg-out30.6%
pow1/230.6%
pow1/230.6%
pow-prod-down30.7%
Applied egg-rr30.7%
unpow130.7%
unpow1/230.7%
Simplified30.7%
*-un-lft-identity30.7%
associate-*l/30.6%
Applied egg-rr30.6%
*-lft-identity30.6%
associate-/l*30.7%
Simplified30.7%
associate-*r/30.6%
sqrt-div39.1%
*-commutative39.1%
Applied egg-rr39.1%
Final simplification22.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 F)) (- (sqrt B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 * F)) / -sqrt(B_m);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 * f)) / -sqrt(b_m)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 * F)) / -math.sqrt(B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}
\end{array}
Initial program 18.3%
Taylor expanded in B around inf 13.0%
mul-1-neg13.0%
distribute-rgt-neg-in13.0%
Simplified13.0%
pow113.0%
distribute-rgt-neg-out13.0%
pow1/213.2%
pow1/213.2%
pow-prod-down13.3%
Applied egg-rr13.3%
unpow113.3%
unpow1/213.0%
Simplified13.0%
*-un-lft-identity13.0%
associate-*l/13.0%
Applied egg-rr13.0%
*-lft-identity13.0%
associate-/l*13.0%
Simplified13.0%
associate-*r/13.0%
sqrt-div16.4%
*-commutative16.4%
Applied egg-rr16.4%
Final simplification16.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt F) (- (sqrt (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(F) * -sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(f) * -sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(F) * -math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(F) * Float64(-sqrt(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) * -sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[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])\\
\\
\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)
\end{array}
Initial program 18.3%
Taylor expanded in B around inf 13.0%
mul-1-neg13.0%
distribute-rgt-neg-in13.0%
Simplified13.0%
pow113.0%
distribute-rgt-neg-out13.0%
pow1/213.2%
pow1/213.2%
pow-prod-down13.3%
Applied egg-rr13.3%
unpow113.3%
unpow1/213.0%
Simplified13.0%
*-un-lft-identity13.0%
associate-*l/13.0%
Applied egg-rr13.0%
*-lft-identity13.0%
associate-/l*13.0%
Simplified13.0%
pow1/213.3%
*-commutative13.3%
unpow-prod-down16.4%
pow1/216.4%
pow1/216.4%
Applied egg-rr16.4%
Final simplification16.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.2e+128) (- (sqrt (* F (/ 2.0 B_m)))) (* -2.0 (/ (sqrt (* C F)) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 7.2e+128) {
tmp = -sqrt((F * (2.0 / B_m)));
} else {
tmp = -2.0 * (sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 7.2d+128) then
tmp = -sqrt((f * (2.0d0 / b_m)))
else
tmp = (-2.0d0) * (sqrt((c * f)) / b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 7.2e+128) {
tmp = -Math.sqrt((F * (2.0 / B_m)));
} else {
tmp = -2.0 * (Math.sqrt((C * F)) / B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 7.2e+128: tmp = -math.sqrt((F * (2.0 / B_m))) else: tmp = -2.0 * (math.sqrt((C * F)) / B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 7.2e+128) tmp = Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(C * F)) / 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 (C <= 7.2e+128)
tmp = -sqrt((F * (2.0 / B_m)));
else
tmp = -2.0 * (sqrt((C * F)) / B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 7.2e+128], (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 7.2 \cdot 10^{+128}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 7.20000000000000054e128Initial program 19.8%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
distribute-rgt-neg-in14.2%
Simplified14.2%
pow114.2%
distribute-rgt-neg-out14.2%
pow1/214.5%
pow1/214.5%
pow-prod-down14.6%
Applied egg-rr14.6%
unpow114.6%
unpow1/214.3%
Simplified14.3%
*-un-lft-identity14.3%
associate-*l/14.2%
Applied egg-rr14.2%
*-lft-identity14.2%
associate-/l*14.3%
Simplified14.3%
if 7.20000000000000054e128 < C Initial program 9.7%
Simplified34.3%
Taylor expanded in C around -inf 22.7%
mul-1-neg22.7%
distribute-rgt-neg-in22.7%
+-commutative22.7%
mul-1-neg22.7%
unsub-neg22.7%
associate-*r*22.7%
associate-/l*22.7%
Simplified22.7%
Taylor expanded in A around -inf 22.0%
Taylor expanded in C around 0 5.5%
associate-*l/5.5%
*-lft-identity5.5%
*-commutative5.5%
Simplified5.5%
Final simplification12.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (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 18.3%
Taylor expanded in B around inf 13.0%
mul-1-neg13.0%
distribute-rgt-neg-in13.0%
Simplified13.0%
pow113.0%
distribute-rgt-neg-out13.0%
pow1/213.2%
pow1/213.2%
pow-prod-down13.3%
Applied egg-rr13.3%
unpow113.3%
unpow1/213.0%
Simplified13.0%
pow1/213.3%
associate-*l/13.2%
Applied egg-rr13.2%
Final simplification13.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* 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 18.3%
Taylor expanded in B around inf 13.0%
mul-1-neg13.0%
distribute-rgt-neg-in13.0%
Simplified13.0%
pow113.0%
distribute-rgt-neg-out13.0%
pow1/213.2%
pow1/213.2%
pow-prod-down13.3%
Applied egg-rr13.3%
unpow113.3%
unpow1/213.0%
Simplified13.0%
*-un-lft-identity13.0%
associate-*l/13.0%
Applied egg-rr13.0%
*-lft-identity13.0%
associate-/l*13.0%
Simplified13.0%
herbie shell --seed 2024110
(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))))