
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (+ A (+ C (hypot B_m (- A C)))))
(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 (* F (/ t_1 (fma -4.0 (* A C) (pow B_m 2.0))))) (- (sqrt 2.0)))
(if (<= t_5 -1e-201)
(/ (sqrt (* (* F t_0) (* 2.0 t_1))) (- t_0))
(if (<= t_5 INFINITY)
(/
(* (sqrt (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))) (sqrt t_3))
t_4)
(/ (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 = A + (C + hypot(B_m, (A - C)));
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((F * (t_1 / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_5 <= -1e-201) {
tmp = sqrt(((F * t_0) * (2.0 * t_1))) / -t_0;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (sqrt(((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C))) * sqrt(t_3)) / t_4;
} 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(A + Float64(C + hypot(B_m, Float64(A - C)))) 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(sqrt(Float64(F * Float64(t_1 / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_5 <= -1e-201) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * t_1))) / Float64(-t_0)); elseif (t_5 <= Inf) tmp = Float64(Float64(sqrt(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C))) * sqrt(t_3)) / t_4); 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[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $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[Sqrt[N[(F * N[(t$95$1 / 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$5, -1e-201], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] / t$95$4), $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 := A + \left(C + \mathsf{hypot}\left(B\_m, A - C\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:\\
\;\;\;\;\sqrt{F \cdot \frac{t\_1}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot t\_1\right)}}{-t\_0}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C} \cdot \sqrt{t\_3}}{t\_4}\\
\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.2%
Taylor expanded in F around 0 19.4%
mul-1-neg19.4%
Simplified65.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))) < -9.99999999999999946e-202Initial program 98.8%
Simplified98.8%
if -9.99999999999999946e-202 < (/.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.4%
pow1/216.4%
*-commutative16.4%
unpow-prod-down18.3%
pow1/218.3%
associate-+l+20.1%
unpow220.1%
unpow220.1%
hypot-define36.2%
pow1/236.2%
Applied egg-rr36.2%
Taylor expanded in A around -inf 21.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 B around inf 17.7%
mul-1-neg17.7%
Simplified17.7%
sqrt-div24.3%
Applied egg-rr24.3%
associate-*l/24.4%
pow1/224.4%
pow1/224.4%
pow-prod-down24.4%
pow1/224.4%
Applied egg-rr24.4%
Final simplification40.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
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2
(/
(* (sqrt (* 2.0 (* (- (pow B_m 2.0) t_0) F))) (sqrt (* 2.0 C)))
t_1))
(t_3 (/ (* B_m (sqrt (* (* 2.0 F) (+ C (hypot B_m C))))) t_1))
(t_4 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-49)
t_2
(if (<= (pow B_m 2.0) 1e+77)
t_3
(if (<= (pow B_m 2.0) 1e+111)
t_2
(if (<= (pow B_m 2.0) 5e+161)
(*
(sqrt
(* t_4 (* (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)) (* 2.0 F))))
(/ -1.0 t_4))
(if (<= (pow B_m 2.0) 5e+290)
t_3
(/ (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 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = (sqrt((2.0 * ((pow(B_m, 2.0) - t_0) * F))) * sqrt((2.0 * C))) / t_1;
double t_3 = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / t_1;
double t_4 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 5e-49) {
tmp = t_2;
} else if (pow(B_m, 2.0) <= 1e+77) {
tmp = t_3;
} else if (pow(B_m, 2.0) <= 1e+111) {
tmp = t_2;
} else if (pow(B_m, 2.0) <= 5e+161) {
tmp = sqrt((t_4 * (((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)) * (2.0 * F)))) * (-1.0 / t_4);
} else if (pow(B_m, 2.0) <= 5e+290) {
tmp = t_3;
} 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(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(Float64(sqrt(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F))) * sqrt(Float64(2.0 * C))) / t_1) t_3 = Float64(Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(B_m, C))))) / t_1) t_4 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-49) tmp = t_2; elseif ((B_m ^ 2.0) <= 1e+77) tmp = t_3; elseif ((B_m ^ 2.0) <= 1e+111) tmp = t_2; elseif ((B_m ^ 2.0) <= 5e+161) tmp = Float64(sqrt(Float64(t_4 * Float64(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)) * Float64(2.0 * F)))) * Float64(-1.0 / t_4)); elseif ((B_m ^ 2.0) <= 5e+290) tmp = t_3; 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[Sqrt[N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-49], t$95$2, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+77], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+111], t$95$2, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+161], N[(N[Sqrt[N[(t$95$4 * N[(N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+290], t$95$3, 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 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \frac{\sqrt{2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{t\_1}\\
t_3 := \frac{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{t\_1}\\
t_4 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-49}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+77}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+111}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+161}:\\
\;\;\;\;\sqrt{t\_4 \cdot \left(\left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right) \cdot \left(2 \cdot F\right)\right)} \cdot \frac{-1}{t\_4}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+290}:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-49 or 9.99999999999999983e76 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999957e110Initial program 18.1%
pow1/218.3%
*-commutative18.3%
unpow-prod-down20.9%
pow1/220.9%
associate-+l+21.7%
unpow221.7%
unpow221.7%
hypot-define33.8%
pow1/233.8%
Applied egg-rr33.8%
Taylor expanded in A around -inf 18.0%
if 4.9999999999999999e-49 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999983e76 or 4.9999999999999997e161 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e290Initial program 30.4%
Taylor expanded in A around 0 18.8%
associate-*l*18.8%
unpow218.8%
unpow218.8%
hypot-define23.2%
Simplified23.2%
*-un-lft-identity23.2%
distribute-rgt-neg-in23.2%
sqrt-unprod23.2%
associate-*r*23.2%
*-commutative23.2%
*-commutative23.2%
associate-*r*23.2%
Applied egg-rr23.2%
*-lft-identity23.2%
associate-*r*23.2%
Simplified23.2%
if 9.99999999999999957e110 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999997e161Initial program 14.4%
Simplified15.3%
div-inv15.3%
Applied egg-rr15.7%
associate-*r*15.7%
hypot-undefine15.2%
unpow215.2%
unpow215.2%
+-commutative15.2%
unpow215.2%
unpow215.2%
hypot-undefine15.7%
Simplified15.7%
Taylor expanded in A around -inf 14.3%
if 4.9999999999999998e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.6%
Taylor expanded in B around inf 30.8%
mul-1-neg30.8%
Simplified30.8%
sqrt-div41.7%
Applied egg-rr41.7%
associate-*l/41.8%
pow1/241.8%
pow1/241.8%
pow-prod-down41.9%
pow1/241.9%
Applied egg-rr41.9%
Final simplification25.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))))
(t_2 (+ A (+ C (hypot B_m (- A C))))))
(if (<= (pow B_m 2.0) 5e-112)
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+44)
(/ (* (sqrt (* F (* 2.0 t_1))) (sqrt t_2)) (- t_1))
(if (<= (pow B_m 2.0) 1e+274)
(*
(sqrt (* F (/ t_2 (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(/ (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 = (4.0 * A) * C;
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double t_2 = A + (C + hypot(B_m, (A - C)));
double tmp;
if (pow(B_m, 2.0) <= 5e-112) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+44) {
tmp = (sqrt((F * (2.0 * t_1))) * sqrt(t_2)) / -t_1;
} else if (pow(B_m, 2.0) <= 1e+274) {
tmp = sqrt((F * (t_2 / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} 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(Float64(4.0 * A) * C) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_2 = Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-112) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+44) tmp = Float64(Float64(sqrt(Float64(F * Float64(2.0 * t_1))) * sqrt(t_2)) / Float64(-t_1)); elseif ((B_m ^ 2.0) <= 1e+274) tmp = Float64(sqrt(Float64(F * Float64(t_2 / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); 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[(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]}, Block[{t$95$2 = N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-112], 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[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+44], N[(N[(N[Sqrt[N[(F * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+274], N[(N[Sqrt[N[(F * N[(t$95$2 / 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], 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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_2 := A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-112}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+44}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(2 \cdot t\_1\right)} \cdot \sqrt{t\_2}}{-t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+274}:\\
\;\;\;\;\sqrt{F \cdot \frac{t\_2}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000044e-112Initial program 16.5%
Taylor expanded in A around -inf 21.2%
if 5.00000000000000044e-112 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e44Initial program 49.2%
Simplified50.3%
pow1/250.3%
associate-*r*50.3%
associate-+r+49.6%
hypot-undefine49.4%
unpow249.4%
unpow249.4%
+-commutative49.4%
unpow-prod-down54.2%
*-commutative54.2%
pow1/254.2%
Applied egg-rr67.6%
unpow1/267.6%
associate-*l*67.7%
hypot-undefine54.4%
unpow254.4%
unpow254.4%
+-commutative54.4%
unpow254.4%
unpow254.4%
hypot-undefine67.7%
Simplified67.7%
if 1.0000000000000001e44 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999921e273Initial program 14.3%
Taylor expanded in F around 0 21.9%
mul-1-neg21.9%
Simplified59.5%
if 9.99999999999999921e273 < (pow.f64 B #s(literal 2 binary64)) Initial program 2.9%
Taylor expanded in B around inf 29.6%
mul-1-neg29.6%
Simplified29.6%
sqrt-div40.0%
Applied egg-rr40.0%
associate-*l/40.0%
pow1/240.0%
pow1/240.0%
pow-prod-down40.2%
pow1/240.2%
Applied egg-rr40.2%
Final simplification38.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 5e-49)
(/
(* (sqrt (* 2.0 (* (- (pow B_m 2.0) t_0) F))) (sqrt (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+274)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(/ (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 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 5e-49) {
tmp = (sqrt((2.0 * ((pow(B_m, 2.0) - t_0) * F))) * sqrt((2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+274) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} 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(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-49) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F))) * sqrt(Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+274) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-49], N[(N[(N[Sqrt[N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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], 1e+274], N[(N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 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], 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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+274}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-49Initial program 18.6%
pow1/218.8%
*-commutative18.8%
unpow-prod-down20.7%
pow1/220.7%
associate-+l+21.5%
unpow221.5%
unpow221.5%
hypot-define33.2%
pow1/233.2%
Applied egg-rr33.2%
Taylor expanded in A around -inf 18.6%
if 4.9999999999999999e-49 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999921e273Initial program 26.3%
Taylor expanded in F around 0 31.4%
mul-1-neg31.4%
Simplified58.4%
if 9.99999999999999921e273 < (pow.f64 B #s(literal 2 binary64)) Initial program 2.9%
Taylor expanded in B around inf 29.6%
mul-1-neg29.6%
Simplified29.6%
sqrt-div40.0%
Applied egg-rr40.0%
associate-*l/40.0%
pow1/240.0%
pow1/240.0%
pow-prod-down40.2%
pow1/240.2%
Applied egg-rr40.2%
Final simplification34.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 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-49)
(* (/ -1.0 t_0) (sqrt (* t_0 (* (* 2.0 C) (* 2.0 F)))))
(if (<= (pow B_m 2.0) 5e+290)
(/
(* B_m (sqrt (* (* 2.0 F) (+ C (hypot B_m C)))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(/ (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 tmp;
if (pow(B_m, 2.0) <= 5e-49) {
tmp = (-1.0 / t_0) * sqrt((t_0 * ((2.0 * C) * (2.0 * F))));
} else if (pow(B_m, 2.0) <= 5e+290) {
tmp = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} 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))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-49) tmp = Float64(Float64(-1.0 / t_0) * sqrt(Float64(t_0 * Float64(Float64(2.0 * C) * Float64(2.0 * F))))); elseif ((B_m ^ 2.0) <= 5e+290) tmp = Float64(Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(B_m, C))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-49], N[(N[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(t$95$0 * N[(N[(2.0 * C), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+290], N[(N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(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)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-49}:\\
\;\;\;\;\frac{-1}{t\_0} \cdot \sqrt{t\_0 \cdot \left(\left(2 \cdot C\right) \cdot \left(2 \cdot F\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+290}:\\
\;\;\;\;\frac{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-49Initial program 18.6%
Simplified25.8%
div-inv25.2%
Applied egg-rr24.4%
associate-*r*24.4%
hypot-undefine17.8%
unpow217.8%
unpow217.8%
+-commutative17.8%
unpow217.8%
unpow217.8%
hypot-undefine24.4%
Simplified24.4%
Taylor expanded in A around -inf 21.1%
if 4.9999999999999999e-49 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e290Initial program 26.7%
Taylor expanded in A around 0 17.3%
associate-*l*17.3%
unpow217.3%
unpow217.3%
hypot-define21.0%
Simplified21.0%
*-un-lft-identity21.0%
distribute-rgt-neg-in21.0%
sqrt-unprod21.1%
associate-*r*21.1%
*-commutative21.1%
*-commutative21.1%
associate-*r*21.1%
Applied egg-rr21.1%
*-lft-identity21.1%
associate-*r*21.1%
Simplified21.1%
if 4.9999999999999998e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.6%
Taylor expanded in B around inf 30.8%
mul-1-neg30.8%
Simplified30.8%
sqrt-div41.7%
Applied egg-rr41.7%
associate-*l/41.8%
pow1/241.8%
pow1/241.8%
pow-prod-down41.9%
pow1/241.9%
Applied egg-rr41.9%
Final simplification26.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)) (t_1 (- t_0 (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 5e-49)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C))) t_1)
(if (<= (pow B_m 2.0) 5e+290)
(/ (* B_m (sqrt (* (* 2.0 F) (+ C (hypot B_m C))))) t_1)
(/ (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 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double tmp;
if (pow(B_m, 2.0) <= 5e-49) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
} else if (pow(B_m, 2.0) <= 5e+290) {
tmp = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / t_1;
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - Math.pow(B_m, 2.0);
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-49) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
} else if (Math.pow(B_m, 2.0) <= 5e+290) {
tmp = (B_m * Math.sqrt(((2.0 * F) * (C + Math.hypot(B_m, C))))) / t_1;
} 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): t_0 = (4.0 * A) * C t_1 = t_0 - math.pow(B_m, 2.0) tmp = 0 if math.pow(B_m, 2.0) <= 5e-49: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1 elif math.pow(B_m, 2.0) <= 5e+290: tmp = (B_m * math.sqrt(((2.0 * F) * (C + math.hypot(B_m, C))))) / t_1 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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-49) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / t_1); elseif ((B_m ^ 2.0) <= 5e+290) tmp = Float64(Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(B_m, C))))) / t_1); 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)
t_0 = (4.0 * A) * C;
t_1 = t_0 - (B_m ^ 2.0);
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-49)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
elseif ((B_m ^ 2.0) <= 5e+290)
tmp = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / t_1;
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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-49], 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] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+290], N[(N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+290}:\\
\;\;\;\;\frac{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-49Initial program 18.6%
Taylor expanded in A around -inf 22.0%
if 4.9999999999999999e-49 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e290Initial program 26.7%
Taylor expanded in A around 0 17.3%
associate-*l*17.3%
unpow217.3%
unpow217.3%
hypot-define21.0%
Simplified21.0%
*-un-lft-identity21.0%
distribute-rgt-neg-in21.0%
sqrt-unprod21.1%
associate-*r*21.1%
*-commutative21.1%
*-commutative21.1%
associate-*r*21.1%
Applied egg-rr21.1%
*-lft-identity21.1%
associate-*r*21.1%
Simplified21.1%
if 4.9999999999999998e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.6%
Taylor expanded in B around inf 30.8%
mul-1-neg30.8%
Simplified30.8%
sqrt-div41.7%
Applied egg-rr41.7%
associate-*l/41.8%
pow1/241.8%
pow1/241.8%
pow-prod-down41.9%
pow1/241.9%
Applied egg-rr41.9%
Final simplification27.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)) (t_1 (- t_0 (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 5e-49)
(/ (* (sqrt (* 2.0 (* (- (pow B_m 2.0) t_0) F))) (sqrt (* 2.0 C))) t_1)
(if (<= (pow B_m 2.0) 5e+290)
(/ (* B_m (sqrt (* (* 2.0 F) (+ C (hypot B_m C))))) t_1)
(/ (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 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double tmp;
if (pow(B_m, 2.0) <= 5e-49) {
tmp = (sqrt((2.0 * ((pow(B_m, 2.0) - t_0) * F))) * sqrt((2.0 * C))) / t_1;
} else if (pow(B_m, 2.0) <= 5e+290) {
tmp = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / t_1;
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - Math.pow(B_m, 2.0);
double tmp;
if (Math.pow(B_m, 2.0) <= 5e-49) {
tmp = (Math.sqrt((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F))) * Math.sqrt((2.0 * C))) / t_1;
} else if (Math.pow(B_m, 2.0) <= 5e+290) {
tmp = (B_m * Math.sqrt(((2.0 * F) * (C + Math.hypot(B_m, C))))) / t_1;
} 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): t_0 = (4.0 * A) * C t_1 = t_0 - math.pow(B_m, 2.0) tmp = 0 if math.pow(B_m, 2.0) <= 5e-49: tmp = (math.sqrt((2.0 * ((math.pow(B_m, 2.0) - t_0) * F))) * math.sqrt((2.0 * C))) / t_1 elif math.pow(B_m, 2.0) <= 5e+290: tmp = (B_m * math.sqrt(((2.0 * F) * (C + math.hypot(B_m, C))))) / t_1 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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-49) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F))) * sqrt(Float64(2.0 * C))) / t_1); elseif ((B_m ^ 2.0) <= 5e+290) tmp = Float64(Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(B_m, C))))) / t_1); 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)
t_0 = (4.0 * A) * C;
t_1 = t_0 - (B_m ^ 2.0);
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e-49)
tmp = (sqrt((2.0 * (((B_m ^ 2.0) - t_0) * F))) * sqrt((2.0 * C))) / t_1;
elseif ((B_m ^ 2.0) <= 5e+290)
tmp = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / t_1;
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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-49], N[(N[(N[Sqrt[N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+290], N[(N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+290}:\\
\;\;\;\;\frac{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-49Initial program 18.6%
pow1/218.8%
*-commutative18.8%
unpow-prod-down20.7%
pow1/220.7%
associate-+l+21.5%
unpow221.5%
unpow221.5%
hypot-define33.2%
pow1/233.2%
Applied egg-rr33.2%
Taylor expanded in A around -inf 18.6%
if 4.9999999999999999e-49 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e290Initial program 26.7%
Taylor expanded in A around 0 17.3%
associate-*l*17.3%
unpow217.3%
unpow217.3%
hypot-define21.0%
Simplified21.0%
*-un-lft-identity21.0%
distribute-rgt-neg-in21.0%
sqrt-unprod21.1%
associate-*r*21.1%
*-commutative21.1%
*-commutative21.1%
associate-*r*21.1%
Applied egg-rr21.1%
*-lft-identity21.1%
associate-*r*21.1%
Simplified21.1%
if 4.9999999999999998e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.6%
Taylor expanded in B around inf 30.8%
mul-1-neg30.8%
Simplified30.8%
sqrt-div41.7%
Applied egg-rr41.7%
associate-*l/41.8%
pow1/241.8%
pow1/241.8%
pow-prod-down41.9%
pow1/241.9%
Applied egg-rr41.9%
Final simplification25.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 (<= B_m 6e-25)
(*
(/ -1.0 (fma B_m B_m (* A (* C -4.0))))
(sqrt (* -16.0 (* A (* F (pow C 2.0))))))
(if (<= B_m 1.75e+145)
(/
(* B_m (sqrt (* (* 2.0 F) (+ C (hypot B_m C)))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(/ (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 (B_m <= 6e-25) {
tmp = (-1.0 / fma(B_m, B_m, (A * (C * -4.0)))) * sqrt((-16.0 * (A * (F * pow(C, 2.0)))));
} else if (B_m <= 1.75e+145) {
tmp = (B_m * sqrt(((2.0 * F) * (C + hypot(B_m, C))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} 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) tmp = 0.0 if (B_m <= 6e-25) tmp = Float64(Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0)))) * sqrt(Float64(-16.0 * Float64(A * Float64(F * (C ^ 2.0)))))); elseif (B_m <= 1.75e+145) tmp = Float64(Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(C + hypot(B_m, C))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); 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_] := If[LessEqual[B$95$m, 6e-25], N[(N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-16.0 * N[(A * N[(F * N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.75e+145], N[(N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(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 \leq 6 \cdot 10^{-25}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{-16 \cdot \left(A \cdot \left(F \cdot {C}^{2}\right)\right)}\\
\mathbf{elif}\;B\_m \leq 1.75 \cdot 10^{+145}:\\
\;\;\;\;\frac{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 5.9999999999999995e-25Initial program 17.4%
Simplified22.9%
div-inv22.4%
Applied egg-rr22.0%
associate-*r*22.0%
hypot-undefine16.9%
unpow216.9%
unpow216.9%
+-commutative16.9%
unpow216.9%
unpow216.9%
hypot-undefine22.0%
Simplified22.0%
Taylor expanded in A around -inf 11.5%
if 5.9999999999999995e-25 < B < 1.7500000000000001e145Initial program 27.7%
Taylor expanded in A around 0 34.2%
associate-*l*34.2%
unpow234.2%
unpow234.2%
hypot-define41.0%
Simplified41.0%
*-un-lft-identity41.0%
distribute-rgt-neg-in41.0%
sqrt-unprod41.1%
associate-*r*41.1%
*-commutative41.1%
*-commutative41.1%
associate-*r*41.1%
Applied egg-rr41.1%
*-lft-identity41.1%
associate-*r*41.1%
Simplified41.1%
if 1.7500000000000001e145 < B Initial program 0.2%
Taylor expanded in B around inf 52.5%
mul-1-neg52.5%
Simplified52.5%
sqrt-div72.9%
Applied egg-rr72.9%
associate-*l/73.1%
pow1/273.1%
pow1/273.1%
pow-prod-down73.3%
pow1/273.3%
Applied egg-rr73.3%
Final simplification24.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 8.5e-18)
(*
(/ -1.0 (fma B_m B_m (* A (* C -4.0))))
(sqrt (* -16.0 (* A (* F (pow C 2.0))))))
(/ (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 (B_m <= 8.5e-18) {
tmp = (-1.0 / fma(B_m, B_m, (A * (C * -4.0)))) * sqrt((-16.0 * (A * (F * pow(C, 2.0)))));
} 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) tmp = 0.0 if (B_m <= 8.5e-18) tmp = Float64(Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0)))) * sqrt(Float64(-16.0 * Float64(A * Float64(F * (C ^ 2.0)))))); 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_] := If[LessEqual[B$95$m, 8.5e-18], N[(N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-16.0 * N[(A * N[(F * N[Power[C, 2.0], $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 \leq 8.5 \cdot 10^{-18}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{-16 \cdot \left(A \cdot \left(F \cdot {C}^{2}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 8.4999999999999995e-18Initial program 17.4%
Simplified22.9%
div-inv22.4%
Applied egg-rr22.0%
associate-*r*22.0%
hypot-undefine16.9%
unpow216.9%
unpow216.9%
+-commutative16.9%
unpow216.9%
unpow216.9%
hypot-undefine22.0%
Simplified22.0%
Taylor expanded in A around -inf 11.5%
if 8.4999999999999995e-18 < B Initial program 12.2%
Taylor expanded in B around inf 46.2%
mul-1-neg46.2%
Simplified46.2%
sqrt-div59.6%
Applied egg-rr59.6%
associate-*l/59.7%
pow1/259.7%
pow1/259.7%
pow-prod-down59.9%
pow1/259.9%
Applied egg-rr59.9%
Final simplification24.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 (if (<= F 1.28e+39) (* (/ (sqrt 2.0) B_m) (- (sqrt (* F (+ C (hypot B_m 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 (F <= 1.28e+39) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + hypot(B_m, C))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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.28e+39) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (C + Math.hypot(B_m, 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 F <= 1.28e+39: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (C + math.hypot(B_m, 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 (F <= 1.28e+39) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(C + hypot(B_m, 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 (F <= 1.28e+39)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + hypot(B_m, 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[F, 1.28e+39], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $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}\;F \leq 1.28 \cdot 10^{+39}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if F < 1.27999999999999994e39Initial program 15.2%
Taylor expanded in A around 0 5.9%
mul-1-neg5.9%
unpow25.9%
unpow25.9%
hypot-define15.7%
Simplified15.7%
if 1.27999999999999994e39 < F Initial program 17.2%
Taylor expanded in B around inf 25.4%
mul-1-neg25.4%
Simplified25.4%
sqrt-div25.5%
Applied egg-rr25.5%
associate-*l/25.6%
pow1/225.6%
pow1/225.6%
pow-prod-down25.6%
pow1/225.6%
Applied egg-rr25.6%
Final simplification19.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 (fabs (* 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(fabs((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(abs((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(Math.abs((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(math.fabs((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(abs(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(abs((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[Abs[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\left|F \cdot \frac{2}{B\_m}\right|}
\end{array}
Initial program 16.0%
Taylor expanded in B around inf 14.5%
mul-1-neg14.5%
Simplified14.5%
pow114.5%
sqrt-unprod14.6%
Applied egg-rr14.6%
unpow114.6%
Simplified14.6%
add-sqr-sqrt14.6%
pow1/214.6%
pow1/214.8%
pow-prod-down16.1%
pow216.1%
associate-*l/16.1%
Applied egg-rr16.1%
unpow1/216.1%
unpow216.1%
rem-sqrt-square25.1%
associate-/l*25.0%
Simplified25.0%
Final simplification25.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt 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 16.0%
Taylor expanded in B around inf 14.5%
mul-1-neg14.5%
Simplified14.5%
sqrt-div18.0%
Applied egg-rr18.0%
associate-*l/18.0%
pow1/218.0%
pow1/218.0%
pow-prod-down18.1%
pow1/218.1%
Applied egg-rr18.1%
sqrt-undiv14.6%
associate-*r/14.5%
pow1/214.8%
*-commutative14.8%
unpow-prod-down18.0%
pow1/218.0%
pow1/218.0%
Applied egg-rr18.0%
Final simplification18.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 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 16.0%
Taylor expanded in B around inf 14.5%
mul-1-neg14.5%
Simplified14.5%
sqrt-div18.0%
Applied egg-rr18.0%
associate-*l/18.0%
pow1/218.0%
pow1/218.0%
pow-prod-down18.1%
pow1/218.1%
Applied egg-rr18.1%
Final simplification18.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 (- (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.0%
Taylor expanded in B around inf 14.5%
mul-1-neg14.5%
Simplified14.5%
sqrt-div18.0%
Applied egg-rr18.0%
sqrt-div14.5%
sqrt-prod14.6%
pow1/214.8%
associate-*l/14.8%
Applied egg-rr14.8%
Final simplification14.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* 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.0%
Taylor expanded in B around inf 14.5%
mul-1-neg14.5%
Simplified14.5%
sqrt-div18.0%
Applied egg-rr18.0%
sqrt-div14.5%
sqrt-prod14.6%
pow1/214.8%
associate-*l/14.8%
Applied egg-rr14.8%
unpow1/214.6%
associate-/l*14.5%
Simplified14.5%
Final simplification14.5%
herbie shell --seed 2024073
(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))))