
(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 23 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (* 2.0 (* (- (pow B_m 2.0) t_1) F)))
(t_3 (- t_1 (pow B_m 2.0)))
(t_4
(/
(sqrt (* t_2 (- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) t_3)
(if (<= t_4 -1e-202)
(*
(*
(sqrt (* (* F t_0) -2.0))
(sqrt (- (sqrt (fma (- A C) (- A C) (* B_m B_m))) (+ A C))))
(/ -1.0 (fma B_m B_m (* C (* A -4.0)))))
(if (<= t_4 INFINITY)
(/ (sqrt (* t_2 (+ A (fma (/ (* B_m B_m) C) -0.5 A)))) t_3)
(* (/ -2.0 (* B_m (sqrt 2.0))) (sqrt (* F (- A (hypot B_m A))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = 2.0 * ((pow(B_m, 2.0) - t_1) * F);
double t_3 = t_1 - pow(B_m, 2.0);
double t_4 = sqrt((t_2 * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) / t_3;
} else if (t_4 <= -1e-202) {
tmp = (sqrt(((F * t_0) * -2.0)) * sqrt((sqrt(fma((A - C), (A - C), (B_m * B_m))) - (A + C)))) * (-1.0 / fma(B_m, B_m, (C * (A * -4.0))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * (A + fma(((B_m * B_m) / C), -0.5, A)))) / t_3;
} else {
tmp = (-2.0 / (B_m * sqrt(2.0))) * sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) t_3 = Float64(t_1 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(t_2 * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) / t_3); elseif (t_4 <= -1e-202) tmp = Float64(Float64(sqrt(Float64(Float64(F * t_0) * -2.0)) * sqrt(Float64(sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))) - Float64(A + C)))) * Float64(-1.0 / fma(B_m, B_m, Float64(C * Float64(A * -4.0))))); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_2 * Float64(A + fma(Float64(Float64(B_m * B_m) / C), -0.5, A)))) / t_3); else tmp = Float64(Float64(-2.0 / Float64(B_m * sqrt(2.0))) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$2 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -1e-202], N[(N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$2 * N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(-2.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := 2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\\
t_3 := t\_1 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{t\_2 \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\left(\sqrt{\left(F \cdot t\_0\right) \cdot -2} \cdot \sqrt{\sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)} - \left(A + C\right)}\right) \cdot \frac{-1}{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(A + \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right)\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{B\_m \cdot \sqrt{2}} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #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.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6411.5
Applied rewrites11.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
Applied rewrites26.8%
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))) < -1e-202Initial program 97.0%
Applied rewrites95.7%
Applied rewrites98.4%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites22.4%
Applied rewrites22.4%
Final simplification37.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2)))
(if (<= t_3 (- INFINITY))
(/ (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) t_2)
(if (<= t_3 -1e-202)
(*
(*
(sqrt (* (* F t_0) -2.0))
(sqrt (- (sqrt (fma (- A C) (- A C) (* B_m B_m))) (+ A C))))
(/ -1.0 (fma B_m B_m (* C (* A -4.0)))))
(if (<= t_3 INFINITY)
(-
(/
(sqrt (* (+ A (+ A (* (/ (* B_m B_m) C) -0.5))) (* t_0 (* 2.0 F))))
t_0))
(* (/ -2.0 (* B_m (sqrt 2.0))) (sqrt (* F (- A (hypot B_m A))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) / t_2;
} else if (t_3 <= -1e-202) {
tmp = (sqrt(((F * t_0) * -2.0)) * sqrt((sqrt(fma((A - C), (A - C), (B_m * B_m))) - (A + C)))) * (-1.0 / fma(B_m, B_m, (C * (A * -4.0))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = -(sqrt(((A + (A + (((B_m * B_m) / C) * -0.5))) * (t_0 * (2.0 * F)))) / t_0);
} else {
tmp = (-2.0 / (B_m * sqrt(2.0))) * sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) / t_2); elseif (t_3 <= -1e-202) tmp = Float64(Float64(sqrt(Float64(Float64(F * t_0) * -2.0)) * sqrt(Float64(sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))) - Float64(A + C)))) * Float64(-1.0 / fma(B_m, B_m, Float64(C * Float64(A * -4.0))))); elseif (t_3 <= Inf) tmp = Float64(-Float64(sqrt(Float64(Float64(A + Float64(A + Float64(Float64(Float64(B_m * B_m) / C) * -0.5))) * Float64(t_0 * Float64(2.0 * F)))) / t_0)); else tmp = Float64(Float64(-2.0 / Float64(B_m * sqrt(2.0))) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -1e-202], N[(N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], (-N[(N[Sqrt[N[(N[(A + N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(-2.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\left(\sqrt{\left(F \cdot t\_0\right) \cdot -2} \cdot \sqrt{\sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)} - \left(A + C\right)}\right) \cdot \frac{-1}{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{\left(A + \left(A + \frac{B\_m \cdot B\_m}{C} \cdot -0.5\right)\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{B\_m \cdot \sqrt{2}} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #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.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6411.5
Applied rewrites11.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
Applied rewrites26.8%
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))) < -1e-202Initial program 97.0%
Applied rewrites95.7%
Applied rewrites98.4%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites22.4%
Applied rewrites22.4%
Final simplification37.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 (- INFINITY))
(/ (* (sqrt t_0) (sqrt (* (+ A A) (* 2.0 F)))) (- t_0))
(if (<= t_2 -1e-202)
(*
(*
(sqrt (* (* F t_0) -2.0))
(sqrt (- (sqrt (fma (- A C) (- A C) (* B_m B_m))) (+ A C))))
(/ -1.0 (fma B_m B_m (* C (* A -4.0)))))
(if (<= t_2 INFINITY)
(-
(/
(sqrt (* (+ A (+ A (* (/ (* B_m B_m) C) -0.5))) (* t_0 (* 2.0 F))))
t_0))
(* (/ -2.0 (* B_m (sqrt 2.0))) (sqrt (* F (- A (hypot B_m A))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * sqrt(((A + A) * (2.0 * F)))) / -t_0;
} else if (t_2 <= -1e-202) {
tmp = (sqrt(((F * t_0) * -2.0)) * sqrt((sqrt(fma((A - C), (A - C), (B_m * B_m))) - (A + C)))) * (-1.0 / fma(B_m, B_m, (C * (A * -4.0))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = -(sqrt(((A + (A + (((B_m * B_m) / C) * -0.5))) * (t_0 * (2.0 * F)))) / t_0);
} else {
tmp = (-2.0 / (B_m * sqrt(2.0))) * sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(A + A) * Float64(2.0 * F)))) / Float64(-t_0)); elseif (t_2 <= -1e-202) tmp = Float64(Float64(sqrt(Float64(Float64(F * t_0) * -2.0)) * sqrt(Float64(sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))) - Float64(A + C)))) * Float64(-1.0 / fma(B_m, B_m, Float64(C * Float64(A * -4.0))))); elseif (t_2 <= Inf) tmp = Float64(-Float64(sqrt(Float64(Float64(A + Float64(A + Float64(Float64(Float64(B_m * B_m) / C) * -0.5))) * Float64(t_0 * Float64(2.0 * F)))) / t_0)); else tmp = Float64(Float64(-2.0 / Float64(B_m * sqrt(2.0))) * sqrt(Float64(F * Float64(A - hypot(B_m, A))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$2, -1e-202], N[(N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], (-N[(N[Sqrt[N[(N[(A + N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(-2.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{\left(A + A\right) \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\left(\sqrt{\left(F \cdot t\_0\right) \cdot -2} \cdot \sqrt{\sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)} - \left(A + C\right)}\right) \cdot \frac{-1}{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{\left(A + \left(A + \frac{B\_m \cdot B\_m}{C} \cdot -0.5\right)\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{B\_m \cdot \sqrt{2}} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #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.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6411.5
Applied rewrites11.5%
Applied rewrites11.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites26.8%
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))) < -1e-202Initial program 97.0%
Applied rewrites95.7%
Applied rewrites98.4%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites22.4%
Applied rewrites22.4%
Final simplification37.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 (- INFINITY))
(/ (* (sqrt t_0) (sqrt (* (+ A A) (* 2.0 F)))) (- t_0))
(if (<= t_2 -1e-202)
(*
(*
(sqrt (* (* F t_0) -2.0))
(sqrt (- (sqrt (fma (- A C) (- A C) (* B_m B_m))) (+ A C))))
(/ -1.0 (fma B_m B_m (* C (* A -4.0)))))
(if (<= t_2 INFINITY)
(-
(/
(sqrt (* (+ A (+ A (* (/ (* B_m B_m) C) -0.5))) (* t_0 (* 2.0 F))))
t_0))
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * sqrt(((A + A) * (2.0 * F)))) / -t_0;
} else if (t_2 <= -1e-202) {
tmp = (sqrt(((F * t_0) * -2.0)) * sqrt((sqrt(fma((A - C), (A - C), (B_m * B_m))) - (A + C)))) * (-1.0 / fma(B_m, B_m, (C * (A * -4.0))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = -(sqrt(((A + (A + (((B_m * B_m) / C) * -0.5))) * (t_0 * (2.0 * F)))) / t_0);
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(A + A) * Float64(2.0 * F)))) / Float64(-t_0)); elseif (t_2 <= -1e-202) tmp = Float64(Float64(sqrt(Float64(Float64(F * t_0) * -2.0)) * sqrt(Float64(sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))) - Float64(A + C)))) * Float64(-1.0 / fma(B_m, B_m, Float64(C * Float64(A * -4.0))))); elseif (t_2 <= Inf) tmp = Float64(-Float64(sqrt(Float64(Float64(A + Float64(A + Float64(Float64(Float64(B_m * B_m) / C) * -0.5))) * Float64(t_0 * Float64(2.0 * F)))) / t_0)); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$2, -1e-202], N[(N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], (-N[(N[Sqrt[N[(N[(A + N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{\left(A + A\right) \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\left(\sqrt{\left(F \cdot t\_0\right) \cdot -2} \cdot \sqrt{\sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)} - \left(A + C\right)}\right) \cdot \frac{-1}{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{\left(A + \left(A + \frac{B\_m \cdot B\_m}{C} \cdot -0.5\right)\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\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.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6411.5
Applied rewrites11.5%
Applied rewrites11.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites26.8%
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))) < -1e-202Initial program 97.0%
Applied rewrites95.7%
Applied rewrites98.4%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around 0
Applied rewrites16.8%
Final simplification35.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (sqrt t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(/ (* t_1 (sqrt (* (+ A A) (* 2.0 F)))) (- t_0))
(if (<= t_3 -1e-202)
(*
(/ -1.0 (fma B_m B_m (* C (* A -4.0))))
(*
t_1
(sqrt
(* (- (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))) (* 2.0 F)))))
(if (<= t_3 INFINITY)
(-
(/
(sqrt (* (+ A (+ A (* (/ (* B_m B_m) C) -0.5))) (* t_0 (* 2.0 F))))
t_0))
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = sqrt(t_0);
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (t_1 * sqrt(((A + A) * (2.0 * F)))) / -t_0;
} else if (t_3 <= -1e-202) {
tmp = (-1.0 / fma(B_m, B_m, (C * (A * -4.0)))) * (t_1 * sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B_m * B_m)))) * (2.0 * F))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = -(sqrt(((A + (A + (((B_m * B_m) / C) * -0.5))) * (t_0 * (2.0 * F)))) / t_0);
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = sqrt(t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(t_1 * sqrt(Float64(Float64(A + A) * Float64(2.0 * F)))) / Float64(-t_0)); elseif (t_3 <= -1e-202) tmp = Float64(Float64(-1.0 / fma(B_m, B_m, Float64(C * Float64(A * -4.0)))) * Float64(t_1 * sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * Float64(2.0 * F))))); elseif (t_3 <= Inf) tmp = Float64(-Float64(sqrt(Float64(Float64(A + Float64(A + Float64(Float64(Float64(B_m * B_m) / C) * -0.5))) * Float64(t_0 * Float64(2.0 * F)))) / t_0)); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[t$95$0], $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(t$95$1 * N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, -1e-202], N[(N[(-1.0 / N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], (-N[(N[Sqrt[N[(N[(A + N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{t\_0}\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{t\_1 \cdot \sqrt{\left(A + A\right) \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(t\_1 \cdot \sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot \left(2 \cdot F\right)}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{\left(A + \left(A + \frac{B\_m \cdot B\_m}{C} \cdot -0.5\right)\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\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.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6411.5
Applied rewrites11.5%
Applied rewrites11.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites26.8%
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))) < -1e-202Initial program 97.0%
Applied rewrites95.7%
Applied rewrites96.9%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around 0
Applied rewrites16.8%
Final simplification34.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 A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 (- INFINITY))
(/ (* (sqrt t_0) (sqrt (* (+ A A) (* 2.0 F)))) (- t_0))
(if (<= t_2 -1e-202)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))
(* (fma B_m B_m (* C (* A -4.0))) (* 2.0 F))))
(fma B_m (- B_m) (* A (* 4.0 C))))
(if (<= t_2 INFINITY)
(-
(/
(sqrt (* (+ A (+ A (* (/ (* B_m B_m) C) -0.5))) (* t_0 (* 2.0 F))))
t_0))
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * sqrt(((A + A) * (2.0 * F)))) / -t_0;
} else if (t_2 <= -1e-202) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B_m * B_m)))) * (fma(B_m, B_m, (C * (A * -4.0))) * (2.0 * F)))) / fma(B_m, -B_m, (A * (4.0 * C)));
} else if (t_2 <= ((double) INFINITY)) {
tmp = -(sqrt(((A + (A + (((B_m * B_m) / C) * -0.5))) * (t_0 * (2.0 * F)))) / t_0);
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(A + A) * Float64(2.0 * F)))) / Float64(-t_0)); elseif (t_2 <= -1e-202) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))) * Float64(fma(B_m, B_m, Float64(C * Float64(A * -4.0))) * Float64(2.0 * F)))) / fma(B_m, Float64(-B_m), Float64(A * Float64(4.0 * C)))); elseif (t_2 <= Inf) tmp = Float64(-Float64(sqrt(Float64(Float64(A + Float64(A + Float64(Float64(Float64(B_m * B_m) / C) * -0.5))) * Float64(t_0 * Float64(2.0 * F)))) / t_0)); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$2, -1e-202], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], (-N[(N[Sqrt[N[(N[(A + N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{\left(A + A\right) \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right) \cdot \left(\mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right) \cdot \left(2 \cdot F\right)\right)}}{\mathsf{fma}\left(B\_m, -B\_m, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{\left(A + \left(A + \frac{B\_m \cdot B\_m}{C} \cdot -0.5\right)\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\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.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6411.5
Applied rewrites11.5%
Applied rewrites11.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites26.8%
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))) < -1e-202Initial program 97.0%
Applied rewrites95.8%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around 0
Applied rewrites16.8%
Final simplification34.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 A (* C -4.0) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 -2e+33)
(/ (* (sqrt t_0) (sqrt (* (+ A A) (* 2.0 F)))) (- t_0))
(if (<= t_2 -1e-202)
(*
(sqrt (* F (- A (sqrt (fma B_m B_m (* A A))))))
(- (/ (sqrt 2.0) B_m)))
(if (<= t_2 INFINITY)
(-
(/
(sqrt (* (+ A (+ A (* (/ (* B_m B_m) C) -0.5))) (* t_0 (* 2.0 F))))
t_0))
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -2e+33) {
tmp = (sqrt(t_0) * sqrt(((A + A) * (2.0 * F)))) / -t_0;
} else if (t_2 <= -1e-202) {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * A)))))) * -(sqrt(2.0) / B_m);
} else if (t_2 <= ((double) INFINITY)) {
tmp = -(sqrt(((A + (A + (((B_m * B_m) / C) * -0.5))) * (t_0 * (2.0 * F)))) / t_0);
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= -2e+33) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(A + A) * Float64(2.0 * F)))) / Float64(-t_0)); elseif (t_2 <= -1e-202) tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / B_m))); elseif (t_2 <= Inf) tmp = Float64(-Float64(sqrt(Float64(Float64(A + Float64(A + Float64(Float64(Float64(B_m * B_m) / C) * -0.5))) * Float64(t_0 * Float64(2.0 * F)))) / t_0)); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+33], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$2, -1e-202], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], (-N[(N[Sqrt[N[(N[(A + N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+33}:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{\left(A + A\right) \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{\left(A + \left(A + \frac{B\_m \cdot B\_m}{C} \cdot -0.5\right)\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\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))) < -1.9999999999999999e33Initial program 26.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites30.8%
if -1.9999999999999999e33 < (/.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))) < -1e-202Initial program 97.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f644.4
Applied rewrites4.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6436.6
Applied rewrites36.6%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around 0
Applied rewrites16.8%
Final simplification25.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (- t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 -2e+33)
(/ (* (sqrt t_0) (sqrt (* (+ A A) (* 2.0 F)))) t_1)
(if (<= t_3 -1e-202)
(*
(sqrt (* F (- A (sqrt (fma B_m B_m (* A A))))))
(- (/ (sqrt 2.0) B_m)))
(if (<= t_3 INFINITY)
(/ (sqrt (* (+ A A) (* t_0 (* 2.0 F)))) t_1)
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = -t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -2e+33) {
tmp = (sqrt(t_0) * sqrt(((A + A) * (2.0 * F)))) / t_1;
} else if (t_3 <= -1e-202) {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * A)))))) * -(sqrt(2.0) / B_m);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((A + A) * (t_0 * (2.0 * F)))) / t_1;
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(-t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= -2e+33) tmp = Float64(Float64(sqrt(t_0) * sqrt(Float64(Float64(A + A) * Float64(2.0 * F)))) / t_1); elseif (t_3 <= -1e-202) tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / B_m))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(2.0 * F)))) / t_1); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+33], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$3, -1e-202], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+33}:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{\left(A + A\right) \cdot \left(2 \cdot F\right)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\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))) < -1.9999999999999999e33Initial program 26.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites30.8%
if -1.9999999999999999e33 < (/.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))) < -1e-202Initial program 97.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f644.4
Applied rewrites4.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6436.6
Applied rewrites36.6%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around 0
Applied rewrites16.8%
Final simplification25.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m)))
(t_1 (- t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 -2e+33)
(*
(sqrt (fma 2.0 (* B_m B_m) (* (* A C) -8.0)))
(/ (sqrt (* F (+ A A))) t_1))
(if (<= t_3 -1e-202)
(*
(sqrt (* F (- A (sqrt (fma B_m B_m (* A A))))))
(- (/ (sqrt 2.0) B_m)))
(if (<= t_3 INFINITY)
(/ (sqrt (* (+ A A) (* t_0 (* 2.0 F)))) t_1)
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = -t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -2e+33) {
tmp = sqrt(fma(2.0, (B_m * B_m), ((A * C) * -8.0))) * (sqrt((F * (A + A))) / t_1);
} else if (t_3 <= -1e-202) {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * A)))))) * -(sqrt(2.0) / B_m);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((A + A) * (t_0 * (2.0 * F)))) / t_1;
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(-t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= -2e+33) tmp = Float64(sqrt(fma(2.0, Float64(B_m * B_m), Float64(Float64(A * C) * -8.0))) * Float64(sqrt(Float64(F * Float64(A + A))) / t_1)); elseif (t_3 <= -1e-202) tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / B_m))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(2.0 * F)))) / t_1); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+33], N[(N[Sqrt[N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision] + N[(N[(A * C), $MachinePrecision] * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-202], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+33}:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(2, B\_m \cdot B\_m, \left(A \cdot C\right) \cdot -8\right)} \cdot \frac{\sqrt{F \cdot \left(A + A\right)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\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))) < -1.9999999999999999e33Initial program 26.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
Applied rewrites27.9%
if -1.9999999999999999e33 < (/.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))) < -1e-202Initial program 97.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f644.4
Applied rewrites4.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6436.6
Applied rewrites36.6%
if -1e-202 < (/.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 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.3
Applied rewrites28.3%
Applied rewrites28.3%
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%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around 0
Applied rewrites16.8%
Final simplification24.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))) (t_1 (* B_m (sqrt 2.0))))
(if (<= (pow B_m 2.0) 2e-110)
(/ (sqrt (* (+ A A) (* t_0 (* 2.0 F)))) (- t_0))
(if (<= (pow B_m 2.0) 4e+256)
(/ (* -2.0 (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))) t_1)
(* (* -2.0 (/ 1.0 t_1)) (* (sqrt 2.0) (sqrt (* 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(A, (C * -4.0), (B_m * B_m));
double t_1 = B_m * sqrt(2.0);
double tmp;
if (pow(B_m, 2.0) <= 2e-110) {
tmp = sqrt(((A + A) * (t_0 * (2.0 * F)))) / -t_0;
} else if (pow(B_m, 2.0) <= 4e+256) {
tmp = (-2.0 * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m))))))) / t_1;
} else {
tmp = (-2.0 * (1.0 / t_1)) * (sqrt(2.0) * sqrt((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(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = Float64(B_m * sqrt(2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-110) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(2.0 * F)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 4e+256) tmp = Float64(Float64(-2.0 * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m))))))) / t_1); else tmp = Float64(Float64(-2.0 * Float64(1.0 / t_1)) * Float64(sqrt(2.0) * sqrt(Float64(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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-110], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+256], N[(N[(-2.0 * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(-2.0 * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := B\_m \cdot \sqrt{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-110}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+256}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{t\_1}\right) \cdot \left(\sqrt{2} \cdot \sqrt{A \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-110Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Applied rewrites21.8%
Applied rewrites21.8%
if 2.0000000000000001e-110 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000001e256Initial program 42.1%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites39.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6421.8
Applied rewrites21.8%
Applied rewrites21.9%
if 4.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around -inf
Applied rewrites3.8%
Final simplification16.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 (* B_m (sqrt 2.0))))
(if (<= (pow B_m 2.0) 4e-114)
(/
(sqrt (* (+ A A) (* (fma A (* C -4.0) (* B_m B_m)) (* 2.0 F))))
(* 4.0 (* A C)))
(if (<= (pow B_m 2.0) 4e+256)
(/ (* -2.0 (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))) t_0)
(* (* -2.0 (/ 1.0 t_0)) (* (sqrt 2.0) (sqrt (* 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 = B_m * sqrt(2.0);
double tmp;
if (pow(B_m, 2.0) <= 4e-114) {
tmp = sqrt(((A + A) * (fma(A, (C * -4.0), (B_m * B_m)) * (2.0 * F)))) / (4.0 * (A * C));
} else if (pow(B_m, 2.0) <= 4e+256) {
tmp = (-2.0 * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m))))))) / t_0;
} else {
tmp = (-2.0 * (1.0 / t_0)) * (sqrt(2.0) * sqrt((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 * sqrt(2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-114) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(fma(A, Float64(C * -4.0), Float64(B_m * B_m)) * Float64(2.0 * F)))) / Float64(4.0 * Float64(A * C))); elseif ((B_m ^ 2.0) <= 4e+256) tmp = Float64(Float64(-2.0 * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m))))))) / t_0); else tmp = Float64(Float64(-2.0 * Float64(1.0 / t_0)) * Float64(sqrt(2.0) * sqrt(Float64(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[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-114], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+256], N[(N[(-2.0 * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(-2.0 * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(A * F), $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 := B\_m \cdot \sqrt{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-114}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right) \cdot \left(2 \cdot F\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+256}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{t\_0}\right) \cdot \left(\sqrt{2} \cdot \sqrt{A \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e-114Initial program 19.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.4
Applied rewrites20.4%
Applied rewrites20.4%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6420.3
Applied rewrites20.3%
if 4.0000000000000002e-114 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000001e256Initial program 42.4%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites40.2%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6421.3
Applied rewrites21.3%
Applied rewrites21.3%
if 4.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around -inf
Applied rewrites3.8%
Final simplification16.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 4e-114)
(/
(sqrt (* (+ A A) (* (fma A (* C -4.0) (* B_m B_m)) (* 2.0 F))))
(* 4.0 (* A C)))
(if (<= (pow B_m 2.0) 4e+256)
(/
(* -2.0 (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))))
(* B_m (sqrt 2.0)))
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-114) {
tmp = sqrt(((A + A) * (fma(A, (C * -4.0), (B_m * B_m)) * (2.0 * F)))) / (4.0 * (A * C));
} else if (pow(B_m, 2.0) <= 4e+256) {
tmp = (-2.0 * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m))))))) / (B_m * sqrt(2.0));
} else {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-114) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(fma(A, Float64(C * -4.0), Float64(B_m * B_m)) * Float64(2.0 * F)))) / Float64(4.0 * Float64(A * C))); elseif ((B_m ^ 2.0) <= 4e+256) tmp = Float64(Float64(-2.0 * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m))))))) / Float64(B_m * sqrt(2.0))); else tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-114], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+256], N[(N[(-2.0 * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-114}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right) \cdot \left(2 \cdot F\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+256}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{B\_m \cdot \sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000002e-114Initial program 19.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.4
Applied rewrites20.4%
Applied rewrites20.4%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6420.3
Applied rewrites20.3%
if 4.0000000000000002e-114 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000001e256Initial program 42.4%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites40.2%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6421.3
Applied rewrites21.3%
Applied rewrites21.3%
if 4.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around -inf
Applied rewrites3.8%
Final simplification16.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 2e-110)
(/
(sqrt (* (+ A A) (* (fma A (* C -4.0) (* B_m B_m)) (* 2.0 F))))
(* 4.0 (* A C)))
(if (<= (pow B_m 2.0) 4e+256)
(* (sqrt (* F (- A (sqrt (fma B_m B_m (* A A)))))) (- (/ (sqrt 2.0) B_m)))
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-110) {
tmp = sqrt(((A + A) * (fma(A, (C * -4.0), (B_m * B_m)) * (2.0 * F)))) / (4.0 * (A * C));
} else if (pow(B_m, 2.0) <= 4e+256) {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * A)))))) * -(sqrt(2.0) / B_m);
} else {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-110) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(fma(A, Float64(C * -4.0), Float64(B_m * B_m)) * Float64(2.0 * F)))) / Float64(4.0 * Float64(A * C))); elseif ((B_m ^ 2.0) <= 4e+256) tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / B_m))); else tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-110], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+256], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-110}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right) \cdot \left(2 \cdot F\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+256}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-110Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Applied rewrites21.8%
Applied rewrites21.8%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6420.8
Applied rewrites20.8%
if 2.0000000000000001e-110 < (pow.f64 B #s(literal 2 binary64)) < 4.0000000000000001e256Initial program 42.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6410.6
Applied rewrites10.6%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6421.9
Applied rewrites21.9%
if 4.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in A around -inf
Applied rewrites3.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 A (* C -4.0) (* B_m B_m)) (* 2.0 F))))
(if (<= (pow B_m 2.0) 2e-101)
(/ (sqrt (* (+ A A) t_0)) (* 4.0 (* A C)))
(if (<= (pow B_m 2.0) 2e+256)
(/ (sqrt (* t_0 (- B_m))) (* B_m (- B_m)))
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m)) * (2.0 * F);
double tmp;
if (pow(B_m, 2.0) <= 2e-101) {
tmp = sqrt(((A + A) * t_0)) / (4.0 * (A * C));
} else if (pow(B_m, 2.0) <= 2e+256) {
tmp = sqrt((t_0 * -B_m)) / (B_m * -B_m);
} else {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(fma(A, Float64(C * -4.0), Float64(B_m * B_m)) * Float64(2.0 * F)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-101) tmp = Float64(sqrt(Float64(Float64(A + A) * t_0)) / Float64(4.0 * Float64(A * C))); elseif ((B_m ^ 2.0) <= 2e+256) tmp = Float64(sqrt(Float64(t_0 * Float64(-B_m))) / Float64(B_m * Float64(-B_m))); else tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-101], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+256], N[(N[Sqrt[N[(t$95$0 * (-B$95$m)), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right) \cdot \left(2 \cdot F\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-101}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_0}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+256}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(-B\_m\right)}}{B\_m \cdot \left(-B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-101Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Applied rewrites21.8%
Applied rewrites21.8%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6420.5
Applied rewrites20.5%
if 2.0000000000000001e-101 < (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e256Initial program 43.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6410.5
Applied rewrites10.5%
Applied rewrites10.5%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f643.8
Applied rewrites3.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6414.5
Applied rewrites14.5%
if 2.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.4%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f643.2
Applied rewrites3.2%
Applied rewrites3.2%
Taylor expanded in A around -inf
Applied rewrites3.9%
Final simplification14.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-101)
(/ (sqrt (* (* A -8.0) (* (* C F) (+ A A)))) (- t_0))
(if (<= (pow B_m 2.0) 2e+256)
(/ (sqrt (* (* t_0 (* 2.0 F)) (- B_m))) (* B_m (- B_m)))
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-101) {
tmp = sqrt(((A * -8.0) * ((C * F) * (A + A)))) / -t_0;
} else if (pow(B_m, 2.0) <= 2e+256) {
tmp = sqrt(((t_0 * (2.0 * F)) * -B_m)) / (B_m * -B_m);
} else {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-101) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(Float64(C * F) * Float64(A + A)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 2e+256) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(-B_m))) / Float64(B_m * Float64(-B_m))); else tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-101], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(N[(C * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+256], N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * (-B$95$m)), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-101}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+256}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(-B\_m\right)}}{B\_m \cdot \left(-B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-101Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Applied rewrites21.8%
Applied rewrites21.8%
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
lower--.f64N/A
mul-1-negN/A
lower-neg.f6418.0
Applied rewrites18.0%
if 2.0000000000000001e-101 < (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e256Initial program 43.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6410.5
Applied rewrites10.5%
Applied rewrites10.5%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f643.8
Applied rewrites3.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6414.5
Applied rewrites14.5%
if 2.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.4%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f643.2
Applied rewrites3.2%
Applied rewrites3.2%
Taylor expanded in A around -inf
Applied rewrites3.9%
Final simplification13.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-101)
(/ (sqrt (* -16.0 (* F (* C (* A A))))) (- t_0))
(if (<= (pow B_m 2.0) 2e+256)
(/ (sqrt (* (* t_0 (* 2.0 F)) (- B_m))) (* B_m (- B_m)))
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-101) {
tmp = sqrt((-16.0 * (F * (C * (A * A))))) / -t_0;
} else if (pow(B_m, 2.0) <= 2e+256) {
tmp = sqrt(((t_0 * (2.0 * F)) * -B_m)) / (B_m * -B_m);
} else {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-101) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 2e+256) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(-B_m))) / Float64(B_m * Float64(-B_m))); else tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-101], N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+256], N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * (-B$95$m)), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-101}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+256}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(-B\_m\right)}}{B\_m \cdot \left(-B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-101Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Applied rewrites21.8%
Applied rewrites21.8%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.8
Applied rewrites14.8%
if 2.0000000000000001e-101 < (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e256Initial program 43.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6410.5
Applied rewrites10.5%
Applied rewrites10.5%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f643.8
Applied rewrites3.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6414.5
Applied rewrites14.5%
if 2.0000000000000001e256 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.4%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f643.2
Applied rewrites3.2%
Applied rewrites3.2%
Taylor expanded in A around -inf
Applied rewrites3.9%
Final simplification11.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-101)
(/ (sqrt (* -16.0 (* F (* C (* A A))))) (- (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e+192)
(/ (sqrt (* -2.0 (* F (* B_m (* B_m B_m))))) (* B_m (- B_m)))
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-101) {
tmp = sqrt((-16.0 * (F * (C * (A * A))))) / -fma(A, (C * -4.0), (B_m * B_m));
} else if (pow(B_m, 2.0) <= 2e+192) {
tmp = sqrt((-2.0 * (F * (B_m * (B_m * B_m))))) / (B_m * -B_m);
} else {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-101) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m)))); elseif ((B_m ^ 2.0) <= 2e+192) tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B_m * Float64(B_m * B_m))))) / Float64(B_m * Float64(-B_m))); else tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-101], N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+192], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B$95$m * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-101}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{-\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+192}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B\_m \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{B\_m \cdot \left(-B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-101Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Applied rewrites21.8%
Applied rewrites21.8%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.8
Applied rewrites14.8%
if 2.0000000000000001e-101 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000008e192Initial program 40.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.2
Applied rewrites12.2%
Applied rewrites12.2%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f644.0
Applied rewrites4.0%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.7
Applied rewrites14.7%
if 2.00000000000000008e192 < (pow.f64 B #s(literal 2 binary64)) Initial program 8.8%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites8.3%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f646.6
Applied rewrites6.6%
Applied rewrites6.6%
Taylor expanded in A around -inf
Applied rewrites4.2%
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
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-76)
(/ (sqrt (* (+ A A) (* t_0 (* 2.0 F)))) (- t_0))
(*
(* -2.0 (/ 1.0 (* B_m (sqrt 2.0))))
(sqrt (* F (- A (fma 0.5 (/ (* A 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 t_0 = fma(A, (C * -4.0), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-76) {
tmp = sqrt(((A + A) * (t_0 * (2.0 * F)))) / -t_0;
} else {
tmp = (-2.0 * (1.0 / (B_m * sqrt(2.0)))) * sqrt((F * (A - fma(0.5, ((A * 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) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-76) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(2.0 * F)))) / Float64(-t_0)); else tmp = Float64(Float64(-2.0 * Float64(1.0 / Float64(B_m * sqrt(2.0)))) * sqrt(Float64(F * Float64(A - fma(0.5, Float64(Float64(A * A) / 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_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-76], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(-2.0 * N[(1.0 / N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[(0.5 * N[(N[(A * A), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-76}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(-2 \cdot \frac{1}{B\_m \cdot \sqrt{2}}\right) \cdot \sqrt{F \cdot \left(A - \mathsf{fma}\left(0.5, \frac{A \cdot A}{B\_m}, B\_m\right)\right)}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999985e-76Initial program 21.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Applied rewrites21.3%
Applied rewrites21.3%
if 1.99999999999999985e-76 < (pow.f64 B #s(literal 2 binary64)) Initial program 20.7%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites19.4%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6412.1
Applied rewrites12.1%
Applied rewrites12.0%
Taylor expanded in A around 0
Applied rewrites22.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 A (* C -4.0) (* B_m B_m))))
(t_1 (/ (sqrt (* -16.0 (* F (* C (* A A))))) t_0)))
(if (<= A -7.4e+153)
(* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m)))
(if (<= A -2.35e-116)
t_1
(if (<= A 5.3e-124)
(/ (sqrt (* -2.0 (* F (* B_m (* B_m B_m))))) 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(A, (C * -4.0), (B_m * B_m));
double t_1 = sqrt((-16.0 * (F * (C * (A * A))))) / t_0;
double tmp;
if (A <= -7.4e+153) {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
} else if (A <= -2.35e-116) {
tmp = t_1;
} else if (A <= 5.3e-124) {
tmp = sqrt((-2.0 * (F * (B_m * (B_m * B_m))))) / t_0;
} else {
tmp = 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 = Float64(-fma(A, Float64(C * -4.0), Float64(B_m * B_m))) t_1 = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / t_0) tmp = 0.0 if (A <= -7.4e+153) tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); elseif (A <= -2.35e-116) tmp = t_1; elseif (A <= 5.3e-124) tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B_m * Float64(B_m * B_m))))) / t_0); else tmp = 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])}, Block[{t$95$1 = N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[A, -7.4e+153], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, -2.35e-116], t$95$1, If[LessEqual[A, 5.3e-124], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B$95$m * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_0}\\
\mathbf{if}\;A \leq -7.4 \cdot 10^{+153}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\mathbf{elif}\;A \leq -2.35 \cdot 10^{-116}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;A \leq 5.3 \cdot 10^{-124}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B\_m \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if A < -7.4000000000000005e153Initial program 1.3%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.7
Applied rewrites1.7%
Applied rewrites1.7%
Taylor expanded in A around -inf
Applied rewrites7.3%
if -7.4000000000000005e153 < A < -2.34999999999999997e-116 or 5.2999999999999997e-124 < A Initial program 18.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6413.6
Applied rewrites13.6%
Applied rewrites13.6%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6413.1
Applied rewrites13.1%
if -2.34999999999999997e-116 < A < 5.2999999999999997e-124Initial program 36.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.5
Applied rewrites8.5%
Applied rewrites8.5%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f649.8
Applied rewrites9.8%
Final simplification11.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 (<= A -3.2e-115) (* 2.0 (* (sqrt (* A F)) (/ -1.0 B_m))) (/ (sqrt (* -2.0 (* F (* B_m (* B_m B_m))))) (* 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.2e-115) {
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
} else {
tmp = sqrt((-2.0 * (F * (B_m * (B_m * B_m))))) / (B_m * -B_m);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-3.2d-115)) then
tmp = 2.0d0 * (sqrt((a * f)) * ((-1.0d0) / b_m))
else
tmp = sqrt(((-2.0d0) * (f * (b_m * (b_m * b_m))))) / (b_m * -b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -3.2e-115) {
tmp = 2.0 * (Math.sqrt((A * F)) * (-1.0 / B_m));
} else {
tmp = Math.sqrt((-2.0 * (F * (B_m * (B_m * B_m))))) / (B_m * -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -3.2e-115: tmp = 2.0 * (math.sqrt((A * F)) * (-1.0 / B_m)) else: tmp = math.sqrt((-2.0 * (F * (B_m * (B_m * B_m))))) / (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.2e-115) tmp = Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.0 / B_m))); else tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B_m * Float64(B_m * B_m))))) / Float64(B_m * Float64(-B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (A <= -3.2e-115)
tmp = 2.0 * (sqrt((A * F)) * (-1.0 / B_m));
else
tmp = sqrt((-2.0 * (F * (B_m * (B_m * B_m))))) / (B_m * -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -3.2e-115], N[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B$95$m * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B$95$m * (-B$95$m)), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -3.2 \cdot 10^{-115}:\\
\;\;\;\;2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B\_m \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{B\_m \cdot \left(-B\_m\right)}\\
\end{array}
\end{array}
if A < -3.2e-115Initial program 19.3%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites18.1%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f646.1
Applied rewrites6.1%
Applied rewrites6.1%
Taylor expanded in A around -inf
Applied rewrites5.6%
if -3.2e-115 < A Initial program 21.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f646.2
Applied rewrites6.2%
Applied rewrites6.2%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f641.0
Applied rewrites1.0%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f645.8
Applied rewrites5.8%
Final simplification5.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 (* 2.0 (* (sqrt (* A F)) (/ -1.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 2.0 * (sqrt((A * F)) * (-1.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 = 2.0d0 * (sqrt((a * f)) * ((-1.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 2.0 * (Math.sqrt((A * F)) * (-1.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 2.0 * (math.sqrt((A * F)) * (-1.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(2.0 * Float64(sqrt(Float64(A * F)) * Float64(-1.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 = 2.0 * (sqrt((A * F)) * (-1.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[(2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-1.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])\\
\\
2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{-1}{B\_m}\right)
\end{array}
Initial program 20.9%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites19.3%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f648.9
Applied rewrites8.9%
Applied rewrites8.7%
Taylor expanded in A around -inf
Applied rewrites2.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 (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 20.9%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Applied rewrites1.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 (sqrt (* 2.0 (/ F B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(2.0 * Float64(F / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.9%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Final simplification1.8%
herbie shell --seed 2024222
(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))))