
(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 A (* C -4.0) (pow B_m 2.0)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(-
(sqrt
(*
(* 2.0 (* t_1 F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_1))
(t_3 (* 2.0 t_0)))
(if (<= t_2 -1e-150)
(/ (* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (- (sqrt t_3))) t_0)
(if (<= t_2 2e+194)
(/
(-
(sqrt
(*
F
(*
t_3
(+
A
(+
A
(*
-0.5
(/ (+ (pow A 2.0) (- (pow B_m 2.0) (pow (- A) 2.0))) C))))))))
t_0)
(if (<= t_2 INFINITY)
(/
(-
(pow
(exp
(* 0.25 (+ (log (* -16.0 (* C F))) (* -2.0 (log (/ -1.0 A))))))
2.0))
(fma B_m B_m (* A (* C -4.0))))
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A))))))))))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(A, (C * -4.0), pow(B_m, 2.0));
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = -sqrt(((2.0 * (t_1 * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_1;
double t_3 = 2.0 * t_0;
double tmp;
if (t_2 <= -1e-150) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * -sqrt(t_3)) / t_0;
} else if (t_2 <= 2e+194) {
tmp = -sqrt((F * (t_3 * (A + (A + (-0.5 * ((pow(A, 2.0) + (pow(B_m, 2.0) - pow(-A, 2.0))) / C))))))) / t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = -pow(exp((0.25 * (log((-16.0 * (C * F))) + (-2.0 * log((-1.0 / A)))))), 2.0) / fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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(A, Float64(C * -4.0), (B_m ^ 2.0)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_1) t_3 = Float64(2.0 * t_0) tmp = 0.0 if (t_2 <= -1e-150) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * Float64(-sqrt(t_3))) / t_0); elseif (t_2 <= 2e+194) tmp = Float64(Float64(-sqrt(Float64(F * Float64(t_3 * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64((A ^ 2.0) + Float64((B_m ^ 2.0) - (Float64(-A) ^ 2.0))) / C)))))))) / t_0); elseif (t_2 <= Inf) tmp = Float64(Float64(-(exp(Float64(0.25 * Float64(log(Float64(-16.0 * Float64(C * F))) + Float64(-2.0 * log(Float64(-1.0 / A)))))) ^ 2.0)) / fma(B_m, B_m, Float64(A * Float64(C * -4.0)))); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); 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[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$1 * 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]) / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * t$95$0), $MachinePrecision]}, If[LessEqual[t$95$2, -1e-150], 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[t$95$3], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$2, 2e+194], N[((-N[Sqrt[N[(F * N[(t$95$3 * N[(A + N[(A + N[(-0.5 * N[(N[(N[Power[A, 2.0], $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[Power[(-A), 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[((-N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(-2.0 * N[Log[N[(-1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]) / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)\\
t_1 := {B_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{-\sqrt{\left(2 \cdot \left(t_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_1}\\
t_3 := 2 \cdot t_0\\
\mathbf{if}\;t_2 \leq -1 \cdot 10^{-150}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)} \cdot \left(-\sqrt{t_3}\right)}{t_0}\\
\mathbf{elif}\;t_2 \leq 2 \cdot 10^{+194}:\\
\;\;\;\;\frac{-\sqrt{F \cdot \left(t_3 \cdot \left(A + \left(A + -0.5 \cdot \frac{{A}^{2} + \left({B_m}^{2} - {\left(-A\right)}^{2}\right)}{C}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\frac{-{\left(e^{0.25 \cdot \left(\log \left(-16 \cdot \left(C \cdot F\right)\right) + -2 \cdot \log \left(\frac{-1}{A}\right)\right)}\right)}^{2}}{\mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -1.00000000000000001e-150Initial program 44.3%
Simplified42.3%
pow1/242.3%
associate-*r*55.0%
unpow-prod-down70.7%
pow1/270.7%
Applied egg-rr70.7%
unpow1/270.7%
associate-+r-70.0%
+-commutative70.0%
associate--l+70.9%
Simplified70.9%
if -1.00000000000000001e-150 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 1.99999999999999989e194Initial program 32.4%
Simplified33.8%
Taylor expanded in C around inf 25.9%
associate--l+25.9%
associate--l+25.9%
mul-1-neg25.9%
mul-1-neg25.9%
Simplified25.9%
if 1.99999999999999989e194 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 3.5%
Simplified26.5%
add-sqr-sqrt26.4%
pow226.4%
pow1/226.4%
sqrt-pow126.4%
associate-*l*26.4%
associate-+r-26.4%
metadata-eval26.4%
Applied egg-rr26.4%
Taylor expanded in A around -inf 47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified1.6%
Taylor expanded in C around 0 2.3%
associate-*r*2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-def16.3%
Simplified16.3%
Final simplification37.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 (* A (* C -4.0)))
(t_1 (* 2.0 (+ A (- C (hypot B_m (- A C))))))
(t_2 (fma B_m B_m t_0))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(-
(sqrt
(*
(* 2.0 (* t_3 F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (- (* (hypot B_m (sqrt t_0)) (sqrt (* F t_1)))) t_2)
(if (<= t_4 -1e-150)
(/ (- (sqrt (* (* F t_2) t_1))) t_2)
(if (<= t_4 2e+194)
(/ (- (pow (pow (* t_2 (* F (* 2.0 (* 2.0 A)))) 0.25) 2.0)) t_2)
(if (<= t_4 INFINITY)
(/
(-
(pow
(exp
(* 0.25 (+ (log (* -16.0 (* C F))) (* -2.0 (log (/ -1.0 A))))))
2.0))
t_2)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A)))))))))))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 = A * (C * -4.0);
double t_1 = 2.0 * (A + (C - hypot(B_m, (A - C))));
double t_2 = fma(B_m, B_m, t_0);
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = -(hypot(B_m, sqrt(t_0)) * sqrt((F * t_1))) / t_2;
} else if (t_4 <= -1e-150) {
tmp = -sqrt(((F * t_2) * t_1)) / t_2;
} else if (t_4 <= 2e+194) {
tmp = -pow(pow((t_2 * (F * (2.0 * (2.0 * A)))), 0.25), 2.0) / t_2;
} else if (t_4 <= ((double) INFINITY)) {
tmp = -pow(exp((0.25 * (log((-16.0 * (C * F))) + (-2.0 * log((-1.0 / A)))))), 2.0) / t_2;
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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(A * Float64(C * -4.0)) t_1 = Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))) t_2 = fma(B_m, B_m, t_0) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(-Float64(hypot(B_m, sqrt(t_0)) * sqrt(Float64(F * t_1)))) / t_2); elseif (t_4 <= -1e-150) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_2) * t_1))) / t_2); elseif (t_4 <= 2e+194) tmp = Float64(Float64(-((Float64(t_2 * Float64(F * Float64(2.0 * Float64(2.0 * A)))) ^ 0.25) ^ 2.0)) / t_2); elseif (t_4 <= Inf) tmp = Float64(Float64(-(exp(Float64(0.25 * Float64(log(Float64(-16.0 * Float64(C * F))) + Float64(-2.0 * log(Float64(-1.0 / A)))))) ^ 2.0)) / t_2); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); 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[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{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]}, Block[{t$95$2 = N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * 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]) / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[((-N[(N[Sqrt[B$95$m ^ 2 + N[Sqrt[t$95$0], $MachinePrecision] ^ 2], $MachinePrecision] * N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-150], N[((-N[Sqrt[N[(N[(F * t$95$2), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, 2e+194], N[((-N[Power[N[Power[N[(t$95$2 * N[(F * N[(2.0 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision], 2.0], $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[((-N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(-2.0 * N[Log[N[(-1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]) / t$95$2), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := A \cdot \left(C \cdot -4\right)\\
t_1 := 2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)\\
t_2 := \mathsf{fma}\left(B_m, B_m, t_0\right)\\
t_3 := {B_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{-\sqrt{\left(2 \cdot \left(t_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_3}\\
\mathbf{if}\;t_4 \leq -\infty:\\
\;\;\;\;\frac{-\mathsf{hypot}\left(B_m, \sqrt{t_0}\right) \cdot \sqrt{F \cdot t_1}}{t_2}\\
\mathbf{elif}\;t_4 \leq -1 \cdot 10^{-150}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_2\right) \cdot t_1}}{t_2}\\
\mathbf{elif}\;t_4 \leq 2 \cdot 10^{+194}:\\
\;\;\;\;\frac{-{\left({\left(t_2 \cdot \left(F \cdot \left(2 \cdot \left(2 \cdot A\right)\right)\right)\right)}^{0.25}\right)}^{2}}{t_2}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\frac{-{\left(e^{0.25 \cdot \left(\log \left(-16 \cdot \left(C \cdot F\right)\right) + -2 \cdot \log \left(\frac{-1}{A}\right)\right)}\right)}^{2}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.0%
Simplified24.5%
add-sqr-sqrt24.5%
sqr-neg24.5%
sqrt-unprod0.7%
add-sqr-sqrt1.8%
neg-sub01.8%
sub-neg1.8%
add-sqr-sqrt0.7%
Applied egg-rr44.2%
+-lft-identity44.2%
associate--l+45.8%
Simplified45.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -1.00000000000000001e-150Initial program 96.0%
Simplified95.9%
if -1.00000000000000001e-150 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 1.99999999999999989e194Initial program 32.4%
Simplified33.7%
add-sqr-sqrt33.5%
pow233.5%
pow1/233.5%
sqrt-pow133.5%
associate-*l*35.8%
associate-+r-34.5%
metadata-eval34.5%
Applied egg-rr34.5%
Taylor expanded in A around -inf 24.0%
if 1.99999999999999989e194 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 3.5%
Simplified26.5%
add-sqr-sqrt26.4%
pow226.4%
pow1/226.4%
sqrt-pow126.4%
associate-*l*26.4%
associate-+r-26.4%
metadata-eval26.4%
Applied egg-rr26.4%
Taylor expanded in A around -inf 47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified1.6%
Taylor expanded in C around 0 2.3%
associate-*r*2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-def16.3%
Simplified16.3%
Final simplification36.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 (* A (* C -4.0)))
(t_1 (* 2.0 (+ A (- C (hypot B_m (- A C))))))
(t_2 (fma B_m B_m t_0))
(t_3 (* F t_2))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(-
(sqrt
(*
(* 2.0 (* t_4 F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_4)))
(if (<= t_5 (- INFINITY))
(/ (- (* (hypot B_m (sqrt t_0)) (sqrt (* F t_1)))) t_2)
(if (<= t_5 -1e-150)
(/ (- (sqrt (* t_3 t_1))) t_2)
(if (<= t_5 2e+194)
(/
(-
(sqrt
(*
t_3
(*
2.0
(+
A
(+
A
(*
-0.5
(/ (+ (pow A 2.0) (- (pow B_m 2.0) (pow (- A) 2.0))) C))))))))
t_2)
(if (<= t_5 INFINITY)
(/
(-
(pow
(exp
(* 0.25 (+ (log (* -16.0 (* C F))) (* -2.0 (log (/ -1.0 A))))))
2.0))
t_2)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A)))))))))))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 = A * (C * -4.0);
double t_1 = 2.0 * (A + (C - hypot(B_m, (A - C))));
double t_2 = fma(B_m, B_m, t_0);
double t_3 = F * t_2;
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = -sqrt(((2.0 * (t_4 * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = -(hypot(B_m, sqrt(t_0)) * sqrt((F * t_1))) / t_2;
} else if (t_5 <= -1e-150) {
tmp = -sqrt((t_3 * t_1)) / t_2;
} else if (t_5 <= 2e+194) {
tmp = -sqrt((t_3 * (2.0 * (A + (A + (-0.5 * ((pow(A, 2.0) + (pow(B_m, 2.0) - pow(-A, 2.0))) / C))))))) / t_2;
} else if (t_5 <= ((double) INFINITY)) {
tmp = -pow(exp((0.25 * (log((-16.0 * (C * F))) + (-2.0 * log((-1.0 / A)))))), 2.0) / t_2;
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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(A * Float64(C * -4.0)) t_1 = Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))) t_2 = fma(B_m, B_m, t_0) t_3 = Float64(F * t_2) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(-Float64(hypot(B_m, sqrt(t_0)) * sqrt(Float64(F * t_1)))) / t_2); elseif (t_5 <= -1e-150) tmp = Float64(Float64(-sqrt(Float64(t_3 * t_1))) / t_2); elseif (t_5 <= 2e+194) tmp = Float64(Float64(-sqrt(Float64(t_3 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64((A ^ 2.0) + Float64((B_m ^ 2.0) - (Float64(-A) ^ 2.0))) / C)))))))) / t_2); elseif (t_5 <= Inf) tmp = Float64(Float64(-(exp(Float64(0.25 * Float64(log(Float64(-16.0 * Float64(C * F))) + Float64(-2.0 * log(Float64(-1.0 / A)))))) ^ 2.0)) / t_2); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); 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[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{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]}, Block[{t$95$2 = N[(B$95$m * B$95$m + t$95$0), $MachinePrecision]}, Block[{t$95$3 = N[(F * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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]) / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[((-N[(N[Sqrt[B$95$m ^ 2 + N[Sqrt[t$95$0], $MachinePrecision] ^ 2], $MachinePrecision] * N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, -1e-150], N[((-N[Sqrt[N[(t$95$3 * t$95$1), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, 2e+194], N[((-N[Sqrt[N[(t$95$3 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[(N[Power[A, 2.0], $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[Power[(-A), 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[((-N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(-2.0 * N[Log[N[(-1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]) / t$95$2), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := A \cdot \left(C \cdot -4\right)\\
t_1 := 2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)\\
t_2 := \mathsf{fma}\left(B_m, B_m, t_0\right)\\
t_3 := F \cdot t_2\\
t_4 := {B_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{-\sqrt{\left(2 \cdot \left(t_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_4}\\
\mathbf{if}\;t_5 \leq -\infty:\\
\;\;\;\;\frac{-\mathsf{hypot}\left(B_m, \sqrt{t_0}\right) \cdot \sqrt{F \cdot t_1}}{t_2}\\
\mathbf{elif}\;t_5 \leq -1 \cdot 10^{-150}:\\
\;\;\;\;\frac{-\sqrt{t_3 \cdot t_1}}{t_2}\\
\mathbf{elif}\;t_5 \leq 2 \cdot 10^{+194}:\\
\;\;\;\;\frac{-\sqrt{t_3 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{A}^{2} + \left({B_m}^{2} - {\left(-A\right)}^{2}\right)}{C}\right)\right)\right)}}{t_2}\\
\mathbf{elif}\;t_5 \leq \infty:\\
\;\;\;\;\frac{-{\left(e^{0.25 \cdot \left(\log \left(-16 \cdot \left(C \cdot F\right)\right) + -2 \cdot \log \left(\frac{-1}{A}\right)\right)}\right)}^{2}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.0%
Simplified24.5%
add-sqr-sqrt24.5%
sqr-neg24.5%
sqrt-unprod0.7%
add-sqr-sqrt1.8%
neg-sub01.8%
sub-neg1.8%
add-sqr-sqrt0.7%
Applied egg-rr44.2%
+-lft-identity44.2%
associate--l+45.8%
Simplified45.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -1.00000000000000001e-150Initial program 96.0%
Simplified95.9%
if -1.00000000000000001e-150 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 1.99999999999999989e194Initial program 32.4%
Simplified33.7%
Taylor expanded in C around inf 23.9%
associate--l+23.9%
mul-1-neg23.9%
Simplified23.9%
if 1.99999999999999989e194 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 3.5%
Simplified26.5%
add-sqr-sqrt26.4%
pow226.4%
pow1/226.4%
sqrt-pow126.4%
associate-*l*26.4%
associate-+r-26.4%
metadata-eval26.4%
Applied egg-rr26.4%
Taylor expanded in A around -inf 47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified1.6%
Taylor expanded in C around 0 2.3%
associate-*r*2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-def16.3%
Simplified16.3%
Final simplification36.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 (fma A (* C -4.0) (pow B_m 2.0)))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(-
(sqrt
(*
(* 2.0 (* t_2 F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_2)))
(if (<= t_3 -1e-150)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (- (sqrt (* 2.0 t_1))))
t_1)
(if (<= t_3 2e+194)
(/
(-
(sqrt
(*
(* F t_0)
(*
2.0
(+
A
(+
A
(*
-0.5
(/ (+ (pow A 2.0) (- (pow B_m 2.0) (pow (- A) 2.0))) C))))))))
t_0)
(if (<= t_3 INFINITY)
(/
(-
(pow
(exp
(* 0.25 (+ (log (* -16.0 (* C F))) (* -2.0 (log (/ -1.0 A))))))
2.0))
t_0)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A))))))))))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 = fma(A, (C * -4.0), pow(B_m, 2.0));
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = -sqrt(((2.0 * (t_2 * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -1e-150) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * -sqrt((2.0 * t_1))) / t_1;
} else if (t_3 <= 2e+194) {
tmp = -sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * ((pow(A, 2.0) + (pow(B_m, 2.0) - pow(-A, 2.0))) / C))))))) / t_0;
} else if (t_3 <= ((double) INFINITY)) {
tmp = -pow(exp((0.25 * (log((-16.0 * (C * F))) + (-2.0 * log((-1.0 / A)))))), 2.0) / t_0;
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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 = fma(A, Float64(C * -4.0), (B_m ^ 2.0)) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_2) tmp = 0.0 if (t_3 <= -1e-150) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * Float64(-sqrt(Float64(2.0 * t_1)))) / t_1); elseif (t_3 <= 2e+194) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64((A ^ 2.0) + Float64((B_m ^ 2.0) - (Float64(-A) ^ 2.0))) / C)))))))) / t_0); elseif (t_3 <= Inf) tmp = Float64(Float64(-(exp(Float64(0.25 * Float64(log(Float64(-16.0 * Float64(C * F))) + Float64(-2.0 * log(Float64(-1.0 / A)))))) ^ 2.0)) / t_0); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); 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[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$2 * 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]) / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -1e-150], 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$1), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$3, 2e+194], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[(N[Power[A, 2.0], $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[Power[(-A), 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[((-N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(-2.0 * N[Log[N[(-1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)\\
t_2 := {B_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{-\sqrt{\left(2 \cdot \left(t_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_2}\\
\mathbf{if}\;t_3 \leq -1 \cdot 10^{-150}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)} \cdot \left(-\sqrt{2 \cdot t_1}\right)}{t_1}\\
\mathbf{elif}\;t_3 \leq 2 \cdot 10^{+194}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{A}^{2} + \left({B_m}^{2} - {\left(-A\right)}^{2}\right)}{C}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;t_3 \leq \infty:\\
\;\;\;\;\frac{-{\left(e^{0.25 \cdot \left(\log \left(-16 \cdot \left(C \cdot F\right)\right) + -2 \cdot \log \left(\frac{-1}{A}\right)\right)}\right)}^{2}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -1.00000000000000001e-150Initial program 44.3%
Simplified42.3%
pow1/242.3%
associate-*r*55.0%
unpow-prod-down70.7%
pow1/270.7%
Applied egg-rr70.7%
unpow1/270.7%
associate-+r-70.0%
+-commutative70.0%
associate--l+70.9%
Simplified70.9%
if -1.00000000000000001e-150 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 1.99999999999999989e194Initial program 32.4%
Simplified33.7%
Taylor expanded in C around inf 23.9%
associate--l+23.9%
mul-1-neg23.9%
Simplified23.9%
if 1.99999999999999989e194 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 3.5%
Simplified26.5%
add-sqr-sqrt26.4%
pow226.4%
pow1/226.4%
sqrt-pow126.4%
associate-*l*26.4%
associate-+r-26.4%
metadata-eval26.4%
Applied egg-rr26.4%
Taylor expanded in A around -inf 47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified1.6%
Taylor expanded in C around 0 2.3%
associate-*r*2.3%
mul-1-neg2.3%
+-commutative2.3%
unpow22.3%
unpow22.3%
hypot-def16.3%
Simplified16.3%
Final simplification37.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 (- A (hypot B_m A))))
(if (<= (pow B_m 2.0) 1e-249)
(/
(- (sqrt (* -8.0 (* (* A C) (* F (+ A A))))))
(fma A (* C -4.0) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+122)
(/ (- (sqrt (* (* F t_0) (* 2.0 t_1)))) t_0)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F t_1)))))))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 = A - hypot(B_m, A);
double tmp;
if (pow(B_m, 2.0) <= 1e-249) {
tmp = -sqrt((-8.0 * ((A * C) * (F * (A + A))))) / fma(A, (C * -4.0), pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+122) {
tmp = -sqrt(((F * t_0) * (2.0 * t_1))) / t_0;
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * t_1));
}
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(A - hypot(B_m, A)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-249) tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A)))))) / fma(A, Float64(C * -4.0), (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+122) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * t_1)))) / t_0); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * t_1))); 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[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-249], N[((-N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+122], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * t$95$1), $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 := A - \mathsf{hypot}\left(B_m, A\right)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-249}:\\
\;\;\;\;\frac{-\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)}\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{+122}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot t_1\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot t_1}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000005e-249Initial program 18.7%
Simplified21.8%
Taylor expanded in C around inf 20.3%
associate-*r*21.5%
sub-neg21.5%
mul-1-neg21.5%
remove-double-neg21.5%
Simplified21.5%
if 1.00000000000000005e-249 < (pow.f64 B 2) < 1.00000000000000001e122Initial program 31.0%
Simplified38.8%
Taylor expanded in C around 0 22.7%
mul-1-neg22.7%
+-commutative22.7%
unpow222.7%
unpow222.7%
hypot-def27.2%
Simplified27.2%
if 1.00000000000000001e122 < (pow.f64 B 2) Initial program 10.2%
Simplified9.2%
Taylor expanded in C around 0 12.2%
associate-*r*12.2%
mul-1-neg12.2%
+-commutative12.2%
unpow212.2%
unpow212.2%
hypot-def28.6%
Simplified28.6%
Final simplification26.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 (<= B_m 1.1e-124)
(/
(- (sqrt (* -8.0 (* (* A C) (* F (+ A A))))))
(fma A (* C -4.0) (pow B_m 2.0)))
(if (<= B_m 2.5e+61)
(/ (- (sqrt (* (* F t_0) (* 2.0 (+ A (- C (hypot B_m (- A C)))))))) t_0)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 1.1e-124) {
tmp = -sqrt((-8.0 * ((A * C) * (F * (A + A))))) / fma(A, (C * -4.0), pow(B_m, 2.0));
} else if (B_m <= 2.5e+61) {
tmp = -sqrt(((F * t_0) * (2.0 * (A + (C - hypot(B_m, (A - C))))))) / t_0;
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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 <= 1.1e-124) tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A)))))) / fma(A, Float64(C * -4.0), (B_m ^ 2.0))); elseif (B_m <= 2.5e+61) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))))) / t_0); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.1e-124], N[((-N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.5e+61], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * 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$0), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B_m \leq 1.1 \cdot 10^{-124}:\\
\;\;\;\;\frac{-\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)}\\
\mathbf{elif}\;B_m \leq 2.5 \cdot 10^{+61}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if B < 1.0999999999999999e-124Initial program 17.8%
Simplified19.1%
Taylor expanded in C around inf 12.3%
associate-*r*12.8%
sub-neg12.8%
mul-1-neg12.8%
remove-double-neg12.8%
Simplified12.8%
if 1.0999999999999999e-124 < B < 2.50000000000000009e61Initial program 33.2%
Simplified43.4%
if 2.50000000000000009e61 < B Initial program 13.9%
Simplified13.9%
Taylor expanded in C around 0 24.2%
associate-*r*24.2%
mul-1-neg24.2%
+-commutative24.2%
unpow224.2%
unpow224.2%
hypot-def57.0%
Simplified57.0%
Final simplification25.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) 1e-79)
(/ (- (sqrt (* (* F t_0) (* 2.0 (+ A A))))) t_0)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A))))))))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) <= 1e-79) {
tmp = -sqrt(((F * t_0) * (2.0 * (A + A)))) / t_0;
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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) <= 1e-79) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + A))))) / t_0); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); 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], 1e-79], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-79}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-79Initial program 24.0%
Simplified32.4%
Taylor expanded in C around inf 15.9%
if 1e-79 < (pow.f64 B 2) Initial program 15.9%
Simplified16.5%
Taylor expanded in C around 0 12.5%
associate-*r*12.5%
mul-1-neg12.5%
+-commutative12.5%
unpow212.5%
unpow212.5%
hypot-def24.1%
Simplified24.1%
Final simplification20.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-79)
(/
(- (sqrt (* -8.0 (* (* A C) (* F (+ A A))))))
(fma A (* C -4.0) (pow B_m 2.0)))
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* F (- A (hypot B_m A)))))))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-79) {
tmp = -sqrt((-8.0 * ((A * C) * (F * (A + A))))) / fma(A, (C * -4.0), pow(B_m, 2.0));
} else {
tmp = -(sqrt(2.0) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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-79) tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A)))))) / fma(A, Float64(C * -4.0), (B_m ^ 2.0))); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); 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-79], N[((-N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B_m}^{2} \leq 10^{-79}:\\
\;\;\;\;\frac{-\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1e-79Initial program 24.0%
Simplified25.5%
Taylor expanded in C around inf 15.2%
associate-*r*15.9%
sub-neg15.9%
mul-1-neg15.9%
remove-double-neg15.9%
Simplified15.9%
if 1e-79 < (pow.f64 B 2) Initial program 15.9%
Simplified16.5%
Taylor expanded in C around 0 12.5%
associate-*r*12.5%
mul-1-neg12.5%
+-commutative12.5%
unpow212.5%
unpow212.5%
hypot-def24.1%
Simplified24.1%
Final simplification20.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (/ (sqrt 2.0) B_m))))
(if (<= A -2.4e+184)
(* t_0 (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) C))))
(* t_0 (sqrt (* F (- A (hypot B_m A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -(sqrt(2.0) / B_m);
double tmp;
if (A <= -2.4e+184) {
tmp = t_0 * sqrt((-0.5 * ((pow(B_m, 2.0) * F) / C)));
} else {
tmp = t_0 * sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = -(Math.sqrt(2.0) / B_m);
double tmp;
if (A <= -2.4e+184) {
tmp = t_0 * Math.sqrt((-0.5 * ((Math.pow(B_m, 2.0) * F) / C)));
} else {
tmp = t_0 * Math.sqrt((F * (A - Math.hypot(B_m, A))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = -(math.sqrt(2.0) / B_m) tmp = 0 if A <= -2.4e+184: tmp = t_0 * math.sqrt((-0.5 * ((math.pow(B_m, 2.0) * F) / C))) else: tmp = t_0 * math.sqrt((F * (A - math.hypot(B_m, A)))) 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(sqrt(2.0) / B_m)) tmp = 0.0 if (A <= -2.4e+184) tmp = Float64(t_0 * sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / C)))); else tmp = Float64(t_0 * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = -(sqrt(2.0) / B_m);
tmp = 0.0;
if (A <= -2.4e+184)
tmp = t_0 * sqrt((-0.5 * (((B_m ^ 2.0) * F) / C)));
else
tmp = t_0 * sqrt((F * (A - hypot(B_m, A))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])}, If[LessEqual[A, -2.4e+184], N[(t$95$0 * N[Sqrt[N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -\frac{\sqrt{2}}{B_m}\\
\mathbf{if}\;A \leq -2.4 \cdot 10^{+184}:\\
\;\;\;\;t_0 \cdot \sqrt{-0.5 \cdot \frac{{B_m}^{2} \cdot F}{C}}\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if A < -2.39999999999999997e184Initial program 1.7%
Simplified7.8%
Taylor expanded in A around 0 1.5%
associate-*r*1.5%
mul-1-neg1.5%
unpow21.5%
unpow21.5%
hypot-def2.1%
Simplified2.1%
Taylor expanded in C around inf 18.6%
if -2.39999999999999997e184 < A Initial program 22.3%
Simplified22.6%
Taylor expanded in C around 0 11.5%
associate-*r*11.5%
mul-1-neg11.5%
+-commutative11.5%
unpow211.5%
unpow211.5%
hypot-def18.8%
Simplified18.8%
Final simplification18.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 (- (/ (sqrt 2.0) B_m))))
(if (<= F -1.9e+89)
(* t_0 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))
(* t_0 (sqrt (* F (- A (hypot B_m A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -(sqrt(2.0) / B_m);
double tmp;
if (F <= -1.9e+89) {
tmp = t_0 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = t_0 * sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = -(Math.sqrt(2.0) / B_m);
double tmp;
if (F <= -1.9e+89) {
tmp = t_0 * Math.sqrt((F * (-0.5 * (Math.pow(B_m, 2.0) / C))));
} else {
tmp = t_0 * Math.sqrt((F * (A - Math.hypot(B_m, A))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = -(math.sqrt(2.0) / B_m) tmp = 0 if F <= -1.9e+89: tmp = t_0 * math.sqrt((F * (-0.5 * (math.pow(B_m, 2.0) / C)))) else: tmp = t_0 * math.sqrt((F * (A - math.hypot(B_m, A)))) 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(sqrt(2.0) / B_m)) tmp = 0.0 if (F <= -1.9e+89) tmp = Float64(t_0 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); else tmp = Float64(t_0 * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = -(sqrt(2.0) / B_m);
tmp = 0.0;
if (F <= -1.9e+89)
tmp = t_0 * sqrt((F * (-0.5 * ((B_m ^ 2.0) / C))));
else
tmp = t_0 * sqrt((F * (A - hypot(B_m, A))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])}, If[LessEqual[F, -1.9e+89], N[(t$95$0 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -\frac{\sqrt{2}}{B_m}\\
\mathbf{if}\;F \leq -1.9 \cdot 10^{+89}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
\end{array}
\end{array}
if F < -1.90000000000000012e89Initial program 15.1%
Simplified11.6%
Taylor expanded in A around 0 10.2%
associate-*r*10.2%
mul-1-neg10.2%
unpow210.2%
unpow210.2%
hypot-def10.3%
Simplified10.3%
Taylor expanded in C around inf 5.9%
if -1.90000000000000012e89 < F Initial program 21.7%
Simplified24.5%
Taylor expanded in C around 0 9.6%
associate-*r*9.6%
mul-1-neg9.6%
+-commutative9.6%
unpow29.6%
unpow29.6%
hypot-def18.5%
Simplified18.5%
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 2.0) B_m)) (sqrt (* F (- A (hypot B_m A))))))
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) / B_m) * sqrt((F * (A - hypot(B_m, A))));
}
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) / B_m) * Math.sqrt((F * (A - Math.hypot(B_m, A))));
}
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) / B_m) * math.sqrt((F * (A - math.hypot(B_m, A))))
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(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))) 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) / B_m) * sqrt((F * (A - hypot(B_m, A))));
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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}
\end{array}
Initial program 19.8%
Simplified20.8%
Taylor expanded in C around 0 10.1%
associate-*r*10.1%
mul-1-neg10.1%
+-commutative10.1%
unpow210.1%
unpow210.1%
hypot-def16.5%
Simplified16.5%
Final simplification16.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 2.0) B_m)) (sqrt (* B_m (- 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) {
return -(sqrt(2.0) / B_m) * sqrt((B_m * -F));
}
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) / b_m) * sqrt((b_m * -f))
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) / B_m) * Math.sqrt((B_m * -F));
}
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) / B_m) * math.sqrt((B_m * -F))
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(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(B_m * Float64(-F)))) 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) / B_m) * sqrt((B_m * -F));
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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{B_m \cdot \left(-F\right)}
\end{array}
Initial program 19.8%
Simplified20.8%
Taylor expanded in A around 0 9.3%
associate-*r*9.3%
mul-1-neg9.3%
unpow29.3%
unpow29.3%
hypot-def15.8%
Simplified15.8%
Taylor expanded in C around 0 15.3%
mul-1-neg15.3%
Simplified15.3%
Final simplification15.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 2.0) B_m)) (sqrt (* B_m 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) {
return -(sqrt(2.0) / B_m) * sqrt((B_m * F));
}
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) / b_m) * sqrt((b_m * f))
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) / B_m) * Math.sqrt((B_m * F));
}
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) / B_m) * math.sqrt((B_m * F))
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(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(B_m * F))) 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) / B_m) * sqrt((B_m * F));
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[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{B_m \cdot F}
\end{array}
Initial program 19.8%
Simplified20.8%
Taylor expanded in A around 0 9.3%
associate-*r*9.3%
mul-1-neg9.3%
unpow29.3%
unpow29.3%
hypot-def15.8%
Simplified15.8%
Taylor expanded in B around -inf 1.6%
Final simplification1.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 C)) (- (sqrt -1.0))))
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 / C)) * -sqrt(-1.0);
}
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 / c)) * -sqrt((-1.0d0))
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 / C)) * -Math.sqrt(-1.0);
}
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 / C)) * -math.sqrt(-1.0)
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 / C)) * Float64(-sqrt(-1.0))) 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 / C)) * -sqrt(-1.0);
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[(F / C), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[-1.0], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{F}{C}} \cdot \left(-\sqrt{-1}\right)
\end{array}
Initial program 19.8%
Simplified25.9%
add-sqr-sqrt25.8%
pow225.8%
pow1/225.8%
sqrt-pow125.8%
associate-*l*26.4%
associate-+r-25.8%
metadata-eval25.8%
Applied egg-rr25.8%
Taylor expanded in A around -inf 0.0%
mul-1-neg0.0%
Simplified0.0%
Final simplification0.0%
herbie shell --seed 2023321
(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))))