
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 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 (- INFINITY))
(*
(sqrt 2.0)
(-
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(if (<= t_3 -1e-204)
(/ (sqrt (* t_1 (+ C (hypot B_m C)))) t_2)
(if (<= t_3 INFINITY)
(/ (sqrt (* t_1 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))) t_2)
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double 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 <= -((double) INFINITY)) {
tmp = sqrt(2.0) * -sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0)))));
} else if (t_3 <= -1e-204) {
tmp = sqrt((t_1 * (C + hypot(B_m, C)))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_2;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) 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 <= Float64(-Inf)) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); elseif (t_3 <= -1e-204) tmp = Float64(sqrt(Float64(t_1 * Float64(C + hypot(B_m, C)))) / t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / t_2); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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, (-Infinity)], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -1e-204], N[(N[Sqrt[N[(t$95$1 * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], 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], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[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 -\infty:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0 24.4%
mul-1-neg24.4%
*-commutative24.4%
distribute-rgt-neg-in24.4%
associate-/l*29.1%
cancel-sign-sub-inv29.1%
metadata-eval29.1%
+-commutative29.1%
Simplified57.4%
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))) < -1e-204Initial program 98.5%
Taylor expanded in A around 0 67.7%
unpow267.7%
unpow267.7%
hypot-define67.8%
Simplified67.8%
if -1e-204 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.4%
Taylor expanded in A around -inf 29.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in A around 0 2.6%
mul-1-neg2.6%
*-commutative2.6%
distribute-rgt-neg-in2.6%
unpow22.6%
unpow22.6%
hypot-define18.7%
Simplified18.7%
pow1/218.8%
*-commutative18.8%
unpow-prod-down29.7%
pow1/229.7%
pow1/229.7%
Applied egg-rr29.7%
hypot-undefine2.5%
unpow22.5%
unpow22.5%
+-commutative2.5%
unpow22.5%
unpow22.5%
hypot-define29.7%
Simplified29.7%
Final simplification39.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))))
(if (<= B_m 1.08e-42)
(/ (sqrt (* t_2 (* 2.0 C))) t_1)
(if (<= B_m 4000000.0)
(/ (sqrt (* t_2 (+ C (hypot B_m C)))) t_1)
(if (<= B_m 1.7e+40)
(/ (sqrt (* t_2 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))) t_1)
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double 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 tmp;
if (B_m <= 1.08e-42) {
tmp = sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 4000000.0) {
tmp = sqrt((t_2 * (C + hypot(B_m, C)))) / t_1;
} else if (B_m <= 1.7e+40) {
tmp = sqrt((t_2 * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_1;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double 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 tmp;
if (B_m <= 1.08e-42) {
tmp = Math.sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 4000000.0) {
tmp = Math.sqrt((t_2 * (C + Math.hypot(B_m, C)))) / t_1;
} else if (B_m <= 1.7e+40) {
tmp = Math.sqrt((t_2 * ((-0.5 * (Math.pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_1;
} else {
tmp = (Math.sqrt((C + Math.hypot(C, B_m))) * Math.sqrt(F)) * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): 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) tmp = 0 if B_m <= 1.08e-42: tmp = math.sqrt((t_2 * (2.0 * C))) / t_1 elif B_m <= 4000000.0: tmp = math.sqrt((t_2 * (C + math.hypot(B_m, C)))) / t_1 elif B_m <= 1.7e+40: tmp = math.sqrt((t_2 * ((-0.5 * (math.pow(B_m, 2.0) / A)) + (2.0 * C)))) / t_1 else: tmp = (math.sqrt((C + math.hypot(C, B_m))) * math.sqrt(F)) * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) 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)) tmp = 0.0 if (B_m <= 1.08e-42) tmp = Float64(sqrt(Float64(t_2 * Float64(2.0 * C))) / t_1); elseif (B_m <= 4000000.0) tmp = Float64(sqrt(Float64(t_2 * Float64(C + hypot(B_m, C)))) / t_1); elseif (B_m <= 1.7e+40) tmp = Float64(sqrt(Float64(t_2 * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)))) / t_1); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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);
tmp = 0.0;
if (B_m <= 1.08e-42)
tmp = sqrt((t_2 * (2.0 * C))) / t_1;
elseif (B_m <= 4000000.0)
tmp = sqrt((t_2 * (C + hypot(B_m, C)))) / t_1;
elseif (B_m <= 1.7e+40)
tmp = sqrt((t_2 * ((-0.5 * ((B_m ^ 2.0) / A)) + (2.0 * C)))) / t_1;
else
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := 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]}, If[LessEqual[B$95$m, 1.08e-42], N[(N[Sqrt[N[(t$95$2 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 4000000.0], N[(N[Sqrt[N[(t$95$2 * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.7e+40], 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], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[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)\\
\mathbf{if}\;B\_m \leq 1.08 \cdot 10^{-42}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 4000000:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.7 \cdot 10^{+40}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if B < 1.07999999999999996e-42Initial program 19.8%
Taylor expanded in A around -inf 14.2%
if 1.07999999999999996e-42 < B < 4e6Initial program 51.2%
Taylor expanded in A around 0 44.7%
unpow244.7%
unpow244.7%
hypot-define45.1%
Simplified45.1%
if 4e6 < B < 1.69999999999999994e40Initial program 14.4%
Taylor expanded in A around -inf 26.3%
if 1.69999999999999994e40 < B Initial program 6.1%
Taylor expanded in A around 0 10.0%
mul-1-neg10.0%
*-commutative10.0%
distribute-rgt-neg-in10.0%
unpow210.0%
unpow210.0%
hypot-define44.0%
Simplified44.0%
pow1/244.0%
*-commutative44.0%
unpow-prod-down71.2%
pow1/271.2%
pow1/271.2%
Applied egg-rr71.2%
hypot-undefine13.6%
unpow213.6%
unpow213.6%
+-commutative13.6%
unpow213.6%
unpow213.6%
hypot-define71.2%
Simplified71.2%
Final simplification28.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 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 (* t_2 (* 2.0 C))) t_1)))
(if (<= B_m 1.14e-42)
t_3
(if (<= B_m 1.14e-26)
(/ (sqrt (* t_2 (+ C (hypot B_m C)))) t_1)
(if (<= B_m 9.6e-11)
t_3
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double 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((t_2 * (2.0 * C))) / t_1;
double tmp;
if (B_m <= 1.14e-42) {
tmp = t_3;
} else if (B_m <= 1.14e-26) {
tmp = sqrt((t_2 * (C + hypot(B_m, C)))) / t_1;
} else if (B_m <= 9.6e-11) {
tmp = t_3;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double 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((t_2 * (2.0 * C))) / t_1;
double tmp;
if (B_m <= 1.14e-42) {
tmp = t_3;
} else if (B_m <= 1.14e-26) {
tmp = Math.sqrt((t_2 * (C + Math.hypot(B_m, C)))) / t_1;
} else if (B_m <= 9.6e-11) {
tmp = t_3;
} else {
tmp = (Math.sqrt((C + Math.hypot(C, B_m))) * Math.sqrt(F)) * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): 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((t_2 * (2.0 * C))) / t_1 tmp = 0 if B_m <= 1.14e-42: tmp = t_3 elif B_m <= 1.14e-26: tmp = math.sqrt((t_2 * (C + math.hypot(B_m, C)))) / t_1 elif B_m <= 9.6e-11: tmp = t_3 else: tmp = (math.sqrt((C + math.hypot(C, B_m))) * math.sqrt(F)) * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) 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(Float64(t_2 * Float64(2.0 * C))) / t_1) tmp = 0.0 if (B_m <= 1.14e-42) tmp = t_3; elseif (B_m <= 1.14e-26) tmp = Float64(sqrt(Float64(t_2 * Float64(C + hypot(B_m, C)))) / t_1); elseif (B_m <= 9.6e-11) tmp = t_3; else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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((t_2 * (2.0 * C))) / t_1;
tmp = 0.0;
if (B_m <= 1.14e-42)
tmp = t_3;
elseif (B_m <= 1.14e-26)
tmp = sqrt((t_2 * (C + hypot(B_m, C)))) / t_1;
elseif (B_m <= 9.6e-11)
tmp = t_3;
else
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := 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[(N[Sqrt[N[(t$95$2 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[B$95$m, 1.14e-42], t$95$3, If[LessEqual[B$95$m, 1.14e-26], N[(N[Sqrt[N[(t$95$2 * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 9.6e-11], t$95$3, N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[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 := \frac{\sqrt{t\_2 \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{if}\;B\_m \leq 1.14 \cdot 10^{-42}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;B\_m \leq 1.14 \cdot 10^{-26}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 9.6 \cdot 10^{-11}:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if B < 1.14e-42 or 1.1399999999999999e-26 < B < 9.6000000000000005e-11Initial program 20.1%
Taylor expanded in A around -inf 15.2%
if 1.14e-42 < B < 1.1399999999999999e-26Initial program 51.2%
Taylor expanded in A around 0 51.8%
unpow251.8%
unpow251.8%
hypot-define52.3%
Simplified52.3%
if 9.6000000000000005e-11 < B Initial program 9.8%
Taylor expanded in A around 0 12.4%
mul-1-neg12.4%
*-commutative12.4%
distribute-rgt-neg-in12.4%
unpow212.4%
unpow212.4%
hypot-define40.2%
Simplified40.2%
pow1/240.2%
*-commutative40.2%
unpow-prod-down62.5%
pow1/262.5%
pow1/262.5%
Applied egg-rr62.5%
hypot-undefine15.4%
unpow215.4%
unpow215.4%
+-commutative15.4%
unpow215.4%
unpow215.4%
hypot-define62.5%
Simplified62.5%
Final simplification28.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= B_m 7e-11)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(* (* (sqrt (+ C (hypot C B_m))) (sqrt F)) (/ (sqrt 2.0) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (B_m <= 7e-11) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (B_m <= 7e-11) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt((C + Math.hypot(C, B_m))) * Math.sqrt(F)) * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if B_m <= 7e-11: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt((C + math.hypot(C, B_m))) * math.sqrt(F)) * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (B_m <= 7e-11) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(sqrt(2.0) / Float64(-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;
tmp = 0.0;
if (B_m <= 7e-11)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 7e-11], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[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 \leq 7 \cdot 10^{-11}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if B < 7.00000000000000038e-11Initial program 21.1%
Taylor expanded in A around -inf 15.3%
if 7.00000000000000038e-11 < B Initial program 9.8%
Taylor expanded in A around 0 12.4%
mul-1-neg12.4%
*-commutative12.4%
distribute-rgt-neg-in12.4%
unpow212.4%
unpow212.4%
hypot-define40.2%
Simplified40.2%
pow1/240.2%
*-commutative40.2%
unpow-prod-down62.5%
pow1/262.5%
pow1/262.5%
Applied egg-rr62.5%
hypot-undefine15.4%
unpow215.4%
unpow215.4%
+-commutative15.4%
unpow215.4%
unpow215.4%
hypot-define62.5%
Simplified62.5%
Final simplification27.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 (<= B_m 6.4e+57)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(* (/ (sqrt 2.0) (- B_m)) (* (sqrt F) (sqrt (+ B_m C)))))))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 (B_m <= 6.4e+57) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((B_m + C)));
}
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 = (4.0d0 * a) * c
if (b_m <= 6.4d+57) then
tmp = sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * (2.0d0 * c))) / (t_0 - (b_m ** 2.0d0))
else
tmp = (sqrt(2.0d0) / -b_m) * (sqrt(f) * sqrt((b_m + c)))
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 = (4.0 * A) * C;
double tmp;
if (B_m <= 6.4e+57) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt(2.0) / -B_m) * (Math.sqrt(F) * Math.sqrt((B_m + C)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if B_m <= 6.4e+57: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt(2.0) / -B_m) * (math.sqrt(F) * math.sqrt((B_m + C))) 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 <= 6.4e+57) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(F) * sqrt(Float64(B_m + C)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if (B_m <= 6.4e+57)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((B_m + C)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 6.4e+57], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 6.4 \cdot 10^{+57}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + C}\right)\\
\end{array}
\end{array}
if B < 6.40000000000000059e57Initial program 21.7%
Taylor expanded in A around -inf 14.8%
if 6.40000000000000059e57 < B Initial program 4.4%
Taylor expanded in A around 0 10.2%
mul-1-neg10.2%
*-commutative10.2%
distribute-rgt-neg-in10.2%
unpow210.2%
unpow210.2%
hypot-define45.4%
Simplified45.4%
pow1/245.4%
*-commutative45.4%
unpow-prod-down73.7%
pow1/273.7%
pow1/273.7%
Applied egg-rr73.7%
hypot-undefine13.9%
unpow213.9%
unpow213.9%
+-commutative13.9%
unpow213.9%
unpow213.9%
hypot-define73.7%
Simplified73.7%
Taylor expanded in C around 0 71.9%
Final simplification26.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1.7e+85)
(/
-1.0
(/
(- B_m (* C (/ (* 4.0 A) B_m)))
(sqrt (* (+ C (hypot B_m C)) (* 2.0 F)))))
(* (/ (sqrt 2.0) (- B_m)) (* (sqrt F) (sqrt (+ B_m C))))))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.7e+85) {
tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / sqrt(((C + hypot(B_m, C)) * (2.0 * F))));
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((B_m + C)));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.7e+85) {
tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / Math.sqrt(((C + Math.hypot(B_m, C)) * (2.0 * F))));
} else {
tmp = (Math.sqrt(2.0) / -B_m) * (Math.sqrt(F) * Math.sqrt((B_m + C)));
}
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.7e+85: tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / math.sqrt(((C + math.hypot(B_m, C)) * (2.0 * F)))) else: tmp = (math.sqrt(2.0) / -B_m) * (math.sqrt(F) * math.sqrt((B_m + C))) 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.7e+85) tmp = Float64(-1.0 / Float64(Float64(B_m - Float64(C * Float64(Float64(4.0 * A) / B_m))) / sqrt(Float64(Float64(C + hypot(B_m, C)) * Float64(2.0 * F))))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(F) * sqrt(Float64(B_m + C)))); 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.7e+85)
tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / sqrt(((C + hypot(B_m, C)) * (2.0 * F))));
else
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((B_m + C)));
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.7e+85], N[(-1.0 / N[(N[(B$95$m - N[(C * N[(N[(4.0 * A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.7 \cdot 10^{+85}:\\
\;\;\;\;\frac{-1}{\frac{B\_m - C \cdot \frac{4 \cdot A}{B\_m}}{\sqrt{\left(C + \mathsf{hypot}\left(B\_m, C\right)\right) \cdot \left(2 \cdot F\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + C}\right)\\
\end{array}
\end{array}
if B < 1.7000000000000002e85Initial program 21.5%
Taylor expanded in A around 0 4.6%
associate-*l*4.6%
unpow24.6%
unpow24.6%
hypot-define5.7%
Simplified5.7%
clear-num5.7%
inv-pow5.7%
*-commutative5.7%
distribute-rgt-neg-in5.7%
sqrt-unprod5.7%
Applied egg-rr5.7%
unpow-15.7%
associate-/r*6.0%
associate-*r*6.0%
hypot-undefine4.6%
unpow24.6%
unpow24.6%
+-commutative4.6%
unpow24.6%
unpow24.6%
hypot-define6.0%
Simplified6.0%
div-inv6.0%
div-sub6.0%
pow16.0%
pow-div6.9%
metadata-eval6.9%
pow16.9%
*-commutative6.9%
*-commutative6.9%
Applied egg-rr6.9%
associate-*r/6.9%
*-rgt-identity6.9%
associate-/l*6.9%
hypot-undefine5.3%
unpow25.3%
unpow25.3%
+-commutative5.3%
unpow25.3%
unpow25.3%
hypot-undefine6.9%
*-commutative6.9%
Simplified6.9%
if 1.7000000000000002e85 < B Initial program 4.5%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
*-commutative10.4%
distribute-rgt-neg-in10.4%
unpow210.4%
unpow210.4%
hypot-define45.2%
Simplified45.2%
pow1/245.2%
*-commutative45.2%
unpow-prod-down74.6%
pow1/274.6%
pow1/274.6%
Applied egg-rr74.6%
hypot-undefine14.3%
unpow214.3%
unpow214.3%
+-commutative14.3%
unpow214.3%
unpow214.3%
hypot-define74.6%
Simplified74.6%
Taylor expanded in C around 0 74.3%
Final simplification20.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 9.2e+174)
(/
-1.0
(/
(- B_m (* C (/ (* 4.0 A) B_m)))
(sqrt (* (+ C (hypot B_m C)) (* 2.0 F)))))
(/ (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 <= 9.2e+174) {
tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / sqrt(((C + hypot(B_m, C)) * (2.0 * F))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 9.2e+174) {
tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / Math.sqrt(((C + Math.hypot(B_m, C)) * (2.0 * F))));
} 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 <= 9.2e+174: tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / math.sqrt(((C + math.hypot(B_m, C)) * (2.0 * F)))) 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 <= 9.2e+174) tmp = Float64(-1.0 / Float64(Float64(B_m - Float64(C * Float64(Float64(4.0 * A) / B_m))) / sqrt(Float64(Float64(C + hypot(B_m, C)) * Float64(2.0 * F))))); 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 <= 9.2e+174)
tmp = -1.0 / ((B_m - (C * ((4.0 * A) / B_m))) / sqrt(((C + hypot(B_m, C)) * (2.0 * F))));
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, 9.2e+174], N[(-1.0 / N[(N[(B$95$m - N[(C * N[(N[(4.0 * A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 9.2 \cdot 10^{+174}:\\
\;\;\;\;\frac{-1}{\frac{B\_m - C \cdot \frac{4 \cdot A}{B\_m}}{\sqrt{\left(C + \mathsf{hypot}\left(B\_m, C\right)\right) \cdot \left(2 \cdot F\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 9.1999999999999991e174Initial program 21.1%
Taylor expanded in A around 0 6.2%
associate-*l*6.2%
unpow26.2%
unpow26.2%
hypot-define7.3%
Simplified7.3%
clear-num7.3%
inv-pow7.3%
*-commutative7.3%
distribute-rgt-neg-in7.3%
sqrt-unprod7.3%
Applied egg-rr7.3%
unpow-17.3%
associate-/r*7.5%
associate-*r*7.5%
hypot-undefine6.2%
unpow26.2%
unpow26.2%
+-commutative6.2%
unpow26.2%
unpow26.2%
hypot-define7.5%
Simplified7.5%
div-inv7.5%
div-sub7.6%
pow17.6%
pow-div9.0%
metadata-eval9.0%
pow19.0%
*-commutative9.0%
*-commutative9.0%
Applied egg-rr9.0%
associate-*r/9.0%
*-rgt-identity9.0%
associate-/l*9.0%
hypot-undefine6.9%
unpow26.9%
unpow26.9%
+-commutative6.9%
unpow26.9%
unpow26.9%
hypot-undefine9.0%
*-commutative9.0%
Simplified9.0%
if 9.1999999999999991e174 < B Initial program 0.0%
Taylor expanded in B around inf 57.5%
mul-1-neg57.5%
distribute-rgt-neg-in57.5%
Simplified57.5%
pow157.5%
distribute-rgt-neg-out57.5%
pow1/257.5%
pow1/257.5%
pow-prod-down57.5%
Applied egg-rr57.5%
unpow157.5%
unpow1/257.5%
associate-*l/57.7%
Simplified57.7%
sqrt-div82.6%
Applied egg-rr82.6%
Final simplification19.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt F) (- (sqrt (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(F) * -sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(f) * -sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(F) * -math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)
\end{array}
Initial program 18.2%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
distribute-rgt-neg-in14.2%
Simplified14.2%
pow114.2%
distribute-rgt-neg-out14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow114.4%
unpow1/214.2%
associate-*l/14.3%
Simplified14.3%
pow1/214.4%
associate-/l*14.4%
unpow-prod-down18.1%
pow1/218.1%
Applied egg-rr18.1%
unpow1/218.1%
Simplified18.1%
Final simplification18.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (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.2%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
distribute-rgt-neg-in14.2%
Simplified14.2%
pow114.2%
distribute-rgt-neg-out14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow114.4%
unpow1/214.2%
associate-*l/14.3%
Simplified14.3%
sqrt-div18.1%
Applied egg-rr18.1%
Final simplification18.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= F 1.3e-23)
(/
-1.0
(/
(+ B_m (* -4.0 (* A (/ C B_m))))
(sqrt (* (* 2.0 F) (+ B_m (* C (+ 1.0 (* (/ C B_m) 0.5))))))))
(/ -1.0 (sqrt (/ B_m (* 2.0 F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.3e-23) {
tmp = -1.0 / ((B_m + (-4.0 * (A * (C / B_m)))) / sqrt(((2.0 * F) * (B_m + (C * (1.0 + ((C / B_m) * 0.5)))))));
} else {
tmp = -1.0 / sqrt((B_m / (2.0 * F)));
}
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 (f <= 1.3d-23) then
tmp = (-1.0d0) / ((b_m + ((-4.0d0) * (a * (c / b_m)))) / sqrt(((2.0d0 * f) * (b_m + (c * (1.0d0 + ((c / b_m) * 0.5d0)))))))
else
tmp = (-1.0d0) / sqrt((b_m / (2.0d0 * f)))
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 (F <= 1.3e-23) {
tmp = -1.0 / ((B_m + (-4.0 * (A * (C / B_m)))) / Math.sqrt(((2.0 * F) * (B_m + (C * (1.0 + ((C / B_m) * 0.5)))))));
} else {
tmp = -1.0 / Math.sqrt((B_m / (2.0 * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 1.3e-23: tmp = -1.0 / ((B_m + (-4.0 * (A * (C / B_m)))) / math.sqrt(((2.0 * F) * (B_m + (C * (1.0 + ((C / B_m) * 0.5))))))) else: tmp = -1.0 / math.sqrt((B_m / (2.0 * F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 1.3e-23) tmp = Float64(-1.0 / Float64(Float64(B_m + Float64(-4.0 * Float64(A * Float64(C / B_m)))) / sqrt(Float64(Float64(2.0 * F) * Float64(B_m + Float64(C * Float64(1.0 + Float64(Float64(C / B_m) * 0.5)))))))); else tmp = Float64(-1.0 / sqrt(Float64(B_m / Float64(2.0 * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 1.3e-23)
tmp = -1.0 / ((B_m + (-4.0 * (A * (C / B_m)))) / sqrt(((2.0 * F) * (B_m + (C * (1.0 + ((C / B_m) * 0.5)))))));
else
tmp = -1.0 / sqrt((B_m / (2.0 * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 1.3e-23], N[(-1.0 / N[(N[(B$95$m + N[(-4.0 * N[(A * N[(C / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(B$95$m + N[(C * N[(1.0 + N[(N[(C / B$95$m), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[Sqrt[N[(B$95$m / N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 1.3 \cdot 10^{-23}:\\
\;\;\;\;\frac{-1}{\frac{B\_m + -4 \cdot \left(A \cdot \frac{C}{B\_m}\right)}{\sqrt{\left(2 \cdot F\right) \cdot \left(B\_m + C \cdot \left(1 + \frac{C}{B\_m} \cdot 0.5\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{B\_m}{2 \cdot F}}}\\
\end{array}
\end{array}
if F < 1.3e-23Initial program 21.8%
Taylor expanded in A around 0 3.3%
associate-*l*3.3%
unpow23.3%
unpow23.3%
hypot-define4.4%
Simplified4.4%
clear-num4.4%
inv-pow4.4%
*-commutative4.4%
distribute-rgt-neg-in4.4%
sqrt-unprod4.4%
Applied egg-rr4.4%
unpow-14.4%
associate-/r*5.0%
associate-*r*5.0%
hypot-undefine3.2%
unpow23.2%
unpow23.2%
+-commutative3.2%
unpow23.2%
unpow23.2%
hypot-define5.0%
Simplified5.0%
Taylor expanded in C around 0 3.4%
Taylor expanded in C around 0 11.6%
associate-/l*13.1%
Simplified13.1%
if 1.3e-23 < F Initial program 14.8%
Taylor expanded in B around inf 22.8%
mul-1-neg22.8%
distribute-rgt-neg-in22.8%
Simplified22.8%
pow122.8%
distribute-rgt-neg-out22.8%
pow1/223.1%
pow1/223.1%
pow-prod-down23.1%
Applied egg-rr23.1%
unpow123.1%
unpow1/222.8%
associate-*l/22.8%
Simplified22.8%
clear-num22.8%
sqrt-div22.9%
metadata-eval22.9%
Applied egg-rr22.9%
Final simplification18.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (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.2%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
distribute-rgt-neg-in14.2%
Simplified14.2%
pow114.2%
distribute-rgt-neg-out14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow114.4%
unpow1/214.2%
associate-*l/14.3%
Simplified14.3%
*-un-lft-identity14.3%
associate-/l*14.3%
Applied egg-rr14.3%
*-lft-identity14.3%
associate-*r/14.3%
associate-*l/14.2%
*-commutative14.2%
Simplified14.2%
Final simplification14.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (* 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(Float64(2.0 * 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[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 18.2%
Taylor expanded in B around inf 14.2%
mul-1-neg14.2%
distribute-rgt-neg-in14.2%
Simplified14.2%
pow114.2%
distribute-rgt-neg-out14.2%
pow1/214.4%
pow1/214.4%
pow-prod-down14.4%
Applied egg-rr14.4%
unpow114.4%
unpow1/214.2%
associate-*l/14.3%
Simplified14.3%
Final simplification14.3%
herbie shell --seed 2024075
(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))))