
(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 20 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 (fma B_m B_m (* -4.0 (* A C))))
(t_2 (- (sqrt (* 2.0 F))))
(t_3 (/ (sqrt (* 2.0 C)) t_0))
(t_4 (* (* 4.0 A) C))
(t_5 (- t_4 (pow B_m 2.0)))
(t_6
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_4) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_5)))
(if (<= t_6 -1e+203)
(* t_3 (* (sqrt t_1) t_2))
(if (<= t_6 -1e-204)
(/
(sqrt
(*
(* t_0 (* 2.0 F))
(+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
(- t_0))
(if (<= t_6 0.0)
(/
(*
(sqrt (* (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)) (* 2.0 t_1)))
(sqrt F))
t_5)
(if (<= t_6 INFINITY)
(* t_3 (* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) t_2)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_2 = -sqrt((2.0 * F));
double t_3 = sqrt((2.0 * C)) / t_0;
double t_4 = (4.0 * A) * C;
double t_5 = t_4 - pow(B_m, 2.0);
double t_6 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_4) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_5;
double tmp;
if (t_6 <= -1e+203) {
tmp = t_3 * (sqrt(t_1) * t_2);
} else if (t_6 <= -1e-204) {
tmp = sqrt(((t_0 * (2.0 * F)) * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / -t_0;
} else if (t_6 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), (2.0 * C)) * (2.0 * t_1))) * sqrt(F)) / t_5;
} else if (t_6 <= ((double) INFINITY)) {
tmp = t_3 * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * t_2;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_2 = Float64(-sqrt(Float64(2.0 * F))) t_3 = Float64(sqrt(Float64(2.0 * C)) / t_0) t_4 = Float64(Float64(4.0 * A) * C) t_5 = Float64(t_4 - (B_m ^ 2.0)) t_6 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_4) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_5) tmp = 0.0 if (t_6 <= -1e+203) tmp = Float64(t_3 * Float64(sqrt(t_1) * t_2)); elseif (t_6 <= -1e-204) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / Float64(-t_0)); elseif (t_6 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C)) * Float64(2.0 * t_1))) * sqrt(F)) / t_5); elseif (t_6 <= Inf) tmp = Float64(t_3 * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * t_2); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])}, Block[{t$95$3 = N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$4), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(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$5), $MachinePrecision]}, If[LessEqual[t$95$6, -1e+203], N[(t$95$3 * N[(N[Sqrt[t$95$1], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, -1e-204], N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$6, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(t$95$3 * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_2 := -\sqrt{2 \cdot F}\\
t_3 := \frac{\sqrt{2 \cdot C}}{t\_0}\\
t_4 := \left(4 \cdot A\right) \cdot C\\
t_5 := t\_4 - {B\_m}^{2}\\
t_6 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_4\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_5}\\
\mathbf{if}\;t\_6 \leq -1 \cdot 10^{+203}:\\
\;\;\;\;t\_3 \cdot \left(\sqrt{t\_1} \cdot t\_2\right)\\
\mathbf{elif}\;t\_6 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}}{-t\_0}\\
\mathbf{elif}\;t\_6 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right) \cdot \left(2 \cdot t\_1\right)} \cdot \sqrt{F}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;t\_3 \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot t\_2\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999999e202Initial program 4.5%
Taylor expanded in A around -inf
lower-*.f6422.6
Applied rewrites22.6%
Applied rewrites28.4%
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites37.2%
if -9.9999999999999999e202 < (/.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-204Initial program 96.5%
Applied rewrites96.3%
Applied rewrites96.5%
if -1e-204 < (/.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))) < -0.0Initial program 3.4%
Applied rewrites15.7%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6445.9
Applied rewrites45.9%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification40.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 (fma B_m B_m (* -4.0 (* A C))))
(t_2 (- (sqrt (* 2.0 F))))
(t_3 (/ (sqrt (* 2.0 C)) t_0))
(t_4 (* (* 4.0 A) C))
(t_5
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_4) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_4 (pow B_m 2.0)))))
(if (<= t_5 -1e+203)
(* t_3 (* (sqrt t_1) t_2))
(if (<= t_5 -1e-204)
(/
(sqrt
(*
(* t_0 (* 2.0 F))
(+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
(- t_0))
(if (<= t_5 0.0)
(*
(/ (sqrt F) -1.0)
(/ (sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m)))))) t_1))
(if (<= t_5 INFINITY)
(* t_3 (* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) t_2)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B_m * B_m));
double t_1 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_2 = -sqrt((2.0 * F));
double t_3 = sqrt((2.0 * C)) / t_0;
double t_4 = (4.0 * A) * C;
double t_5 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_4) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_4 - pow(B_m, 2.0));
double tmp;
if (t_5 <= -1e+203) {
tmp = t_3 * (sqrt(t_1) * t_2);
} else if (t_5 <= -1e-204) {
tmp = sqrt(((t_0 * (2.0 * F)) * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / -t_0;
} else if (t_5 <= 0.0) {
tmp = (sqrt(F) / -1.0) * (sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) / t_1);
} else if (t_5 <= ((double) INFINITY)) {
tmp = t_3 * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * t_2;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B_m * B_m)) t_1 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_2 = Float64(-sqrt(Float64(2.0 * F))) t_3 = Float64(sqrt(Float64(2.0 * C)) / t_0) t_4 = Float64(Float64(4.0 * A) * C) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_4) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_4 - (B_m ^ 2.0))) tmp = 0.0 if (t_5 <= -1e+203) tmp = Float64(t_3 * Float64(sqrt(t_1) * t_2)); elseif (t_5 <= -1e-204) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / Float64(-t_0)); elseif (t_5 <= 0.0) tmp = Float64(Float64(sqrt(F) / -1.0) * Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) / t_1)); elseif (t_5 <= Inf) tmp = Float64(t_3 * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * t_2); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])}, Block[{t$95$3 = N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$4), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(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$4 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, -1e+203], N[(t$95$3 * N[(N[Sqrt[t$95$1], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, -1e-204], N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(t$95$3 * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_2 := -\sqrt{2 \cdot F}\\
t_3 := \frac{\sqrt{2 \cdot C}}{t\_0}\\
t_4 := \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_4\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_4 - {B\_m}^{2}}\\
\mathbf{if}\;t\_5 \leq -1 \cdot 10^{+203}:\\
\;\;\;\;t\_3 \cdot \left(\sqrt{t\_1} \cdot t\_2\right)\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}}{-t\_0}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\frac{\sqrt{F}}{-1} \cdot \frac{\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;t\_3 \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot t\_2\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999999e202Initial program 4.5%
Taylor expanded in A around -inf
lower-*.f6422.6
Applied rewrites22.6%
Applied rewrites28.4%
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites37.2%
if -9.9999999999999999e202 < (/.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-204Initial program 96.5%
Applied rewrites96.3%
Applied rewrites96.5%
if -1e-204 < (/.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))) < -0.0Initial program 3.4%
Taylor expanded in A around -inf
lower-*.f6428.0
Applied rewrites28.0%
Applied rewrites35.7%
Applied rewrites35.8%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification39.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (- (sqrt (* 2.0 F))))
(t_2 (/ (sqrt (* 2.0 C)) (fma A (* C -4.0) (* B_m B_m))))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 -2e+162)
(* t_2 (* (sqrt t_0) t_1))
(if (<= t_4 -5e-153)
(*
(sqrt
(/ (* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))) t_0))
(- (sqrt 2.0)))
(if (<= t_4 0.0)
(*
(/ (sqrt F) -1.0)
(/ (sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m)))))) t_0))
(if (<= t_4 INFINITY)
(* t_2 (* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) t_1)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = -sqrt((2.0 * F));
double t_2 = sqrt((2.0 * C)) / fma(A, (C * -4.0), (B_m * B_m));
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= -2e+162) {
tmp = t_2 * (sqrt(t_0) * t_1);
} else if (t_4 <= -5e-153) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / t_0)) * -sqrt(2.0);
} else if (t_4 <= 0.0) {
tmp = (sqrt(F) / -1.0) * (sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) / t_0);
} else if (t_4 <= ((double) INFINITY)) {
tmp = t_2 * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * t_1;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = Float64(-sqrt(Float64(2.0 * F))) t_2 = Float64(sqrt(Float64(2.0 * C)) / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= -2e+162) tmp = Float64(t_2 * Float64(sqrt(t_0) * t_1)); elseif (t_4 <= -5e-153) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / t_0)) * Float64(-sqrt(2.0))); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(F) / -1.0) * Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) / t_0)); elseif (t_4 <= Inf) tmp = Float64(t_2 * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * t_1); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])}, Block[{t$95$2 = N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $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$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+162], N[(t$95$2 * N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -5e-153], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(t$95$2 * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := -\sqrt{2 \cdot F}\\
t_2 := \frac{\sqrt{2 \cdot C}}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+162}:\\
\;\;\;\;t\_2 \cdot \left(\sqrt{t\_0} \cdot t\_1\right)\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-153}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{F}}{-1} \cdot \frac{\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{t\_0}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;t\_2 \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot t\_1\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.9999999999999999e162Initial program 8.7%
Taylor expanded in A around -inf
lower-*.f6423.2
Applied rewrites23.2%
Applied rewrites28.7%
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites37.1%
if -1.9999999999999999e162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000033e-153Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites99.1%
if -5.00000000000000033e-153 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 8.2%
Taylor expanded in A around -inf
lower-*.f6428.4
Applied rewrites28.4%
Applied rewrites35.7%
Applied rewrites35.8%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification38.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (/ (sqrt (* 2.0 C)) (fma A (* C -4.0) (* B_m B_m))))
(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+162)
(* t_1 (* (sqrt (fma 2.0 (* B_m B_m) (* (* A C) -8.0))) (- (sqrt F))))
(if (<= t_3 -5e-153)
(*
(sqrt
(/ (* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))) t_0))
(- (sqrt 2.0)))
(if (<= t_3 0.0)
(*
(/ (sqrt F) -1.0)
(/ (sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m)))))) t_0))
(if (<= t_3 INFINITY)
(* t_1 (* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = sqrt((2.0 * C)) / fma(A, (C * -4.0), (B_m * B_m));
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+162) {
tmp = t_1 * (sqrt(fma(2.0, (B_m * B_m), ((A * C) * -8.0))) * -sqrt(F));
} else if (t_3 <= -5e-153) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / t_0)) * -sqrt(2.0);
} else if (t_3 <= 0.0) {
tmp = (sqrt(F) / -1.0) * (sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_1 * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = Float64(sqrt(Float64(2.0 * C)) / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) 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+162) tmp = Float64(t_1 * Float64(sqrt(fma(2.0, Float64(B_m * B_m), Float64(Float64(A * C) * -8.0))) * Float64(-sqrt(F)))); elseif (t_3 <= -5e-153) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / t_0)) * Float64(-sqrt(2.0))); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(F) / -1.0) * Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) / t_0)); elseif (t_3 <= Inf) tmp = Float64(t_1 * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $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, -2e+162], N[(t$95$1 * 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[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-153], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(t$95$1 * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \frac{\sqrt{2 \cdot C}}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
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^{+162}:\\
\;\;\;\;t\_1 \cdot \left(\sqrt{\mathsf{fma}\left(2, B\_m \cdot B\_m, \left(A \cdot C\right) \cdot -8\right)} \cdot \left(-\sqrt{F}\right)\right)\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-153}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{F}}{-1} \cdot \frac{\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_1 \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.9999999999999999e162Initial program 8.7%
Taylor expanded in A around -inf
lower-*.f6423.2
Applied rewrites23.2%
Applied rewrites28.7%
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
associate-*r*N/A
Applied rewrites37.0%
if -1.9999999999999999e162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000033e-153Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites99.1%
if -5.00000000000000033e-153 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 8.2%
Taylor expanded in A around -inf
lower-*.f6428.4
Applied rewrites28.4%
Applied rewrites35.7%
Applied rewrites35.8%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification37.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 B_m B_m (* -4.0 (* A C))))
(t_1 (sqrt (* 2.0 C)))
(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+162)
(* t_1 (/ (sqrt (* t_0 (* 2.0 F))) (- t_0)))
(if (<= t_3 -5e-153)
(*
(sqrt
(/ (* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))) t_0))
(- (sqrt 2.0)))
(if (<= t_3 0.0)
(*
(/ (sqrt F) -1.0)
(/ (sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m)))))) t_0))
(if (<= t_3 INFINITY)
(*
(/ t_1 (fma A (* C -4.0) (* B_m B_m)))
(* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = sqrt((2.0 * C));
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+162) {
tmp = t_1 * (sqrt((t_0 * (2.0 * F))) / -t_0);
} else if (t_3 <= -5e-153) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / t_0)) * -sqrt(2.0);
} else if (t_3 <= 0.0) {
tmp = (sqrt(F) / -1.0) * (sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (t_1 / fma(A, (C * -4.0), (B_m * B_m))) * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = sqrt(Float64(2.0 * C)) 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+162) tmp = Float64(t_1 * Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) / Float64(-t_0))); elseif (t_3 <= -5e-153) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / t_0)) * Float64(-sqrt(2.0))); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(F) / -1.0) * Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) / t_0)); elseif (t_3 <= Inf) tmp = Float64(Float64(t_1 / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * C), $MachinePrecision]], $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, -2e+162], N[(t$95$1 * N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-153], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(t$95$1 / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \sqrt{2 \cdot C}\\
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^{+162}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{t\_0 \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-153}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{F}}{-1} \cdot \frac{\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{t\_1}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.9999999999999999e162Initial program 8.7%
Taylor expanded in A around -inf
lower-*.f6423.2
Applied rewrites23.2%
Applied rewrites28.7%
Applied rewrites28.8%
if -1.9999999999999999e162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000033e-153Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites99.1%
if -5.00000000000000033e-153 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 8.2%
Taylor expanded in A around -inf
lower-*.f6428.4
Applied rewrites28.4%
Applied rewrites35.7%
Applied rewrites35.8%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification35.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (sqrt (* 2.0 C)))
(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+162)
(* t_1 (/ (sqrt (* t_0 (* 2.0 F))) (- t_0)))
(if (<= t_3 -5e-153)
(*
(sqrt
(/ (* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C)))))) t_0))
(- (sqrt 2.0)))
(if (<= t_3 0.0)
(*
(sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m))))))
(/ (- (sqrt F)) t_0))
(if (<= t_3 INFINITY)
(*
(/ t_1 (fma A (* C -4.0) (* B_m B_m)))
(* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = sqrt((2.0 * C));
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+162) {
tmp = t_1 * (sqrt((t_0 * (2.0 * F))) / -t_0);
} else if (t_3 <= -5e-153) {
tmp = sqrt(((F * ((A + C) + sqrt(fma(B_m, B_m, ((A - C) * (A - C)))))) / t_0)) * -sqrt(2.0);
} else if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) * (-sqrt(F) / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (t_1 / fma(A, (C * -4.0), (B_m * B_m))) * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = sqrt(Float64(2.0 * C)) 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+162) tmp = Float64(t_1 * Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) / Float64(-t_0))); elseif (t_3 <= -5e-153) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C)))))) / t_0)) * Float64(-sqrt(2.0))); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) * Float64(Float64(-sqrt(F)) / t_0)); elseif (t_3 <= Inf) tmp = Float64(Float64(t_1 / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * C), $MachinePrecision]], $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, -2e+162], N[(t$95$1 * N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-153], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(t$95$1 / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \sqrt{2 \cdot C}\\
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^{+162}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{t\_0 \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-153}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{t\_1}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.9999999999999999e162Initial program 8.7%
Taylor expanded in A around -inf
lower-*.f6423.2
Applied rewrites23.2%
Applied rewrites28.7%
Applied rewrites28.8%
if -1.9999999999999999e162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000033e-153Initial program 99.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites99.1%
if -5.00000000000000033e-153 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 8.2%
Taylor expanded in A around -inf
lower-*.f6428.4
Applied rewrites28.4%
Applied rewrites35.7%
Applied rewrites35.7%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification35.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (sqrt (* 2.0 C)))
(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))))
(t_4 (sqrt (* 2.0 F))))
(if (<= t_3 -1e+154)
(* t_1 (/ (sqrt (* t_0 (* 2.0 F))) (- t_0)))
(if (<= t_3 -1e-204)
(/ (* (* t_4 (- B_m)) (sqrt (+ C (sqrt (fma B_m B_m (* C C)))))) t_0)
(if (<= t_3 0.0)
(*
(sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m))))))
(/ (- (sqrt F)) t_0))
(if (<= t_3 INFINITY)
(*
(/ t_1 (fma A (* C -4.0) (* B_m B_m)))
(* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- t_4))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = sqrt((2.0 * C));
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 t_4 = sqrt((2.0 * F));
double tmp;
if (t_3 <= -1e+154) {
tmp = t_1 * (sqrt((t_0 * (2.0 * F))) / -t_0);
} else if (t_3 <= -1e-204) {
tmp = ((t_4 * -B_m) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))))) / t_0;
} else if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) * (-sqrt(F) / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (t_1 / fma(A, (C * -4.0), (B_m * B_m))) * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -t_4;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = sqrt(Float64(2.0 * C)) 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))) t_4 = sqrt(Float64(2.0 * F)) tmp = 0.0 if (t_3 <= -1e+154) tmp = Float64(t_1 * Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) / Float64(-t_0))); elseif (t_3 <= -1e-204) tmp = Float64(Float64(Float64(t_4 * Float64(-B_m)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) / t_0); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) * Float64(Float64(-sqrt(F)) / t_0)); elseif (t_3 <= Inf) tmp = Float64(Float64(t_1 / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-t_4)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * C), $MachinePrecision]], $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]}, Block[{t$95$4 = N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, -1e+154], N[(t$95$1 * N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-204], N[(N[(N[(t$95$4 * (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(t$95$1 / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-t$95$4)), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \sqrt{2 \cdot C}\\
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}}\\
t_4 := \sqrt{2 \cdot F}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+154}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{t\_0 \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;\frac{\left(t\_4 \cdot \left(-B\_m\right)\right) \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{t\_1}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-t\_4\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.00000000000000004e154Initial program 10.0%
Taylor expanded in A around -inf
lower-*.f6422.8
Applied rewrites22.8%
Applied rewrites28.3%
Applied rewrites28.4%
if -1.00000000000000004e154 < (/.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-204Initial program 96.0%
Applied rewrites95.8%
Taylor expanded in A around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6487.9
Applied rewrites87.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-*.f64N/A
rem-square-sqrtN/A
unpow2N/A
lower-sqrt.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-sqrt.f6446.5
Applied rewrites46.5%
Applied rewrites46.5%
if -1e-204 < (/.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))) < -0.0Initial program 3.4%
Taylor expanded in A around -inf
lower-*.f6428.0
Applied rewrites28.0%
Applied rewrites35.7%
Applied rewrites35.8%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification30.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (sqrt (* 2.0 C)))
(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 -1e+154)
(* t_1 (/ (sqrt (* t_0 (* 2.0 F))) (- t_0)))
(if (<= t_3 -1e-204)
(-
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) B_m))
(if (<= t_3 0.0)
(*
(sqrt (* 2.0 (* C (fma -8.0 (* A C) (* 2.0 (* B_m B_m))))))
(/ (- (sqrt F)) t_0))
(if (<= t_3 INFINITY)
(*
(/ t_1 (fma A (* C -4.0) (* B_m B_m)))
(* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = sqrt((2.0 * C));
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 <= -1e+154) {
tmp = t_1 * (sqrt((t_0 * (2.0 * F))) / -t_0);
} else if (t_3 <= -1e-204) {
tmp = -((sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / B_m);
} else if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (C * fma(-8.0, (A * C), (2.0 * (B_m * B_m)))))) * (-sqrt(F) / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (t_1 / fma(A, (C * -4.0), (B_m * B_m))) * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = sqrt(Float64(2.0 * C)) 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 <= -1e+154) tmp = Float64(t_1 * Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) / Float64(-t_0))); elseif (t_3 <= -1e-204) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / B_m)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * Float64(C * fma(-8.0, Float64(A * C), Float64(2.0 * Float64(B_m * B_m)))))) * Float64(Float64(-sqrt(F)) / t_0)); elseif (t_3 <= Inf) tmp = Float64(Float64(t_1 / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * C), $MachinePrecision]], $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, -1e+154], N[(t$95$1 * N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-204], (-N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]), If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(2.0 * N[(C * N[(-8.0 * N[(A * C), $MachinePrecision] + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(t$95$1 / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \sqrt{2 \cdot C}\\
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 -1 \cdot 10^{+154}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{t\_0 \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(C \cdot \mathsf{fma}\left(-8, A \cdot C, 2 \cdot \left(B\_m \cdot B\_m\right)\right)\right)} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{t\_1}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000004e154Initial program 10.0%
Taylor expanded in A around -inf
lower-*.f6422.8
Applied rewrites22.8%
Applied rewrites28.3%
Applied rewrites28.4%
if -1.00000000000000004e154 < (/.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-204Initial program 96.0%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites46.3%
if -1e-204 < (/.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))) < -0.0Initial program 3.4%
Taylor expanded in A around -inf
lower-*.f6428.0
Applied rewrites28.0%
Applied rewrites35.7%
Applied rewrites35.8%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification30.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
(t_1 (sqrt (* 2.0 C)))
(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 -1e+154)
(* t_1 (/ (sqrt (* t_0 (* 2.0 F))) (- t_0)))
(if (<= t_3 -1e-204)
(-
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) B_m))
(if (<= t_3 0.0)
(/
(*
(sqrt F)
(sqrt (* (* 2.0 C) (fma B_m (* 2.0 B_m) (* (* A C) -8.0)))))
(* -4.0 (* C (- A))))
(if (<= t_3 INFINITY)
(*
(/ t_1 (fma A (* C -4.0) (* B_m B_m)))
(* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double t_1 = sqrt((2.0 * C));
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 <= -1e+154) {
tmp = t_1 * (sqrt((t_0 * (2.0 * F))) / -t_0);
} else if (t_3 <= -1e-204) {
tmp = -((sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / B_m);
} else if (t_3 <= 0.0) {
tmp = (sqrt(F) * sqrt(((2.0 * C) * fma(B_m, (2.0 * B_m), ((A * C) * -8.0))))) / (-4.0 * (C * -A));
} else if (t_3 <= ((double) INFINITY)) {
tmp = (t_1 / fma(A, (C * -4.0), (B_m * B_m))) * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) t_1 = sqrt(Float64(2.0 * C)) 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 <= -1e+154) tmp = Float64(t_1 * Float64(sqrt(Float64(t_0 * Float64(2.0 * F))) / Float64(-t_0))); elseif (t_3 <= -1e-204) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / B_m)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(Float64(2.0 * C) * fma(B_m, Float64(2.0 * B_m), Float64(Float64(A * C) * -8.0))))) / Float64(-4.0 * Float64(C * Float64(-A)))); elseif (t_3 <= Inf) tmp = Float64(Float64(t_1 / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * C), $MachinePrecision]], $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, -1e+154], N[(t$95$1 * N[(N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-204], (-N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]), If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(B$95$m * N[(2.0 * B$95$m), $MachinePrecision] + N[(N[(A * C), $MachinePrecision] * -8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(C * (-A)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(t$95$1 / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \sqrt{2 \cdot C}\\
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 -1 \cdot 10^{+154}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{t\_0 \cdot \left(2 \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{F} \cdot \sqrt{\left(2 \cdot C\right) \cdot \mathsf{fma}\left(B\_m, 2 \cdot B\_m, \left(A \cdot C\right) \cdot -8\right)}}{-4 \cdot \left(C \cdot \left(-A\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{t\_1}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)} \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000004e154Initial program 10.0%
Taylor expanded in A around -inf
lower-*.f6422.8
Applied rewrites22.8%
Applied rewrites28.3%
Applied rewrites28.4%
if -1.00000000000000004e154 < (/.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-204Initial program 96.0%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites46.3%
if -1e-204 < (/.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))) < -0.0Initial program 3.4%
Taylor expanded in A around -inf
lower-*.f6428.0
Applied rewrites28.0%
Applied rewrites35.7%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6435.5
Applied rewrites35.5%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification30.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* A C) -8.0))
(t_1 (/ (sqrt (* 2.0 C)) (fma A (* C -4.0) (* B_m B_m))))
(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 -1e+185)
(* t_1 (* (- (sqrt F)) (sqrt t_0)))
(if (<= t_3 -1e-204)
(-
(/ (* (sqrt 2.0) (sqrt (* F (+ C (sqrt (fma C C (* B_m B_m))))))) B_m))
(if (<= t_3 0.0)
(/
(* (sqrt F) (sqrt (* (* 2.0 C) (fma B_m (* 2.0 B_m) t_0))))
(* -4.0 (* C (- A))))
(if (<= t_3 INFINITY)
(* t_1 (* (sqrt (* F (* A -8.0))) (- (sqrt C))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 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 = (A * C) * -8.0;
double t_1 = sqrt((2.0 * C)) / fma(A, (C * -4.0), (B_m * B_m));
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 <= -1e+185) {
tmp = t_1 * (-sqrt(F) * sqrt(t_0));
} else if (t_3 <= -1e-204) {
tmp = -((sqrt(2.0) * sqrt((F * (C + sqrt(fma(C, C, (B_m * B_m))))))) / B_m);
} else if (t_3 <= 0.0) {
tmp = (sqrt(F) * sqrt(((2.0 * C) * fma(B_m, (2.0 * B_m), t_0)))) / (-4.0 * (C * -A));
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_1 * (sqrt((F * (A * -8.0))) * -sqrt(C));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * 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(Float64(A * C) * -8.0) t_1 = Float64(sqrt(Float64(2.0 * C)) / fma(A, Float64(C * -4.0), Float64(B_m * B_m))) 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 <= -1e+185) tmp = Float64(t_1 * Float64(Float64(-sqrt(F)) * sqrt(t_0))); elseif (t_3 <= -1e-204) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(C + sqrt(fma(C, C, Float64(B_m * B_m))))))) / B_m)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(Float64(2.0 * C) * fma(B_m, Float64(2.0 * B_m), t_0)))) / Float64(-4.0 * Float64(C * Float64(-A)))); elseif (t_3 <= Inf) tmp = Float64(t_1 * Float64(sqrt(Float64(F * Float64(A * -8.0))) * Float64(-sqrt(C)))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -8.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / N[(A * N[(C * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $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, -1e+185], N[(t$95$1 * N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-204], (-N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(C * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]), If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(B$95$m * N[(2.0 * B$95$m), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(C * (-A)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(t$95$1 * N[(N[Sqrt[N[(F * N[(A * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[C], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(A \cdot C\right) \cdot -8\\
t_1 := \frac{\sqrt{2 \cdot C}}{\mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)}\\
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 -1 \cdot 10^{+185}:\\
\;\;\;\;t\_1 \cdot \left(\left(-\sqrt{F}\right) \cdot \sqrt{t\_0}\right)\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-204}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(C, C, B\_m \cdot B\_m\right)}\right)}}{B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{F} \cdot \sqrt{\left(2 \cdot C\right) \cdot \mathsf{fma}\left(B\_m, 2 \cdot B\_m, t\_0\right)}}{-4 \cdot \left(C \cdot \left(-A\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_1 \cdot \left(\sqrt{F \cdot \left(A \cdot -8\right)} \cdot \left(-\sqrt{C}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999998e184Initial program 6.0%
Taylor expanded in A around -inf
lower-*.f6423.8
Applied rewrites23.8%
Applied rewrites29.5%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6421.9
Applied rewrites21.9%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6430.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6430.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6430.2
Applied rewrites30.2%
if -9.9999999999999998e184 < (/.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-204Initial program 96.4%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites44.9%
if -1e-204 < (/.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))) < -0.0Initial program 3.4%
Taylor expanded in A around -inf
lower-*.f6428.0
Applied rewrites28.0%
Applied rewrites35.7%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6435.5
Applied rewrites35.5%
if -0.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))) < +inf.0Initial program 45.8%
Taylor expanded in A around -inf
lower-*.f6434.5
Applied rewrites34.5%
Applied rewrites40.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6434.8
Applied rewrites34.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6447.0
Applied rewrites47.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6424.0
Applied rewrites24.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
Final simplification31.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e+64)
(* (sqrt (* C (* 4.0 (* F t_0)))) (/ -1.0 t_0))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 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 tmp;
if (pow(B_m, 2.0) <= 5e+64) {
tmp = sqrt((C * (4.0 * (F * t_0)))) * (-1.0 / t_0);
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * 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)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+64) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * t_0)))) * Float64(-1.0 / t_0)); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+64], N[(N[Sqrt[N[(C * N[(4.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+64}:\\
\;\;\;\;\sqrt{C \cdot \left(4 \cdot \left(F \cdot t\_0\right)\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5e64Initial program 22.7%
Taylor expanded in A around -inf
lower-*.f6428.1
Applied rewrites28.1%
Applied rewrites28.1%
if 5e64 < (pow.f64 B #s(literal 2 binary64)) Initial program 7.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6422.2
Applied rewrites22.2%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6430.1
Applied rewrites30.1%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6430.1
Applied rewrites30.1%
Final simplification29.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e+64)
(/ (sqrt (* C (* 4.0 (* F t_0)))) (- t_0))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 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 tmp;
if (pow(B_m, 2.0) <= 5e+64) {
tmp = sqrt((C * (4.0 * (F * t_0)))) / -t_0;
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * 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)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+64) tmp = Float64(sqrt(Float64(C * Float64(4.0 * Float64(F * t_0)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+64], N[(N[Sqrt[N[(C * N[(4.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+64}:\\
\;\;\;\;\frac{\sqrt{C \cdot \left(4 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5e64Initial program 22.7%
Taylor expanded in A around -inf
lower-*.f6428.1
Applied rewrites28.1%
Applied rewrites28.1%
if 5e64 < (pow.f64 B #s(literal 2 binary64)) Initial program 7.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6422.2
Applied rewrites22.2%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6430.1
Applied rewrites30.1%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6430.1
Applied rewrites30.1%
Final simplification29.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 0.02)
(*
(sqrt (* (* 2.0 C) (* A (* -8.0 (* C F)))))
(/ -1.0 (fma B_m B_m (* -4.0 (* A C)))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 0.02) {
tmp = sqrt(((2.0 * C) * (A * (-8.0 * (C * F))))) * (-1.0 / fma(B_m, B_m, (-4.0 * (A * C))));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 0.02) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(A * Float64(-8.0 * Float64(C * F))))) * Float64(-1.0 / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 0.02], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(A * N[(-8.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 0.02:\\
\;\;\;\;\sqrt{\left(2 \cdot C\right) \cdot \left(A \cdot \left(-8 \cdot \left(C \cdot F\right)\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 0.0200000000000000004Initial program 20.0%
Taylor expanded in A around -inf
lower-*.f6429.8
Applied rewrites29.8%
Applied rewrites23.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6418.6
Applied rewrites18.6%
Applied rewrites24.7%
if 0.0200000000000000004 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6422.1
Applied rewrites22.1%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6429.0
Applied rewrites29.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6429.0
Applied rewrites29.0%
Final simplification26.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
(if (<= (pow B_m 2.0) 0.02)
(/
(sqrt (* (* 2.0 C) (* A (* -8.0 (* C F)))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 0.02) {
tmp = sqrt(((2.0 * C) * (A * (-8.0 * (C * F))))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 0.02) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(A * Float64(-8.0 * Float64(C * F))))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 0.02], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(A * N[(-8.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 0.02:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot C\right) \cdot \left(A \cdot \left(-8 \cdot \left(C \cdot F\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 0.0200000000000000004Initial program 20.0%
Taylor expanded in A around -inf
lower-*.f6429.8
Applied rewrites29.8%
Applied rewrites23.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6418.6
Applied rewrites18.6%
Applied rewrites24.7%
if 0.0200000000000000004 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6422.1
Applied rewrites22.1%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6429.0
Applied rewrites29.0%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6429.0
Applied rewrites29.0%
Final simplification26.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 (if (<= (pow B_m 2.0) 2.95e+33) (* -2.0 (sqrt (/ (* C F) (fma B_m B_m (* -4.0 (* A C)))))) (* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2.95e+33) {
tmp = -2.0 * sqrt(((C * F) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else {
tmp = sqrt((1.0 / B_m)) * -sqrt((2.0 * F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2.95e+33) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); else tmp = Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2.95e+33], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2.95 \cdot 10^{+33}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.95000000000000004e33Initial program 21.5%
Taylor expanded in A around -inf
lower-*.f6428.8
Applied rewrites28.8%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6417.7
Applied rewrites17.7%
if 2.95000000000000004e33 < (pow.f64 B #s(literal 2 binary64)) Initial program 9.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6422.0
Applied rewrites22.0%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6429.1
Applied rewrites29.1%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6429.2
Applied rewrites29.2%
Final simplification23.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (/ 1.0 B_m)) (- (sqrt (* 2.0 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((1.0 / B_m)) * -sqrt((2.0 * 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((1.0d0 / b_m)) * -sqrt((2.0d0 * 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((1.0 / B_m)) * -Math.sqrt((2.0 * 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((1.0 / B_m)) * -math.sqrt((2.0 * F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(1.0 / B_m)) * Float64(-sqrt(Float64(2.0 * 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((1.0 / B_m)) * -sqrt((2.0 * F));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(1.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * 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{1}{B\_m}} \cdot \left(-\sqrt{2 \cdot F}\right)
\end{array}
Initial program 15.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.0
Applied rewrites14.0%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6418.1
Applied rewrites18.1%
metadata-evalN/A
sqrt-divN/A
lower-sqrt.f64N/A
lower-/.f6418.1
Applied rewrites18.1%
Final simplification18.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1.65e+245) (- (sqrt (/ (* 2.0 F) B_m))) (* (sqrt (* C F)) (/ 2.0 (- B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.65e+245) {
tmp = -sqrt(((2.0 * F) / B_m));
} else {
tmp = sqrt((C * F)) * (2.0 / -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 (c <= 1.65d+245) then
tmp = -sqrt(((2.0d0 * f) / b_m))
else
tmp = sqrt((c * f)) * (2.0d0 / -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 (C <= 1.65e+245) {
tmp = -Math.sqrt(((2.0 * F) / B_m));
} else {
tmp = Math.sqrt((C * F)) * (2.0 / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 1.65e+245: tmp = -math.sqrt(((2.0 * F) / B_m)) else: tmp = math.sqrt((C * F)) * (2.0 / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 1.65e+245) tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / B_m))); else tmp = Float64(sqrt(Float64(C * F)) * Float64(2.0 / 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 (C <= 1.65e+245)
tmp = -sqrt(((2.0 * F) / B_m));
else
tmp = sqrt((C * F)) * (2.0 / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 1.65e+245], (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] * N[(2.0 / (-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}\;C \leq 1.65 \cdot 10^{+245}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{C \cdot F} \cdot \frac{2}{-B\_m}\\
\end{array}
\end{array}
if C < 1.65000000000000005e245Initial program 16.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.6
Applied rewrites14.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6414.6
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6414.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6414.7
Applied rewrites14.7%
if 1.65000000000000005e245 < C Initial program 0.9%
Taylor expanded in A around -inf
lower-*.f640.9
Applied rewrites0.9%
Applied rewrites14.6%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-sqrt.f64N/A
lower-*.f649.1
Applied rewrites9.1%
Final simplification14.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 (* (- (sqrt F)) (sqrt (/ 2.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(F) * sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) * sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) * Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) * math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-sqrt(F)) * sqrt(Float64(2.0 / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) * sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B\_m}}
\end{array}
Initial program 15.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.0
Applied rewrites14.0%
lift-/.f64N/A
sqrt-unprodN/A
pow1/2N/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-sqrt.f6418.1
Applied rewrites18.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
un-div-invN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.1
Applied rewrites18.1%
Final simplification18.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (* 2.0 F) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(((2.0 * F) / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((2.0d0 * f) / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((2.0 * F) / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((2.0 * F) / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(Float64(2.0 * 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[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 15.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.0
Applied rewrites14.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6414.0
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6414.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6414.0
Applied rewrites14.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 15.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.0
Applied rewrites14.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6414.0
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6414.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6414.0
Applied rewrites14.0%
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6414.0
Applied rewrites14.0%
herbie shell --seed 2024214
(FPCore (A B C F)
:name "ABCF->ab-angle a"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))