
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -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))))
(if (<= t_2 (- INFINITY))
(* (sqrt (* F (/ (- (+ C A) (hypot (- A C) B_m)) t_0))) (- (sqrt 2.0)))
(if (<= t_2 -1e-194)
t_2
(if (<= t_2 INFINITY)
(/
(sqrt
(*
(fma (* A C) -4.0 (* B_m B_m))
(* (* F 2.0) (+ (fma (/ (* B_m B_m) C) -0.5 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 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 tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt((F * (((C + A) - hypot((A - C), B_m)) / t_0))) * -sqrt(2.0);
} else if (t_2 <= -1e-194) {
tmp = t_2;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (fma(((B_m * B_m) / C), -0.5, 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(-4.0, Float64(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)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_0))) * Float64(-sqrt(2.0))); elseif (t_2 <= -1e-194) tmp = t_2; elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A)))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(2.0) / Float64(-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[(-4.0 * N[(C * A), $MachinePrecision] + 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]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -1e-194], t$95$2, If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + 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, C \cdot 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}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right)\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 (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in F around 0
associate-*r*N/A
lower-*.f64N/A
Applied rewrites55.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))) < -1.00000000000000002e-194Initial program 99.1%
if -1.00000000000000002e-194 < (/.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%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites22.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.9
Applied rewrites30.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites36.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/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.f6417.2
Applied rewrites17.2%
Final simplification39.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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (- t_2)))
(if (<= t_1 (- INFINITY))
(* (sqrt (* F (/ (- (+ C A) (hypot (- A C) B_m)) t_2))) (- (sqrt 2.0)))
(if (<= t_1 -1e-194)
(/ (sqrt (* (- (+ C A) (hypot B_m (- A C))) (* (* 2.0 F) t_2))) t_3)
(if (<= t_1 INFINITY)
(/
(sqrt
(*
(fma (* A C) -4.0 (* B_m B_m))
(* (* F 2.0) (+ (fma (/ (* B_m B_m) C) -0.5 A) A))))
t_3)
(* (/ (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = -t_2;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = sqrt((F * (((C + A) - hypot((A - C), B_m)) / t_2))) * -sqrt(2.0);
} else if (t_1 <= -1e-194) {
tmp = sqrt((((C + A) - hypot(B_m, (A - C))) * ((2.0 * F) * t_2))) / t_3;
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (fma(((B_m * B_m) / C), -0.5, A) + A)))) / t_3;
} 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 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = Float64(-t_2) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_2))) * Float64(-sqrt(2.0))); elseif (t_1 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(Float64(C + A) - hypot(B_m, Float64(A - C))) * Float64(Float64(2.0 * F) * t_2))) / t_3); elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A)))) / t_3); else tmp = Float64(Float64(sqrt(2.0) / Float64(-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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$2)}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$1, -1e-194], 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] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \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\_m}^{2}}\right)}}{-t\_0}\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := -t\_2\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_2}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + A\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_2\right)}}{t\_3}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right)\right)}}{t\_3}\\
\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 (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in F around 0
associate-*r*N/A
lower-*.f64N/A
Applied rewrites55.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))) < -1.00000000000000002e-194Initial program 99.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.1%
if -1.00000000000000002e-194 < (/.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%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites22.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.9
Applied rewrites30.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites36.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/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.f6417.2
Applied rewrites17.2%
Final simplification39.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 (* C A) -4.0 (* 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 (/ (* B_m B_m) C))
(t_4 (fma -4.0 (* C A) (* B_m B_m)))
(t_5 (- t_4)))
(if (<= t_2 (- INFINITY))
(* (sqrt t_0) (/ (sqrt (* (+ (fma -0.5 t_3 A) A) (* 2.0 F))) (- t_0)))
(if (<= t_2 -1e-194)
(/
(sqrt (* (* B_m (+ (/ A B_m) (- (/ C B_m) 1.0))) (* (* 2.0 F) t_4)))
t_5)
(/
(sqrt
(*
(fma (* A C) -4.0 (* B_m B_m))
(* (* F 2.0) (+ (fma t_3 -0.5 A) A))))
t_5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (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 = (B_m * B_m) / C;
double t_4 = fma(-4.0, (C * A), (B_m * B_m));
double t_5 = -t_4;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt(t_0) * (sqrt(((fma(-0.5, t_3, A) + A) * (2.0 * F))) / -t_0);
} else if (t_2 <= -1e-194) {
tmp = sqrt(((B_m * ((A / B_m) + ((C / B_m) - 1.0))) * ((2.0 * F) * t_4))) / t_5;
} else {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (fma(t_3, -0.5, A) + A)))) / t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, 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(Float64(B_m * B_m) / C) t_4 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_5 = Float64(-t_4) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(t_0) * Float64(sqrt(Float64(Float64(fma(-0.5, t_3, A) + A) * Float64(2.0 * F))) / Float64(-t_0))); elseif (t_2 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(B_m * Float64(Float64(A / B_m) + Float64(Float64(C / B_m) - 1.0))) * Float64(Float64(2.0 * F) * t_4))) / t_5); else tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(fma(t_3, -0.5, A) + A)))) / t_5); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + 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 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$3 + A), $MachinePrecision] + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-194], N[(N[Sqrt[N[(N[(B$95$m * N[(N[(A / B$95$m), $MachinePrecision] + N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$4), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(t$95$3 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $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(C \cdot A, -4, 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 := \frac{B\_m \cdot B\_m}{C}\\
t_4 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{t\_0} \cdot \frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_3, A\right) + A\right) \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(B\_m \cdot \left(\frac{A}{B\_m} + \left(\frac{C}{B\_m} - 1\right)\right)\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_4\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(t\_3, -0.5, A\right) + A\right)\right)}}{t\_5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites14.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6418.2
Applied rewrites18.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites18.3%
Applied rewrites27.2%
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))) < -1.00000000000000002e-194Initial program 99.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.1%
Taylor expanded in B around inf
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-/.f6440.2
Applied rewrites40.2%
if -1.00000000000000002e-194 < (/.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 5.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6411.2
Applied rewrites11.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites12.5%
Final simplification19.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 (fma (* A C) -4.0 (* B_m B_m)))
(t_1 (+ (fma (/ (* B_m B_m) C) -0.5 A) A))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3)))
(t_5 (- t_2)))
(if (<= t_4 -1e+277)
(* (/ -1.0 t_0) (sqrt (* (* (* t_0 F) 2.0) t_1)))
(if (<= t_4 -1e-194)
(/
(sqrt (* (* B_m (+ (/ A B_m) (- (/ C B_m) 1.0))) (* (* 2.0 F) t_2)))
t_5)
(/ (sqrt (* t_0 (* (* F 2.0) t_1))) t_5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((A * C), -4.0, (B_m * B_m));
double t_1 = fma(((B_m * B_m) / C), -0.5, A) + A;
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double t_5 = -t_2;
double tmp;
if (t_4 <= -1e+277) {
tmp = (-1.0 / t_0) * sqrt((((t_0 * F) * 2.0) * t_1));
} else if (t_4 <= -1e-194) {
tmp = sqrt(((B_m * ((A / B_m) + ((C / B_m) - 1.0))) * ((2.0 * F) * t_2))) / t_5;
} else {
tmp = sqrt((t_0 * ((F * 2.0) * t_1))) / t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B_m * B_m)) t_1 = Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) 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)) t_5 = Float64(-t_2) tmp = 0.0 if (t_4 <= -1e+277) tmp = Float64(Float64(-1.0 / t_0) * sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * t_1))); elseif (t_4 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(B_m * Float64(Float64(A / B_m) + Float64(Float64(C / B_m) - 1.0))) * Float64(Float64(2.0 * F) * t_2))) / t_5); else tmp = Float64(sqrt(Float64(t_0 * Float64(Float64(F * 2.0) * t_1))) / t_5); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, Block[{t$95$5 = (-t$95$2)}, If[LessEqual[t$95$4, -1e+277], N[(N[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-194], N[(N[Sqrt[N[(N[(B$95$m * N[(N[(A / B$95$m), $MachinePrecision] + N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $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 \cdot C, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
t_5 := -t\_2\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{+277}:\\
\;\;\;\;\frac{-1}{t\_0} \cdot \sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot t\_1}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(B\_m \cdot \left(\frac{A}{B\_m} + \left(\frac{C}{B\_m} - 1\right)\right)\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_2\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(\left(F \cdot 2\right) \cdot t\_1\right)}}{t\_5}\\
\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))) < -1e277Initial program 4.9%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites16.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.9
Applied rewrites17.9%
Applied rewrites17.9%
if -1e277 < (/.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))) < -1.00000000000000002e-194Initial program 99.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.0%
Taylor expanded in B around inf
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-/.f6440.8
Applied rewrites40.8%
if -1.00000000000000002e-194 < (/.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 5.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6411.2
Applied rewrites11.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites12.5%
Final simplification17.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 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* (* 2.0 F) t_0))
(t_2 (- t_0))
(t_3 (* (* 4.0 A) C))
(t_4 (- (pow B_m 2.0) t_3))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4))))
(if (<= t_5 -1e-16)
(/ (sqrt (* (+ A A) t_1)) t_2)
(if (<= t_5 -1e-194)
(/ (sqrt (* (- B_m) t_1)) t_2)
(/
(sqrt
(*
(fma (* A C) -4.0 (* B_m B_m))
(* (* F 2.0) (+ (fma (/ (* B_m B_m) C) -0.5 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 = (2.0 * F) * t_0;
double t_2 = -t_0;
double t_3 = (4.0 * A) * C;
double t_4 = pow(B_m, 2.0) - t_3;
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -1e-16) {
tmp = sqrt(((A + A) * t_1)) / t_2;
} else if (t_5 <= -1e-194) {
tmp = sqrt((-B_m * t_1)) / t_2;
} else {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (fma(((B_m * B_m) / C), -0.5, 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(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(Float64(2.0 * F) * t_0) t_2 = Float64(-t_0) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64((B_m ^ 2.0) - t_3) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) tmp = 0.0 if (t_5 <= -1e-16) tmp = Float64(sqrt(Float64(Float64(A + A) * t_1)) / t_2); elseif (t_5 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_1)) / t_2); else tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $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[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision]}, If[LessEqual[t$95$5, -1e-16], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, -1e-194], N[(N[Sqrt[N[((-B$95$m) * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + 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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(2 \cdot F\right) \cdot t\_0\\
t_2 := -t\_0\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := {B\_m}^{2} - t\_3\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
\mathbf{if}\;t\_5 \leq -1 \cdot 10^{-16}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right)\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))) < -9.9999999999999998e-17Initial program 27.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites35.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f6417.5
Applied rewrites17.5%
if -9.9999999999999998e-17 < (/.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))) < -1.00000000000000002e-194Initial program 99.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6446.7
Applied rewrites46.7%
if -1.00000000000000002e-194 < (/.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 5.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6411.2
Applied rewrites11.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites12.5%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f6411.7
Applied rewrites11.7%
Final simplification15.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* (* 2.0 F) t_0))
(t_2 (- 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 (- A C) 2.0) (pow B_m 2.0))))))
(- t_3))))
(if (<= t_4 -1e-16)
(/ (sqrt (* (+ A A) t_1)) t_2)
(if (<= t_4 -1e-194)
(/ (sqrt (* (- B_m) t_1)) t_2)
(/
(sqrt (* (fma (* A C) -4.0 (* B_m B_m)) (* (* F 2.0) (+ A A))))
t_2)))))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 = (2.0 * F) * t_0;
double t_2 = -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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double tmp;
if (t_4 <= -1e-16) {
tmp = sqrt(((A + A) * t_1)) / t_2;
} else if (t_4 <= -1e-194) {
tmp = sqrt((-B_m * t_1)) / t_2;
} else {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (A + A)))) / t_2;
}
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(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(Float64(2.0 * F) * t_0) t_2 = Float64(-t_0) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) 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 <= -1e-16) tmp = Float64(sqrt(Float64(Float64(A + A) * t_1)) / t_2); elseif (t_4 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_1)) / t_2); else tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(A + A)))) / t_2); 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, 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[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, -1e-16], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-194], N[(N[Sqrt[N[((-B$95$m) * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(2 \cdot F\right) \cdot t\_0\\
t_2 := -t\_0\\
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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{-16}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(A + A\right)\right)}}{t\_2}\\
\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))) < -9.9999999999999998e-17Initial program 27.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites35.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f6417.5
Applied rewrites17.5%
if -9.9999999999999998e-17 < (/.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))) < -1.00000000000000002e-194Initial program 99.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6446.7
Applied rewrites46.7%
if -1.00000000000000002e-194 < (/.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 5.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6411.2
Applied rewrites11.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites12.5%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6411.4
Applied rewrites11.4%
Final simplification15.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 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* (* 2.0 F) t_0))
(t_2 (- 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 (- A C) 2.0) (pow B_m 2.0))))))
(- t_3))))
(if (<= t_4 -1e-16)
(/ (sqrt (* (+ A A) t_1)) t_2)
(if (<= t_4 -1e-194)
(/ (sqrt (* (- B_m) t_1)) t_2)
(/ (sqrt (* -8.0 (* A (* C (* F (+ A A)))))) t_2)))))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 = (2.0 * F) * t_0;
double t_2 = -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((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double tmp;
if (t_4 <= -1e-16) {
tmp = sqrt(((A + A) * t_1)) / t_2;
} else if (t_4 <= -1e-194) {
tmp = sqrt((-B_m * t_1)) / t_2;
} else {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) / t_2;
}
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(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(Float64(2.0 * F) * t_0) t_2 = Float64(-t_0) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) 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 <= -1e-16) tmp = Float64(sqrt(Float64(Float64(A + A) * t_1)) / t_2); elseif (t_4 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_1)) / t_2); else tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) / t_2); 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, 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[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, -1e-16], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-194], N[(N[Sqrt[N[((-B$95$m) * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(2 \cdot F\right) \cdot t\_0\\
t_2 := -t\_0\\
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{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{-16}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{t\_2}\\
\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))) < -9.9999999999999998e-17Initial program 27.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites35.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f6417.5
Applied rewrites17.5%
if -9.9999999999999998e-17 < (/.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))) < -1.00000000000000002e-194Initial program 99.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6446.7
Applied rewrites46.7%
if -1.00000000000000002e-194 < (/.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 5.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f6410.6
Applied rewrites10.6%
Final simplification14.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))
(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 -1e+277)
(/
(sqrt (* (* -8.0 (* A (* C (+ A A)))) F))
(- (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_3 -1e-194)
(/ (sqrt (* (- B_m) (* (* 2.0 F) t_0))) t_1)
(/ (sqrt (* -8.0 (* A (* C (* F (+ A A)))))) 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 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+277) {
tmp = sqrt(((-8.0 * (A * (C * (A + A)))) * F)) / -fma((C * A), -4.0, (B_m * B_m));
} else if (t_3 <= -1e-194) {
tmp = sqrt((-B_m * ((2.0 * F) * t_0))) / t_1;
} else {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) / 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(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(-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+277) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * Float64(A + A)))) * F)) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); elseif (t_3 <= -1e-194) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(2.0 * F) * t_0))) / t_1); else tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) / 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, 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, -1e+277], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -1e-194], N[(N[Sqrt[N[((-B$95$m) * N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := -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^{+277}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot \left(A + A\right)\right)\right)\right) \cdot F}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_0\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{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))) < -1e277Initial program 4.9%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6416.1
Applied rewrites16.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
lift--.f64N/A
lift-pow.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
Applied rewrites12.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6414.6
Applied rewrites14.6%
if -1e277 < (/.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))) < -1.00000000000000002e-194Initial program 99.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6435.1
Applied rewrites35.1%
if -1.00000000000000002e-194 < (/.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 5.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f6410.6
Applied rewrites10.6%
Final simplification14.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-96)
(/
(sqrt (* (fma (* A C) -4.0 (* B_m B_m)) (* (* F 2.0) (+ A A))))
(- t_0))
(if (<= (pow B_m 2.0) 5e+208)
(* (sqrt (* F (/ (- (+ C A) (hypot (- A C) B_m)) t_0))) (- (sqrt 2.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-96) {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (A + A)))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+208) {
tmp = sqrt((F * (((C + A) - hypot((A - C), B_m)) / t_0))) * -sqrt(2.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(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-96) tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(A + A)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+208) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_0))) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-96], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+208], N[(N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $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, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-96}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(A + A\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+208}:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\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.9999999999999998e-96Initial program 19.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites23.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.9
Applied rewrites22.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites24.8%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6425.0
Applied rewrites25.0%
if 1.9999999999999998e-96 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e208Initial program 30.6%
Taylor expanded in F around 0
associate-*r*N/A
lower-*.f64N/A
Applied rewrites48.3%
if 5.0000000000000004e208 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/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.f6423.0
Applied rewrites23.0%
Final simplification29.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 2e-118)
(/
(sqrt (* (fma (* A C) -4.0 (* B_m B_m)) (* (* F 2.0) (+ A A))))
(- (fma -4.0 (* C A) (* B_m B_m))))
(* (/ (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 tmp;
if (pow(B_m, 2.0) <= 2e-118) {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (A + A)))) / -fma(-4.0, (C * A), (B_m * B_m));
} 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) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-118) tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(A + A)))) / Float64(-fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-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_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-118], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $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}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-118}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(A + A\right)\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\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.99999999999999997e-118Initial program 18.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites23.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.7
Applied rewrites22.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites24.8%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6424.9
Applied rewrites24.9%
if 1.99999999999999997e-118 < (pow.f64 B #s(literal 2 binary64)) Initial program 15.1%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/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.f6421.9
Applied rewrites21.9%
Final simplification23.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 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (- t_0))
(t_2 (fma (* A C) -4.0 (* B_m B_m))))
(if (<= C -3.4e-128)
(/ (sqrt (* t_2 (* (* F 2.0) (+ A A)))) t_1)
(if (<= C 2.65e-70)
(* (/ (sqrt 2.0) -1.0) (/ (* (sqrt t_2) (sqrt (* (- B_m) F))) t_0))
(/
(sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) (* (* 2.0 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 = -t_0;
double t_2 = fma((A * C), -4.0, (B_m * B_m));
double tmp;
if (C <= -3.4e-128) {
tmp = sqrt((t_2 * ((F * 2.0) * (A + A)))) / t_1;
} else if (C <= 2.65e-70) {
tmp = (sqrt(2.0) / -1.0) * ((sqrt(t_2) * sqrt((-B_m * F))) / t_0);
} else {
tmp = sqrt(((fma(-0.5, ((B_m * B_m) / C), A) + A) * ((2.0 * 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(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(-t_0) t_2 = fma(Float64(A * C), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (C <= -3.4e-128) tmp = Float64(sqrt(Float64(t_2 * Float64(Float64(F * 2.0) * Float64(A + A)))) / t_1); elseif (C <= 2.65e-70) tmp = Float64(Float64(sqrt(2.0) / -1.0) * Float64(Float64(sqrt(t_2) * sqrt(Float64(Float64(-B_m) * F))) / t_0)); else tmp = Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) * Float64(Float64(2.0 * 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, -3.4e-128], N[(N[Sqrt[N[(t$95$2 * N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[C, 2.65e-70], N[(N[(N[Sqrt[2.0], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[(N[Sqrt[t$95$2], $MachinePrecision] * N[Sqrt[N[((-B$95$m) * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]), $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
t_2 := \mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;C \leq -3.4 \cdot 10^{-128}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(\left(F \cdot 2\right) \cdot \left(A + A\right)\right)}}{t\_1}\\
\mathbf{elif}\;C \leq 2.65 \cdot 10^{-70}:\\
\;\;\;\;\frac{\sqrt{2}}{-1} \cdot \frac{\sqrt{t\_2} \cdot \sqrt{\left(-B\_m\right) \cdot F}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_0\right)}}{t\_1}\\
\end{array}
\end{array}
if C < -3.39999999999999975e-128Initial program 23.5%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites30.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f644.5
Applied rewrites4.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites5.7%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f646.1
Applied rewrites6.1%
if -3.39999999999999975e-128 < C < 2.64999999999999992e-70Initial program 17.5%
Applied rewrites21.1%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f648.3
Applied rewrites8.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites8.8%
if 2.64999999999999992e-70 < C Initial program 9.9%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites10.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.1
Applied rewrites26.1%
Final simplification14.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 (- t_0)))
(if (<= C 2.9e-65)
(/ (sqrt (* (fma (* A C) -4.0 (* B_m B_m)) (* (* F 2.0) (+ A A)))) t_1)
(/
(sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) (* (* 2.0 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 = -t_0;
double tmp;
if (C <= 2.9e-65) {
tmp = sqrt((fma((A * C), -4.0, (B_m * B_m)) * ((F * 2.0) * (A + A)))) / t_1;
} else {
tmp = sqrt(((fma(-0.5, ((B_m * B_m) / C), A) + A) * ((2.0 * 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(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(-t_0) tmp = 0.0 if (C <= 2.9e-65) tmp = Float64(sqrt(Float64(fma(Float64(A * C), -4.0, Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * Float64(A + A)))) / t_1); else tmp = Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) * Float64(Float64(2.0 * 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[C, 2.9e-65], N[(N[Sqrt[N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]), $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
\mathbf{if}\;C \leq 2.9 \cdot 10^{-65}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(A + A\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_0\right)}}{t\_1}\\
\end{array}
\end{array}
if C < 2.8999999999999998e-65Initial program 20.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites25.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f645.4
Applied rewrites5.4%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites7.1%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f648.6
Applied rewrites8.6%
if 2.8999999999999998e-65 < C Initial program 10.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites10.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.9
Applied rewrites26.9%
Final simplification14.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= A 3.7e-56)
(/ (sqrt (* (* -16.0 (* (* A A) C)) F)) (- (fma (* C A) -4.0 (* B_m B_m))))
(/
(sqrt (* (* -16.0 (* A A)) (* C F)))
(- (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) {
double tmp;
if (A <= 3.7e-56) {
tmp = sqrt(((-16.0 * ((A * A) * C)) * F)) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = sqrt(((-16.0 * (A * A)) * (C * F))) / -fma(-4.0, (C * A), (B_m * B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= 3.7e-56) tmp = Float64(sqrt(Float64(Float64(-16.0 * Float64(Float64(A * A) * C)) * F)) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(sqrt(Float64(Float64(-16.0 * Float64(A * A)) * Float64(C * F))) / Float64(-fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, 3.7e-56], N[(N[Sqrt[N[(N[(-16.0 * N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(N[(-16.0 * N[(A * A), $MachinePrecision]), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq 3.7 \cdot 10^{-56}:\\
\;\;\;\;\frac{\sqrt{\left(-16 \cdot \left(\left(A \cdot A\right) \cdot C\right)\right) \cdot F}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(-16 \cdot \left(A \cdot A\right)\right) \cdot \left(C \cdot F\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\end{array}
\end{array}
if A < 3.7000000000000002e-56Initial program 20.7%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f649.2
Applied rewrites9.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
lift--.f64N/A
lift-pow.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
Applied rewrites7.5%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.2
Applied rewrites11.2%
if 3.7000000000000002e-56 < A Initial program 7.2%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites9.4%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.2
Applied rewrites4.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 (/ (sqrt (* -8.0 (* A (* C (* F (+ A A)))))) (- (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 * (F * (A + A)))))) / -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(C * Float64(F * Float64(A + A)))))) / Float64(-fma(-4.0, Float64(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[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * 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])\\
\\
\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 16.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites20.5%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f6411.2
Applied rewrites11.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 (/ (sqrt (* (* -16.0 (* A A)) (* C F))) (- (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(((-16.0 * (A * A)) * (C * F))) / -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(-16.0 * Float64(A * A)) * Float64(C * F))) / Float64(-fma(-4.0, Float64(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[(-16.0 * N[(A * A), $MachinePrecision]), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * 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])\\
\\
\frac{\sqrt{\left(-16 \cdot \left(A \cdot A\right)\right) \cdot \left(C \cdot F\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 16.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites20.5%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f648.3
Applied rewrites8.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 (* -16.0 (* A (* (* C C) F)))) (- (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((-16.0 * (A * ((C * C) * F)))) / -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(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(-fma(-4.0, Float64(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[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * 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])\\
\\
\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 16.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites20.5%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6410.1
Applied rewrites10.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ 2.0 (/ 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 / 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 / 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 / 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 / F)))
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(2.0 / 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 / 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[Sqrt[N[(2.0 / 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])\\
\\
\sqrt{\frac{2}{\frac{B\_m}{F}}}
\end{array}
Initial program 16.7%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* 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 16.7%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
herbie shell --seed 2024322
(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))))