
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* F t_0))
(t_2 (hypot (- A C) B_m))
(t_3 (- t_0))
(t_4 (* (* 4.0 A) C))
(t_5
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_4) F))
(+ (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))))
(- t_4 (pow B_m 2.0)))))
(if (<= t_5 (- INFINITY))
(*
(sqrt
(*
F
(/ (+ A (+ C (hypot B_m (- A C)))) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_5 -5e-217)
(/ (* (sqrt t_1) (sqrt (* 2.0 (+ (+ A C) t_2)))) t_3)
(if (<= t_5 1e+105)
(/ (sqrt (* t_1 (- (* 4.0 C) (/ (pow B_m 2.0) A)))) t_3)
(if (<= t_5 INFINITY)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* -4.0 (* A C))))))
(sqrt (+ A (+ C t_2))))
t_3)
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ C (hypot C B_m))))
(- (sqrt 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 = F * t_0;
double t_2 = hypot((A - C), B_m);
double t_3 = -t_0;
double t_4 = (4.0 * A) * C;
double t_5 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_4) * F)) * (sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) + (A + C)))) / (t_4 - pow(B_m, 2.0));
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_5 <= -5e-217) {
tmp = (sqrt(t_1) * sqrt((2.0 * ((A + C) + t_2)))) / t_3;
} else if (t_5 <= 1e+105) {
tmp = sqrt((t_1 * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / t_3;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, (-4.0 * (A * C)))))) * sqrt((A + (C + t_2)))) / t_3;
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((C + hypot(C, B_m)))) * -sqrt(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(F * t_0) t_2 = hypot(Float64(A - C), B_m) t_3 = Float64(-t_0) t_4 = Float64(Float64(4.0 * A) * C) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_4) * F)) * Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) + Float64(A + C)))) / Float64(t_4 - (B_m ^ 2.0))) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_5 <= -5e-217) tmp = Float64(Float64(sqrt(t_1) * sqrt(Float64(2.0 * Float64(Float64(A + C) + t_2)))) / t_3); elseif (t_5 <= 1e+105) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(4.0 * C) - Float64((B_m ^ 2.0) / A)))) / t_3); elseif (t_5 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * sqrt(Float64(A + Float64(C + t_2)))) / t_3); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(C + hypot(C, B_m)))) * Float64(-sqrt(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[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, Block[{t$95$4 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$4), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$4 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$5, -5e-217], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(N[(A + C), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, 1e+105], N[(N[Sqrt[N[(t$95$1 * N[(N[(4.0 * C), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 := \mathsf{hypot}\left(A - C, B\_m\right)\\
t_3 := -t\_0\\
t_4 := \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_4\right) \cdot F\right)\right) \cdot \left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} + \left(A + C\right)\right)}}{t\_4 - {B\_m}^{2}}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_5 \leq -5 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{t\_1} \cdot \sqrt{2 \cdot \left(\left(A + C\right) + t\_2\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq 10^{+105}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(4 \cdot C - \frac{{B\_m}^{2}}{A}\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{A + \left(C + t\_2\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right) \cdot \left(-\sqrt{F}\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))) < -inf.0Initial program 3.1%
Taylor expanded in F around 0 27.5%
mul-1-neg27.5%
*-commutative27.5%
cancel-sign-sub-inv27.5%
metadata-eval27.5%
+-commutative27.5%
associate-/l*35.0%
Simplified69.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))) < -5.0000000000000002e-217Initial program 97.7%
Simplified97.7%
add-sqr-sqrt97.6%
pow297.6%
Applied egg-rr97.7%
pow-pow97.7%
unpow-prod-down97.8%
metadata-eval97.8%
pow1/297.8%
associate-*r*97.8%
metadata-eval97.8%
pow1/297.8%
associate-+r+97.8%
+-commutative97.8%
Applied egg-rr97.8%
if -5.0000000000000002e-217 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.9999999999999994e104Initial program 10.1%
Simplified12.4%
Taylor expanded in A around -inf 36.6%
if 9.9999999999999994e104 < (/.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 13.6%
Simplified54.2%
associate-*r*54.2%
associate-+r+54.2%
hypot-undefine13.6%
unpow213.6%
unpow213.6%
+-commutative13.6%
sqrt-prod13.6%
*-commutative13.6%
associate-*r*13.6%
associate-+l+13.6%
Applied egg-rr89.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 A around 0 1.6%
mul-1-neg1.6%
unpow21.6%
unpow21.6%
hypot-define20.2%
Simplified20.2%
add-exp-log17.6%
associate-*l/17.6%
Applied egg-rr17.7%
rem-exp-log20.3%
unpow-prod-down20.2%
exp-to-pow20.3%
pow1/220.2%
*-commutative20.2%
sqrt-unprod27.1%
associate-*l/27.1%
associate-*r*27.1%
exp-to-pow27.2%
pow1/227.2%
Applied egg-rr27.2%
Final simplification51.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)))) (t_1 (- t_0)) (t_2 (* F t_0)))
(if (<= (pow B_m 2.0) 2e-156)
(/ (sqrt (* t_2 (* 4.0 C))) t_1)
(if (<= (pow B_m 2.0) 1e+168)
(/ (* (sqrt t_2) (sqrt (* 2.0 (+ (+ A C) (hypot (- A C) B_m))))) t_1)
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (exp (* (log 2.0) 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 t_1 = -t_0;
double t_2 = F * t_0;
double tmp;
if (pow(B_m, 2.0) <= 2e-156) {
tmp = sqrt((t_2 * (4.0 * C))) / t_1;
} else if (pow(B_m, 2.0) <= 1e+168) {
tmp = (sqrt(t_2) * sqrt((2.0 * ((A + C) + hypot((A - C), B_m))))) / t_1;
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (exp((log(2.0) * 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))) t_1 = Float64(-t_0) t_2 = Float64(F * t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-156) tmp = Float64(sqrt(Float64(t_2 * Float64(4.0 * C))) / t_1); elseif ((B_m ^ 2.0) <= 1e+168) tmp = Float64(Float64(sqrt(t_2) * sqrt(Float64(2.0 * Float64(Float64(A + C) + hypot(Float64(A - C), B_m))))) / t_1); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(exp(Float64(log(2.0) * 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]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-156], N[(N[Sqrt[N[(t$95$2 * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+168], N[(N[(N[Sqrt[t$95$2], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(N[Log[2.0], $MachinePrecision] * 0.5), $MachinePrecision]], $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}^{2} \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(4 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+168}:\\
\;\;\;\;\frac{\sqrt{t\_2} \cdot \sqrt{2 \cdot \left(\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{e^{\log 2 \cdot 0.5}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000008e-156Initial program 14.4%
Simplified28.3%
Taylor expanded in A around -inf 26.6%
*-commutative26.6%
Simplified26.6%
if 2.00000000000000008e-156 < (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999993e167Initial program 36.4%
Simplified47.0%
add-sqr-sqrt47.0%
pow247.0%
Applied egg-rr47.1%
pow-pow47.0%
unpow-prod-down62.3%
metadata-eval62.3%
pow1/262.3%
associate-*r*62.3%
metadata-eval62.3%
pow1/262.3%
associate-+r+62.2%
+-commutative62.2%
Applied egg-rr62.2%
if 9.9999999999999993e167 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.9%
Taylor expanded in A around 0 7.0%
mul-1-neg7.0%
unpow27.0%
unpow27.0%
hypot-define28.0%
Simplified28.0%
pow1/228.0%
metadata-eval28.0%
pow-to-exp28.1%
metadata-eval28.1%
Applied egg-rr28.1%
pow1/228.1%
*-commutative28.1%
hypot-undefine7.1%
unpow27.1%
unpow27.1%
metadata-eval7.1%
unpow-prod-down9.2%
Applied egg-rr38.0%
Final simplification40.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-156)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(if (<= (pow B_m 2.0) 5e+142)
(*
(sqrt
(*
F
(/
(+ A (+ C (hypot B_m (- A C))))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(*
(* (sqrt (+ C (hypot C B_m))) (sqrt F))
(/ (exp (* (log 2.0) 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 (pow(B_m, 2.0) <= 2e-156) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+142) {
tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else {
tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (exp((log(2.0) * 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 ^ 2.0) <= 2e-156) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+142) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(sqrt(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(exp(Float64(log(2.0) * 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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-156], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+142], N[(N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(N[Log[2.0], $MachinePrecision] * 0.5), $MachinePrecision]], $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}^{2} \leq 2 \cdot 10^{-156}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+142}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\right) \cdot \frac{e^{\log 2 \cdot 0.5}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000008e-156Initial program 14.4%
Simplified28.3%
Taylor expanded in A around -inf 26.6%
*-commutative26.6%
Simplified26.6%
if 2.00000000000000008e-156 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e142Initial program 38.5%
Taylor expanded in F around 0 45.6%
mul-1-neg45.6%
*-commutative45.6%
cancel-sign-sub-inv45.6%
metadata-eval45.6%
+-commutative45.6%
associate-/l*46.4%
Simplified59.5%
if 5.0000000000000001e142 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.8%
Taylor expanded in A around 0 6.8%
mul-1-neg6.8%
unpow26.8%
unpow26.8%
hypot-define26.9%
Simplified26.9%
pow1/226.9%
metadata-eval26.9%
pow-to-exp27.0%
metadata-eval27.0%
Applied egg-rr27.0%
pow1/227.0%
*-commutative27.0%
hypot-undefine6.9%
unpow26.9%
unpow26.9%
metadata-eval6.9%
unpow-prod-down8.9%
Applied egg-rr36.6%
Final simplification38.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)))) (t_1 (- t_0)))
(if (<= (pow B_m 2.0) 4e-72)
(/ (sqrt (* (* F t_0) (* 4.0 C))) t_1)
(if (<= (pow B_m 2.0) 2e+168)
(/
(*
(+ B_m (* 0.5 (* A (/ (* C -4.0) B_m))))
(sqrt (* F (* 2.0 (+ A (+ C (hypot (- A C) B_m)))))))
t_1)
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ B_m C)) (- (sqrt 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 = -t_0;
double tmp;
if (pow(B_m, 2.0) <= 4e-72) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / t_1;
} else if (pow(B_m, 2.0) <= 2e+168) {
tmp = ((B_m + (0.5 * (A * ((C * -4.0) / B_m)))) * sqrt((F * (2.0 * (A + (C + hypot((A - C), B_m))))))) / t_1;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m + C)) * -sqrt(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(-t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-72) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / t_1); elseif ((B_m ^ 2.0) <= 2e+168) tmp = Float64(Float64(Float64(B_m + Float64(0.5 * Float64(A * Float64(Float64(C * -4.0) / B_m)))) * sqrt(Float64(F * Float64(2.0 * Float64(A + Float64(C + hypot(Float64(A - C), B_m))))))) / t_1); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m + C)) * Float64(-sqrt(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 = (-t$95$0)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-72], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+168], N[(N[(N[(B$95$m + N[(0.5 * N[(A * N[(N[(C * -4.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(2.0 * N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 := -t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-72}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+168}:\\
\;\;\;\;\frac{\left(B\_m + 0.5 \cdot \left(A \cdot \frac{C \cdot -4}{B\_m}\right)\right) \cdot \sqrt{F \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m + C} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72Initial program 16.0%
Simplified29.2%
Taylor expanded in A around -inf 24.0%
*-commutative24.0%
Simplified24.0%
if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e168Initial program 41.6%
Simplified52.1%
associate-*l*52.2%
sqrt-prod69.7%
fma-undefine69.7%
add-sqr-sqrt42.3%
hypot-define42.3%
associate-*r*42.3%
hypot-undefine25.8%
unpow225.8%
unpow225.8%
+-commutative25.8%
unpow225.8%
unpow225.8%
hypot-define42.3%
Applied egg-rr42.3%
Taylor expanded in A around 0 0.0%
associate-/l*0.0%
unpow20.0%
rem-square-sqrt26.3%
Simplified26.3%
if 1.9999999999999999e168 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.9%
Taylor expanded in A around 0 7.1%
mul-1-neg7.1%
unpow27.1%
unpow27.1%
hypot-define28.3%
Simplified28.3%
pow1/228.4%
*-commutative28.4%
hypot-undefine7.2%
unpow27.2%
unpow27.2%
metadata-eval7.2%
unpow-prod-down9.3%
Applied egg-rr38.4%
Taylor expanded in C around 0 32.7%
Final simplification27.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-72)
(/ (sqrt (* (* F t_0) (- (* 4.0 C) (/ (pow B_m 2.0) A)))) (- t_0))
(* (* (/ (sqrt 2.0) B_m) (sqrt (+ C (hypot C B_m)))) (- (sqrt 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) <= 4e-72) {
tmp = sqrt(((F * t_0) * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / -t_0;
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((C + hypot(C, B_m)))) * -sqrt(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) <= 4e-72) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(Float64(4.0 * C) - Float64((B_m ^ 2.0) / A)))) / Float64(-t_0)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(C + hypot(C, B_m)))) * Float64(-sqrt(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], 4e-72], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(N[(4.0 * C), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 4 \cdot 10^{-72}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C - \frac{{B\_m}^{2}}{A}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right) \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72Initial program 16.0%
Simplified29.2%
Taylor expanded in A around -inf 23.1%
if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.3%
Taylor expanded in A around 0 12.4%
mul-1-neg12.4%
unpow212.4%
unpow212.4%
hypot-define26.5%
Simplified26.5%
add-exp-log23.6%
associate-*l/23.6%
Applied egg-rr23.6%
rem-exp-log26.6%
unpow-prod-down26.5%
exp-to-pow26.6%
pow1/226.6%
*-commutative26.6%
sqrt-unprod33.3%
associate-*l/33.3%
associate-*r*33.3%
exp-to-pow33.4%
pow1/233.4%
Applied egg-rr33.4%
Final simplification28.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-72)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(if (<= (pow B_m 2.0) 1e+180)
(/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ B_m C)) (- (sqrt 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) <= 4e-72) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+180) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m + C)) * -sqrt(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) <= 4e-72) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e+180) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m + C)) * Float64(-sqrt(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], 4e-72], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+180], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 4 \cdot 10^{-72}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+180}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m + C} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72Initial program 16.0%
Simplified29.2%
Taylor expanded in A around -inf 24.0%
*-commutative24.0%
Simplified24.0%
if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64)) < 1e180Initial program 40.0%
Taylor expanded in A around 0 21.8%
mul-1-neg21.8%
unpow221.8%
unpow221.8%
hypot-define22.2%
Simplified22.2%
neg-sub022.2%
associate-*l/22.2%
Applied egg-rr22.3%
neg-sub022.3%
distribute-neg-frac222.3%
unpow1/222.3%
Simplified22.3%
if 1e180 < (pow.f64 B #s(literal 2 binary64)) Initial program 5.0%
Taylor expanded in A around 0 7.2%
mul-1-neg7.2%
unpow27.2%
unpow27.2%
hypot-define28.8%
Simplified28.8%
pow1/229.0%
*-commutative29.0%
hypot-undefine7.3%
unpow27.3%
unpow27.3%
metadata-eval7.3%
unpow-prod-down9.4%
Applied egg-rr39.2%
Taylor expanded in C around 0 33.4%
Final simplification27.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) 4e-72)
(/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
(* (* (/ (sqrt 2.0) B_m) (sqrt (+ C (hypot C B_m)))) (- (sqrt 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) <= 4e-72) {
tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((C + hypot(C, B_m)))) * -sqrt(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) <= 4e-72) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(C + hypot(C, B_m)))) * Float64(-sqrt(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], 4e-72], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 4 \cdot 10^{-72}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right) \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72Initial program 16.0%
Simplified29.2%
Taylor expanded in A around -inf 24.0%
*-commutative24.0%
Simplified24.0%
if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.3%
Taylor expanded in A around 0 12.4%
mul-1-neg12.4%
unpow212.4%
unpow212.4%
hypot-define26.5%
Simplified26.5%
add-exp-log23.6%
associate-*l/23.6%
Applied egg-rr23.6%
rem-exp-log26.6%
unpow-prod-down26.5%
exp-to-pow26.6%
pow1/226.6%
*-commutative26.6%
sqrt-unprod33.3%
associate-*l/33.3%
associate-*r*33.3%
exp-to-pow33.4%
pow1/233.4%
Applied egg-rr33.4%
Final simplification29.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 7e+66) (/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m)) (* (/ (sqrt 2.0) B_m) (* (sqrt (+ B_m C)) (- (sqrt F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 7e+66) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m + C)) * -sqrt(F));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 7e+66) {
tmp = Math.sqrt((2.0 * (F * (C + Math.hypot(C, B_m))))) / -B_m;
} else {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((B_m + C)) * -Math.sqrt(F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 7e+66: tmp = math.sqrt((2.0 * (F * (C + math.hypot(C, B_m))))) / -B_m else: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((B_m + C)) * -math.sqrt(F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 7e+66) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(B_m + C)) * Float64(-sqrt(F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 7e+66)
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
else
tmp = (sqrt(2.0) / B_m) * (sqrt((B_m + C)) * -sqrt(F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 7e+66], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 7 \cdot 10^{+66}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{B\_m + C} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if F < 6.9999999999999994e66Initial program 16.3%
Taylor expanded in A around 0 9.0%
mul-1-neg9.0%
unpow29.0%
unpow29.0%
hypot-define19.0%
Simplified19.0%
neg-sub019.0%
associate-*l/19.0%
Applied egg-rr19.2%
neg-sub019.2%
distribute-neg-frac219.2%
unpow1/219.1%
Simplified19.1%
if 6.9999999999999994e66 < F Initial program 17.6%
Taylor expanded in A around 0 12.7%
mul-1-neg12.7%
unpow212.7%
unpow212.7%
hypot-define15.6%
Simplified15.6%
pow1/215.6%
*-commutative15.6%
hypot-undefine12.7%
unpow212.7%
unpow212.7%
metadata-eval12.7%
unpow-prod-down16.5%
Applied egg-rr29.1%
Taylor expanded in C around 0 23.7%
Final simplification20.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 8e+66) (/ (sqrt (* 2.0 (* F (+ C (hypot C B_m))))) (- B_m)) (* (sqrt F) (- (sqrt (/ 2.0 B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 8e+66) {
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
} else {
tmp = sqrt(F) * -sqrt((2.0 / B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 8e+66) {
tmp = Math.sqrt((2.0 * (F * (C + Math.hypot(C, B_m))))) / -B_m;
} else {
tmp = Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 8e+66: tmp = math.sqrt((2.0 * (F * (C + math.hypot(C, B_m))))) / -B_m else: tmp = math.sqrt(F) * -math.sqrt((2.0 / B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 8e+66) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C + hypot(C, B_m))))) / Float64(-B_m)); else tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(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)
tmp = 0.0;
if (F <= 8e+66)
tmp = sqrt((2.0 * (F * (C + hypot(C, B_m))))) / -B_m;
else
tmp = sqrt(F) * -sqrt((2.0 / B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 8e+66], N[(N[Sqrt[N[(2.0 * N[(F * N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 8 \cdot 10^{+66}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if F < 7.99999999999999956e66Initial program 16.3%
Taylor expanded in A around 0 9.0%
mul-1-neg9.0%
unpow29.0%
unpow29.0%
hypot-define19.0%
Simplified19.0%
neg-sub019.0%
associate-*l/19.0%
Applied egg-rr19.2%
neg-sub019.2%
distribute-neg-frac219.2%
unpow1/219.1%
Simplified19.1%
if 7.99999999999999956e66 < F Initial program 17.6%
Taylor expanded in B around inf 24.0%
mul-1-neg24.0%
*-commutative24.0%
Simplified24.0%
*-commutative24.0%
pow1/224.7%
metadata-eval24.7%
pow1/224.7%
metadata-eval24.7%
pow-prod-down24.9%
metadata-eval24.9%
Applied egg-rr24.9%
unpow1/224.2%
Simplified24.2%
associate-*l/24.2%
Applied egg-rr24.2%
associate-/l*24.1%
Simplified24.1%
pow1/224.8%
*-commutative24.8%
unpow-prod-down24.2%
pow1/224.2%
pow1/224.2%
Applied egg-rr24.2%
Final simplification20.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt F) (- (sqrt (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(F) * -sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(f) * -sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(F) * -math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(F) * Float64(-sqrt(Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(F) * -sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)
\end{array}
Initial program 16.7%
Taylor expanded in B around inf 14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
*-commutative14.8%
pow1/215.0%
metadata-eval15.0%
pow1/215.0%
metadata-eval15.0%
pow-prod-down15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/214.9%
Simplified14.9%
associate-*l/14.9%
Applied egg-rr14.9%
associate-/l*14.9%
Simplified14.9%
pow1/215.1%
*-commutative15.1%
unpow-prod-down18.1%
pow1/218.1%
pow1/218.1%
Applied egg-rr18.1%
Final simplification18.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* 2.0 (fabs (/ 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 * fabs((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 * abs((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 * Math.abs((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.fabs((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 * abs(Float64(F / B_m))))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((2.0 * abs((F / B_m))));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(2.0 * N[Abs[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{2 \cdot \left|\frac{F}{B\_m}\right|}
\end{array}
Initial program 16.7%
Taylor expanded in B around inf 14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
*-commutative14.8%
pow1/215.0%
metadata-eval15.0%
pow1/215.0%
metadata-eval15.0%
pow-prod-down15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/214.9%
Simplified14.9%
pow114.9%
metadata-eval14.9%
pow-prod-up15.0%
pow-prod-down19.5%
pow219.5%
Applied egg-rr19.5%
unpow1/219.5%
unpow219.5%
rem-sqrt-square27.5%
Simplified27.5%
Final simplification27.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (fabs (* F (/ 2.0 B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(fabs((F * (2.0 / B_m))));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(abs((f * (2.0d0 / b_m))))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(Math.abs((F * (2.0 / B_m))));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(math.fabs((F * (2.0 / B_m))))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(abs(Float64(F * Float64(2.0 / B_m))))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(abs((F * (2.0 / B_m))));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[Abs[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\left|F \cdot \frac{2}{B\_m}\right|}
\end{array}
Initial program 16.7%
Taylor expanded in B around inf 14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
*-commutative14.8%
pow1/215.0%
metadata-eval15.0%
pow1/215.0%
metadata-eval15.0%
pow-prod-down15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/214.9%
Simplified14.9%
associate-*l/14.9%
Applied egg-rr14.9%
associate-/l*14.9%
Simplified14.9%
add-sqr-sqrt14.9%
pow1/214.9%
pow1/215.1%
pow-prod-down19.5%
pow219.5%
associate-*r/19.5%
Applied egg-rr19.5%
unpow1/219.5%
unpow219.5%
rem-sqrt-square27.5%
associate-/l*27.4%
Simplified27.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 (- (pow (* 2.0 (/ F B_m)) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -pow((2.0 * (F / B_m)), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -((2.0d0 * (f / b_m)) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.pow((2.0 * (F / B_m)), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -((2.0 * (F / B_m)) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 16.7%
Taylor expanded in B around inf 14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
*-commutative14.8%
pow1/215.0%
metadata-eval15.0%
pow1/215.0%
metadata-eval15.0%
pow-prod-down15.1%
metadata-eval15.1%
Applied egg-rr15.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 (* 2.0 (/ F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((2.0d0 * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 16.7%
Taylor expanded in B around inf 14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
*-commutative14.8%
pow1/215.0%
metadata-eval15.0%
pow1/215.0%
metadata-eval15.0%
pow-prod-down15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/214.9%
Simplified14.9%
Final simplification14.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 (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 16.7%
Taylor expanded in B around inf 14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
*-commutative14.8%
pow1/215.0%
metadata-eval15.0%
pow1/215.0%
metadata-eval15.0%
pow-prod-down15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/214.9%
Simplified14.9%
associate-*l/14.9%
Applied egg-rr14.9%
associate-/l*14.9%
Simplified14.9%
herbie shell --seed 2024123
(FPCore (A B C F)
:name "ABCF->ab-angle a"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))