
(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 14 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 (* (* 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 -5e-186)
(/
(* (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)) (/ (pow B_m 2.0) C)))) (- t_0))
(*
(/ (cbrt (* 2.0 (sqrt 2.0))) B_m)
(- (exp (* (- (log (- (hypot B_m A) A)) (log (/ -1.0 F))) 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) {
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 <= -5e-186) {
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)) - (pow(B_m, 2.0) / C)))) / -t_0;
} else {
tmp = (cbrt((2.0 * sqrt(2.0))) / B_m) * -exp(((log((hypot(B_m, A) - A)) - log((-1.0 / F))) * 0.5));
}
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 <= -5e-186) 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(Float64(2.0 * Float64(A + A)) - Float64((B_m ^ 2.0) / C)))) / Float64(-t_0)); else tmp = Float64(Float64(cbrt(Float64(2.0 * sqrt(2.0))) / B_m) * Float64(-exp(Float64(Float64(log(Float64(hypot(B_m, A) - A)) - log(Float64(-1.0 / F))) * 0.5)))); 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, -5e-186], 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[(N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Power[N[(2.0 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Exp[N[(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] * 0.5), $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 -5 \cdot 10^{-186}:\\
\;\;\;\;\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 + A\right) - \frac{{B\_m}^{2}}{C}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt[3]{2 \cdot \sqrt{2}}}{B\_m} \cdot \left(-e^{\left(\log \left(\mathsf{hypot}\left(B\_m, A\right) - A\right) - \log \left(\frac{-1}{F}\right)\right) \cdot 0.5}\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))) < -5e-186Initial program 43.0%
Simplified43.5%
pow1/243.5%
associate-*r*51.3%
unpow-prod-down69.0%
associate-+r-68.1%
hypot-undefine49.9%
unpow249.9%
unpow249.9%
+-commutative49.9%
unpow249.9%
unpow249.9%
hypot-define68.1%
pow1/268.1%
Applied egg-rr68.1%
unpow1/268.1%
associate-+r-69.0%
hypot-undefine49.9%
unpow249.9%
unpow249.9%
+-commutative49.9%
unpow249.9%
unpow249.9%
hypot-undefine69.0%
Simplified69.0%
if -5e-186 < (/.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 11.3%
Simplified20.5%
Taylor expanded in C around inf 32.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0 1.6%
mul-1-neg1.6%
+-commutative1.6%
unpow21.6%
unpow21.6%
hypot-define16.4%
Simplified16.4%
pow1/216.4%
pow-to-exp15.4%
Applied egg-rr15.4%
Taylor expanded in F around -inf 1.7%
mul-1-neg1.7%
+-commutative1.7%
unpow21.7%
unpow21.7%
hypot-undefine24.1%
mul-1-neg24.1%
Simplified24.1%
add-cbrt-cube24.1%
pow1/324.1%
pow1/224.1%
pow1/224.1%
pow-prod-up24.1%
metadata-eval24.1%
metadata-eval24.1%
Applied egg-rr24.1%
unpow1/324.1%
Simplified24.1%
Final simplification43.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))) (t_1 (* F t_0)) (t_2 (- t_0)))
(if (<= (pow B_m 2.0) 1e-223)
(/ (sqrt (* (* 4.0 A) t_1)) t_2)
(if (<= (pow B_m 2.0) 4e+91)
(/ (sqrt (* t_1 (* 2.0 (+ A (- C (hypot B_m (- A C))))))) t_2)
(*
(/ (cbrt (* 2.0 (sqrt 2.0))) B_m)
(- (exp (* (- (log (- (hypot B_m A) A)) (log (/ -1.0 F))) 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) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = F * t_0;
double t_2 = -t_0;
double tmp;
if (pow(B_m, 2.0) <= 1e-223) {
tmp = sqrt(((4.0 * A) * t_1)) / t_2;
} else if (pow(B_m, 2.0) <= 4e+91) {
tmp = sqrt((t_1 * (2.0 * (A + (C - hypot(B_m, (A - C))))))) / t_2;
} else {
tmp = (cbrt((2.0 * sqrt(2.0))) / B_m) * -exp(((log((hypot(B_m, A) - A)) - log((-1.0 / F))) * 0.5));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(F * t_0) t_2 = Float64(-t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-223) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * t_1)) / t_2); elseif ((B_m ^ 2.0) <= 4e+91) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))))) / t_2); else tmp = Float64(Float64(cbrt(Float64(2.0 * sqrt(2.0))) / B_m) * Float64(-exp(Float64(Float64(log(Float64(hypot(B_m, A) - A)) - log(Float64(-1.0 / F))) * 0.5)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-223], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+91], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[Power[N[(2.0 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Exp[N[(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] * 0.5), $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 := F \cdot t\_0\\
t_2 := -t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+91}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt[3]{2 \cdot \sqrt{2}}}{B\_m} \cdot \left(-e^{\left(\log \left(\mathsf{hypot}\left(B\_m, A\right) - A\right) - \log \left(\frac{-1}{F}\right)\right) \cdot 0.5}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999997e-224Initial program 11.2%
Simplified24.2%
Taylor expanded in A around -inf 30.7%
if 9.9999999999999997e-224 < (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000032e91Initial program 46.4%
Simplified51.6%
if 4.00000000000000032e91 < (pow.f64 B #s(literal 2 binary64)) Initial program 9.3%
Taylor expanded in C around 0 10.1%
mul-1-neg10.1%
+-commutative10.1%
unpow210.1%
unpow210.1%
hypot-define25.7%
Simplified25.7%
pow1/225.7%
pow-to-exp24.3%
Applied egg-rr24.3%
Taylor expanded in F around -inf 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-undefine33.1%
mul-1-neg33.1%
Simplified33.1%
add-cbrt-cube33.2%
pow1/333.1%
pow1/233.1%
pow1/233.1%
pow-prod-up33.1%
metadata-eval33.1%
metadata-eval33.1%
Applied egg-rr33.1%
unpow1/333.2%
Simplified33.2%
Final simplification36.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))) (t_1 (* F t_0)) (t_2 (- t_0)))
(if (<= (pow B_m 2.0) 1e-223)
(/ (sqrt (* (* 4.0 A) t_1)) t_2)
(if (<= (pow B_m 2.0) 4e+91)
(/ (sqrt (* t_1 (* 2.0 (+ A (- C (hypot B_m (- A C))))))) t_2)
(*
(exp (* 0.5 (+ (log (- (hypot B_m A) A)) (log (- 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 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = F * t_0;
double t_2 = -t_0;
double tmp;
if (pow(B_m, 2.0) <= 1e-223) {
tmp = sqrt(((4.0 * A) * t_1)) / t_2;
} else if (pow(B_m, 2.0) <= 4e+91) {
tmp = sqrt((t_1 * (2.0 * (A + (C - hypot(B_m, (A - C))))))) / t_2;
} else {
tmp = exp((0.5 * (log((hypot(B_m, A) - A)) + log(-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 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(F * t_0) t_2 = Float64(-t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-223) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * t_1)) / t_2); elseif ((B_m ^ 2.0) <= 4e+91) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))))) / t_2); else tmp = Float64(exp(Float64(0.5 * Float64(log(Float64(hypot(B_m, A) - A)) + log(Float64(-F))))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-223], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+91], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Exp[N[(0.5 * N[(N[Log[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] - A), $MachinePrecision]], $MachinePrecision] + N[Log[(-F)], $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)\\
t_1 := F \cdot t\_0\\
t_2 := -t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+91}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;e^{0.5 \cdot \left(\log \left(\mathsf{hypot}\left(B\_m, A\right) - A\right) + \log \left(-F\right)\right)} \cdot \frac{-\sqrt{2}}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999997e-224Initial program 11.2%
Simplified24.2%
Taylor expanded in A around -inf 30.7%
if 9.9999999999999997e-224 < (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000032e91Initial program 46.4%
Simplified51.6%
if 4.00000000000000032e91 < (pow.f64 B #s(literal 2 binary64)) Initial program 9.3%
Taylor expanded in C around 0 10.1%
mul-1-neg10.1%
+-commutative10.1%
unpow210.1%
unpow210.1%
hypot-define25.7%
Simplified25.7%
pow1/225.7%
pow-to-exp24.3%
Applied egg-rr24.3%
Taylor expanded in F around -inf 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-undefine33.1%
mul-1-neg33.1%
Simplified33.1%
Taylor expanded in F around -inf 10.4%
sub-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-undefine33.1%
log-rec33.1%
associate-/r/33.1%
metadata-eval33.1%
neg-mul-133.1%
Simplified33.1%
Final simplification36.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))) (t_1 (- t_0)) (t_2 (* F t_0)))
(if (<= B_m 1.8e-109)
(/ (sqrt (* (* 4.0 A) t_2)) t_1)
(if (<= B_m 1.25e+45)
(/ (sqrt (* t_2 (* 2.0 (+ A (- C (hypot B_m (- A C))))))) t_1)
(if (<= B_m 2.5e+174)
(/ (sqrt (* 2.0 (/ (- (hypot A B_m) A) (/ -1.0 F)))) (- B_m))
(*
(exp (* 0.5 (+ (log (- F)) (log 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 t_1 = -t_0;
double t_2 = F * t_0;
double tmp;
if (B_m <= 1.8e-109) {
tmp = sqrt(((4.0 * A) * t_2)) / t_1;
} else if (B_m <= 1.25e+45) {
tmp = sqrt((t_2 * (2.0 * (A + (C - hypot(B_m, (A - C))))))) / t_1;
} else if (B_m <= 2.5e+174) {
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
} else {
tmp = exp((0.5 * (log(-F) + log(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))) t_1 = Float64(-t_0) t_2 = Float64(F * t_0) tmp = 0.0 if (B_m <= 1.8e-109) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * t_2)) / t_1); elseif (B_m <= 1.25e+45) tmp = Float64(sqrt(Float64(t_2 * Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))))) / t_1); elseif (B_m <= 2.5e+174) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(hypot(A, B_m) - A) / Float64(-1.0 / F)))) / Float64(-B_m)); else tmp = Float64(exp(Float64(0.5 * Float64(log(Float64(-F)) + log(B_m)))) * Float64(Float64(-sqrt(2.0)) / 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 = (-t$95$0)}, Block[{t$95$2 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[B$95$m, 1.8e-109], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.25e+45], N[(N[Sqrt[N[(t$95$2 * N[(2.0 * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 2.5e+174], N[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Exp[N[(0.5 * N[(N[Log[(-F)], $MachinePrecision] + N[Log[B$95$m], $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)\\
t_1 := -t\_0\\
t_2 := F \cdot t\_0\\
\mathbf{if}\;B\_m \leq 1.8 \cdot 10^{-109}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot t\_2}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.25 \cdot 10^{+45}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 2.5 \cdot 10^{+174}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \frac{\mathsf{hypot}\left(A, B\_m\right) - A}{\frac{-1}{F}}}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;e^{0.5 \cdot \left(\log \left(-F\right) + \log B\_m\right)} \cdot \frac{-\sqrt{2}}{B\_m}\\
\end{array}
\end{array}
if B < 1.8e-109Initial program 17.3%
Simplified24.9%
Taylor expanded in A around -inf 20.7%
if 1.8e-109 < B < 1.25e45Initial program 38.6%
Simplified44.1%
if 1.25e45 < B < 2.4999999999999998e174Initial program 23.2%
Taylor expanded in C around 0 45.0%
mul-1-neg45.0%
+-commutative45.0%
unpow245.0%
unpow245.0%
hypot-define58.3%
Simplified58.3%
pow1/258.3%
pow-to-exp55.2%
Applied egg-rr55.2%
Taylor expanded in F around -inf 45.9%
mul-1-neg45.9%
+-commutative45.9%
unpow245.9%
unpow245.9%
hypot-undefine62.1%
mul-1-neg62.1%
Simplified62.1%
neg-sub062.1%
associate-*l/62.1%
Applied egg-rr58.8%
neg-sub058.8%
distribute-neg-frac258.8%
unpow1/258.8%
distribute-frac-neg58.8%
distribute-neg-frac258.8%
hypot-undefine45.5%
unpow245.5%
unpow245.5%
+-commutative45.5%
unpow245.5%
unpow245.5%
hypot-define58.8%
Simplified58.8%
if 2.4999999999999998e174 < B Initial program 0.0%
Taylor expanded in C around 0 2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-define49.6%
Simplified49.6%
pow1/249.6%
pow-to-exp46.4%
Applied egg-rr46.4%
Taylor expanded in F around -inf 2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-undefine74.2%
mul-1-neg74.2%
Simplified74.2%
Taylor expanded in A around 0 66.5%
sub-neg66.5%
log-rec66.5%
associate-/r/66.5%
metadata-eval66.5%
neg-mul-166.5%
Simplified66.5%
Final simplification32.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)))
(if (<= (pow B_m 2.0) 2e-41)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A)))
(- t_0 (pow B_m 2.0)))
(/ (sqrt (* 2.0 (/ (- (hypot A B_m) A) (/ -1.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) {
double t_0 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 2e-41) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -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 (Math.pow(B_m, 2.0) <= 2e-41) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = Math.sqrt((2.0 * ((Math.hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 2e-41: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = math.sqrt((2.0 * ((math.hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-41) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(hypot(A, B_m) - A) / Float64(-1.0 / F)))) / 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 ^ 2.0) <= 2e-41)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - (B_m ^ 2.0));
else
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-41], 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 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / 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])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-41}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \frac{\mathsf{hypot}\left(A, B\_m\right) - A}{\frac{-1}{F}}}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000001e-41Initial program 20.7%
Taylor expanded in A around -inf 28.3%
if 2.00000000000000001e-41 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.3%
Taylor expanded in C around 0 12.9%
mul-1-neg12.9%
+-commutative12.9%
unpow212.9%
unpow212.9%
hypot-define25.3%
Simplified25.3%
pow1/225.3%
pow-to-exp23.9%
Applied egg-rr23.9%
Taylor expanded in F around -inf 12.8%
mul-1-neg12.8%
+-commutative12.8%
unpow212.8%
unpow212.8%
hypot-undefine30.9%
mul-1-neg30.9%
Simplified30.9%
neg-sub030.9%
associate-*l/30.9%
Applied egg-rr25.5%
neg-sub025.5%
distribute-neg-frac225.5%
unpow1/225.5%
distribute-frac-neg25.5%
distribute-neg-frac225.5%
hypot-undefine13.0%
unpow213.0%
unpow213.0%
+-commutative13.0%
unpow213.0%
unpow213.0%
hypot-define25.5%
Simplified25.5%
Final simplification26.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e-41)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/ (sqrt (* 2.0 (/ (- (hypot A B_m) A) (/ -1.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) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e-41) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-41) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(hypot(A, B_m) - A) / Float64(-1.0 / F)))) / 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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-41], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / 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])\\
\\
\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^{-41}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \frac{\mathsf{hypot}\left(A, B\_m\right) - A}{\frac{-1}{F}}}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000001e-41Initial program 20.7%
Simplified31.3%
Taylor expanded in A around -inf 28.3%
if 2.00000000000000001e-41 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.3%
Taylor expanded in C around 0 12.9%
mul-1-neg12.9%
+-commutative12.9%
unpow212.9%
unpow212.9%
hypot-define25.3%
Simplified25.3%
pow1/225.3%
pow-to-exp23.9%
Applied egg-rr23.9%
Taylor expanded in F around -inf 12.8%
mul-1-neg12.8%
+-commutative12.8%
unpow212.8%
unpow212.8%
hypot-undefine30.9%
mul-1-neg30.9%
Simplified30.9%
neg-sub030.9%
associate-*l/30.9%
Applied egg-rr25.5%
neg-sub025.5%
distribute-neg-frac225.5%
unpow1/225.5%
distribute-frac-neg25.5%
distribute-neg-frac225.5%
hypot-undefine13.0%
unpow213.0%
unpow213.0%
+-commutative13.0%
unpow213.0%
unpow213.0%
hypot-define25.5%
Simplified25.5%
Final simplification26.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-223)
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(/ (sqrt (* 2.0 (/ (- (hypot A B_m) A) (/ -1.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) {
double tmp;
if (pow(B_m, 2.0) <= 1e-223) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else {
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-223) 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(sqrt(Float64(2.0 * Float64(Float64(hypot(A, B_m) - A) / Float64(-1.0 / F)))) / 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[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-223], 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[Sqrt[N[(2.0 * N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / 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])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-223}:\\
\;\;\;\;\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{\sqrt{2 \cdot \frac{\mathsf{hypot}\left(A, B\_m\right) - A}{\frac{-1}{F}}}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999997e-224Initial program 11.2%
Simplified21.8%
Taylor expanded in C around inf 28.6%
associate-*r*28.6%
mul-1-neg28.6%
Simplified28.6%
if 9.9999999999999997e-224 < (pow.f64 B #s(literal 2 binary64)) Initial program 23.0%
Taylor expanded in C around 0 13.4%
mul-1-neg13.4%
+-commutative13.4%
unpow213.4%
unpow213.4%
hypot-define23.4%
Simplified23.4%
pow1/223.4%
pow-to-exp22.2%
Applied egg-rr22.2%
Taylor expanded in F around -inf 13.2%
mul-1-neg13.2%
+-commutative13.2%
unpow213.2%
unpow213.2%
hypot-undefine27.7%
mul-1-neg27.7%
Simplified27.7%
neg-sub027.7%
associate-*l/27.7%
Applied egg-rr23.5%
neg-sub023.5%
distribute-neg-frac223.5%
unpow1/223.5%
distribute-frac-neg23.5%
distribute-neg-frac223.5%
hypot-undefine13.5%
unpow213.5%
unpow213.5%
+-commutative13.5%
unpow213.5%
unpow213.5%
hypot-define23.5%
Simplified23.5%
Final simplification25.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= B_m 9e-21)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A)))
(- t_0 (pow B_m 2.0)))
(if (<= B_m 2.7e+175)
(/ (sqrt (* 2.0 (/ (- (hypot A B_m) A) (/ -1.0 F)))) (- B_m))
(* (exp (* 0.5 (+ (log (- F)) (log 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 = (4.0 * A) * C;
double tmp;
if (B_m <= 9e-21) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
} else if (B_m <= 2.7e+175) {
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
} else {
tmp = exp((0.5 * (log(-F) + log(B_m)))) * (-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 <= 9e-21) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - Math.pow(B_m, 2.0));
} else if (B_m <= 2.7e+175) {
tmp = Math.sqrt((2.0 * ((Math.hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
} else {
tmp = Math.exp((0.5 * (Math.log(-F) + Math.log(B_m)))) * (-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 <= 9e-21: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - math.pow(B_m, 2.0)) elif B_m <= 2.7e+175: tmp = math.sqrt((2.0 * ((math.hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m else: tmp = math.exp((0.5 * (math.log(-F) + math.log(B_m)))) * (-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 <= 9e-21) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0))); elseif (B_m <= 2.7e+175) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(hypot(A, B_m) - A) / Float64(-1.0 / F)))) / Float64(-B_m)); else tmp = Float64(exp(Float64(0.5 * Float64(log(Float64(-F)) + log(B_m)))) * Float64(Float64(-sqrt(2.0)) / 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 <= 9e-21)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - (B_m ^ 2.0));
elseif (B_m <= 2.7e+175)
tmp = sqrt((2.0 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -B_m;
else
tmp = exp((0.5 * (log(-F) + log(B_m)))) * (-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, 9e-21], 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 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.7e+175], N[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Exp[N[(0.5 * N[(N[Log[(-F)], $MachinePrecision] + N[Log[B$95$m], $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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 9 \cdot 10^{-21}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;B\_m \leq 2.7 \cdot 10^{+175}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \frac{\mathsf{hypot}\left(A, B\_m\right) - A}{\frac{-1}{F}}}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;e^{0.5 \cdot \left(\log \left(-F\right) + \log B\_m\right)} \cdot \frac{-\sqrt{2}}{B\_m}\\
\end{array}
\end{array}
if B < 8.99999999999999936e-21Initial program 19.4%
Taylor expanded in A around -inf 19.6%
if 8.99999999999999936e-21 < B < 2.7000000000000001e175Initial program 30.2%
Taylor expanded in C around 0 41.1%
mul-1-neg41.1%
+-commutative41.1%
unpow241.1%
unpow241.1%
hypot-define49.3%
Simplified49.3%
pow1/249.3%
pow-to-exp46.6%
Applied egg-rr46.6%
Taylor expanded in F around -inf 40.8%
mul-1-neg40.8%
+-commutative40.8%
unpow240.8%
unpow240.8%
hypot-undefine50.8%
mul-1-neg50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
Applied egg-rr49.7%
neg-sub049.7%
distribute-neg-frac249.7%
unpow1/249.7%
distribute-frac-neg49.7%
distribute-neg-frac249.7%
hypot-undefine41.5%
unpow241.5%
unpow241.5%
+-commutative41.5%
unpow241.5%
unpow241.5%
hypot-define49.7%
Simplified49.7%
if 2.7000000000000001e175 < B Initial program 0.0%
Taylor expanded in C around 0 2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-define49.6%
Simplified49.6%
pow1/249.6%
pow-to-exp46.4%
Applied egg-rr46.4%
Taylor expanded in F around -inf 2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-undefine74.2%
mul-1-neg74.2%
Simplified74.2%
Taylor expanded in A around 0 66.5%
sub-neg66.5%
log-rec66.5%
associate-/r/66.5%
metadata-eval66.5%
neg-mul-166.5%
Simplified66.5%
Final simplification29.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 (/ (- (hypot A B_m) A) (/ -1.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 * ((hypot(A, B_m) - A) / (-1.0 / F)))) / -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 * ((Math.hypot(A, B_m) - A) / (-1.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 * ((math.hypot(A, B_m) - A) / (-1.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(Float64(hypot(A, B_m) - A) / Float64(-1.0 / 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 * ((hypot(A, B_m) - A) / (-1.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[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] - A), $MachinePrecision] / N[(-1.0 / 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 \frac{\mathsf{hypot}\left(A, B\_m\right) - A}{\frac{-1}{F}}}}{-B\_m}
\end{array}
Initial program 18.9%
Taylor expanded in C around 0 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-define17.0%
Simplified17.0%
pow1/217.0%
pow-to-exp16.1%
Applied egg-rr16.1%
Taylor expanded in F around -inf 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-undefine20.0%
mul-1-neg20.0%
Simplified20.0%
neg-sub020.0%
associate-*l/20.0%
Applied egg-rr17.1%
neg-sub017.1%
distribute-neg-frac217.1%
unpow1/217.0%
distribute-frac-neg17.0%
distribute-neg-frac217.0%
hypot-undefine10.5%
unpow210.5%
unpow210.5%
+-commutative10.5%
unpow210.5%
unpow210.5%
hypot-define17.0%
Simplified17.0%
Final simplification17.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 (* F (- 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 18.9%
Taylor expanded in C around 0 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-define17.0%
Simplified17.0%
neg-sub017.0%
associate-*l/17.0%
pow1/217.0%
pow1/217.0%
pow-prod-down17.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 (if (<= A -5e+220) (* (sqrt (* A F)) (/ -2.0 B_m)) (/ (sqrt (* -2.0 (* 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) {
double tmp;
if (A <= -5e+220) {
tmp = sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-5d+220)) then
tmp = sqrt((a * f)) * ((-2.0d0) / b_m)
else
tmp = sqrt(((-2.0d0) * (b_m * f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -5e+220) {
tmp = Math.sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = Math.sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -5e+220: tmp = math.sqrt((A * F)) * (-2.0 / B_m) else: tmp = math.sqrt((-2.0 * (B_m * F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= -5e+220) tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B_m)); else tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / 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 (A <= -5e+220)
tmp = sqrt((A * F)) * (-2.0 / B_m);
else
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -5e+220], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $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}\;A \leq -5 \cdot 10^{+220}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -5.0000000000000002e220Initial program 1.9%
Taylor expanded in C around 0 1.2%
mul-1-neg1.2%
+-commutative1.2%
unpow21.2%
unpow21.2%
hypot-define17.7%
Simplified17.7%
pow1/218.2%
pow-to-exp17.3%
Applied egg-rr17.3%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt17.5%
unpow217.5%
rem-square-sqrt17.8%
metadata-eval17.8%
Simplified17.8%
if -5.0000000000000002e220 < A Initial program 20.2%
Taylor expanded in C around 0 11.1%
mul-1-neg11.1%
+-commutative11.1%
unpow211.1%
unpow211.1%
hypot-define16.9%
Simplified16.9%
neg-sub016.9%
associate-*l/16.9%
pow1/216.9%
pow1/216.9%
pow-prod-down17.0%
Applied egg-rr17.0%
neg-sub017.0%
distribute-neg-frac217.0%
unpow1/217.0%
Simplified17.0%
Taylor expanded in A around 0 16.2%
Final simplification16.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 (* (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 18.9%
Taylor expanded in C around 0 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-define17.0%
Simplified17.0%
pow1/217.0%
pow-to-exp16.1%
Applied egg-rr16.1%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt2.9%
unpow22.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 18.9%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.6%
Simplified1.6%
Taylor expanded in F around 0 1.6%
sqrt-unprod1.6%
pow1/21.9%
Applied egg-rr1.9%
Final simplification1.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) 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 18.9%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.6%
Simplified1.6%
Taylor expanded in F around 0 1.6%
pow11.6%
sqrt-unprod1.6%
Applied egg-rr1.6%
unpow11.6%
*-commutative1.6%
associate-*r/1.6%
Simplified1.6%
herbie shell --seed 2024165
(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))))