
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (cbrt (/ -1.0 F)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0))))
(t_4 (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= t_3 -2e-204)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (sqrt (* 2.0 t_4)))
(- t_4))
(if (<= t_3 INFINITY)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(*
(exp
(*
(- (log (- (hypot B_m A) A)) (+ (log (pow t_1 2.0)) (log t_1)))
0.5))
(/ (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 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = cbrt((-1.0 / F));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double t_4 = fma(C, (A * -4.0), pow(B_m, 2.0));
double tmp;
if (t_3 <= -2e-204) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * sqrt((2.0 * t_4))) / -t_4;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = exp(((log((hypot(B_m, A) - A)) - (log(pow(t_1, 2.0)) + log(t_1))) * 0.5)) * (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 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = cbrt(Float64(-1.0 / F)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) t_4 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) tmp = 0.0 if (t_3 <= -2e-204) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * sqrt(Float64(2.0 * t_4))) / Float64(-t_4)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(exp(Float64(Float64(log(Float64(hypot(B_m, A) - A)) - Float64(log((t_1 ^ 2.0)) + log(t_1))) * 0.5)) * 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[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Power[N[(-1.0 / F), $MachinePrecision], 1/3], $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e-204], N[(N[(N[Sqrt[N[(F * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$4), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$4)), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Exp[N[(N[(N[Log[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision]], $MachinePrecision] - N[(N[Log[N[Power[t$95$1, 2.0], $MachinePrecision]], $MachinePrecision] + N[Log[t$95$1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \sqrt[3]{\frac{-1}{F}}\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
t_4 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{-204}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)} \cdot \sqrt{2 \cdot t\_4}}{-t\_4}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;e^{\left(\log \left(\mathsf{hypot}\left(B\_m, A\right) - A\right) - \left(\log \left({t\_1}^{2}\right) + \log t\_1\right)\right) \cdot 0.5} \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))) < -2e-204Initial program 51.1%
Simplified46.8%
pow1/246.8%
associate-*r*62.0%
unpow-prod-down77.2%
associate-+r-76.4%
hypot-undefine61.8%
unpow261.8%
unpow261.8%
+-commutative61.8%
unpow261.8%
unpow261.8%
hypot-define76.4%
pow1/276.4%
Applied egg-rr76.4%
unpow1/276.4%
sub-neg76.4%
associate-+l+77.2%
sub-neg77.2%
hypot-undefine61.8%
unpow261.8%
unpow261.8%
+-commutative61.8%
unpow261.8%
unpow261.8%
hypot-undefine77.2%
Simplified77.2%
if -2e-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 23.5%
Simplified32.2%
Taylor expanded in C around inf 34.0%
mul-1-neg34.0%
Simplified34.0%
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 C around 0 2.0%
mul-1-neg2.0%
+-commutative2.0%
Simplified2.0%
pow1/22.0%
pow-to-exp2.0%
unpow22.0%
unpow22.0%
hypot-undefine15.8%
Applied egg-rr15.8%
Taylor expanded in F around -inf 1.9%
mul-1-neg1.9%
unsub-neg1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-undefine23.9%
Simplified23.9%
add-cube-cbrt23.9%
log-prod23.9%
pow223.9%
Applied egg-rr23.9%
Final simplification44.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 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0))))
(t_3 (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= t_2 -2e-204)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (sqrt (* 2.0 t_3)))
(- t_3))
(if (<= t_2 INFINITY)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(*
(/ (sqrt 2.0) B_m)
(- (exp (* 0.5 (- (log (- (hypot B_m A) A)) (log (/ -1.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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(C, (A * -4.0), pow(B_m, 2.0));
double tmp;
if (t_2 <= -2e-204) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * sqrt((2.0 * t_3))) / -t_3;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = (sqrt(2.0) / B_m) * -exp((0.5 * (log((hypot(B_m, A) - A)) - log((-1.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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) tmp = 0.0 if (t_2 <= -2e-204) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * sqrt(Float64(2.0 * t_3))) / Float64(-t_3)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-exp(Float64(0.5 * Float64(log(Float64(hypot(B_m, A) - A)) - log(Float64(-1.0 / F))))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e-204], N[(N[(N[Sqrt[N[(F * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Exp[N[(0.5 * N[(N[Log[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / F), $MachinePrecision]], $MachinePrecision]), $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{-204}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)} \cdot \sqrt{2 \cdot t\_3}}{-t\_3}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-e^{0.5 \cdot \left(\log \left(\mathsf{hypot}\left(B\_m, A\right) - A\right) - \log \left(\frac{-1}{F}\right)\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2e-204Initial program 51.1%
Simplified46.8%
pow1/246.8%
associate-*r*62.0%
unpow-prod-down77.2%
associate-+r-76.4%
hypot-undefine61.8%
unpow261.8%
unpow261.8%
+-commutative61.8%
unpow261.8%
unpow261.8%
hypot-define76.4%
pow1/276.4%
Applied egg-rr76.4%
unpow1/276.4%
sub-neg76.4%
associate-+l+77.2%
sub-neg77.2%
hypot-undefine61.8%
unpow261.8%
unpow261.8%
+-commutative61.8%
unpow261.8%
unpow261.8%
hypot-undefine77.2%
Simplified77.2%
if -2e-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 23.5%
Simplified32.2%
Taylor expanded in C around inf 34.0%
mul-1-neg34.0%
Simplified34.0%
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 C around 0 2.0%
mul-1-neg2.0%
+-commutative2.0%
Simplified2.0%
pow1/22.0%
pow-to-exp2.0%
unpow22.0%
unpow22.0%
hypot-undefine15.8%
Applied egg-rr15.8%
Taylor expanded in F around -inf 1.9%
mul-1-neg1.9%
unsub-neg1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-undefine23.9%
Simplified23.9%
Taylor expanded in F around -inf 1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-undefine23.9%
Simplified23.9%
Final simplification45.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e+39)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(*
(/ (sqrt 2.0) B_m)
(- (pow (exp 0.5) (- (log (- (hypot A B_m) A)) (log (/ -1.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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e+39) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = (sqrt(2.0) / B_m) * -pow(exp(0.5), (log((hypot(A, B_m) - A)) - log((-1.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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+39) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-(exp(0.5) ^ Float64(log(Float64(hypot(A, B_m) - A)) - log(Float64(-1.0 / F)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+39], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Power[N[Exp[0.5], $MachinePrecision], N[(N[Log[N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / F), $MachinePrecision]], $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+39}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-{\left(e^{0.5}\right)}^{\left(\log \left(\mathsf{hypot}\left(A, B\_m\right) - A\right) - \log \left(\frac{-1}{F}\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999988e39Initial program 25.3%
Simplified35.0%
Taylor expanded in C around inf 24.4%
mul-1-neg24.4%
Simplified24.4%
if 1.99999999999999988e39 < (pow.f64 B #s(literal 2 binary64)) Initial program 20.4%
Taylor expanded in C around 0 15.8%
mul-1-neg15.8%
+-commutative15.8%
Simplified15.8%
pow1/215.8%
pow-to-exp14.9%
unpow214.9%
unpow214.9%
hypot-undefine30.3%
Applied egg-rr30.3%
Taylor expanded in F around -inf 14.7%
mul-1-neg14.7%
unsub-neg14.7%
mul-1-neg14.7%
+-commutative14.7%
unpow214.7%
unpow214.7%
hypot-undefine38.3%
Simplified38.3%
Taylor expanded in F around -inf 14.7%
mul-1-neg14.7%
associate-/l*14.7%
distribute-lft-neg-in14.7%
Simplified38.3%
Final simplification30.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e+39)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(*
(/ (sqrt 2.0) B_m)
(- (exp (* 0.5 (- (log (- (hypot B_m A) A)) (log (/ -1.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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e+39) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = (sqrt(2.0) / B_m) * -exp((0.5 * (log((hypot(B_m, A) - A)) - log((-1.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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+39) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-exp(Float64(0.5 * Float64(log(Float64(hypot(B_m, A) - A)) - log(Float64(-1.0 / F))))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+39], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Exp[N[(0.5 * N[(N[Log[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / F), $MachinePrecision]], $MachinePrecision]), $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+39}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-e^{0.5 \cdot \left(\log \left(\mathsf{hypot}\left(B\_m, A\right) - A\right) - \log \left(\frac{-1}{F}\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999988e39Initial program 25.3%
Simplified35.0%
Taylor expanded in C around inf 24.4%
mul-1-neg24.4%
Simplified24.4%
if 1.99999999999999988e39 < (pow.f64 B #s(literal 2 binary64)) Initial program 20.4%
Taylor expanded in C around 0 15.8%
mul-1-neg15.8%
+-commutative15.8%
Simplified15.8%
pow1/215.8%
pow-to-exp14.9%
unpow214.9%
unpow214.9%
hypot-undefine30.3%
Applied egg-rr30.3%
Taylor expanded in F around -inf 14.7%
mul-1-neg14.7%
unsub-neg14.7%
mul-1-neg14.7%
+-commutative14.7%
unpow214.7%
unpow214.7%
hypot-undefine38.3%
Simplified38.3%
Taylor expanded in F around -inf 14.7%
+-commutative14.7%
unpow214.7%
unpow214.7%
hypot-undefine38.3%
Simplified38.3%
Final simplification30.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 3.5e+21)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(if (<= B_m 1.65e+205)
(* (/ -1.0 B_m) (sqrt (* 2.0 (* F (- A (hypot B_m A))))))
(*
(exp (* 0.5 (+ (log (- F)) (- (log B_m) (/ A B_m)))))
(/ (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 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 3.5e+21) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else if (B_m <= 1.65e+205) {
tmp = (-1.0 / B_m) * sqrt((2.0 * (F * (A - hypot(B_m, A)))));
} else {
tmp = exp((0.5 * (log(-F) + (log(B_m) - (A / B_m))))) * (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 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 3.5e+21) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); elseif (B_m <= 1.65e+205) tmp = Float64(Float64(-1.0 / B_m) * sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A)))))); else tmp = Float64(exp(Float64(0.5 * Float64(log(Float64(-F)) + Float64(log(B_m) - Float64(A / B_m))))) * 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[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 3.5e+21], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 1.65e+205], N[(N[(-1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(0.5 * N[(N[Log[(-F)], $MachinePrecision] + N[(N[Log[B$95$m], $MachinePrecision] - N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 3.5 \cdot 10^{+21}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 1.65 \cdot 10^{+205}:\\
\;\;\;\;\frac{-1}{B\_m} \cdot \sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{0.5 \cdot \left(\log \left(-F\right) + \left(\log B\_m - \frac{A}{B\_m}\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.5e21Initial program 26.1%
Simplified33.8%
Taylor expanded in C around inf 20.3%
mul-1-neg20.3%
Simplified20.3%
if 3.5e21 < B < 1.6500000000000001e205Initial program 22.9%
Taylor expanded in C around 0 38.0%
mul-1-neg38.0%
+-commutative38.0%
unpow238.0%
unpow238.0%
hypot-define48.5%
Simplified48.5%
div-inv48.4%
Applied egg-rr48.4%
pow1/248.4%
exp-to-pow45.3%
div-inv45.3%
associate-*l/45.3%
exp-to-pow48.4%
pow1/248.4%
sqrt-prod48.6%
distribute-frac-neg248.6%
clear-num48.6%
frac-2neg48.6%
metadata-eval48.6%
Applied egg-rr48.6%
associate-/r/48.7%
associate-*r*48.7%
hypot-undefine38.1%
unpow238.1%
unpow238.1%
+-commutative38.1%
*-commutative38.1%
+-commutative38.1%
unpow238.1%
unpow238.1%
hypot-undefine48.7%
Simplified48.7%
if 1.6500000000000001e205 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
Simplified2.4%
pow1/22.4%
pow-to-exp2.4%
unpow22.4%
unpow22.4%
hypot-undefine54.1%
Applied egg-rr54.1%
Taylor expanded in B around inf 84.6%
neg-mul-184.6%
mul-1-neg84.6%
unsub-neg84.6%
mul-1-neg84.6%
log-rec84.6%
remove-double-div84.6%
Simplified84.6%
Final simplification30.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 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 4800.0)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(if (<= B_m 7.2e+204)
(/ (pow (* 2.0 (/ (- (hypot B_m A) A) (/ -1.0 F))) 0.5) (- B_m))
(*
(exp (* 0.5 (+ (log (- F)) (- (log B_m) (/ A B_m)))))
(/ (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 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 4800.0) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else if (B_m <= 7.2e+204) {
tmp = pow((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m;
} else {
tmp = exp((0.5 * (log(-F) + (log(B_m) - (A / B_m))))) * (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 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 4800.0) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); elseif (B_m <= 7.2e+204) tmp = Float64((Float64(2.0 * Float64(Float64(hypot(B_m, A) - A) / Float64(-1.0 / F))) ^ 0.5) / Float64(-B_m)); else tmp = Float64(exp(Float64(0.5 * Float64(log(Float64(-F)) + Float64(log(B_m) - Float64(A / B_m))))) * 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[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4800.0], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 7.2e+204], N[(N[Power[N[(2.0 * N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Exp[N[(0.5 * N[(N[Log[(-F)], $MachinePrecision] + N[(N[Log[B$95$m], $MachinePrecision] - N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 4800:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 7.2 \cdot 10^{+204}:\\
\;\;\;\;\frac{{\left(2 \cdot \frac{\mathsf{hypot}\left(B\_m, A\right) - A}{\frac{-1}{F}}\right)}^{0.5}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;e^{0.5 \cdot \left(\log \left(-F\right) + \left(\log B\_m - \frac{A}{B\_m}\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if B < 4800Initial program 26.7%
Simplified34.4%
Taylor expanded in A around -inf 20.6%
if 4800 < B < 7.2000000000000005e204Initial program 21.0%
Taylor expanded in C around 0 34.9%
mul-1-neg34.9%
+-commutative34.9%
Simplified34.9%
pow1/235.0%
pow-to-exp32.7%
unpow232.7%
unpow232.7%
hypot-undefine41.6%
Applied egg-rr41.6%
Taylor expanded in F around -inf 32.2%
mul-1-neg32.2%
unsub-neg32.2%
mul-1-neg32.2%
+-commutative32.2%
unpow232.2%
unpow232.2%
hypot-undefine44.7%
Simplified44.7%
associate-*l/44.7%
pow1/244.7%
exp-prod41.0%
pow-prod-down40.9%
diff-log41.6%
add-exp-log44.7%
Applied egg-rr44.7%
if 7.2000000000000005e204 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
Simplified2.4%
pow1/22.4%
pow-to-exp2.4%
unpow22.4%
unpow22.4%
hypot-undefine54.1%
Applied egg-rr54.1%
Taylor expanded in B around inf 84.6%
neg-mul-184.6%
mul-1-neg84.6%
unsub-neg84.6%
mul-1-neg84.6%
log-rec84.6%
remove-double-div84.6%
Simplified84.6%
Final simplification30.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 4e-174)
(/
(sqrt (* -16.0 (* (pow A 2.0) (* C F))))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(/ (pow (* 2.0 (/ (- (hypot B_m A) A) (/ -1.0 F))) 0.5) (- B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-174) {
tmp = sqrt((-16.0 * (pow(A, 2.0) * (C * F)))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else {
tmp = pow((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -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 (Math.pow(B_m, 2.0) <= 4e-174) {
tmp = Math.sqrt((-16.0 * (Math.pow(A, 2.0) * (C * F)))) / (((4.0 * A) * C) - Math.pow(B_m, 2.0));
} else {
tmp = Math.pow((2.0 * ((Math.hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 4e-174: tmp = math.sqrt((-16.0 * (math.pow(A, 2.0) * (C * F)))) / (((4.0 * A) * C) - math.pow(B_m, 2.0)) else: tmp = math.pow((2.0 * ((math.hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-174) tmp = Float64(sqrt(Float64(-16.0 * Float64((A ^ 2.0) * Float64(C * F)))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64((Float64(2.0 * Float64(Float64(hypot(B_m, A) - A) / Float64(-1.0 / F))) ^ 0.5) / 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)
tmp = 0.0;
if ((B_m ^ 2.0) <= 4e-174)
tmp = sqrt((-16.0 * ((A ^ 2.0) * (C * F)))) / (((4.0 * A) * C) - (B_m ^ 2.0));
else
tmp = ((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))) ^ 0.5) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-174], N[(N[Sqrt[N[(-16.0 * N[(N[Power[A, 2.0], $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[N[(2.0 * N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-174}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left({A}^{2} \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(2 \cdot \frac{\mathsf{hypot}\left(B\_m, A\right) - A}{\frac{-1}{F}}\right)}^{0.5}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4e-174Initial program 23.5%
Simplified29.6%
Taylor expanded in A around -inf 20.7%
Taylor expanded in C around 0 20.7%
associate-*r*20.7%
Simplified20.7%
if 4e-174 < (pow.f64 B #s(literal 2 binary64)) Initial program 23.2%
Taylor expanded in C around 0 13.9%
mul-1-neg13.9%
+-commutative13.9%
Simplified13.9%
pow1/213.9%
pow-to-exp13.1%
unpow213.1%
unpow213.1%
hypot-undefine23.5%
Applied egg-rr23.5%
Taylor expanded in F around -inf 12.9%
mul-1-neg12.9%
unsub-neg12.9%
mul-1-neg12.9%
+-commutative12.9%
unpow212.9%
unpow212.9%
hypot-undefine28.7%
Simplified28.7%
associate-*l/28.7%
pow1/228.7%
exp-prod23.0%
pow-prod-down23.0%
diff-log23.5%
add-exp-log25.0%
Applied egg-rr25.0%
Final simplification23.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 5000.0)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(if (<= B_m 1.65e+205)
(/ (pow (* 2.0 (/ (- (hypot B_m A) A) (/ -1.0 F))) 0.5) (- B_m))
(* (/ (sqrt 2.0) B_m) (- (exp (* 0.5 (+ (log (- F)) (log B_m))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 5000.0) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else if (B_m <= 1.65e+205) {
tmp = pow((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * -exp((0.5 * (log(-F) + log(B_m))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 5000.0) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); elseif (B_m <= 1.65e+205) tmp = Float64((Float64(2.0 * Float64(Float64(hypot(B_m, A) - A) / Float64(-1.0 / F))) ^ 0.5) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-exp(Float64(0.5 * Float64(log(Float64(-F)) + log(B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5000.0], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 1.65e+205], N[(N[Power[N[(2.0 * N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Exp[N[(0.5 * N[(N[Log[(-F)], $MachinePrecision] + N[Log[B$95$m], $MachinePrecision]), $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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 5000:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 1.65 \cdot 10^{+205}:\\
\;\;\;\;\frac{{\left(2 \cdot \frac{\mathsf{hypot}\left(B\_m, A\right) - A}{\frac{-1}{F}}\right)}^{0.5}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-e^{0.5 \cdot \left(\log \left(-F\right) + \log B\_m\right)}\right)\\
\end{array}
\end{array}
if B < 5e3Initial program 26.7%
Simplified34.4%
Taylor expanded in A around -inf 20.6%
if 5e3 < B < 1.6500000000000001e205Initial program 21.0%
Taylor expanded in C around 0 34.9%
mul-1-neg34.9%
+-commutative34.9%
Simplified34.9%
pow1/235.0%
pow-to-exp32.7%
unpow232.7%
unpow232.7%
hypot-undefine41.6%
Applied egg-rr41.6%
Taylor expanded in F around -inf 32.2%
mul-1-neg32.2%
unsub-neg32.2%
mul-1-neg32.2%
+-commutative32.2%
unpow232.2%
unpow232.2%
hypot-undefine44.7%
Simplified44.7%
associate-*l/44.7%
pow1/244.7%
exp-prod41.0%
pow-prod-down40.9%
diff-log41.6%
add-exp-log44.7%
Applied egg-rr44.7%
if 1.6500000000000001e205 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
Simplified2.4%
pow1/22.4%
pow-to-exp2.4%
unpow22.4%
unpow22.4%
hypot-undefine54.1%
Applied egg-rr54.1%
Taylor expanded in B around inf 83.8%
neg-mul-183.8%
mul-1-neg83.8%
log-rec83.8%
remove-double-div83.8%
Simplified83.8%
Final simplification30.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 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 1000.0)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/ (pow (* 2.0 (/ (- (hypot B_m A) A) (/ -1.0 F))) 0.5) (- B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1000.0) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = pow((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 1000.0) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64((Float64(2.0 * Float64(Float64(hypot(B_m, A) - A) / Float64(-1.0 / F))) ^ 0.5) / 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[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1000.0], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Power[N[(2.0 * N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 1000:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(2 \cdot \frac{\mathsf{hypot}\left(B\_m, A\right) - A}{\frac{-1}{F}}\right)}^{0.5}}{-B\_m}\\
\end{array}
\end{array}
if B < 1e3Initial program 26.7%
Simplified34.4%
Taylor expanded in A around -inf 20.6%
if 1e3 < B Initial program 13.9%
Taylor expanded in C around 0 23.9%
mul-1-neg23.9%
+-commutative23.9%
Simplified23.9%
pow1/224.0%
pow-to-exp22.4%
unpow222.4%
unpow222.4%
hypot-undefine45.9%
Applied egg-rr45.9%
Taylor expanded in F around -inf 22.1%
mul-1-neg22.1%
unsub-neg22.1%
mul-1-neg22.1%
+-commutative22.1%
unpow222.1%
unpow222.1%
hypot-undefine58.2%
Simplified58.2%
associate-*l/58.2%
pow1/258.2%
exp-prod44.8%
pow-prod-down44.8%
diff-log45.8%
add-exp-log49.0%
Applied egg-rr49.0%
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
(if (<= B_m 6.5e-84)
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(/ (pow (* 2.0 (/ (- (hypot B_m A) A) (/ -1.0 F))) 0.5) (- 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 <= 6.5e-84) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else {
tmp = pow((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -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 <= 6.5e-84) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); else tmp = Float64((Float64(2.0 * Float64(Float64(hypot(B_m, A) - A) / Float64(-1.0 / F))) ^ 0.5) / 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_] := If[LessEqual[B$95$m, 6.5e-84], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Power[N[(2.0 * N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 6.5 \cdot 10^{-84}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(2 \cdot \frac{\mathsf{hypot}\left(B\_m, A\right) - A}{\frac{-1}{F}}\right)}^{0.5}}{-B\_m}\\
\end{array}
\end{array}
if B < 6.50000000000000022e-84Initial program 27.0%
Simplified29.2%
Taylor expanded in C around inf 18.6%
associate-*r*18.6%
mul-1-neg18.6%
Simplified18.6%
if 6.50000000000000022e-84 < B Initial program 15.9%
Taylor expanded in C around 0 24.4%
mul-1-neg24.4%
+-commutative24.4%
Simplified24.4%
pow1/224.5%
pow-to-exp23.1%
unpow223.1%
unpow223.1%
hypot-undefine41.7%
Applied egg-rr41.7%
Taylor expanded in F around -inf 22.7%
mul-1-neg22.7%
unsub-neg22.7%
mul-1-neg22.7%
+-commutative22.7%
unpow222.7%
unpow222.7%
hypot-undefine51.4%
Simplified51.4%
associate-*l/51.4%
pow1/251.4%
exp-prod40.8%
pow-prod-down40.8%
diff-log41.7%
add-exp-log44.4%
Applied egg-rr44.4%
Final simplification27.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 4e-174) (/ (sqrt (* -16.0 (* (pow A 2.0) (* C F)))) (* (* 4.0 A) C)) (/ (pow (* 2.0 (/ (- (hypot B_m A) A) (/ -1.0 F))) 0.5) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-174) {
tmp = sqrt((-16.0 * (pow(A, 2.0) * (C * F)))) / ((4.0 * A) * C);
} else {
tmp = pow((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -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 (Math.pow(B_m, 2.0) <= 4e-174) {
tmp = Math.sqrt((-16.0 * (Math.pow(A, 2.0) * (C * F)))) / ((4.0 * A) * C);
} else {
tmp = Math.pow((2.0 * ((Math.hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 4e-174: tmp = math.sqrt((-16.0 * (math.pow(A, 2.0) * (C * F)))) / ((4.0 * A) * C) else: tmp = math.pow((2.0 * ((math.hypot(B_m, A) - A) / (-1.0 / F))), 0.5) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-174) tmp = Float64(sqrt(Float64(-16.0 * Float64((A ^ 2.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64((Float64(2.0 * Float64(Float64(hypot(B_m, A) - A) / Float64(-1.0 / F))) ^ 0.5) / 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)
tmp = 0.0;
if ((B_m ^ 2.0) <= 4e-174)
tmp = sqrt((-16.0 * ((A ^ 2.0) * (C * F)))) / ((4.0 * A) * C);
else
tmp = ((2.0 * ((hypot(B_m, A) - A) / (-1.0 / F))) ^ 0.5) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-174], N[(N[Sqrt[N[(-16.0 * N[(N[Power[A, 2.0], $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Power[N[(2.0 * N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-174}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left({A}^{2} \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(2 \cdot \frac{\mathsf{hypot}\left(B\_m, A\right) - A}{\frac{-1}{F}}\right)}^{0.5}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4e-174Initial program 23.5%
Simplified29.6%
Taylor expanded in A around -inf 20.7%
Taylor expanded in C around inf 20.6%
associate-*r*20.6%
Simplified20.6%
if 4e-174 < (pow.f64 B #s(literal 2 binary64)) Initial program 23.2%
Taylor expanded in C around 0 13.9%
mul-1-neg13.9%
+-commutative13.9%
Simplified13.9%
pow1/213.9%
pow-to-exp13.1%
unpow213.1%
unpow213.1%
hypot-undefine23.5%
Applied egg-rr23.5%
Taylor expanded in F around -inf 12.9%
mul-1-neg12.9%
unsub-neg12.9%
mul-1-neg12.9%
+-commutative12.9%
unpow212.9%
unpow212.9%
hypot-undefine28.7%
Simplified28.7%
associate-*l/28.7%
pow1/228.7%
exp-prod23.0%
pow-prod-down23.0%
diff-log23.5%
add-exp-log25.0%
Applied egg-rr25.0%
Final simplification23.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.1e-87) (/ (sqrt (* -16.0 (* (pow A 2.0) (* C F)))) (* (* 4.0 A) C)) (/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- 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 <= 3.1e-87) {
tmp = sqrt((-16.0 * (pow(A, 2.0) * (C * F)))) / ((4.0 * A) * C);
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -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 <= 3.1e-87) {
tmp = Math.sqrt((-16.0 * (Math.pow(A, 2.0) * (C * F)))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((2.0 * (F * (A - Math.hypot(B_m, A))))) / -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 <= 3.1e-87: tmp = math.sqrt((-16.0 * (math.pow(A, 2.0) * (C * F)))) / ((4.0 * A) * C) else: tmp = math.sqrt((2.0 * (F * (A - math.hypot(B_m, A))))) / -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 <= 3.1e-87) tmp = Float64(sqrt(Float64(-16.0 * Float64((A ^ 2.0) * Float64(C * F)))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / 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)
tmp = 0.0;
if (B_m <= 3.1e-87)
tmp = sqrt((-16.0 * ((A ^ 2.0) * (C * F)))) / ((4.0 * A) * C);
else
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -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, 3.1e-87], N[(N[Sqrt[N[(-16.0 * N[(N[Power[A, 2.0], $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 3.1 \cdot 10^{-87}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left({A}^{2} \cdot \left(C \cdot F\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.09999999999999998e-87Initial program 27.1%
Simplified29.4%
Taylor expanded in A around -inf 13.5%
Taylor expanded in C around inf 14.6%
associate-*r*14.6%
Simplified14.6%
if 3.09999999999999998e-87 < B Initial program 15.8%
Taylor expanded in C around 0 24.2%
mul-1-neg24.2%
+-commutative24.2%
unpow224.2%
unpow224.2%
hypot-define43.8%
Simplified43.8%
neg-sub043.8%
associate-*l/43.8%
pow1/243.8%
pow1/243.8%
hypot-undefine24.2%
unpow224.2%
unpow224.2%
pow-prod-down24.2%
unpow224.2%
unpow224.2%
hypot-undefine43.9%
Applied egg-rr43.9%
neg-sub043.9%
distribute-neg-frac243.9%
unpow1/243.9%
Simplified43.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 (/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- 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 * (A - hypot(B_m, A))))) / -B_m;
}
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 * (A - Math.hypot(B_m, A))))) / -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 * (A - math.hypot(B_m, A))))) / -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 * Float64(A - hypot(B_m, A))))) / Float64(-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 * (A - hypot(B_m, A))))) / -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 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}
\end{array}
Initial program 23.3%
Taylor expanded in C around 0 9.9%
mul-1-neg9.9%
+-commutative9.9%
unpow29.9%
unpow29.9%
hypot-define17.1%
Simplified17.1%
neg-sub017.1%
associate-*l/17.1%
pow1/217.1%
pow1/217.1%
hypot-undefine10.0%
unpow210.0%
unpow210.0%
pow-prod-down10.0%
unpow210.0%
unpow210.0%
hypot-undefine17.1%
Applied egg-rr17.1%
neg-sub017.1%
distribute-neg-frac217.1%
unpow1/217.1%
Simplified17.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 (- (* A F) (* B_m 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 * ((A * F) - (B_m * 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 * ((a * f) - (b_m * 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 * ((A * F) - (B_m * 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 * ((A * F) - (B_m * 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(Float64(A * F) - Float64(B_m * F)))) / Float64(-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 * ((A * F) - (B_m * 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[(N[Sqrt[N[(2.0 * N[(N[(A * F), $MachinePrecision] - N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 \left(A \cdot F - B\_m \cdot F\right)}}{-B\_m}
\end{array}
Initial program 23.3%
Taylor expanded in C around 0 9.9%
mul-1-neg9.9%
+-commutative9.9%
unpow29.9%
unpow29.9%
hypot-define17.1%
Simplified17.1%
neg-sub017.1%
associate-*l/17.1%
pow1/217.1%
pow1/217.1%
hypot-undefine10.0%
unpow210.0%
unpow210.0%
pow-prod-down10.0%
unpow210.0%
unpow210.0%
hypot-undefine17.1%
Applied egg-rr17.1%
neg-sub017.1%
distribute-neg-frac217.1%
unpow1/217.1%
Simplified17.1%
Taylor expanded in A around 0 15.1%
+-commutative15.1%
mul-1-neg15.1%
unsub-neg15.1%
*-commutative15.1%
Simplified15.1%
Final simplification15.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 (* (* B_m 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(((B_m * 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(((b_m * 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(((B_m * 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(((B_m * 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(Float64(B_m * F) * -2.0)) / Float64(-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(((B_m * 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[(N[Sqrt[N[(N[(B$95$m * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(B\_m \cdot F\right) \cdot -2}}{-B\_m}
\end{array}
Initial program 23.3%
Taylor expanded in C around 0 9.9%
mul-1-neg9.9%
+-commutative9.9%
unpow29.9%
unpow29.9%
hypot-define17.1%
Simplified17.1%
neg-sub017.1%
associate-*l/17.1%
pow1/217.1%
pow1/217.1%
hypot-undefine10.0%
unpow210.0%
unpow210.0%
pow-prod-down10.0%
unpow210.0%
unpow210.0%
hypot-undefine17.1%
Applied egg-rr17.1%
neg-sub017.1%
distribute-neg-frac217.1%
unpow1/217.1%
Simplified17.1%
Taylor expanded in A around 0 15.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 (* A 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((A * 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((a * 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((A * 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((A * 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(A * 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((A * 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[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / 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{A \cdot F} \cdot \frac{-2}{B\_m}
\end{array}
Initial program 23.3%
Taylor expanded in C around 0 9.9%
mul-1-neg9.9%
+-commutative9.9%
unpow29.9%
unpow29.9%
hypot-define17.1%
Simplified17.1%
div-inv17.0%
Applied egg-rr17.0%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
unpow20.0%
rem-square-sqrt2.9%
rem-square-sqrt2.9%
metadata-eval2.9%
Simplified2.9%
Final simplification2.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (pow (* 2.0 (/ F B_m)) 0.5))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return pow((2.0 * (F / B_m)), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = (2.0d0 * (f / b_m)) ** 0.5d0
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.pow((2.0 * (F / B_m)), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(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 23.3%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.3%
Simplified2.3%
Taylor expanded in F around 0 2.3%
*-commutative2.3%
pow1/22.3%
pow1/22.4%
pow-prod-down2.4%
Applied egg-rr2.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 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 23.3%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.3%
Simplified2.3%
Taylor expanded in F around 0 2.3%
pow12.3%
*-commutative2.3%
sqrt-unprod2.3%
Applied egg-rr2.3%
unpow12.3%
associate-*r/2.3%
Simplified2.3%
herbie shell --seed 2024170
(FPCore (A B C F)
:name "ABCF->ab-angle b"
: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))))