
(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 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (* 2.0 (* (- (pow B_m 2.0) t_0) F)))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3
(/
(sqrt (* t_1 (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2)))
(if (<= t_3 -4e-187)
(*
(*
(sqrt
(/ (+ (+ A C) (hypot B_m (- A C))) (fma (* A C) -4.0 (pow B_m 2.0))))
(sqrt F))
(- (sqrt 2.0)))
(if (<= t_3 1e-71)
(/ (sqrt (* t_1 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))) t_2)
(if (<= t_3 INFINITY)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* (* A C) -4.0)))))
(sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- (fma B_m B_m (* A (* C -4.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 = 2.0 * ((pow(B_m, 2.0) - t_0) * F);
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = sqrt((t_1 * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -4e-187) {
tmp = (sqrt((((A + C) + hypot(B_m, (A - C))) / fma((A * C), -4.0, pow(B_m, 2.0)))) * sqrt(F)) * -sqrt(2.0);
} else if (t_3 <= 1e-71) {
tmp = sqrt((t_1 * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, ((A * C) * -4.0))))) * sqrt((A + (C + hypot((A - C), B_m))))) / -fma(B_m, B_m, (A * (C * -4.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 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= -4e-187) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(Float64(A * C), -4.0, (B_m ^ 2.0)))) * sqrt(F)) * Float64(-sqrt(2.0))); elseif (t_3 <= 1e-71) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / t_2); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.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[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t$95$1 * 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]}, If[LessEqual[t$95$3, -4e-187], N[(N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[(A * C), $MachinePrecision] * -4.0 + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 1e-71], N[(N[Sqrt[N[(t$95$1 * 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[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -4 \cdot 10^{-187}:\\
\;\;\;\;\left(\sqrt{\frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(A \cdot C, -4, {B\_m}^{2}\right)}} \cdot \sqrt{F}\right) \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 10^{-71}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\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))) < -4.0000000000000001e-187Initial program 42.6%
Taylor expanded in F around 0 43.8%
mul-1-neg43.8%
*-commutative43.8%
distribute-rgt-neg-in43.8%
associate-/l*46.9%
cancel-sign-sub-inv46.9%
metadata-eval46.9%
+-commutative46.9%
Simplified71.4%
pow1/271.4%
*-commutative71.4%
unpow-prod-down82.3%
pow1/282.3%
associate-+r+81.8%
fma-undefine81.8%
*-commutative81.8%
*-commutative81.8%
fma-define81.8%
pow1/281.8%
Applied egg-rr81.8%
if -4.0000000000000001e-187 < (/.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.9999999999999992e-72Initial program 7.7%
Taylor expanded in A around -inf 43.9%
if 9.9999999999999992e-72 < (/.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 27.7%
Simplified47.0%
associate-*r*47.0%
associate-+r+47.0%
hypot-undefine27.7%
unpow227.7%
unpow227.7%
+-commutative27.7%
sqrt-prod27.7%
*-commutative27.7%
associate-*r*27.7%
associate-+l+27.7%
Applied egg-rr75.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))) Initial program 0.0%
Taylor expanded in B around inf 18.1%
mul-1-neg18.1%
distribute-rgt-neg-in18.1%
Simplified18.1%
distribute-rgt-neg-out18.1%
pow1/218.3%
pow1/218.3%
pow-prod-down18.4%
Applied egg-rr18.4%
unpow1/218.2%
associate-*l/18.2%
sqrt-div26.0%
Applied egg-rr26.0%
Final simplification52.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
(let* ((t_0 (* (* 4.0 A) C)) (t_1 (- (sqrt 2.0))) (t_2 (* A (* C -4.0))))
(if (<= (pow B_m 2.0) 5e-215)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 2e+63)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* (* A C) -4.0)))))
(sqrt (+ A (+ C (hypot (- A C) B_m)))))
(- (fma B_m B_m t_2)))
(if (<= (pow B_m 2.0) 2e+151)
(* (sqrt (* F (/ -0.5 A))) t_1)
(if (<= (pow B_m 2.0) 2e+196)
(*
(sqrt
(* F (/ (+ A (+ C (hypot B_m (- A C)))) (+ (pow B_m 2.0) t_2))))
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 = -sqrt(2.0);
double t_2 = A * (C * -4.0);
double tmp;
if (pow(B_m, 2.0) <= 5e-215) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 2e+63) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, ((A * C) * -4.0))))) * sqrt((A + (C + hypot((A - C), B_m))))) / -fma(B_m, B_m, t_2);
} else if (pow(B_m, 2.0) <= 2e+151) {
tmp = sqrt((F * (-0.5 / A))) * t_1;
} else if (pow(B_m, 2.0) <= 2e+196) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + t_2)))) * t_1;
} 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(-sqrt(2.0)) t_2 = Float64(A * Float64(C * -4.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-215) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 2e+63) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / Float64(-fma(B_m, B_m, t_2))); elseif ((B_m ^ 2.0) <= 2e+151) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * t_1); elseif ((B_m ^ 2.0) <= 2e+196) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + t_2)))) * t_1); 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[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$2 = N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-215], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+63], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + t$95$2), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+151], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+196], 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[(N[Power[B$95$m, 2.0], $MachinePrecision] + t$95$2), $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 := -\sqrt{2}\\
t_2 := A \cdot \left(C \cdot -4\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-215}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, t\_2\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+151}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot t\_1\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+196}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + t\_2}} \cdot 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.99999999999999956e-215Initial program 19.0%
Taylor expanded in A around -inf 23.8%
if 4.99999999999999956e-215 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000012e63Initial program 38.6%
Simplified45.5%
associate-*r*45.5%
associate-+r+45.2%
hypot-undefine38.6%
unpow238.6%
unpow238.6%
+-commutative38.6%
sqrt-prod43.2%
*-commutative43.2%
associate-*r*43.2%
associate-+l+43.2%
Applied egg-rr63.7%
if 2.00000000000000012e63 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000003e151Initial program 17.8%
Taylor expanded in F around 0 17.5%
mul-1-neg17.5%
*-commutative17.5%
distribute-rgt-neg-in17.5%
associate-/l*22.5%
cancel-sign-sub-inv22.5%
metadata-eval22.5%
+-commutative22.5%
Simplified34.0%
Taylor expanded in A around -inf 43.4%
if 2.00000000000000003e151 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e196Initial program 24.9%
Taylor expanded in F around 0 39.5%
mul-1-neg39.5%
*-commutative39.5%
distribute-rgt-neg-in39.5%
associate-/l*46.9%
cancel-sign-sub-inv46.9%
metadata-eval46.9%
+-commutative46.9%
Simplified76.9%
fma-undefine76.9%
*-commutative76.9%
*-commutative76.9%
associate-*r*76.9%
Applied egg-rr76.9%
if 1.9999999999999999e196 < (pow.f64 B #s(literal 2 binary64)) Initial program 2.8%
Taylor expanded in B around inf 27.5%
mul-1-neg27.5%
distribute-rgt-neg-in27.5%
Simplified27.5%
distribute-rgt-neg-out27.5%
pow1/227.5%
pow1/227.5%
pow-prod-down27.7%
Applied egg-rr27.7%
unpow1/227.7%
associate-*l/27.7%
sqrt-div39.0%
Applied egg-rr39.0%
Final simplification42.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))))
(if (<= (pow B_m 2.0) 1e-68)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C))) t_1)
(if (<= (pow B_m 2.0) 2e+63)
(-
(sqrt
(*
2.0
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(fma (* A C) -4.0 (pow B_m 2.0))))))
(if (<= (pow B_m 2.0) 1e+143)
(* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))
(if (<= (pow B_m 2.0) 2e+305)
(/ (* B_m (* (sqrt 2.0) (sqrt (* 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) <= 1e-68) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / t_1;
} else if (pow(B_m, 2.0) <= 2e+63) {
tmp = -sqrt((2.0 * ((F * (A + (C + hypot(B_m, (A - C))))) / fma((A * C), -4.0, pow(B_m, 2.0)))));
} else if (pow(B_m, 2.0) <= 1e+143) {
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
} else if (pow(B_m, 2.0) <= 2e+305) {
tmp = (B_m * (sqrt(2.0) * sqrt((F * (C + hypot(B_m, C)))))) / t_1;
} 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)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-68) 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) <= 2e+63) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / fma(Float64(A * C), -4.0, (B_m ^ 2.0)))))); elseif ((B_m ^ 2.0) <= 1e+143) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))); elseif ((B_m ^ 2.0) <= 2e+305) tmp = Float64(Float64(B_m * Float64(sqrt(2.0) * sqrt(Float64(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 = 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], 1e-68], 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], 2e+63], (-N[Sqrt[N[(2.0 * N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(A * C), $MachinePrecision] * -4.0 + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+143], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+305], N[(N[(B$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $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 10^{-68}:\\
\;\;\;\;\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 2 \cdot 10^{+63}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{\mathsf{fma}\left(A \cdot C, -4, {B\_m}^{2}\right)}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+143}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+305}:\\
\;\;\;\;\frac{B\_m \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\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)) < 1.00000000000000007e-68Initial program 23.3%
Taylor expanded in A around -inf 24.1%
if 1.00000000000000007e-68 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000012e63Initial program 40.5%
Taylor expanded in F around 0 45.6%
mul-1-neg45.6%
*-commutative45.6%
distribute-rgt-neg-in45.6%
associate-/l*45.7%
cancel-sign-sub-inv45.7%
metadata-eval45.7%
+-commutative45.7%
Simplified60.6%
pow160.6%
Applied egg-rr59.6%
unpow159.6%
unpow1/259.6%
associate-+l+60.5%
Simplified60.5%
if 2.00000000000000012e63 < (pow.f64 B #s(literal 2 binary64)) < 1e143Initial program 20.8%
Taylor expanded in F around 0 20.5%
mul-1-neg20.5%
*-commutative20.5%
distribute-rgt-neg-in20.5%
associate-/l*26.3%
cancel-sign-sub-inv26.3%
metadata-eval26.3%
+-commutative26.3%
Simplified33.5%
Taylor expanded in A around -inf 44.6%
if 1e143 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e305Initial program 17.1%
Taylor expanded in A around 0 26.3%
associate-*l*26.3%
unpow226.3%
unpow226.3%
hypot-define32.4%
Simplified32.4%
if 1.9999999999999999e305 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in B around inf 29.0%
mul-1-neg29.0%
distribute-rgt-neg-in29.0%
Simplified29.0%
distribute-rgt-neg-out29.0%
pow1/229.0%
pow1/229.0%
pow-prod-down29.2%
Applied egg-rr29.2%
unpow1/229.2%
associate-*l/29.2%
sqrt-div42.2%
Applied egg-rr42.2%
Final simplification36.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)) (t_1 (* A (* C -4.0))) (t_2 (fma B_m B_m t_1)))
(if (<= (pow B_m 2.0) 5e-215)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 5e-35)
(*
(sqrt (* F (* 2.0 t_2)))
(- (/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) t_2)))
(if (<= (pow B_m 2.0) 5e+276)
(*
(sqrt
(* F (/ (+ A (+ C (hypot B_m (- A C)))) (+ (pow B_m 2.0) t_1))))
(- (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 = A * (C * -4.0);
double t_2 = fma(B_m, B_m, t_1);
double tmp;
if (pow(B_m, 2.0) <= 5e-215) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 5e-35) {
tmp = sqrt((F * (2.0 * t_2))) * -(sqrt(((A + C) + hypot((A - C), B_m))) / t_2);
} else if (pow(B_m, 2.0) <= 5e+276) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + t_1)))) * -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 = Float64(A * Float64(C * -4.0)) t_2 = fma(B_m, B_m, t_1) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-215) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 5e-35) tmp = Float64(sqrt(Float64(F * Float64(2.0 * t_2))) * Float64(-Float64(sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))) / t_2))); elseif ((B_m ^ 2.0) <= 5e+276) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + t_1)))) * 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[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(B$95$m * B$95$m + t$95$1), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-215], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-35], N[(N[Sqrt[N[(F * N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+276], 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[(N[Power[B$95$m, 2.0], $MachinePrecision] + t$95$1), $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 := A \cdot \left(C \cdot -4\right)\\
t_2 := \mathsf{fma}\left(B\_m, B\_m, t\_1\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-215}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{-35}:\\
\;\;\;\;\sqrt{F \cdot \left(2 \cdot t\_2\right)} \cdot \left(-\frac{\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{t\_2}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+276}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + t\_1}} \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.99999999999999956e-215Initial program 19.0%
Taylor expanded in A around -inf 23.8%
if 4.99999999999999956e-215 < (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999964e-35Initial program 34.0%
Simplified40.0%
associate-*r*40.0%
associate-+r+39.9%
hypot-undefine34.0%
unpow234.0%
unpow234.0%
+-commutative34.0%
sqrt-prod39.5%
*-commutative39.5%
associate-*r*39.5%
associate-+l+39.5%
Applied egg-rr59.2%
associate-/l*59.1%
associate-*l*59.1%
associate-*r*59.1%
associate-+r+59.0%
Applied egg-rr59.0%
if 4.99999999999999964e-35 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000001e276Initial program 28.2%
Taylor expanded in F around 0 36.2%
mul-1-neg36.2%
*-commutative36.2%
distribute-rgt-neg-in36.2%
associate-/l*40.1%
cancel-sign-sub-inv40.1%
metadata-eval40.1%
+-commutative40.1%
Simplified59.8%
fma-undefine59.8%
*-commutative59.8%
*-commutative59.8%
associate-*r*59.8%
Applied egg-rr59.8%
if 5.00000000000000001e276 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.5%
Taylor expanded in B around inf 28.8%
mul-1-neg28.8%
distribute-rgt-neg-in28.8%
Simplified28.8%
distribute-rgt-neg-out28.8%
pow1/228.8%
pow1/228.8%
pow-prod-down29.0%
Applied egg-rr29.0%
unpow1/229.0%
associate-*l/29.0%
sqrt-div41.0%
Applied egg-rr41.0%
Final simplification43.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)))
(if (<= (pow B_m 2.0) 1e-68)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 2e+63)
(-
(sqrt
(*
2.0
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(fma (* A C) -4.0 (pow B_m 2.0))))))
(if (<= (pow B_m 2.0) 5e+128)
(* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))
(if (<= (pow B_m 2.0) 2e+305)
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ 1.0 (* 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 t_0 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 1e-68) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 2e+63) {
tmp = -sqrt((2.0 * ((F * (A + (C + hypot(B_m, (A - C))))) / fma((A * C), -4.0, pow(B_m, 2.0)))));
} else if (pow(B_m, 2.0) <= 5e+128) {
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
} else if (pow(B_m, 2.0) <= 2e+305) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((1.0 / (F * (C + hypot(B_m, C))))));
} 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) <= 1e-68) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 2e+63) tmp = Float64(-sqrt(Float64(2.0 * Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / fma(Float64(A * C), -4.0, (B_m ^ 2.0)))))); elseif ((B_m ^ 2.0) <= 5e+128) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))); elseif ((B_m ^ 2.0) <= 2e+305) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(1.0 / 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 = 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], 1e-68], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+63], (-N[Sqrt[N[(2.0 * N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(A * C), $MachinePrecision] * -4.0 + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+128], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+305], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-68}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+63}:\\
\;\;\;\;-\sqrt{2 \cdot \frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{\mathsf{fma}\left(A \cdot C, -4, {B\_m}^{2}\right)}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+128}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+305}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000007e-68Initial program 23.3%
Taylor expanded in A around -inf 24.1%
if 1.00000000000000007e-68 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000012e63Initial program 40.5%
Taylor expanded in F around 0 45.6%
mul-1-neg45.6%
*-commutative45.6%
distribute-rgt-neg-in45.6%
associate-/l*45.7%
cancel-sign-sub-inv45.7%
metadata-eval45.7%
+-commutative45.7%
Simplified60.6%
pow160.6%
Applied egg-rr59.6%
unpow159.6%
unpow1/259.6%
associate-+l+60.5%
Simplified60.5%
if 2.00000000000000012e63 < (pow.f64 B #s(literal 2 binary64)) < 5e128Initial program 21.9%
Taylor expanded in F around 0 21.8%
mul-1-neg21.8%
*-commutative21.8%
distribute-rgt-neg-in21.8%
associate-/l*28.0%
cancel-sign-sub-inv28.0%
metadata-eval28.0%
+-commutative28.0%
Simplified35.7%
Taylor expanded in A around -inf 47.5%
if 5e128 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e305Initial program 16.7%
Simplified31.1%
associate-*r*31.1%
associate-+r+31.0%
hypot-undefine16.7%
unpow216.7%
unpow216.7%
+-commutative16.7%
sqrt-prod30.8%
*-commutative30.8%
associate-*r*30.8%
associate-+l+30.8%
Applied egg-rr50.5%
clear-num50.6%
inv-pow50.6%
sqrt-unprod31.1%
associate-*l*31.1%
associate-*r*31.1%
associate-+r+31.0%
Applied egg-rr31.0%
unpow-131.0%
associate-*l*11.5%
Simplified11.5%
Taylor expanded in A around 0 25.6%
mul-1-neg25.6%
unpow225.6%
unpow225.6%
hypot-define31.3%
Simplified31.3%
if 1.9999999999999999e305 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in B around inf 29.0%
mul-1-neg29.0%
distribute-rgt-neg-in29.0%
Simplified29.0%
distribute-rgt-neg-out29.0%
pow1/229.0%
pow1/229.0%
pow-prod-down29.2%
Applied egg-rr29.2%
unpow1/229.2%
associate-*l/29.2%
sqrt-div42.2%
Applied egg-rr42.2%
Final simplification36.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2 (* 2.0 (* (- (pow B_m 2.0) t_0) F)))
(t_3 (- (sqrt 2.0))))
(if (<= B_m 7.5e-204)
(/ (sqrt (* t_2 (* 2.0 C))) t_1)
(if (<= B_m 7.5e-147)
(* (sqrt (* F (/ -0.5 A))) t_3)
(if (<= B_m 2.35e-29)
(/ (sqrt (* t_2 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))) t_1)
(if (<= B_m 6.5e+138)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(+ (pow B_m 2.0) (* A (* C -4.0))))))
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 = 2.0 * ((pow(B_m, 2.0) - t_0) * F);
double t_3 = -sqrt(2.0);
double tmp;
if (B_m <= 7.5e-204) {
tmp = sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 7.5e-147) {
tmp = sqrt((F * (-0.5 / A))) * t_3;
} else if (B_m <= 2.35e-29) {
tmp = sqrt((t_2 * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_1;
} else if (B_m <= 6.5e+138) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + (A * (C * -4.0)))))) * t_3;
} 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 t_2 = 2.0 * ((Math.pow(B_m, 2.0) - t_0) * F);
double t_3 = -Math.sqrt(2.0);
double tmp;
if (B_m <= 7.5e-204) {
tmp = Math.sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 7.5e-147) {
tmp = Math.sqrt((F * (-0.5 / A))) * t_3;
} else if (B_m <= 2.35e-29) {
tmp = Math.sqrt((t_2 * ((-0.5 * (Math.pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_1;
} else if (B_m <= 6.5e+138) {
tmp = Math.sqrt((F * ((A + (C + Math.hypot(B_m, (A - C)))) / (Math.pow(B_m, 2.0) + (A * (C * -4.0)))))) * t_3;
} 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) t_2 = 2.0 * ((math.pow(B_m, 2.0) - t_0) * F) t_3 = -math.sqrt(2.0) tmp = 0 if B_m <= 7.5e-204: tmp = math.sqrt((t_2 * (2.0 * C))) / t_1 elif B_m <= 7.5e-147: tmp = math.sqrt((F * (-0.5 / A))) * t_3 elif B_m <= 2.35e-29: tmp = math.sqrt((t_2 * ((-0.5 * (math.pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_1 elif B_m <= 6.5e+138: tmp = math.sqrt((F * ((A + (C + math.hypot(B_m, (A - C)))) / (math.pow(B_m, 2.0) + (A * (C * -4.0)))))) * t_3 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)) t_2 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) t_3 = Float64(-sqrt(2.0)) tmp = 0.0 if (B_m <= 7.5e-204) tmp = Float64(sqrt(Float64(t_2 * Float64(2.0 * C))) / t_1); elseif (B_m <= 7.5e-147) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * t_3); elseif (B_m <= 2.35e-29) tmp = Float64(sqrt(Float64(t_2 * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / t_1); elseif (B_m <= 6.5e+138) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + Float64(A * Float64(C * -4.0)))))) * t_3); 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);
t_2 = 2.0 * (((B_m ^ 2.0) - t_0) * F);
t_3 = -sqrt(2.0);
tmp = 0.0;
if (B_m <= 7.5e-204)
tmp = sqrt((t_2 * (2.0 * C))) / t_1;
elseif (B_m <= 7.5e-147)
tmp = sqrt((F * (-0.5 / A))) * t_3;
elseif (B_m <= 2.35e-29)
tmp = sqrt((t_2 * ((-0.5 * ((B_m ^ 2.0) / A)) + (2.0 * C)))) / t_1;
elseif (B_m <= 6.5e+138)
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / ((B_m ^ 2.0) + (A * (C * -4.0)))))) * t_3;
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]}, Block[{t$95$2 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 7.5e-204], N[(N[Sqrt[N[(t$95$2 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 7.5e-147], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[B$95$m, 2.35e-29], N[(N[Sqrt[N[(t$95$2 * 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$1), $MachinePrecision], If[LessEqual[B$95$m, 6.5e+138], 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[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$3), $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}\\
t_2 := 2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\\
t_3 := -\sqrt{2}\\
\mathbf{if}\;B\_m \leq 7.5 \cdot 10^{-204}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 7.5 \cdot 10^{-147}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot t\_3\\
\mathbf{elif}\;B\_m \leq 2.35 \cdot 10^{-29}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{+138}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + A \cdot \left(C \cdot -4\right)}} \cdot t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 7.5000000000000003e-204Initial program 18.6%
Taylor expanded in A around -inf 14.9%
if 7.5000000000000003e-204 < B < 7.50000000000000047e-147Initial program 18.9%
Taylor expanded in F around 0 18.0%
mul-1-neg18.0%
*-commutative18.0%
distribute-rgt-neg-in18.0%
associate-/l*17.8%
cancel-sign-sub-inv17.8%
metadata-eval17.8%
+-commutative17.8%
Simplified35.0%
Taylor expanded in A around -inf 35.2%
if 7.50000000000000047e-147 < B < 2.3499999999999999e-29Initial program 30.7%
Taylor expanded in A around -inf 35.4%
if 2.3499999999999999e-29 < B < 6.50000000000000054e138Initial program 29.2%
Taylor expanded in F around 0 33.4%
mul-1-neg33.4%
*-commutative33.4%
distribute-rgt-neg-in33.4%
associate-/l*37.7%
cancel-sign-sub-inv37.7%
metadata-eval37.7%
+-commutative37.7%
Simplified52.0%
fma-undefine52.0%
*-commutative52.0%
*-commutative52.0%
associate-*r*52.0%
Applied egg-rr52.0%
if 6.50000000000000054e138 < B Initial program 0.2%
Taylor expanded in B around inf 48.7%
mul-1-neg48.7%
distribute-rgt-neg-in48.7%
Simplified48.7%
distribute-rgt-neg-out48.7%
pow1/248.7%
pow1/248.7%
pow-prod-down48.9%
Applied egg-rr48.9%
unpow1/248.9%
associate-*l/48.9%
sqrt-div71.2%
Applied egg-rr71.2%
Final simplification32.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
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0))))
(t_2 (- (sqrt 2.0))))
(if (<= B_m 9e-204)
t_1
(if (<= B_m 7.5e-147)
(* (sqrt (* F (/ -0.5 A))) t_2)
(if (<= B_m 5.6e-34)
t_1
(if (<= B_m 5.5e+138)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(+ (pow B_m 2.0) (* A (* C -4.0))))))
t_2)
(/ (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 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
double t_2 = -sqrt(2.0);
double tmp;
if (B_m <= 9e-204) {
tmp = t_1;
} else if (B_m <= 7.5e-147) {
tmp = sqrt((F * (-0.5 / A))) * t_2;
} else if (B_m <= 5.6e-34) {
tmp = t_1;
} else if (B_m <= 5.5e+138) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / (pow(B_m, 2.0) + (A * (C * -4.0)))))) * t_2;
} 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 = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
double t_2 = -Math.sqrt(2.0);
double tmp;
if (B_m <= 9e-204) {
tmp = t_1;
} else if (B_m <= 7.5e-147) {
tmp = Math.sqrt((F * (-0.5 / A))) * t_2;
} else if (B_m <= 5.6e-34) {
tmp = t_1;
} else if (B_m <= 5.5e+138) {
tmp = Math.sqrt((F * ((A + (C + Math.hypot(B_m, (A - C)))) / (Math.pow(B_m, 2.0) + (A * (C * -4.0)))))) * t_2;
} 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 = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) t_2 = -math.sqrt(2.0) tmp = 0 if B_m <= 9e-204: tmp = t_1 elif B_m <= 7.5e-147: tmp = math.sqrt((F * (-0.5 / A))) * t_2 elif B_m <= 5.6e-34: tmp = t_1 elif B_m <= 5.5e+138: tmp = math.sqrt((F * ((A + (C + math.hypot(B_m, (A - C)))) / (math.pow(B_m, 2.0) + (A * (C * -4.0)))))) * t_2 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(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))) t_2 = Float64(-sqrt(2.0)) tmp = 0.0 if (B_m <= 9e-204) tmp = t_1; elseif (B_m <= 7.5e-147) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * t_2); elseif (B_m <= 5.6e-34) tmp = t_1; elseif (B_m <= 5.5e+138) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / Float64((B_m ^ 2.0) + Float64(A * Float64(C * -4.0)))))) * t_2); 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 = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
t_2 = -sqrt(2.0);
tmp = 0.0;
if (B_m <= 9e-204)
tmp = t_1;
elseif (B_m <= 7.5e-147)
tmp = sqrt((F * (-0.5 / A))) * t_2;
elseif (B_m <= 5.6e-34)
tmp = t_1;
elseif (B_m <= 5.5e+138)
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / ((B_m ^ 2.0) + (A * (C * -4.0)))))) * t_2;
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[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 9e-204], t$95$1, If[LessEqual[B$95$m, 7.5e-147], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[B$95$m, 5.6e-34], t$95$1, If[LessEqual[B$95$m, 5.5e+138], 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[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $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 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := -\sqrt{2}\\
\mathbf{if}\;B\_m \leq 9 \cdot 10^{-204}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 7.5 \cdot 10^{-147}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot t\_2\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{-34}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 5.5 \cdot 10^{+138}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{{B\_m}^{2} + A \cdot \left(C \cdot -4\right)}} \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 8.99999999999999948e-204 or 7.50000000000000047e-147 < B < 5.59999999999999994e-34Initial program 20.4%
Taylor expanded in A around -inf 17.3%
if 8.99999999999999948e-204 < B < 7.50000000000000047e-147Initial program 18.9%
Taylor expanded in F around 0 18.0%
mul-1-neg18.0%
*-commutative18.0%
distribute-rgt-neg-in18.0%
associate-/l*17.8%
cancel-sign-sub-inv17.8%
metadata-eval17.8%
+-commutative17.8%
Simplified35.0%
Taylor expanded in A around -inf 35.2%
if 5.59999999999999994e-34 < B < 5.4999999999999999e138Initial program 29.2%
Taylor expanded in F around 0 33.4%
mul-1-neg33.4%
*-commutative33.4%
distribute-rgt-neg-in33.4%
associate-/l*37.7%
cancel-sign-sub-inv37.7%
metadata-eval37.7%
+-commutative37.7%
Simplified52.0%
fma-undefine52.0%
*-commutative52.0%
*-commutative52.0%
associate-*r*52.0%
Applied egg-rr52.0%
if 5.4999999999999999e138 < B Initial program 0.2%
Taylor expanded in B around inf 48.7%
mul-1-neg48.7%
distribute-rgt-neg-in48.7%
Simplified48.7%
distribute-rgt-neg-out48.7%
pow1/248.7%
pow1/248.7%
pow-prod-down48.9%
Applied egg-rr48.9%
unpow1/248.9%
associate-*l/48.9%
sqrt-div71.2%
Applied egg-rr71.2%
Final simplification32.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))))
(if (<= B_m 4.5e-203)
t_1
(if (<= B_m 8.5e-147)
(* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))
(if (<= B_m 7.5e-35)
t_1
(if (<= B_m 1e+184)
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ 1.0 (* 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 t_0 = (4.0 * A) * C;
double t_1 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
double tmp;
if (B_m <= 4.5e-203) {
tmp = t_1;
} else if (B_m <= 8.5e-147) {
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
} else if (B_m <= 7.5e-35) {
tmp = t_1;
} else if (B_m <= 1e+184) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((1.0 / (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 t_0 = (4.0 * A) * C;
double t_1 = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
double tmp;
if (B_m <= 4.5e-203) {
tmp = t_1;
} else if (B_m <= 8.5e-147) {
tmp = Math.sqrt((F * (-0.5 / A))) * -Math.sqrt(2.0);
} else if (B_m <= 7.5e-35) {
tmp = t_1;
} else if (B_m <= 1e+184) {
tmp = -1.0 / ((B_m / Math.sqrt(2.0)) * Math.sqrt((1.0 / (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): t_0 = (4.0 * A) * C t_1 = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) tmp = 0 if B_m <= 4.5e-203: tmp = t_1 elif B_m <= 8.5e-147: tmp = math.sqrt((F * (-0.5 / A))) * -math.sqrt(2.0) elif B_m <= 7.5e-35: tmp = t_1 elif B_m <= 1e+184: tmp = -1.0 / ((B_m / math.sqrt(2.0)) * math.sqrt((1.0 / (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) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))) tmp = 0.0 if (B_m <= 4.5e-203) tmp = t_1; elseif (B_m <= 8.5e-147) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))); elseif (B_m <= 7.5e-35) tmp = t_1; elseif (B_m <= 1e+184) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(1.0 / 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)
t_0 = (4.0 * A) * C;
t_1 = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
tmp = 0.0;
if (B_m <= 4.5e-203)
tmp = t_1;
elseif (B_m <= 8.5e-147)
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
elseif (B_m <= 7.5e-35)
tmp = t_1;
elseif (B_m <= 1e+184)
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((1.0 / (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_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.5e-203], t$95$1, If[LessEqual[B$95$m, 8.5e-147], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 7.5e-35], t$95$1, If[LessEqual[B$95$m, 1e+184], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{if}\;B\_m \leq 4.5 \cdot 10^{-203}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{-147}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 7.5 \cdot 10^{-35}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 10^{+184}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 4.5000000000000002e-203 or 8.5000000000000002e-147 < B < 7.5e-35Initial program 20.5%
Taylor expanded in A around -inf 17.4%
if 4.5000000000000002e-203 < B < 8.5000000000000002e-147Initial program 18.9%
Taylor expanded in F around 0 18.0%
mul-1-neg18.0%
*-commutative18.0%
distribute-rgt-neg-in18.0%
associate-/l*17.8%
cancel-sign-sub-inv17.8%
metadata-eval17.8%
+-commutative17.8%
Simplified35.0%
Taylor expanded in A around -inf 35.2%
if 7.5e-35 < B < 1.00000000000000002e184Initial program 23.1%
Simplified28.6%
associate-*r*28.6%
associate-+r+28.4%
hypot-undefine23.1%
unpow223.1%
unpow223.1%
+-commutative23.1%
sqrt-prod28.1%
*-commutative28.1%
associate-*r*28.1%
associate-+l+28.1%
Applied egg-rr45.6%
clear-num45.5%
inv-pow45.5%
sqrt-unprod28.6%
associate-*l*28.6%
associate-*r*28.6%
associate-+r+28.4%
Applied egg-rr28.4%
unpow-128.4%
associate-*l*21.6%
Simplified21.6%
Taylor expanded in A around 0 28.3%
mul-1-neg28.3%
unpow228.3%
unpow228.3%
hypot-define38.7%
Simplified38.7%
if 1.00000000000000002e184 < B Initial program 0.0%
Taylor expanded in B around inf 54.8%
mul-1-neg54.8%
distribute-rgt-neg-in54.8%
Simplified54.8%
distribute-rgt-neg-out54.8%
pow1/254.8%
pow1/254.8%
pow-prod-down55.1%
Applied egg-rr55.1%
unpow1/255.1%
associate-*l/55.1%
sqrt-div82.1%
Applied egg-rr82.1%
Final simplification30.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
(let* ((t_0 (* F (+ C (hypot B_m C))))
(t_1 (* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))))
(if (<= B_m 1.16e-22)
t_1
(if (<= B_m 4.6e+31)
(* (sqrt t_0) (/ (sqrt 2.0) (- B_m)))
(if (<= B_m 1.4e+65)
t_1
(if (<= B_m 1.1e+185)
(/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ 1.0 t_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 = F * (C + hypot(B_m, C));
double t_1 = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
double tmp;
if (B_m <= 1.16e-22) {
tmp = t_1;
} else if (B_m <= 4.6e+31) {
tmp = sqrt(t_0) * (sqrt(2.0) / -B_m);
} else if (B_m <= 1.4e+65) {
tmp = t_1;
} else if (B_m <= 1.1e+185) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((1.0 / t_0)));
} 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 = F * (C + Math.hypot(B_m, C));
double t_1 = Math.sqrt((F * (-0.5 / A))) * -Math.sqrt(2.0);
double tmp;
if (B_m <= 1.16e-22) {
tmp = t_1;
} else if (B_m <= 4.6e+31) {
tmp = Math.sqrt(t_0) * (Math.sqrt(2.0) / -B_m);
} else if (B_m <= 1.4e+65) {
tmp = t_1;
} else if (B_m <= 1.1e+185) {
tmp = -1.0 / ((B_m / Math.sqrt(2.0)) * Math.sqrt((1.0 / t_0)));
} 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 = F * (C + math.hypot(B_m, C)) t_1 = math.sqrt((F * (-0.5 / A))) * -math.sqrt(2.0) tmp = 0 if B_m <= 1.16e-22: tmp = t_1 elif B_m <= 4.6e+31: tmp = math.sqrt(t_0) * (math.sqrt(2.0) / -B_m) elif B_m <= 1.4e+65: tmp = t_1 elif B_m <= 1.1e+185: tmp = -1.0 / ((B_m / math.sqrt(2.0)) * math.sqrt((1.0 / t_0))) 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(F * Float64(C + hypot(B_m, C))) t_1 = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))) tmp = 0.0 if (B_m <= 1.16e-22) tmp = t_1; elseif (B_m <= 4.6e+31) tmp = Float64(sqrt(t_0) * Float64(sqrt(2.0) / Float64(-B_m))); elseif (B_m <= 1.4e+65) tmp = t_1; elseif (B_m <= 1.1e+185) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(1.0 / t_0)))); 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 = F * (C + hypot(B_m, C));
t_1 = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
tmp = 0.0;
if (B_m <= 1.16e-22)
tmp = t_1;
elseif (B_m <= 4.6e+31)
tmp = sqrt(t_0) * (sqrt(2.0) / -B_m);
elseif (B_m <= 1.4e+65)
tmp = t_1;
elseif (B_m <= 1.1e+185)
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((1.0 / t_0)));
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[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]}, If[LessEqual[B$95$m, 1.16e-22], t$95$1, If[LessEqual[B$95$m, 4.6e+31], N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.4e+65], t$95$1, If[LessEqual[B$95$m, 1.1e+185], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / t$95$0), $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 := F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\\
t_1 := \sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{if}\;B\_m \leq 1.16 \cdot 10^{-22}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 4.6 \cdot 10^{+31}:\\
\;\;\;\;\sqrt{t\_0} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{elif}\;B\_m \leq 1.4 \cdot 10^{+65}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 1.1 \cdot 10^{+185}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.1600000000000001e-22 or 4.5999999999999999e31 < B < 1.3999999999999999e65Initial program 21.2%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
*-commutative17.9%
distribute-rgt-neg-in17.9%
associate-/l*18.9%
cancel-sign-sub-inv18.9%
metadata-eval18.9%
+-commutative18.9%
Simplified29.5%
Taylor expanded in A around -inf 22.0%
if 1.1600000000000001e-22 < B < 4.5999999999999999e31Initial program 28.8%
Taylor expanded in A around 0 25.2%
mul-1-neg25.2%
*-commutative25.2%
distribute-rgt-neg-in25.2%
unpow225.2%
unpow225.2%
hypot-define25.6%
Simplified25.6%
if 1.3999999999999999e65 < B < 1.1e185Initial program 16.3%
Simplified26.9%
associate-*r*26.9%
associate-+r+26.8%
hypot-undefine16.3%
unpow216.3%
unpow216.3%
+-commutative16.3%
sqrt-prod26.8%
*-commutative26.8%
associate-*r*26.8%
associate-+l+26.8%
Applied egg-rr41.0%
clear-num41.0%
inv-pow41.0%
sqrt-unprod26.8%
associate-*l*26.8%
associate-*r*26.8%
associate-+r+26.7%
Applied egg-rr26.7%
unpow-126.7%
associate-*l*12.9%
Simplified12.9%
Taylor expanded in A around 0 31.8%
mul-1-neg31.8%
unpow231.8%
unpow231.8%
hypot-define53.4%
Simplified53.4%
if 1.1e185 < B Initial program 0.0%
Taylor expanded in B around inf 54.8%
mul-1-neg54.8%
distribute-rgt-neg-in54.8%
Simplified54.8%
distribute-rgt-neg-out54.8%
pow1/254.8%
pow1/254.8%
pow-prod-down55.1%
Applied egg-rr55.1%
unpow1/255.1%
associate-*l/55.1%
sqrt-div82.1%
Applied egg-rr82.1%
Final simplification32.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 (fma B_m B_m (* A (* C -4.0)))) (t_1 (* F (+ C (hypot B_m C)))))
(if (<= B_m 1.16e-29)
(/ -1.0 (/ t_0 (sqrt (* F (* (* 2.0 C) (* 2.0 t_0))))))
(if (<= B_m 5.1e+31)
(* (sqrt t_1) (/ (sqrt 2.0) (- B_m)))
(if (<= B_m 4.1e+64)
(* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))
(if (<= B_m 3.2e+184)
(/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ 1.0 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 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = F * (C + hypot(B_m, C));
double tmp;
if (B_m <= 1.16e-29) {
tmp = -1.0 / (t_0 / sqrt((F * ((2.0 * C) * (2.0 * t_0)))));
} else if (B_m <= 5.1e+31) {
tmp = sqrt(t_1) * (sqrt(2.0) / -B_m);
} else if (B_m <= 4.1e+64) {
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
} else if (B_m <= 3.2e+184) {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt((1.0 / t_1)));
} 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(F * Float64(C + hypot(B_m, C))) tmp = 0.0 if (B_m <= 1.16e-29) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(F * Float64(Float64(2.0 * C) * Float64(2.0 * t_0)))))); elseif (B_m <= 5.1e+31) tmp = Float64(sqrt(t_1) * Float64(sqrt(2.0) / Float64(-B_m))); elseif (B_m <= 4.1e+64) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))); elseif (B_m <= 3.2e+184) tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(1.0 / t_1)))); 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[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.16e-29], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(F * N[(N[(2.0 * C), $MachinePrecision] * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.1e+31], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.1e+64], N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 3.2e+184], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / t$95$1), $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 := F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)\\
\mathbf{if}\;B\_m \leq 1.16 \cdot 10^{-29}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{F \cdot \left(\left(2 \cdot C\right) \cdot \left(2 \cdot t\_0\right)\right)}}}\\
\mathbf{elif}\;B\_m \leq 5.1 \cdot 10^{+31}:\\
\;\;\;\;\sqrt{t\_1} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{elif}\;B\_m \leq 4.1 \cdot 10^{+64}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 3.2 \cdot 10^{+184}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{t\_1}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.15999999999999996e-29Initial program 20.4%
Simplified28.2%
associate-*r*28.2%
associate-+r+27.4%
hypot-undefine20.4%
unpow220.4%
unpow220.4%
+-commutative20.4%
sqrt-prod22.8%
*-commutative22.8%
associate-*r*22.8%
associate-+l+23.0%
Applied egg-rr33.7%
clear-num33.7%
inv-pow33.7%
sqrt-unprod28.2%
associate-*l*28.2%
associate-*r*28.2%
associate-+r+27.4%
Applied egg-rr27.4%
unpow-127.4%
associate-*l*24.1%
Simplified24.1%
Taylor expanded in A around -inf 15.2%
if 1.15999999999999996e-29 < B < 5.0999999999999997e31Initial program 31.3%
Taylor expanded in A around 0 28.0%
mul-1-neg28.0%
*-commutative28.0%
distribute-rgt-neg-in28.0%
unpow228.0%
unpow228.0%
hypot-define28.4%
Simplified28.4%
if 5.0999999999999997e31 < B < 4.09999999999999978e64Initial program 29.3%
Taylor expanded in F around 0 29.1%
mul-1-neg29.1%
*-commutative29.1%
distribute-rgt-neg-in29.1%
associate-/l*37.6%
cancel-sign-sub-inv37.6%
metadata-eval37.6%
+-commutative37.6%
Simplified47.2%
Taylor expanded in A around -inf 46.5%
if 4.09999999999999978e64 < B < 3.19999999999999983e184Initial program 16.3%
Simplified26.9%
associate-*r*26.9%
associate-+r+26.8%
hypot-undefine16.3%
unpow216.3%
unpow216.3%
+-commutative16.3%
sqrt-prod26.8%
*-commutative26.8%
associate-*r*26.8%
associate-+l+26.8%
Applied egg-rr41.0%
clear-num41.0%
inv-pow41.0%
sqrt-unprod26.8%
associate-*l*26.8%
associate-*r*26.8%
associate-+r+26.7%
Applied egg-rr26.7%
unpow-126.7%
associate-*l*12.9%
Simplified12.9%
Taylor expanded in A around 0 31.8%
mul-1-neg31.8%
unpow231.8%
unpow231.8%
hypot-define53.4%
Simplified53.4%
if 3.19999999999999983e184 < B Initial program 0.0%
Taylor expanded in B around inf 54.8%
mul-1-neg54.8%
distribute-rgt-neg-in54.8%
Simplified54.8%
distribute-rgt-neg-out54.8%
pow1/254.8%
pow1/254.8%
pow-prod-down55.1%
Applied egg-rr55.1%
unpow1/255.1%
associate-*l/55.1%
sqrt-div82.1%
Applied egg-rr82.1%
Final simplification29.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 (* (sqrt (* F (+ C (hypot B_m C)))) (/ (sqrt 2.0) (- B_m))))
(t_1 (* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))))
(if (<= B_m 5.5e-22)
t_1
(if (<= B_m 6e+31)
t_0
(if (<= B_m 1.1e+73)
t_1
(if (<= B_m 1e+184) t_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 = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
double t_1 = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
double tmp;
if (B_m <= 5.5e-22) {
tmp = t_1;
} else if (B_m <= 6e+31) {
tmp = t_0;
} else if (B_m <= 1.1e+73) {
tmp = t_1;
} else if (B_m <= 1e+184) {
tmp = t_0;
} 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 = Math.sqrt((F * (C + Math.hypot(B_m, C)))) * (Math.sqrt(2.0) / -B_m);
double t_1 = Math.sqrt((F * (-0.5 / A))) * -Math.sqrt(2.0);
double tmp;
if (B_m <= 5.5e-22) {
tmp = t_1;
} else if (B_m <= 6e+31) {
tmp = t_0;
} else if (B_m <= 1.1e+73) {
tmp = t_1;
} else if (B_m <= 1e+184) {
tmp = t_0;
} 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 = math.sqrt((F * (C + math.hypot(B_m, C)))) * (math.sqrt(2.0) / -B_m) t_1 = math.sqrt((F * (-0.5 / A))) * -math.sqrt(2.0) tmp = 0 if B_m <= 5.5e-22: tmp = t_1 elif B_m <= 6e+31: tmp = t_0 elif B_m <= 1.1e+73: tmp = t_1 elif B_m <= 1e+184: tmp = t_0 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(sqrt(Float64(F * Float64(C + hypot(B_m, C)))) * Float64(sqrt(2.0) / Float64(-B_m))) t_1 = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))) tmp = 0.0 if (B_m <= 5.5e-22) tmp = t_1; elseif (B_m <= 6e+31) tmp = t_0; elseif (B_m <= 1.1e+73) tmp = t_1; elseif (B_m <= 1e+184) tmp = t_0; 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 = sqrt((F * (C + hypot(B_m, C)))) * (sqrt(2.0) / -B_m);
t_1 = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
tmp = 0.0;
if (B_m <= 5.5e-22)
tmp = t_1;
elseif (B_m <= 6e+31)
tmp = t_0;
elseif (B_m <= 1.1e+73)
tmp = t_1;
elseif (B_m <= 1e+184)
tmp = t_0;
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[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]}, If[LessEqual[B$95$m, 5.5e-22], t$95$1, If[LessEqual[B$95$m, 6e+31], t$95$0, If[LessEqual[B$95$m, 1.1e+73], t$95$1, If[LessEqual[B$95$m, 1e+184], t$95$0, 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 := \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
t_1 := \sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{if}\;B\_m \leq 5.5 \cdot 10^{-22}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 6 \cdot 10^{+31}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 1.1 \cdot 10^{+73}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 10^{+184}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 5.5000000000000001e-22 or 5.99999999999999978e31 < B < 1.1e73Initial program 21.2%
Taylor expanded in F around 0 17.9%
mul-1-neg17.9%
*-commutative17.9%
distribute-rgt-neg-in17.9%
associate-/l*18.9%
cancel-sign-sub-inv18.9%
metadata-eval18.9%
+-commutative18.9%
Simplified29.5%
Taylor expanded in A around -inf 22.0%
if 5.5000000000000001e-22 < B < 5.99999999999999978e31 or 1.1e73 < B < 1.00000000000000002e184Initial program 20.7%
Taylor expanded in A around 0 29.3%
mul-1-neg29.3%
*-commutative29.3%
distribute-rgt-neg-in29.3%
unpow229.3%
unpow229.3%
hypot-define43.4%
Simplified43.4%
if 1.00000000000000002e184 < B Initial program 0.0%
Taylor expanded in B around inf 54.8%
mul-1-neg54.8%
distribute-rgt-neg-in54.8%
Simplified54.8%
distribute-rgt-neg-out54.8%
pow1/254.8%
pow1/254.8%
pow-prod-down55.1%
Applied egg-rr55.1%
unpow1/255.1%
associate-*l/55.1%
sqrt-div82.1%
Applied egg-rr82.1%
Final simplification32.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 (* (sqrt (* F (/ -0.5 A))) (- (sqrt 2.0)))))
(if (<= B_m 1.3e-21)
t_0
(if (<= B_m 940000000000.0)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (+ B_m C))))
(if (<= B_m 1.75e+79) t_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 = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
double tmp;
if (B_m <= 1.3e-21) {
tmp = t_0;
} else if (B_m <= 940000000000.0) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (B_m + C)));
} else if (B_m <= 1.75e+79) {
tmp = t_0;
} 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) :: t_0
real(8) :: tmp
t_0 = sqrt((f * ((-0.5d0) / a))) * -sqrt(2.0d0)
if (b_m <= 1.3d-21) then
tmp = t_0
else if (b_m <= 940000000000.0d0) then
tmp = (sqrt(2.0d0) / -b_m) * sqrt((f * (b_m + c)))
else if (b_m <= 1.75d+79) then
tmp = t_0
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 t_0 = Math.sqrt((F * (-0.5 / A))) * -Math.sqrt(2.0);
double tmp;
if (B_m <= 1.3e-21) {
tmp = t_0;
} else if (B_m <= 940000000000.0) {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * (B_m + C)));
} else if (B_m <= 1.75e+79) {
tmp = t_0;
} 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 = math.sqrt((F * (-0.5 / A))) * -math.sqrt(2.0) tmp = 0 if B_m <= 1.3e-21: tmp = t_0 elif B_m <= 940000000000.0: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * (B_m + C))) elif B_m <= 1.75e+79: tmp = t_0 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(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))) tmp = 0.0 if (B_m <= 1.3e-21) tmp = t_0; elseif (B_m <= 940000000000.0) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(B_m + C)))); elseif (B_m <= 1.75e+79) tmp = t_0; 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 = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
tmp = 0.0;
if (B_m <= 1.3e-21)
tmp = t_0;
elseif (B_m <= 940000000000.0)
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (B_m + C)));
elseif (B_m <= 1.75e+79)
tmp = t_0;
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[Sqrt[N[(F * N[(-0.5 / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]}, If[LessEqual[B$95$m, 1.3e-21], t$95$0, If[LessEqual[B$95$m, 940000000000.0], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * N[(B$95$m + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.75e+79], t$95$0, 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 := \sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{if}\;B\_m \leq 1.3 \cdot 10^{-21}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 940000000000:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(B\_m + C\right)}\\
\mathbf{elif}\;B\_m \leq 1.75 \cdot 10^{+79}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.30000000000000009e-21 or 9.4e11 < B < 1.7499999999999999e79Initial program 21.7%
Taylor expanded in F around 0 18.4%
mul-1-neg18.4%
*-commutative18.4%
distribute-rgt-neg-in18.4%
associate-/l*19.4%
cancel-sign-sub-inv19.4%
metadata-eval19.4%
+-commutative19.4%
Simplified30.7%
Taylor expanded in A around -inf 21.9%
if 1.30000000000000009e-21 < B < 9.4e11Initial program 22.3%
Taylor expanded in B around inf 22.4%
Taylor expanded in A around 0 22.4%
mul-1-neg22.4%
Simplified22.4%
if 1.7499999999999999e79 < B Initial program 7.6%
Taylor expanded in B around inf 48.9%
mul-1-neg48.9%
distribute-rgt-neg-in48.9%
Simplified48.9%
distribute-rgt-neg-out48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down49.1%
Applied egg-rr49.1%
unpow1/249.1%
associate-*l/49.1%
sqrt-div67.2%
Applied egg-rr67.2%
Final simplification32.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 (if (<= B_m 1.46e+78) (* (sqrt (* F (/ -0.5 A))) (- (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 tmp;
if (B_m <= 1.46e+78) {
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
} 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 <= 1.46d+78) then
tmp = sqrt((f * ((-0.5d0) / a))) * -sqrt(2.0d0)
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 (B_m <= 1.46e+78) {
tmp = Math.sqrt((F * (-0.5 / A))) * -Math.sqrt(2.0);
} 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 B_m <= 1.46e+78: tmp = math.sqrt((F * (-0.5 / A))) * -math.sqrt(2.0) 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 <= 1.46e+78) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / A))) * Float64(-sqrt(2.0))); 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 <= 1.46e+78)
tmp = sqrt((F * (-0.5 / A))) * -sqrt(2.0);
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[B$95$m, 1.46e+78], N[(N[Sqrt[N[(F * N[(-0.5 / A), $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}
\mathbf{if}\;B\_m \leq 1.46 \cdot 10^{+78}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.46000000000000005e78Initial program 21.7%
Taylor expanded in F around 0 18.6%
mul-1-neg18.6%
*-commutative18.6%
distribute-rgt-neg-in18.6%
associate-/l*19.5%
cancel-sign-sub-inv19.5%
metadata-eval19.5%
+-commutative19.5%
Simplified30.9%
Taylor expanded in A around -inf 21.4%
if 1.46000000000000005e78 < B Initial program 7.6%
Taylor expanded in B around inf 48.9%
mul-1-neg48.9%
distribute-rgt-neg-in48.9%
Simplified48.9%
distribute-rgt-neg-out48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down49.1%
Applied egg-rr49.1%
unpow1/249.1%
associate-*l/49.1%
sqrt-div67.2%
Applied egg-rr67.2%
Final simplification31.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 (/ (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.6%
Taylor expanded in B around inf 15.4%
mul-1-neg15.4%
distribute-rgt-neg-in15.4%
Simplified15.4%
distribute-rgt-neg-out15.4%
pow1/215.6%
pow1/215.6%
pow-prod-down15.7%
Applied egg-rr15.7%
unpow1/215.4%
associate-*l/15.4%
sqrt-div19.8%
Applied egg-rr19.8%
Final simplification19.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 (- (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(2.0 * Float64(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[(2.0 * N[(F / B$95$m), $MachinePrecision]), $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(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.4%
mul-1-neg15.4%
distribute-rgt-neg-in15.4%
Simplified15.4%
distribute-rgt-neg-out15.4%
pow1/215.6%
pow1/215.6%
pow-prod-down15.7%
Applied egg-rr15.7%
Final simplification15.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.4%
mul-1-neg15.4%
distribute-rgt-neg-in15.4%
Simplified15.4%
distribute-rgt-neg-out15.4%
pow1/215.6%
pow1/215.6%
pow-prod-down15.7%
Applied egg-rr15.7%
*-un-lft-identity15.7%
unpow1/215.4%
associate-*l/15.4%
Applied egg-rr15.4%
*-lft-identity15.4%
associate-/l*15.4%
Simplified15.4%
Final simplification15.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 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 / 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 / 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 / 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 / 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 * Float64(F / 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 / 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[(2.0 * N[(F / 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{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf 15.4%
mul-1-neg15.4%
distribute-rgt-neg-in15.4%
Simplified15.4%
pow115.4%
distribute-rgt-neg-out15.4%
pow1/215.6%
pow1/215.6%
pow-prod-down15.7%
Applied egg-rr15.7%
unpow115.7%
unpow1/215.4%
Simplified15.4%
Final simplification15.4%
herbie shell --seed 2024109
(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))))