
(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 27 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (sqrt (fma (* -4.0 C) A (* B_m B_m))))
(t_2 (sqrt (* F 2.0)))
(t_3 (* C (* A 4.0)))
(t_4
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_3)) 2.0)))
(- t_3 (pow B_m 2.0))))
(t_5 (- t_0)))
(if (<= t_4 -5e-189)
(* (/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) t_0) (* (- t_1) t_2))
(if (<= t_4 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_5) (* t_1 t_2))
(if (<= t_4 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (sqrt (* C 2.0)) t_5))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = sqrt(fma((-4.0 * C), A, (B_m * B_m)));
double t_2 = sqrt((F * 2.0));
double t_3 = C * (A * 4.0);
double t_4 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
double t_5 = -t_0;
double tmp;
if (t_4 <= -5e-189) {
tmp = (sqrt(((hypot((A - C), B_m) + A) + C)) / t_0) * (-t_1 * t_2);
} else if (t_4 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_5) * (t_1 * t_2);
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * (sqrt((C * 2.0)) / t_5);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) t_2 = sqrt(Float64(F * 2.0)) t_3 = Float64(C * Float64(A * 4.0)) t_4 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0))) t_5 = Float64(-t_0) tmp = 0.0 if (t_4 <= -5e-189) tmp = Float64(Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / t_0) * Float64(Float64(-t_1) * t_2)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_5) * Float64(t_1 * t_2)); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(sqrt(Float64(C * 2.0)) / t_5)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$0)}, If[LessEqual[t$95$4, -5e-189], N[(N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * N[((-t$95$1) * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision] * N[(t$95$1 * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}\\
t_2 := \sqrt{F \cdot 2}\\
t_3 := C \cdot \left(A \cdot 4\right)\\
t_4 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\
t_5 := -t\_0\\
\mathbf{if}\;t\_4 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{t\_0} \cdot \left(\left(-t\_1\right) \cdot t\_2\right)\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_5} \cdot \left(t\_1 \cdot t\_2\right)\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C \cdot 2}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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))) < -4.9999999999999997e-189Initial program 35.1%
Applied rewrites64.6%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6484.2
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites84.2%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
Final simplification47.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* C (* A 4.0)))
(t_1
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_0)) 2.0)))
(- t_0 (pow B_m 2.0))))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (- t_2))
(t_4 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_5 (sqrt (* (* F 2.0) t_2))))
(if (<= t_1 (- INFINITY))
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_3) t_4)
(if (<= t_1 -5e-189)
(* (- (sqrt (+ (+ (hypot (- A C) B_m) A) C))) (/ t_5 t_2))
(if (<= t_1 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_3) t_4)
(if (<= t_1 INFINITY)
(* t_5 (/ (sqrt (* C 2.0)) t_3))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt 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 = C * (A * 4.0);
double t_1 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_0)) * 2.0))) / (t_0 - pow(B_m, 2.0));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = -t_2;
double t_4 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_5 = sqrt(((F * 2.0) * t_2));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_3) * t_4;
} else if (t_1 <= -5e-189) {
tmp = -sqrt(((hypot((A - C), B_m) + A) + C)) * (t_5 / t_2);
} else if (t_1 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_3) * t_4;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_5 * (sqrt((C * 2.0)) / t_3);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(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(C * Float64(A * 4.0)) t_1 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0))) / Float64(t_0 - (B_m ^ 2.0))) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = Float64(-t_2) t_4 = Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_5 = sqrt(Float64(Float64(F * 2.0) * t_2)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_3) * t_4); elseif (t_1 <= -5e-189) tmp = Float64(Float64(-sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C))) * Float64(t_5 / t_2)); elseif (t_1 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_3) * t_4); elseif (t_1 <= Inf) tmp = Float64(t_5 * Float64(sqrt(Float64(C * 2.0)) / t_3)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$2)}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision] * t$95$4), $MachinePrecision], If[LessEqual[t$95$1, -5e-189], N[((-N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision]) * N[(t$95$5 / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision] * t$95$4), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(t$95$5 * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 := C \cdot \left(A \cdot 4\right)\\
t_1 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := -t\_2\\
t_4 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_5 := \sqrt{\left(F \cdot 2\right) \cdot t\_2}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_3} \cdot t\_4\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\left(-\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}\right) \cdot \frac{t\_5}{t\_2}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_3} \cdot t\_4\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{C \cdot 2}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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))) < -inf.0Initial program 3.5%
Applied rewrites47.2%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6476.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites76.7%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.3
Applied rewrites27.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.4%
Applied rewrites99.3%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
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 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma -4.0 (* C A) (* B_m B_m)))
(t_4 (- t_3))
(t_5 (sqrt (* (* F 2.0) t_3))))
(if (<= t_2 (- INFINITY))
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_0)
(if (<= t_2 -5e-189)
(* t_5 (/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) t_4))
(if (<= t_2 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_0)
(if (<= t_2 INFINITY)
(* t_5 (/ (sqrt (* C 2.0)) t_4))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt 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 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(-4.0, (C * A), (B_m * B_m));
double t_4 = -t_3;
double t_5 = sqrt(((F * 2.0) * t_3));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_0;
} else if (t_2 <= -5e-189) {
tmp = t_5 * (sqrt(((hypot((A - C), B_m) + A) + C)) / t_4);
} else if (t_2 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_5 * (sqrt((C * 2.0)) / t_4);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(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(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_4 = Float64(-t_3) t_5 = sqrt(Float64(Float64(F * 2.0) * t_3)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_0); elseif (t_2 <= -5e-189) tmp = Float64(t_5 * Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / t_4)); elseif (t_2 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_0); elseif (t_2 <= Inf) tmp = Float64(t_5 * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(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[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, -5e-189], N[(t$95$5 * N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(t$95$5 * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_4 := -t\_3\\
t_5 := \sqrt{\left(F \cdot 2\right) \cdot t\_3}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{t\_4}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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))) < -inf.0Initial program 3.5%
Applied rewrites47.2%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6476.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites76.7%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.3
Applied rewrites27.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.4%
Applied rewrites99.4%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
Final simplification35.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m)))
(t_1 (* (sqrt t_0) (sqrt (* F 2.0))))
(t_2 (* C (* A 4.0)))
(t_3
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_2)) 2.0)))
(- t_2 (pow B_m 2.0))))
(t_4 (fma -4.0 (* C A) (* B_m B_m)))
(t_5 (- t_4)))
(if (<= t_3 (- INFINITY))
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_5) t_1)
(if (<= t_3 -5e-189)
(*
(/ -1.0 t_4)
(* (sqrt (* (+ (+ (hypot (- A C) B_m) C) A) 2.0)) (sqrt (* t_0 F))))
(if (<= t_3 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_5) t_1)
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_4)) (/ (sqrt (* C 2.0)) t_5))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = sqrt(t_0) * sqrt((F * 2.0));
double t_2 = C * (A * 4.0);
double t_3 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B_m, 2.0));
double t_4 = fma(-4.0, (C * A), (B_m * B_m));
double t_5 = -t_4;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_5) * t_1;
} else if (t_3 <= -5e-189) {
tmp = (-1.0 / t_4) * (sqrt((((hypot((A - C), B_m) + C) + A) * 2.0)) * sqrt((t_0 * F)));
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_5) * t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_4)) * (sqrt((C * 2.0)) / t_5);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(sqrt(t_0) * sqrt(Float64(F * 2.0))) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B_m ^ 2.0))) t_4 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_5 = Float64(-t_4) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_5) * t_1); elseif (t_3 <= -5e-189) tmp = Float64(Float64(-1.0 / t_4) * Float64(sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * 2.0)) * sqrt(Float64(t_0 * F)))); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_5) * t_1); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_4)) * Float64(sqrt(Float64(C * 2.0)) / t_5)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$3, -5e-189], N[(N[(-1.0 / t$95$4), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{t\_0} \cdot \sqrt{F \cdot 2}\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\
t_4 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_5} \cdot t\_1\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\frac{-1}{t\_4} \cdot \left(\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot 2} \cdot \sqrt{t\_0 \cdot F}\right)\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_5} \cdot t\_1\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_4} \cdot \frac{\sqrt{C \cdot 2}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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))) < -inf.0Initial program 3.5%
Applied rewrites47.2%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6476.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites76.7%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.3
Applied rewrites27.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.4%
Applied rewrites98.6%
Applied rewrites99.2%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
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 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma -4.0 (* C A) (* B_m B_m)))
(t_4 (- t_3))
(t_5 (* (* F 2.0) t_3)))
(if (<= t_2 (- INFINITY))
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_0)
(if (<= t_2 -5e-189)
(* (sqrt (* t_5 (+ (+ (hypot (- A C) B_m) A) C))) (/ -1.0 t_3))
(if (<= t_2 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_0)
(if (<= t_2 INFINITY)
(* (sqrt t_5) (/ (sqrt (* C 2.0)) t_4))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt 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 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(-4.0, (C * A), (B_m * B_m));
double t_4 = -t_3;
double t_5 = (F * 2.0) * t_3;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_0;
} else if (t_2 <= -5e-189) {
tmp = sqrt((t_5 * ((hypot((A - C), B_m) + A) + C))) * (-1.0 / t_3);
} else if (t_2 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(t_5) * (sqrt((C * 2.0)) / t_4);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(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(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_4 = Float64(-t_3) t_5 = Float64(Float64(F * 2.0) * t_3) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_0); elseif (t_2 <= -5e-189) tmp = Float64(sqrt(Float64(t_5 * Float64(Float64(hypot(Float64(A - C), B_m) + A) + C))) * Float64(-1.0 / t_3)); elseif (t_2 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_0); elseif (t_2 <= Inf) tmp = Float64(sqrt(t_5) * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(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[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, -5e-189], N[(N[Sqrt[N[(t$95$5 * N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$3), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[t$95$5], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_4 := -t\_3\\
t_5 := \left(F \cdot 2\right) \cdot t\_3\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\sqrt{t\_5 \cdot \left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right)} \cdot \frac{-1}{t\_3}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_5} \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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))) < -inf.0Initial program 3.5%
Applied rewrites47.2%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6476.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites76.7%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.3
Applied rewrites27.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.4%
Applied rewrites98.6%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
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 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma -4.0 (* C A) (* B_m B_m)))
(t_4 (- t_3))
(t_5 (* (* F 2.0) t_3)))
(if (<= t_2 (- INFINITY))
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_0)
(if (<= t_2 -5e-189)
(/ (sqrt (* t_5 (+ (+ (hypot (- A C) B_m) A) C))) t_4)
(if (<= t_2 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_0)
(if (<= t_2 INFINITY)
(* (sqrt t_5) (/ (sqrt (* C 2.0)) t_4))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt 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 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(-4.0, (C * A), (B_m * B_m));
double t_4 = -t_3;
double t_5 = (F * 2.0) * t_3;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_0;
} else if (t_2 <= -5e-189) {
tmp = sqrt((t_5 * ((hypot((A - C), B_m) + A) + C))) / t_4;
} else if (t_2 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(t_5) * (sqrt((C * 2.0)) / t_4);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(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(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_4 = Float64(-t_3) t_5 = Float64(Float64(F * 2.0) * t_3) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_0); elseif (t_2 <= -5e-189) tmp = Float64(sqrt(Float64(t_5 * Float64(Float64(hypot(Float64(A - C), B_m) + A) + C))) / t_4); elseif (t_2 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_0); elseif (t_2 <= Inf) tmp = Float64(sqrt(t_5) * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(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[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, -5e-189], N[(N[Sqrt[N[(t$95$5 * N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[t$95$5], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $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 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_4 := -t\_3\\
t_5 := \left(F \cdot 2\right) \cdot t\_3\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right)}}{t\_4}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_5} \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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))) < -inf.0Initial program 3.5%
Applied rewrites47.2%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6476.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites76.7%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.3
Applied rewrites27.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.4%
Applied rewrites98.4%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
Final simplification35.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_3
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_4 (- t_0)))
(if (<= t_3 -1e+157)
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_2)
(if (<= t_3 -5e-189)
(* (sqrt (/ (* (+ (+ (hypot (- A C) B_m) C) A) F) t_0)) (- (sqrt 2.0)))
(if (<= t_3 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_2)
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (sqrt (* C 2.0)) t_4))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_3 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_4 = -t_0;
double tmp;
if (t_3 <= -1e+157) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_2;
} else if (t_3 <= -5e-189) {
tmp = sqrt(((((hypot((A - C), B_m) + C) + A) * F) / t_0)) * -sqrt(2.0);
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * (sqrt((C * 2.0)) / t_4);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -1e+157) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_2); elseif (t_3 <= -5e-189) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * F) / t_0)) * Float64(-sqrt(2.0))); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -1e+157], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -5e-189], N[(N[Sqrt[N[(N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+157}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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.99999999999999983e156Initial program 8.1%
Applied rewrites49.7%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6477.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites77.7%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6426.1
Applied rewrites26.1%
if -9.99999999999999983e156 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites95.9%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
Final simplification34.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_3
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_4 (- t_0)))
(if (<= t_3 -2e+87)
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_2)
(if (<= t_3 -5e-189)
(* (sqrt (* (+ (hypot C B_m) C) F)) (/ (- (sqrt 2.0)) B_m))
(if (<= t_3 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_2)
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (sqrt (* C 2.0)) t_4))
(*
(* (/ (sqrt 2.0) B_m) (sqrt (+ (hypot B_m A) A)))
(- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_3 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_4 = -t_0;
double tmp;
if (t_3 <= -2e+87) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_2;
} else if (t_3 <= -5e-189) {
tmp = sqrt(((hypot(C, B_m) + C) * F)) * (-sqrt(2.0) / B_m);
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * (sqrt((C * 2.0)) / t_4);
} else {
tmp = ((sqrt(2.0) / B_m) * sqrt((hypot(B_m, A) + A))) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -2e+87) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_2); elseif (t_3 <= -5e-189) tmp = Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * F)) * Float64(Float64(-sqrt(2.0)) / B_m)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(hypot(B_m, A) + A))) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -2e+87], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -5e-189], N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+87}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F} \cdot \frac{-\sqrt{2}}{B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(B\_m, A\right) + A}\right) \cdot \left(-\sqrt{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.9999999999999999e87Initial program 15.9%
Applied rewrites54.0%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6479.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites79.6%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.0
Applied rewrites27.0%
if -1.9999999999999999e87 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.2%
Taylor expanded in A around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.9
Applied rewrites48.9%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
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 -4.0 (* C A) (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_3
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_4 (- t_0)))
(if (<= t_3 -2e+87)
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_2)
(if (<= t_3 -5e-189)
(* (sqrt (* (+ (hypot C B_m) C) F)) (/ (- (sqrt 2.0)) B_m))
(if (<= t_3 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_2)
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (sqrt (* C 2.0)) t_4))
(* (/ (sqrt (* (+ (hypot B_m A) A) 2.0)) (- B_m)) (sqrt F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_3 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_4 = -t_0;
double tmp;
if (t_3 <= -2e+87) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_2;
} else if (t_3 <= -5e-189) {
tmp = sqrt(((hypot(C, B_m) + C) * F)) * (-sqrt(2.0) / B_m);
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * (sqrt((C * 2.0)) / t_4);
} else {
tmp = (sqrt(((hypot(B_m, A) + A) * 2.0)) / -B_m) * sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -2e+87) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_2); elseif (t_3 <= -5e-189) tmp = Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * F)) * Float64(Float64(-sqrt(2.0)) / B_m)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(B_m, A) + A) * 2.0)) / Float64(-B_m)) * sqrt(F)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -2e+87], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -5e-189], N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+87}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F} \cdot \frac{-\sqrt{2}}{B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A\right) + A\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.9999999999999999e87Initial program 15.9%
Applied rewrites54.0%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6479.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites79.6%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.0
Applied rewrites27.0%
if -1.9999999999999999e87 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.2%
Taylor expanded in A around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.9
Applied rewrites48.9%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.6
Applied rewrites14.6%
Applied rewrites22.8%
Applied rewrites22.8%
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 -4.0 (* C A) (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_3
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_4 (- t_0)))
(if (<= t_3 -2e+87)
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_4) t_2)
(if (<= t_3 -5e-189)
(* (sqrt (* (+ (hypot C B_m) C) F)) (/ (- (sqrt 2.0)) B_m))
(if (<= t_3 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_4) t_2)
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (sqrt (* C 2.0)) t_4))
(/ (- (sqrt F)) (sqrt (* 0.5 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_3 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_4 = -t_0;
double tmp;
if (t_3 <= -2e+87) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_4) * t_2;
} else if (t_3 <= -5e-189) {
tmp = sqrt(((hypot(C, B_m) + C) * F)) * (-sqrt(2.0) / B_m);
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_4) * t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * (sqrt((C * 2.0)) / t_4);
} else {
tmp = -sqrt(F) / sqrt((0.5 * B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -2e+87) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_4) * t_2); elseif (t_3 <= -5e-189) tmp = Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * F)) * Float64(Float64(-sqrt(2.0)) / B_m)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_4) * t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(sqrt(Float64(C * 2.0)) / t_4)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -2e+87], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -5e-189], N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+87}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F} \cdot \frac{-\sqrt{2}}{B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_4} \cdot t\_2\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C \cdot 2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\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.9999999999999999e87Initial program 15.9%
Applied rewrites54.0%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6479.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites79.6%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6427.0
Applied rewrites27.0%
if -1.9999999999999999e87 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 98.2%
Taylor expanded in A around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.9
Applied rewrites48.9%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites16.8%
Applied rewrites16.8%
Applied rewrites21.2%
Final simplification28.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (sqrt (* (* F 2.0) t_0)))
(t_2 (* C (* A 4.0)))
(t_3 (* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(t_4
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_2)) 2.0)))
(- t_2 (pow B_m 2.0))))
(t_5 (- t_0)))
(if (<= t_4 -5e+27)
(* (/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_5) t_3)
(if (<= t_4 -5e-189)
(* t_1 (/ (sqrt (+ (* (+ 1.0 (/ A B_m)) B_m) C)) t_5))
(if (<= t_4 0.0)
(* (/ (sqrt (+ (fma -0.5 (/ (* B_m B_m) A) C) C)) t_5) t_3)
(if (<= t_4 INFINITY)
(* t_1 (/ (sqrt (* C 2.0)) t_5))
(/ (- (sqrt F)) (sqrt (* 0.5 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = sqrt(((F * 2.0) * t_0));
double t_2 = C * (A * 4.0);
double t_3 = sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0));
double t_4 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B_m, 2.0));
double t_5 = -t_0;
double tmp;
if (t_4 <= -5e+27) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_5) * t_3;
} else if (t_4 <= -5e-189) {
tmp = t_1 * (sqrt((((1.0 + (A / B_m)) * B_m) + C)) / t_5);
} else if (t_4 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), C) + C)) / t_5) * t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = t_1 * (sqrt((C * 2.0)) / t_5);
} else {
tmp = -sqrt(F) / sqrt((0.5 * B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = sqrt(Float64(Float64(F * 2.0) * t_0)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0))) t_4 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B_m ^ 2.0))) t_5 = Float64(-t_0) tmp = 0.0 if (t_4 <= -5e+27) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_5) * t_3); elseif (t_4 <= -5e-189) tmp = Float64(t_1 * Float64(sqrt(Float64(Float64(Float64(1.0 + Float64(A / B_m)) * B_m) + C)) / t_5)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C)) / t_5) * t_3); elseif (t_4 <= Inf) tmp = Float64(t_1 * Float64(sqrt(Float64(C * 2.0)) / t_5)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$0)}, If[LessEqual[t$95$4, -5e+27], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -5e-189], N[(t$95$1 * N[(N[Sqrt[N[(N[(N[(1.0 + N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(t$95$1 * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{\left(F \cdot 2\right) \cdot t\_0}\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\\
t_4 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\
t_5 := -t\_0\\
\mathbf{if}\;t\_4 \leq -5 \cdot 10^{+27}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_5} \cdot t\_3\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{\left(1 + \frac{A}{B\_m}\right) \cdot B\_m + C}}{t\_5}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C}}{t\_5} \cdot t\_3\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{C \cdot 2}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\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))) < -4.99999999999999979e27Initial program 21.6%
Applied rewrites57.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6480.9
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites80.9%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6425.3
Applied rewrites25.3%
if -4.99999999999999979e27 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 97.7%
Applied rewrites99.4%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f6448.4
Applied rewrites48.4%
if -4.9999999999999997e-189 < (/.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 rewrites7.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6423.6
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites23.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.2
Applied rewrites27.2%
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 49.6%
Applied rewrites80.8%
Taylor expanded in A around -inf
lower-*.f6457.8
Applied rewrites57.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites16.8%
Applied rewrites16.8%
Applied rewrites21.2%
Final simplification27.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (- t_0))
(t_4 (* (* F 2.0) t_0))
(t_5 (sqrt t_4)))
(if (<= t_2 -5e+27)
(*
(/ (sqrt (+ (* (fma 0.0 (/ A C) 1.0) C) C)) t_3)
(* (sqrt (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* F 2.0))))
(if (<= t_2 -5e-189)
(* t_5 (/ (sqrt (+ (* (+ 1.0 (/ A B_m)) B_m) C)) t_3))
(if (<= t_2 1.0)
(* (sqrt (* (+ (+ (* (/ (* B_m B_m) A) -0.5) C) C) t_4)) (/ -1.0 t_0))
(if (<= t_2 INFINITY)
(* t_5 (/ (sqrt (* C 2.0)) t_3))
(/ (- (sqrt F)) (sqrt (* 0.5 B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = -t_0;
double t_4 = (F * 2.0) * t_0;
double t_5 = sqrt(t_4);
double tmp;
if (t_2 <= -5e+27) {
tmp = (sqrt(((fma(0.0, (A / C), 1.0) * C) + C)) / t_3) * (sqrt(fma((-4.0 * C), A, (B_m * B_m))) * sqrt((F * 2.0)));
} else if (t_2 <= -5e-189) {
tmp = t_5 * (sqrt((((1.0 + (A / B_m)) * B_m) + C)) / t_3);
} else if (t_2 <= 1.0) {
tmp = sqrt(((((((B_m * B_m) / A) * -0.5) + C) + C) * t_4)) * (-1.0 / t_0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_5 * (sqrt((C * 2.0)) / t_3);
} else {
tmp = -sqrt(F) / sqrt((0.5 * B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = Float64(-t_0) t_4 = Float64(Float64(F * 2.0) * t_0) t_5 = sqrt(t_4) tmp = 0.0 if (t_2 <= -5e+27) tmp = Float64(Float64(sqrt(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C)) / t_3) * Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) * sqrt(Float64(F * 2.0)))); elseif (t_2 <= -5e-189) tmp = Float64(t_5 * Float64(sqrt(Float64(Float64(Float64(1.0 + Float64(A / B_m)) * B_m) + C)) / t_3)); elseif (t_2 <= 1.0) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) + C) + C) * t_4)) * Float64(-1.0 / t_0)); elseif (t_2 <= Inf) tmp = Float64(t_5 * Float64(sqrt(Float64(C * 2.0)) / t_3)); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, Block[{t$95$4 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[t$95$4], $MachinePrecision]}, If[LessEqual[t$95$2, -5e+27], N[(N[(N[Sqrt[N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision] * N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-189], N[(t$95$5 * N[(N[Sqrt[N[(N[(N[(1.0 + N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1.0], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(t$95$5 * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := -t\_0\\
t_4 := \left(F \cdot 2\right) \cdot t\_0\\
t_5 := \sqrt{t\_4}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+27}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C}}{t\_3} \cdot \left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}\right)\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-189}:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{\left(1 + \frac{A}{B\_m}\right) \cdot B\_m + C}}{t\_3}\\
\mathbf{elif}\;t\_2 \leq 1:\\
\;\;\;\;\sqrt{\left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5 + C\right) + C\right) \cdot t\_4} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{C \cdot 2}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\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))) < -4.99999999999999979e27Initial program 21.6%
Applied rewrites57.1%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6480.9
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites80.9%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6425.3
Applied rewrites25.3%
if -4.99999999999999979e27 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999997e-189Initial program 97.7%
Applied rewrites99.4%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f6448.4
Applied rewrites48.4%
if -4.9999999999999997e-189 < (/.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))) < 1Initial program 12.7%
Applied rewrites15.6%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6431.6
Applied rewrites31.6%
if 1 < (/.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 30.1%
Applied rewrites81.6%
Taylor expanded in A around -inf
lower-*.f6464.2
Applied rewrites64.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites16.8%
Applied rewrites16.8%
Applied rewrites21.2%
Final simplification27.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m))) (t_1 (* (* F 2.0) t_0)))
(if (<= (pow B_m 2.0) 1.5e-37)
(* (sqrt (* (+ (+ (* (/ (* B_m B_m) A) -0.5) C) C) t_1)) (/ -1.0 t_0))
(if (<= (pow B_m 2.0) 5e+171)
(* (sqrt t_1) (/ (sqrt (* C 2.0)) (- t_0)))
(/ (sqrt (* F 2.0)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = (F * 2.0) * t_0;
double tmp;
if (pow(B_m, 2.0) <= 1.5e-37) {
tmp = sqrt(((((((B_m * B_m) / A) * -0.5) + C) + C) * t_1)) * (-1.0 / t_0);
} else if (pow(B_m, 2.0) <= 5e+171) {
tmp = sqrt(t_1) * (sqrt((C * 2.0)) / -t_0);
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(Float64(F * 2.0) * t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 1.5e-37) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) + C) + C) * t_1)) * Float64(-1.0 / t_0)); elseif ((B_m ^ 2.0) <= 5e+171) tmp = Float64(sqrt(t_1) * Float64(sqrt(Float64(C * 2.0)) / Float64(-t_0))); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1.5e-37], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+171], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(F \cdot 2\right) \cdot t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 1.5 \cdot 10^{-37}:\\
\;\;\;\;\sqrt{\left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5 + C\right) + C\right) \cdot t\_1} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+171}:\\
\;\;\;\;\sqrt{t\_1} \cdot \frac{\sqrt{C \cdot 2}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.5e-37Initial program 19.1%
Applied rewrites25.3%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6420.5
Applied rewrites20.5%
if 1.5e-37 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e171Initial program 32.4%
Applied rewrites57.8%
Taylor expanded in A around -inf
lower-*.f6421.3
Applied rewrites21.3%
if 5.0000000000000004e171 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.2%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6431.1
Applied rewrites31.1%
Applied rewrites31.3%
Applied rewrites36.6%
Final simplification26.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m))) (t_1 (* (* F 2.0) t_0)))
(if (<= (pow B_m 2.0) 1e-139)
(* (sqrt (* (* C 2.0) t_1)) (/ -1.0 t_0))
(if (<= (pow B_m 2.0) 5e+171)
(* (sqrt t_1) (/ (sqrt (* C 2.0)) (- t_0)))
(/ (sqrt (* F 2.0)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = (F * 2.0) * t_0;
double tmp;
if (pow(B_m, 2.0) <= 1e-139) {
tmp = sqrt(((C * 2.0) * t_1)) * (-1.0 / t_0);
} else if (pow(B_m, 2.0) <= 5e+171) {
tmp = sqrt(t_1) * (sqrt((C * 2.0)) / -t_0);
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(Float64(F * 2.0) * t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-139) tmp = Float64(sqrt(Float64(Float64(C * 2.0) * t_1)) * Float64(-1.0 / t_0)); elseif ((B_m ^ 2.0) <= 5e+171) tmp = Float64(sqrt(t_1) * Float64(sqrt(Float64(C * 2.0)) / Float64(-t_0))); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-139], N[(N[Sqrt[N[(N[(C * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+171], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(F \cdot 2\right) \cdot t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-139}:\\
\;\;\;\;\sqrt{\left(C \cdot 2\right) \cdot t\_1} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+171}:\\
\;\;\;\;\sqrt{t\_1} \cdot \frac{\sqrt{C \cdot 2}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000003e-139Initial program 15.6%
Applied rewrites23.2%
Taylor expanded in A around -inf
lower-*.f6422.6
Applied rewrites22.6%
if 1.00000000000000003e-139 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e171Initial program 33.0%
Applied rewrites54.7%
Taylor expanded in A around -inf
lower-*.f6419.8
Applied rewrites19.8%
if 5.0000000000000004e171 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.2%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6431.1
Applied rewrites31.1%
Applied rewrites31.3%
Applied rewrites36.6%
Final simplification26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-159)
(* (sqrt (* (* C 2.0) (* (* F 2.0) t_0))) (/ -1.0 t_0))
(if (<= (pow B_m 2.0) 2e+173)
(*
(* (/ (- (sqrt 2.0)) B_m) (sqrt F))
(sqrt (* (/ (* B_m B_m) A) -0.5)))
(/ (sqrt (* F 2.0)) (- (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-159) {
tmp = sqrt(((C * 2.0) * ((F * 2.0) * t_0))) * (-1.0 / t_0);
} else if (pow(B_m, 2.0) <= 2e+173) {
tmp = ((-sqrt(2.0) / B_m) * sqrt(F)) * sqrt((((B_m * B_m) / A) * -0.5));
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-159) tmp = Float64(sqrt(Float64(Float64(C * 2.0) * Float64(Float64(F * 2.0) * t_0))) * Float64(-1.0 / t_0)); elseif ((B_m ^ 2.0) <= 2e+173) tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(F)) * sqrt(Float64(Float64(Float64(B_m * B_m) / A) * -0.5))); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-159], N[(N[Sqrt[N[(N[(C * 2.0), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+173], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-159}:\\
\;\;\;\;\sqrt{\left(C \cdot 2\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+173}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{F}\right) \cdot \sqrt{\frac{B\_m \cdot B\_m}{A} \cdot -0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999989e-160Initial program 15.4%
Applied rewrites23.2%
Taylor expanded in A around -inf
lower-*.f6422.5
Applied rewrites22.5%
if 9.99999999999999989e-160 < (pow.f64 B #s(literal 2 binary64)) < 2e173Initial program 31.7%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6415.0
Applied rewrites15.0%
Taylor expanded in A around -inf
Applied rewrites12.6%
Applied rewrites13.2%
if 2e173 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6431.4
Applied rewrites31.4%
Applied rewrites31.6%
Applied rewrites37.0%
Final simplification24.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* (* F 2.0) t_0))
(t_2 (sqrt (* F 2.0))))
(if (<= B_m 1.02e-256)
(*
(* (sqrt (/ 1.0 C)) (* (/ (sqrt 2.0) A) -0.25))
(* (- (sqrt (fma (* -4.0 C) A (* B_m B_m)))) t_2))
(if (<= B_m 4.1e-19)
(* (sqrt (* (+ (+ (* (/ (* B_m B_m) A) -0.5) C) C) t_1)) (/ -1.0 t_0))
(if (<= B_m 7e+85)
(* (sqrt t_1) (/ (sqrt (* C 2.0)) (- t_0)))
(/ t_2 (- (sqrt B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = (F * 2.0) * t_0;
double t_2 = sqrt((F * 2.0));
double tmp;
if (B_m <= 1.02e-256) {
tmp = (sqrt((1.0 / C)) * ((sqrt(2.0) / A) * -0.25)) * (-sqrt(fma((-4.0 * C), A, (B_m * B_m))) * t_2);
} else if (B_m <= 4.1e-19) {
tmp = sqrt(((((((B_m * B_m) / A) * -0.5) + C) + C) * t_1)) * (-1.0 / t_0);
} else if (B_m <= 7e+85) {
tmp = sqrt(t_1) * (sqrt((C * 2.0)) / -t_0);
} else {
tmp = t_2 / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(Float64(F * 2.0) * t_0) t_2 = sqrt(Float64(F * 2.0)) tmp = 0.0 if (B_m <= 1.02e-256) tmp = Float64(Float64(sqrt(Float64(1.0 / C)) * Float64(Float64(sqrt(2.0) / A) * -0.25)) * Float64(Float64(-sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)))) * t_2)); elseif (B_m <= 4.1e-19) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) + C) + C) * t_1)) * Float64(-1.0 / t_0)); elseif (B_m <= 7e+85) tmp = Float64(sqrt(t_1) * Float64(sqrt(Float64(C * 2.0)) / Float64(-t_0))); else tmp = Float64(t_2 / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 1.02e-256], N[(N[(N[Sqrt[N[(1.0 / C), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[2.0], $MachinePrecision] / A), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.1e-19], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 7e+85], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[(N[Sqrt[N[(C * 2.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(t$95$2 / (-N[Sqrt[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}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(F \cdot 2\right) \cdot t\_0\\
t_2 := \sqrt{F \cdot 2}\\
\mathbf{if}\;B\_m \leq 1.02 \cdot 10^{-256}:\\
\;\;\;\;\left(\sqrt{\frac{1}{C}} \cdot \left(\frac{\sqrt{2}}{A} \cdot -0.25\right)\right) \cdot \left(\left(-\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}\right) \cdot t\_2\right)\\
\mathbf{elif}\;B\_m \leq 4.1 \cdot 10^{-19}:\\
\;\;\;\;\sqrt{\left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5 + C\right) + C\right) \cdot t\_1} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;B\_m \leq 7 \cdot 10^{+85}:\\
\;\;\;\;\sqrt{t\_1} \cdot \frac{\sqrt{C \cdot 2}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_2}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.01999999999999993e-256Initial program 17.4%
Applied rewrites28.6%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f64N/A
pow1/2N/A
lower-sqrt.f6432.4
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites32.4%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6411.3
Applied rewrites11.3%
if 1.01999999999999993e-256 < B < 4.09999999999999985e-19Initial program 18.1%
Applied rewrites22.5%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.0
Applied rewrites14.0%
if 4.09999999999999985e-19 < B < 7.0000000000000001e85Initial program 29.9%
Applied rewrites62.7%
Taylor expanded in A around -inf
lower-*.f6428.7
Applied rewrites28.7%
if 7.0000000000000001e85 < B Initial program 4.8%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6454.8
Applied rewrites54.8%
Applied rewrites55.1%
Applied rewrites65.7%
Final simplification23.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.4e-166)
(*
(sqrt (* (* (* (* C C) A) F) -16.0))
(/ -1.0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 3.5e+88)
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt F)) (sqrt (* (/ (* B_m B_m) A) -0.5)))
(/ (sqrt (* F 2.0)) (- (sqrt 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 (B_m <= 2.4e-166) {
tmp = sqrt(((((C * C) * A) * F) * -16.0)) * (-1.0 / fma(-4.0, (C * A), (B_m * B_m)));
} else if (B_m <= 3.5e+88) {
tmp = ((-sqrt(2.0) / B_m) * sqrt(F)) * sqrt((((B_m * B_m) / A) * -0.5));
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.4e-166) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * A) * F) * -16.0)) * Float64(-1.0 / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); elseif (B_m <= 3.5e+88) tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(F)) * sqrt(Float64(Float64(Float64(B_m * B_m) / A) * -0.5))); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.4e-166], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * A), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 3.5e+88], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}\;B\_m \leq 2.4 \cdot 10^{-166}:\\
\;\;\;\;\sqrt{\left(\left(\left(C \cdot C\right) \cdot A\right) \cdot F\right) \cdot -16} \cdot \frac{-1}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 3.5 \cdot 10^{+88}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{F}\right) \cdot \sqrt{\frac{B\_m \cdot B\_m}{A} \cdot -0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.3999999999999999e-166Initial program 16.8%
Applied rewrites22.8%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f644.2
Applied rewrites4.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.1
Applied rewrites11.1%
if 2.3999999999999999e-166 < B < 3.4999999999999998e88Initial program 23.4%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6422.0
Applied rewrites22.0%
Taylor expanded in A around -inf
Applied rewrites15.7%
Applied rewrites18.6%
if 3.4999999999999998e88 < B Initial program 4.8%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6454.8
Applied rewrites54.8%
Applied rewrites55.1%
Applied rewrites65.7%
Final simplification23.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 5.4e-167)
(*
(sqrt (* (* (* (* C C) A) F) -16.0))
(/ -1.0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 1.15e-25)
(* (sqrt (* (* (* (/ B_m A) B_m) -0.5) F)) (/ (- (sqrt 2.0)) B_m))
(/ (sqrt (* F 2.0)) (- (sqrt 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 (B_m <= 5.4e-167) {
tmp = sqrt(((((C * C) * A) * F) * -16.0)) * (-1.0 / fma(-4.0, (C * A), (B_m * B_m)));
} else if (B_m <= 1.15e-25) {
tmp = sqrt(((((B_m / A) * B_m) * -0.5) * F)) * (-sqrt(2.0) / B_m);
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 5.4e-167) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * A) * F) * -16.0)) * Float64(-1.0 / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); elseif (B_m <= 1.15e-25) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B_m / A) * B_m) * -0.5) * F)) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 5.4e-167], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * A), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.15e-25], N[(N[Sqrt[N[(N[(N[(N[(B$95$m / A), $MachinePrecision] * B$95$m), $MachinePrecision] * -0.5), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}\;B\_m \leq 5.4 \cdot 10^{-167}:\\
\;\;\;\;\sqrt{\left(\left(\left(C \cdot C\right) \cdot A\right) \cdot F\right) \cdot -16} \cdot \frac{-1}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 1.15 \cdot 10^{-25}:\\
\;\;\;\;\sqrt{\left(\left(\frac{B\_m}{A} \cdot B\_m\right) \cdot -0.5\right) \cdot F} \cdot \frac{-\sqrt{2}}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 5.4000000000000001e-167Initial program 16.8%
Applied rewrites22.8%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f644.2
Applied rewrites4.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.1
Applied rewrites11.1%
if 5.4000000000000001e-167 < B < 1.15e-25Initial program 17.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6413.4
Applied rewrites13.4%
Taylor expanded in A around -inf
Applied rewrites17.0%
Applied rewrites18.2%
if 1.15e-25 < B Initial program 14.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.2
Applied rewrites48.2%
Applied rewrites48.5%
Applied rewrites55.9%
Final simplification24.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
(if (<= B_m 2.4e-166)
(*
(sqrt (* (* (* (* C C) A) F) -16.0))
(/ -1.0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 1.15e-25)
(* (sqrt (* (/ (* (* B_m B_m) F) A) -0.5)) (/ (- (sqrt 2.0)) B_m))
(/ (sqrt (* F 2.0)) (- (sqrt 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 (B_m <= 2.4e-166) {
tmp = sqrt(((((C * C) * A) * F) * -16.0)) * (-1.0 / fma(-4.0, (C * A), (B_m * B_m)));
} else if (B_m <= 1.15e-25) {
tmp = sqrt(((((B_m * B_m) * F) / A) * -0.5)) * (-sqrt(2.0) / B_m);
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.4e-166) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * A) * F) * -16.0)) * Float64(-1.0 / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); elseif (B_m <= 1.15e-25) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B_m * B_m) * F) / A) * -0.5)) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.4e-166], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * A), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.15e-25], N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}\;B\_m \leq 2.4 \cdot 10^{-166}:\\
\;\;\;\;\sqrt{\left(\left(\left(C \cdot C\right) \cdot A\right) \cdot F\right) \cdot -16} \cdot \frac{-1}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 1.15 \cdot 10^{-25}:\\
\;\;\;\;\sqrt{\frac{\left(B\_m \cdot B\_m\right) \cdot F}{A} \cdot -0.5} \cdot \frac{-\sqrt{2}}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.3999999999999999e-166Initial program 16.8%
Applied rewrites22.8%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f644.2
Applied rewrites4.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.1
Applied rewrites11.1%
if 2.3999999999999999e-166 < B < 1.15e-25Initial program 17.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6413.4
Applied rewrites13.4%
Taylor expanded in A around -inf
Applied rewrites19.4%
if 1.15e-25 < B Initial program 14.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.2
Applied rewrites48.2%
Applied rewrites48.5%
Applied rewrites55.9%
Final simplification24.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.4e-166)
(*
(sqrt (* (* (* (* C C) A) F) -16.0))
(/ -1.0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 1.15e-25)
(/ (sqrt (* (* (* (/ (* B_m B_m) A) -0.5) F) 2.0)) (- B_m))
(/ (sqrt (* F 2.0)) (- (sqrt 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 (B_m <= 2.4e-166) {
tmp = sqrt(((((C * C) * A) * F) * -16.0)) * (-1.0 / fma(-4.0, (C * A), (B_m * B_m)));
} else if (B_m <= 1.15e-25) {
tmp = sqrt((((((B_m * B_m) / A) * -0.5) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.4e-166) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * A) * F) * -16.0)) * Float64(-1.0 / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); elseif (B_m <= 1.15e-25) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.4e-166], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * A), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.15e-25], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}\;B\_m \leq 2.4 \cdot 10^{-166}:\\
\;\;\;\;\sqrt{\left(\left(\left(C \cdot C\right) \cdot A\right) \cdot F\right) \cdot -16} \cdot \frac{-1}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 1.15 \cdot 10^{-25}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.3999999999999999e-166Initial program 16.8%
Applied rewrites22.8%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f644.2
Applied rewrites4.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.1
Applied rewrites11.1%
if 2.3999999999999999e-166 < B < 1.15e-25Initial program 17.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6413.4
Applied rewrites13.4%
Taylor expanded in A around -inf
Applied rewrites17.0%
Applied rewrites17.0%
if 1.15e-25 < B Initial program 14.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.2
Applied rewrites48.2%
Applied rewrites48.5%
Applied rewrites55.9%
Final simplification24.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.4e-166)
(*
(sqrt (* (* (* (* C C) F) A) -16.0))
(/ -1.0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 1.15e-25)
(/ (sqrt (* (* (* (/ (* B_m B_m) A) -0.5) F) 2.0)) (- B_m))
(/ (sqrt (* F 2.0)) (- (sqrt 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 (B_m <= 2.4e-166) {
tmp = sqrt(((((C * C) * F) * A) * -16.0)) * (-1.0 / fma(-4.0, (C * A), (B_m * B_m)));
} else if (B_m <= 1.15e-25) {
tmp = sqrt((((((B_m * B_m) / A) * -0.5) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.4e-166) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) * Float64(-1.0 / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); elseif (B_m <= 1.15e-25) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.4e-166], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.15e-25], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}\;B\_m \leq 2.4 \cdot 10^{-166}:\\
\;\;\;\;\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -16} \cdot \frac{-1}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 1.15 \cdot 10^{-25}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.3999999999999999e-166Initial program 16.8%
Applied rewrites22.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.6
Applied rewrites11.6%
if 2.3999999999999999e-166 < B < 1.15e-25Initial program 17.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6413.4
Applied rewrites13.4%
Taylor expanded in A around -inf
Applied rewrites17.0%
Applied rewrites17.0%
if 1.15e-25 < B Initial program 14.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.2
Applied rewrites48.2%
Applied rewrites48.5%
Applied rewrites55.9%
Final simplification24.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.15e-25) (/ (sqrt (* (* (* (/ (* B_m B_m) A) -0.5) F) 2.0)) (- B_m)) (/ (sqrt (* F 2.0)) (- (sqrt 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 (B_m <= 1.15e-25) {
tmp = sqrt((((((B_m * B_m) / A) * -0.5) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((F * 2.0)) / -sqrt(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 (b_m <= 1.15d-25) then
tmp = sqrt((((((b_m * b_m) / a) * (-0.5d0)) * f) * 2.0d0)) / -b_m
else
tmp = sqrt((f * 2.0d0)) / -sqrt(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 (B_m <= 1.15e-25) {
tmp = Math.sqrt((((((B_m * B_m) / A) * -0.5) * F) * 2.0)) / -B_m;
} else {
tmp = Math.sqrt((F * 2.0)) / -Math.sqrt(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 B_m <= 1.15e-25: tmp = math.sqrt((((((B_m * B_m) / A) * -0.5) * F) * 2.0)) / -B_m else: tmp = math.sqrt((F * 2.0)) / -math.sqrt(B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.15e-25) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(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 (B_m <= 1.15e-25)
tmp = sqrt((((((B_m * B_m) / A) * -0.5) * F) * 2.0)) / -B_m;
else
tmp = sqrt((F * 2.0)) / -sqrt(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[B$95$m, 1.15e-25], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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}\;B\_m \leq 1.15 \cdot 10^{-25}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.15e-25Initial program 16.8%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f644.9
Applied rewrites4.9%
Taylor expanded in A around -inf
Applied rewrites7.5%
Applied rewrites7.5%
if 1.15e-25 < B Initial program 14.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.2
Applied rewrites48.2%
Applied rewrites48.5%
Applied rewrites55.9%
Final simplification20.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* F 2.0)) (- (sqrt 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)) / -sqrt(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)) / -sqrt(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)) / -Math.sqrt(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)) / -math.sqrt(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 * 2.0)) / Float64(-sqrt(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)) / -sqrt(B_m);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[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])\\
\\
\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}
\end{array}
Initial program 16.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.5
Applied rewrites16.5%
Applied rewrites16.6%
Applied rewrites18.7%
Final simplification18.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (- (sqrt F)) (sqrt (* 0.5 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((0.5 * 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((0.5d0 * 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((0.5 * 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((0.5 * 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(0.5 * 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((0.5 * 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[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}
\end{array}
Initial program 16.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.5
Applied rewrites16.5%
Applied rewrites16.6%
Applied rewrites16.5%
Applied rewrites18.7%
Final simplification18.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (- (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 16.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.5
Applied rewrites16.5%
Applied rewrites16.6%
Applied rewrites18.6%
Final simplification18.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (* F 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(Float64(F * 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[(N[(F * 2.0), $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{F \cdot 2}{B\_m}}
\end{array}
Initial program 16.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.5
Applied rewrites16.5%
Applied rewrites16.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* (/ 2.0 B_m) F))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(((2.0 / B_m) * F));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((2.0d0 / b_m) * f))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((2.0 / B_m) * F));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((2.0 / B_m) * F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(Float64(2.0 / B_m) * F))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(((2.0 / B_m) * F));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $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}{B\_m} \cdot F}
\end{array}
Initial program 16.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.5
Applied rewrites16.5%
Applied rewrites16.6%
Applied rewrites16.5%
herbie shell --seed 2024296
(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))))