
(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 19 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 (* -4.0 C) A (* B_m B_m)))
(t_1 (fma (* -0.5 B_m) (/ B_m C) (+ A A)))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2))))
(if (<= t_3 (- INFINITY))
(/ (* (- (sqrt (* t_0 2.0))) (sqrt (* F t_1))) t_2)
(if (<= t_3 -5e-216)
(/
(*
(- (sqrt (* (fma -4.0 (* C A) (* B_m B_m)) 2.0)))
(sqrt (* F (- (+ C A) (hypot B_m (- A C))))))
t_2)
(if (<= t_3 INFINITY)
(/ (sqrt (* (* (* F 2.0) t_0) t_1)) (- t_0))
(*
(- (sqrt 2.0))
(* (pow B_m -1.0) (sqrt (* F (- A (hypot A B_m)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = fma((-0.5 * B_m), (B_m / C), (A + A));
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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (-sqrt((t_0 * 2.0)) * sqrt((F * t_1))) / t_2;
} else if (t_3 <= -5e-216) {
tmp = (-sqrt((fma(-4.0, (C * A), (B_m * B_m)) * 2.0)) * sqrt((F * ((C + A) - hypot(B_m, (A - C)))))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((((F * 2.0) * t_0) * t_1)) / -t_0;
} else {
tmp = -sqrt(2.0) * (pow(B_m, -1.0) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * 2.0))) * sqrt(Float64(F * t_1))) / t_2); elseif (t_3 <= -5e-216) tmp = Float64(Float64(Float64(-sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0))) * sqrt(Float64(F * Float64(Float64(C + A) - hypot(B_m, Float64(A - C)))))) / t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * t_1)) / Float64(-t_0)); else tmp = Float64(Float64(-sqrt(2.0)) * Float64((B_m ^ -1.0) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[((-N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -5e-216], N[(N[((-N[Sqrt[N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(F * N[(N[(C + A), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Power[B$95$m, -1.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{F \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-216}:\\
\;\;\;\;\frac{\left(-\sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2}\right) \cdot \sqrt{F \cdot \left(\left(C + A\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot t\_1}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \left({B\_m}^{-1} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6425.0
Applied rewrites25.0%
Applied rewrites32.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000021e-216Initial program 93.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites95.5%
if -5.00000000000000021e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6429.4
Applied rewrites29.4%
Applied rewrites29.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.0%
Taylor expanded in C around 0
Applied rewrites22.0%
Final simplification35.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m)))
(t_1 (fma (* -0.5 B_m) (/ B_m C) (+ A A)))
(t_2 (* (* 4.0 A) C))
(t_3 (- (pow B_m 2.0) t_2))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3))))
(if (<= t_4 (- INFINITY))
(/ (* (- (sqrt (* t_0 2.0))) (sqrt (* F t_1))) t_3)
(if (<= t_4 -5e-216)
(/
(sqrt
(*
(- (+ C A) (hypot B_m (- A C)))
(* (* 2.0 F) (fma -4.0 (* C A) (* B_m B_m)))))
(fma (- B_m) B_m t_2))
(if (<= t_4 INFINITY)
(/ (sqrt (* (* (* F 2.0) t_0) t_1)) (- t_0))
(*
(- (sqrt 2.0))
(* (pow B_m -1.0) (sqrt (* F (- A (hypot A B_m)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = fma((-0.5 * B_m), (B_m / C), (A + A));
double t_2 = (4.0 * A) * C;
double t_3 = pow(B_m, 2.0) - t_2;
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (-sqrt((t_0 * 2.0)) * sqrt((F * t_1))) / t_3;
} else if (t_4 <= -5e-216) {
tmp = sqrt((((C + A) - hypot(B_m, (A - C))) * ((2.0 * F) * fma(-4.0, (C * A), (B_m * B_m))))) / fma(-B_m, B_m, t_2);
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((((F * 2.0) * t_0) * t_1)) / -t_0;
} else {
tmp = -sqrt(2.0) * (pow(B_m, -1.0) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64((B_m ^ 2.0) - t_2) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_3)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * 2.0))) * sqrt(Float64(F * t_1))) / t_3); elseif (t_4 <= -5e-216) tmp = Float64(sqrt(Float64(Float64(Float64(C + A) - hypot(B_m, Float64(A - C))) * Float64(Float64(2.0 * F) * fma(-4.0, Float64(C * A), Float64(B_m * B_m))))) / fma(Float64(-B_m), B_m, t_2)); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * t_1)) / Float64(-t_0)); else tmp = Float64(Float64(-sqrt(2.0)) * Float64((B_m ^ -1.0) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[((-N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -5e-216], N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[((-B$95$m) * B$95$m + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Power[B$95$m, -1.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := {B\_m}^{2} - t\_2\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{F \cdot t\_1}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + A\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right) \cdot \left(\left(2 \cdot F\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\right)}}{\mathsf{fma}\left(-B\_m, B\_m, t\_2\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot t\_1}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \left({B\_m}^{-1} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6425.0
Applied rewrites25.0%
Applied rewrites32.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000021e-216Initial program 93.5%
Applied rewrites93.6%
if -5.00000000000000021e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6429.4
Applied rewrites29.4%
Applied rewrites29.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites4.0%
Taylor expanded in C around 0
Applied rewrites22.0%
Final simplification35.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 (* -4.0 C) A (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3 (- t_0)))
(if (<= t_2 (- INFINITY))
(/ (sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0)) t_3)
(if (<= t_2 -5e-216)
(*
(sqrt (* (* B_m (fma -1.0 F (/ (* F (+ A C)) B_m))) t_0))
(/ (- (sqrt 2.0)) t_0))
(/
(sqrt (* (* (* F 2.0) t_0) (fma (* -0.5 B_m) (/ B_m C) (+ A A))))
t_3)))))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((-4.0 * C), A, (B_m * B_m));
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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -t_0;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / t_3;
} else if (t_2 <= -5e-216) {
tmp = sqrt(((B_m * fma(-1.0, F, ((F * (A + C)) / B_m))) * t_0)) * (-sqrt(2.0) / t_0);
} else {
tmp = sqrt((((F * 2.0) * t_0) * fma((-0.5 * B_m), (B_m / C), (A + A)))) / t_3;
}
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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(-t_0) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / t_3); elseif (t_2 <= -5e-216) tmp = Float64(sqrt(Float64(Float64(B_m * fma(-1.0, F, Float64(Float64(F * Float64(A + C)) / B_m))) * t_0)) * Float64(Float64(-sqrt(2.0)) / t_0)); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)))) / t_3); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$2, -5e-216], N[(N[Sqrt[N[(N[(B$95$m * N[(-1.0 * F + N[(N[(F * N[(A + C), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $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(-4 \cdot C, A, B\_m \cdot B\_m\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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := -t\_0\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{t\_3}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-216}:\\
\;\;\;\;\sqrt{\left(B\_m \cdot \mathsf{fma}\left(-1, F, \frac{F \cdot \left(A + C\right)}{B\_m}\right)\right) \cdot t\_0} \cdot \frac{-\sqrt{2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)}}{t\_3}\\
\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.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6425.0
Applied rewrites25.0%
Applied rewrites25.8%
Applied rewrites25.9%
Applied rewrites23.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000021e-216Initial program 93.5%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites93.3%
Applied rewrites93.1%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f6429.7
Applied rewrites29.7%
if -5.00000000000000021e-216 < (/.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 6.9%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6414.1
Applied rewrites14.1%
Applied rewrites14.1%
Final simplification18.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 (* -4.0 C) A (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3 (- t_0)))
(if (<= t_2 (- INFINITY))
(/ (sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0)) t_3)
(if (<= t_2 -4e-153)
(/ (sqrt (* (* t_0 (* (* F (+ -1.0 (/ (+ C A) B_m))) B_m)) 2.0)) t_3)
(/
(sqrt (* (* (* F 2.0) t_0) (fma (* -0.5 B_m) (/ B_m C) (+ A A))))
t_3)))))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((-4.0 * C), A, (B_m * B_m));
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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -t_0;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / t_3;
} else if (t_2 <= -4e-153) {
tmp = sqrt(((t_0 * ((F * (-1.0 + ((C + A) / B_m))) * B_m)) * 2.0)) / t_3;
} else {
tmp = sqrt((((F * 2.0) * t_0) * fma((-0.5 * B_m), (B_m / C), (A + A)))) / t_3;
}
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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(-t_0) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / t_3); elseif (t_2 <= -4e-153) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(Float64(F * Float64(-1.0 + Float64(Float64(C + A) / B_m))) * B_m)) * 2.0)) / t_3); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)))) / t_3); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$2, -4e-153], N[(N[Sqrt[N[(N[(t$95$0 * N[(N[(F * N[(-1.0 + N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $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(-4 \cdot C, A, B\_m \cdot B\_m\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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := -t\_0\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{t\_3}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-153}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(\left(F \cdot \left(-1 + \frac{C + A}{B\_m}\right)\right) \cdot B\_m\right)\right) \cdot 2}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)}}{t\_3}\\
\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.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6425.0
Applied rewrites25.0%
Applied rewrites25.8%
Applied rewrites25.9%
Applied rewrites23.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.00000000000000016e-153Initial program 93.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites92.9%
Applied rewrites92.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f6427.8
Applied rewrites27.8%
Applied rewrites27.5%
if -4.00000000000000016e-153 < (/.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 8.0%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6414.0
Applied rewrites14.0%
Applied rewrites14.0%
Final simplification18.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 (* -4.0 C) A (* B_m B_m)))
(t_1 (/ (- (sqrt 2.0)) t_0))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2))))
(if (or (<= t_3 -1e+188) (not (<= t_3 -5e-216)))
(* (sqrt (* (* -4.0 A) (* (* C F) (+ A A)))) t_1)
(* (sqrt (* (* (- B_m) F) t_0)) 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((-4.0 * C), A, (B_m * B_m));
double t_1 = -sqrt(2.0) / t_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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double tmp;
if ((t_3 <= -1e+188) || !(t_3 <= -5e-216)) {
tmp = sqrt(((-4.0 * A) * ((C * F) * (A + A)))) * t_1;
} else {
tmp = sqrt(((-B_m * F) * t_0)) * 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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(Float64(-sqrt(2.0)) / t_0) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) tmp = 0.0 if ((t_3 <= -1e+188) || !(t_3 <= -5e-216)) tmp = Float64(sqrt(Float64(Float64(-4.0 * A) * Float64(Float64(C * F) * Float64(A + A)))) * t_1); else tmp = Float64(sqrt(Float64(Float64(Float64(-B_m) * F) * t_0)) * 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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, If[Or[LessEqual[t$95$3, -1e+188], N[Not[LessEqual[t$95$3, -5e-216]], $MachinePrecision]], N[(N[Sqrt[N[(N[(-4.0 * A), $MachinePrecision] * N[(N[(C * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[((-B$95$m) * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \frac{-\sqrt{2}}{t\_0}\\
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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+188} \lor \neg \left(t\_3 \leq -5 \cdot 10^{-216}\right):\\
\;\;\;\;\sqrt{\left(-4 \cdot A\right) \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)} \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(-B\_m\right) \cdot F\right) \cdot t\_0} \cdot t\_1\\
\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))) < -1e188 or -5.00000000000000021e-216 < (/.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 7.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites11.7%
Applied rewrites11.7%
Taylor expanded in C around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6411.5
Applied rewrites11.5%
if -1e188 < (/.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.00000000000000021e-216Initial program 92.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites92.6%
Applied rewrites92.5%
Taylor expanded in B around inf
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f6427.6
Applied rewrites27.6%
Final simplification13.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 (* -4.0 C) A (* B_m B_m))) (t_1 (- t_0)))
(if (<= (pow B_m 2.0) 5e-109)
(/ (sqrt (* (* (* F 2.0) t_0) (fma (* -0.5 B_m) (/ B_m C) (+ A A)))) t_1)
(if (<= (pow B_m 2.0) 1e+15)
(- (sqrt (* (* (- (+ C A) (hypot (- A C) B_m)) (/ F t_0)) 2.0)))
(if (<= (pow B_m 2.0) 2e+77)
(/
(sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0))
t_1)
(*
(- (sqrt 2.0))
(* (pow B_m -1.0) (sqrt (* F (- A (hypot A B_m)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = -t_0;
double tmp;
if (pow(B_m, 2.0) <= 5e-109) {
tmp = sqrt((((F * 2.0) * t_0) * fma((-0.5 * B_m), (B_m / C), (A + A)))) / t_1;
} else if (pow(B_m, 2.0) <= 1e+15) {
tmp = -sqrt(((((C + A) - hypot((A - C), B_m)) * (F / t_0)) * 2.0));
} else if (pow(B_m, 2.0) <= 2e+77) {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / t_1;
} else {
tmp = -sqrt(2.0) * (pow(B_m, -1.0) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(-t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-109) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)))) / t_1); elseif ((B_m ^ 2.0) <= 1e+15) tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) * Float64(F / t_0)) * 2.0))); elseif ((B_m ^ 2.0) <= 2e+77) tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / t_1); else tmp = Float64(Float64(-sqrt(2.0)) * Float64((B_m ^ -1.0) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-109], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+15], (-N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(F / t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+77], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Power[B$95$m, -1.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-109}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)}}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+15}:\\
\;\;\;\;-\sqrt{\left(\left(\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right) \cdot \frac{F}{t\_0}\right) \cdot 2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+77}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \left({B\_m}^{-1} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-109Initial program 16.6%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6424.5
Applied rewrites24.5%
Applied rewrites24.5%
if 5.0000000000000002e-109 < (pow.f64 B #s(literal 2 binary64)) < 1e15Initial program 37.6%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites61.8%
Applied rewrites58.6%
if 1e15 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999997e77Initial program 22.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6427.4
Applied rewrites27.4%
Applied rewrites27.7%
Applied rewrites27.7%
Applied rewrites27.4%
if 1.99999999999999997e77 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites26.4%
Taylor expanded in C around 0
Applied rewrites25.4%
Final simplification28.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 (* -4.0 C) A (* B_m B_m))) (t_1 (- (sqrt 2.0))))
(if (<= (pow B_m 2.0) 2e-135)
(/
(sqrt (* (* (* F 2.0) t_0) (fma (* -0.5 B_m) (/ B_m C) (+ A A))))
(- t_0))
(if (<= (pow B_m 2.0) 5e+296)
(*
t_1
(sqrt
(*
F
(/ (- (+ C A) (hypot (- A C) B_m)) (fma -4.0 (* C A) (* B_m B_m))))))
(* t_1 (* (pow B_m -1.0) (sqrt (* F (- A (hypot A B_m))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = -sqrt(2.0);
double tmp;
if (pow(B_m, 2.0) <= 2e-135) {
tmp = sqrt((((F * 2.0) * t_0) * fma((-0.5 * B_m), (B_m / C), (A + A)))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+296) {
tmp = t_1 * sqrt((F * (((C + A) - hypot((A - C), B_m)) / fma(-4.0, (C * A), (B_m * B_m)))));
} else {
tmp = t_1 * (pow(B_m, -1.0) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(-sqrt(2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-135) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+296) tmp = Float64(t_1 * sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))))); else tmp = Float64(t_1 * Float64((B_m ^ -1.0) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-135], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+296], N[(t$95$1 * N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[Power[B$95$m, -1.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := -\sqrt{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-135}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+296}:\\
\;\;\;\;t\_1 \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left({B\_m}^{-1} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-135Initial program 17.0%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6424.7
Applied rewrites24.7%
Applied rewrites24.7%
if 2.0000000000000001e-135 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e296Initial program 28.7%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites52.6%
if 5.0000000000000001e296 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites5.9%
Taylor expanded in C around 0
Applied rewrites31.9%
Final simplification36.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 (* -4.0 C) A (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e+77)
(/
(sqrt (* (* (* F 2.0) t_0) (fma (* -0.5 B_m) (/ B_m C) (+ A A))))
(- t_0))
(* (- (sqrt 2.0)) (* (pow B_m -1.0) (sqrt (* F (- A (hypot A B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e+77) {
tmp = sqrt((((F * 2.0) * t_0) * fma((-0.5 * B_m), (B_m / C), (A + A)))) / -t_0;
} else {
tmp = -sqrt(2.0) * (pow(B_m, -1.0) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+77) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)))) / Float64(-t_0)); else tmp = Float64(Float64(-sqrt(2.0)) * Float64((B_m ^ -1.0) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+77], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Power[B$95$m, -1.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+77}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \left({B\_m}^{-1} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999997e77Initial program 21.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6423.9
Applied rewrites23.9%
Applied rewrites23.9%
if 1.99999999999999997e77 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites26.4%
Taylor expanded in C around 0
Applied rewrites25.4%
Final simplification24.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 (* -4.0 C) A (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e+77)
(/
(sqrt (* (* (* F 2.0) t_0) (fma (* -0.5 B_m) (/ B_m C) (+ A A))))
(- t_0))
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* (- A (hypot B_m A)) 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((-4.0 * C), A, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e+77) {
tmp = sqrt((((F * 2.0) * t_0) * fma((-0.5 * B_m), (B_m / C), (A + A)))) / -t_0;
} else {
tmp = (-sqrt(2.0) / B_m) * sqrt(((A - hypot(B_m, A)) * 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(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+77) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)))) / Float64(-t_0)); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+77], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + 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[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * 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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+77}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999997e77Initial program 21.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6423.9
Applied rewrites23.9%
Applied rewrites23.9%
if 1.99999999999999997e77 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.3%
Taylor expanded in C around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6425.4
Applied rewrites25.4%
Final simplification24.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 (* -4.0 C) A (* B_m B_m))) (t_1 (/ (- (sqrt 2.0)) t_0)))
(if (<= C 6e-243)
(*
(sqrt
(* (* (- A) (fma -2.0 F (* -0.5 (/ (* (* B_m B_m) F) (* A A))))) t_0))
t_1)
(if (<= C 6.2e-129)
(* (* (sqrt t_0) (sqrt (* (* F (+ -1.0 (/ (+ C A) B_m))) B_m))) t_1)
(/
(sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0))
(- t_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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = -sqrt(2.0) / t_0;
double tmp;
if (C <= 6e-243) {
tmp = sqrt(((-A * fma(-2.0, F, (-0.5 * (((B_m * B_m) * F) / (A * A))))) * t_0)) * t_1;
} else if (C <= 6.2e-129) {
tmp = (sqrt(t_0) * sqrt(((F * (-1.0 + ((C + A) / B_m))) * B_m))) * t_1;
} else {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / -t_0;
}
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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(Float64(-sqrt(2.0)) / t_0) tmp = 0.0 if (C <= 6e-243) tmp = Float64(sqrt(Float64(Float64(Float64(-A) * fma(-2.0, F, Float64(-0.5 * Float64(Float64(Float64(B_m * B_m) * F) / Float64(A * A))))) * t_0)) * t_1); elseif (C <= 6.2e-129) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(F * Float64(-1.0 + Float64(Float64(C + A) / B_m))) * B_m))) * t_1); else tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / Float64(-t_0)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]}, If[LessEqual[C, 6e-243], N[(N[Sqrt[N[(N[((-A) * N[(-2.0 * F + N[(-0.5 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision] / N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[C, 6.2e-129], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(F * N[(-1.0 + N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \frac{-\sqrt{2}}{t\_0}\\
\mathbf{if}\;C \leq 6 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{\left(\left(-A\right) \cdot \mathsf{fma}\left(-2, F, -0.5 \cdot \frac{\left(B\_m \cdot B\_m\right) \cdot F}{A \cdot A}\right)\right) \cdot t\_0} \cdot t\_1\\
\mathbf{elif}\;C \leq 6.2 \cdot 10^{-129}:\\
\;\;\;\;\left(\sqrt{t\_0} \cdot \sqrt{\left(F \cdot \left(-1 + \frac{C + A}{B\_m}\right)\right) \cdot B\_m}\right) \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{-t\_0}\\
\end{array}
\end{array}
if C < 6.0000000000000002e-243Initial program 19.8%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites25.9%
Applied rewrites25.9%
Taylor expanded in A around -inf
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f648.7
Applied rewrites8.7%
if 6.0000000000000002e-243 < C < 6.2000000000000001e-129Initial program 32.0%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites32.4%
Applied rewrites32.4%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f649.9
Applied rewrites9.9%
Applied rewrites13.7%
if 6.2000000000000001e-129 < C Initial program 8.1%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6435.5
Applied rewrites35.5%
Applied rewrites35.4%
Applied rewrites35.5%
Applied rewrites34.0%
Final simplification17.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))) (t_1 (/ (- (sqrt 2.0)) t_0)))
(if (<= C 6e-243)
(* (sqrt (* (* F (+ A A)) t_0)) t_1)
(if (<= C 1.28e-132)
(* (* (sqrt t_0) (sqrt (* (* F (+ -1.0 (/ (+ C A) B_m))) B_m))) t_1)
(/
(sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0))
(- t_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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = -sqrt(2.0) / t_0;
double tmp;
if (C <= 6e-243) {
tmp = sqrt(((F * (A + A)) * t_0)) * t_1;
} else if (C <= 1.28e-132) {
tmp = (sqrt(t_0) * sqrt(((F * (-1.0 + ((C + A) / B_m))) * B_m))) * t_1;
} else {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / -t_0;
}
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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(Float64(-sqrt(2.0)) / t_0) tmp = 0.0 if (C <= 6e-243) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + A)) * t_0)) * t_1); elseif (C <= 1.28e-132) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(F * Float64(-1.0 + Float64(Float64(C + A) / B_m))) * B_m))) * t_1); else tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / Float64(-t_0)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]}, If[LessEqual[C, 6e-243], N[(N[Sqrt[N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[C, 1.28e-132], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(F * N[(-1.0 + N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \frac{-\sqrt{2}}{t\_0}\\
\mathbf{if}\;C \leq 6 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{\left(F \cdot \left(A + A\right)\right) \cdot t\_0} \cdot t\_1\\
\mathbf{elif}\;C \leq 1.28 \cdot 10^{-132}:\\
\;\;\;\;\left(\sqrt{t\_0} \cdot \sqrt{\left(F \cdot \left(-1 + \frac{C + A}{B\_m}\right)\right) \cdot B\_m}\right) \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{-t\_0}\\
\end{array}
\end{array}
if C < 6.0000000000000002e-243Initial program 19.8%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites25.9%
Applied rewrites25.9%
Taylor expanded in C around inf
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f648.7
Applied rewrites8.7%
if 6.0000000000000002e-243 < C < 1.28000000000000005e-132Initial program 32.0%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites32.4%
Applied rewrites32.4%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f649.9
Applied rewrites9.9%
Applied rewrites13.7%
if 1.28000000000000005e-132 < C Initial program 8.1%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6435.5
Applied rewrites35.5%
Applied rewrites35.4%
Applied rewrites35.5%
Applied rewrites34.0%
Final simplification17.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))) (t_1 (/ (- (sqrt 2.0)) t_0)))
(if (<= C 6e-243)
(* (sqrt (* (* F (+ A A)) t_0)) t_1)
(if (<= C 1.28e-132)
(* (sqrt (* (* F (+ -1.0 (/ (+ C A) B_m))) B_m)) (* (sqrt t_0) t_1))
(/
(sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0))
(- t_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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = -sqrt(2.0) / t_0;
double tmp;
if (C <= 6e-243) {
tmp = sqrt(((F * (A + A)) * t_0)) * t_1;
} else if (C <= 1.28e-132) {
tmp = sqrt(((F * (-1.0 + ((C + A) / B_m))) * B_m)) * (sqrt(t_0) * t_1);
} else {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / -t_0;
}
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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(Float64(-sqrt(2.0)) / t_0) tmp = 0.0 if (C <= 6e-243) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + A)) * t_0)) * t_1); elseif (C <= 1.28e-132) tmp = Float64(sqrt(Float64(Float64(F * Float64(-1.0 + Float64(Float64(C + A) / B_m))) * B_m)) * Float64(sqrt(t_0) * t_1)); else tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / Float64(-t_0)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]}, If[LessEqual[C, 6e-243], N[(N[Sqrt[N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[C, 1.28e-132], N[(N[Sqrt[N[(N[(F * N[(-1.0 + N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \frac{-\sqrt{2}}{t\_0}\\
\mathbf{if}\;C \leq 6 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{\left(F \cdot \left(A + A\right)\right) \cdot t\_0} \cdot t\_1\\
\mathbf{elif}\;C \leq 1.28 \cdot 10^{-132}:\\
\;\;\;\;\sqrt{\left(F \cdot \left(-1 + \frac{C + A}{B\_m}\right)\right) \cdot B\_m} \cdot \left(\sqrt{t\_0} \cdot t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{-t\_0}\\
\end{array}
\end{array}
if C < 6.0000000000000002e-243Initial program 19.8%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites25.9%
Applied rewrites25.9%
Taylor expanded in C around inf
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f648.7
Applied rewrites8.7%
if 6.0000000000000002e-243 < C < 1.28000000000000005e-132Initial program 32.0%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites32.4%
Applied rewrites32.4%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f649.9
Applied rewrites9.9%
Applied rewrites13.6%
if 1.28000000000000005e-132 < C Initial program 8.1%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6435.5
Applied rewrites35.5%
Applied rewrites35.4%
Applied rewrites35.5%
Applied rewrites34.0%
Final simplification17.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))) (t_1 (- t_0)))
(if (<= C 7.8e-227)
(* (sqrt (* (* F (+ A A)) t_0)) (/ (- (sqrt 2.0)) t_0))
(if (<= C 1.28e-132)
(/ (sqrt (* (* t_0 (* (* F (+ -1.0 (/ (+ C A) B_m))) B_m)) 2.0)) t_1)
(/
(sqrt (* (* (fma (* -0.5 (/ B_m C)) B_m (+ A A)) (* F 2.0)) t_0))
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((-4.0 * C), A, (B_m * B_m));
double t_1 = -t_0;
double tmp;
if (C <= 7.8e-227) {
tmp = sqrt(((F * (A + A)) * t_0)) * (-sqrt(2.0) / t_0);
} else if (C <= 1.28e-132) {
tmp = sqrt(((t_0 * ((F * (-1.0 + ((C + A) / B_m))) * B_m)) * 2.0)) / t_1;
} else {
tmp = sqrt(((fma((-0.5 * (B_m / C)), B_m, (A + A)) * (F * 2.0)) * t_0)) / 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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(-t_0) tmp = 0.0 if (C <= 7.8e-227) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + A)) * t_0)) * Float64(Float64(-sqrt(2.0)) / t_0)); elseif (C <= 1.28e-132) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(Float64(F * Float64(-1.0 + Float64(Float64(C + A) / B_m))) * B_m)) * 2.0)) / t_1); else tmp = Float64(sqrt(Float64(Float64(fma(Float64(-0.5 * Float64(B_m / C)), B_m, Float64(A + A)) * Float64(F * 2.0)) * t_0)) / 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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[C, 7.8e-227], N[(N[Sqrt[N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[C, 1.28e-132], N[(N[Sqrt[N[(N[(t$95$0 * N[(N[(F * N[(-1.0 + N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(B$95$m / C), $MachinePrecision]), $MachinePrecision] * B$95$m + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$1), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
\mathbf{if}\;C \leq 7.8 \cdot 10^{-227}:\\
\;\;\;\;\sqrt{\left(F \cdot \left(A + A\right)\right) \cdot t\_0} \cdot \frac{-\sqrt{2}}{t\_0}\\
\mathbf{elif}\;C \leq 1.28 \cdot 10^{-132}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(\left(F \cdot \left(-1 + \frac{C + A}{B\_m}\right)\right) \cdot B\_m\right)\right) \cdot 2}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5 \cdot \frac{B\_m}{C}, B\_m, A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{t\_1}\\
\end{array}
\end{array}
if C < 7.7999999999999999e-227Initial program 20.4%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites26.2%
Applied rewrites26.2%
Taylor expanded in C around inf
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f649.1
Applied rewrites9.1%
if 7.7999999999999999e-227 < C < 1.28000000000000005e-132Initial program 31.2%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites31.6%
Applied rewrites31.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f6411.7
Applied rewrites11.7%
Applied rewrites11.7%
if 1.28000000000000005e-132 < C Initial program 8.1%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6435.5
Applied rewrites35.5%
Applied rewrites35.4%
Applied rewrites35.5%
Applied rewrites34.0%
Final simplification17.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))))
(if (<= B_m 1.35e+34)
(* (sqrt (* (* F (+ A A)) t_0)) (/ (- (sqrt 2.0)) t_0))
(/
(sqrt (* (* t_0 (* (* F (+ -1.0 (/ (+ C A) B_m))) B_m)) 2.0))
(- t_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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (B_m <= 1.35e+34) {
tmp = sqrt(((F * (A + A)) * t_0)) * (-sqrt(2.0) / t_0);
} else {
tmp = sqrt(((t_0 * ((F * (-1.0 + ((C + A) / B_m))) * B_m)) * 2.0)) / -t_0;
}
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(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 1.35e+34) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + A)) * t_0)) * Float64(Float64(-sqrt(2.0)) / t_0)); else tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(Float64(F * Float64(-1.0 + Float64(Float64(C + A) / B_m))) * B_m)) * 2.0)) / Float64(-t_0)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.35e+34], N[(N[Sqrt[N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(t$95$0 * N[(N[(F * N[(-1.0 + N[(N[(C + A), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 1.35 \cdot 10^{+34}:\\
\;\;\;\;\sqrt{\left(F \cdot \left(A + A\right)\right) \cdot t\_0} \cdot \frac{-\sqrt{2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(\left(F \cdot \left(-1 + \frac{C + A}{B\_m}\right)\right) \cdot B\_m\right)\right) \cdot 2}}{-t\_0}\\
\end{array}
\end{array}
if B < 1.35e34Initial program 18.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites23.7%
Applied rewrites23.8%
Taylor expanded in C around inf
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6418.3
Applied rewrites18.3%
if 1.35e34 < B Initial program 11.5%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites11.5%
Applied rewrites11.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f649.7
Applied rewrites9.7%
Applied rewrites9.8%
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
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))) (t_1 (/ (- (sqrt 2.0)) t_0)))
(if (<= B_m 1.35e+34)
(* (sqrt (* (* F (+ A A)) t_0)) t_1)
(* (sqrt (* (* (- B_m) F) t_0)) 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((-4.0 * C), A, (B_m * B_m));
double t_1 = -sqrt(2.0) / t_0;
double tmp;
if (B_m <= 1.35e+34) {
tmp = sqrt(((F * (A + A)) * t_0)) * t_1;
} else {
tmp = sqrt(((-B_m * F) * t_0)) * 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(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(Float64(-sqrt(2.0)) / t_0) tmp = 0.0 if (B_m <= 1.35e+34) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + A)) * t_0)) * t_1); else tmp = Float64(sqrt(Float64(Float64(Float64(-B_m) * F) * t_0)) * 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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[((-N[Sqrt[2.0], $MachinePrecision]) / t$95$0), $MachinePrecision]}, If[LessEqual[B$95$m, 1.35e+34], N[(N[Sqrt[N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[((-B$95$m) * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \frac{-\sqrt{2}}{t\_0}\\
\mathbf{if}\;B\_m \leq 1.35 \cdot 10^{+34}:\\
\;\;\;\;\sqrt{\left(F \cdot \left(A + A\right)\right) \cdot t\_0} \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(-B\_m\right) \cdot F\right) \cdot t\_0} \cdot t\_1\\
\end{array}
\end{array}
if B < 1.35e34Initial program 18.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites23.7%
Applied rewrites23.8%
Taylor expanded in C around inf
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6418.3
Applied rewrites18.3%
if 1.35e34 < B Initial program 11.5%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites11.5%
Applied rewrites11.6%
Taylor expanded in B around inf
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f649.7
Applied rewrites9.7%
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 (* (* -4.0 A) (* (* C F) (+ A A)))) (/ (- (sqrt 2.0)) (fma (* -4.0 C) A (* B_m 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(((-4.0 * A) * ((C * F) * (A + A)))) * (-sqrt(2.0) / fma((-4.0 * C), A, (B_m * B_m)));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(-4.0 * A) * Float64(Float64(C * F) * Float64(A + A)))) * Float64(Float64(-sqrt(2.0)) / fma(Float64(-4.0 * C), A, Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(-4.0 * A), $MachinePrecision] * N[(N[(C * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * 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(-4 \cdot A\right) \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)} \cdot \frac{-\sqrt{2}}{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 17.2%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites21.2%
Applied rewrites21.2%
Taylor expanded in C around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6411.3
Applied rewrites11.3%
Final simplification11.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 (* (* -8.0 (* A A)) (* C F))) (/ (- (sqrt 2.0)) (fma (* -4.0 C) A (* B_m 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(((-8.0 * (A * A)) * (C * F))) * (-sqrt(2.0) / fma((-4.0 * C), A, (B_m * B_m)));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(-8.0 * Float64(A * A)) * Float64(C * F))) * Float64(Float64(-sqrt(2.0)) / fma(Float64(-4.0 * C), A, Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(-8.0 * N[(A * A), $MachinePrecision]), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * 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(-8 \cdot \left(A \cdot A\right)\right) \cdot \left(C \cdot F\right)} \cdot \frac{-\sqrt{2}}{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 17.2%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites21.2%
Applied rewrites21.2%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6410.0
Applied rewrites10.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (* -8.0 (* A (* (* C C) F)))) (/ (- (sqrt 2.0)) (fma (* -4.0 C) A (* B_m 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((-8.0 * (A * ((C * C) * F)))) * (-sqrt(2.0) / fma((-4.0 * C), A, (B_m * 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(-8.0 * Float64(A * Float64(Float64(C * C) * F)))) * Float64(Float64(-sqrt(2.0)) / fma(Float64(-4.0 * C), A, Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(-8.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * 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{-8 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)} \cdot \frac{-\sqrt{2}}{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 17.2%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites21.2%
Applied rewrites21.2%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6410.5
Applied rewrites10.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 (* 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 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 17.2%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.0
Applied rewrites2.0%
Applied rewrites2.0%
Applied rewrites2.0%
herbie shell --seed 2024342
(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))))