
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1 (* 2.0 (* t_0 F)))
(t_2 (- t_0))
(t_3
(/
(sqrt (* t_1 (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
t_2)))
(if (<= t_3 -1e-218)
(*
(* (sqrt (* F 2.0)) (- (sqrt (fma (* A -4.0) C (* B_m B_m)))))
(/
(sqrt (+ (+ (hypot B_m (- A C)) A) C))
(fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_3 INFINITY)
(/ (sqrt (* t_1 (fma (/ (* B_m B_m) A) -0.5 (* 2.0 C)))) t_2)
(* (/ (- (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = 2.0 * (t_0 * F);
double t_2 = -t_0;
double t_3 = sqrt((t_1 * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_2;
double tmp;
if (t_3 <= -1e-218) {
tmp = (sqrt((F * 2.0)) * -sqrt(fma((A * -4.0), C, (B_m * B_m)))) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / fma(-4.0, (C * A), (B_m * B_m)));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * fma(((B_m * B_m) / A), -0.5, (2.0 * C)))) / t_2;
} 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((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(2.0 * Float64(t_0 * F)) t_2 = Float64(-t_0) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= -1e-218) tmp = Float64(Float64(sqrt(Float64(F * 2.0)) * Float64(-sqrt(fma(Float64(A * -4.0), C, Float64(B_m * B_m))))) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(t_1 * fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(2.0 * C)))) / t_2); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[Sqrt[N[(t$95$1 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -1e-218], N[(N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(N[(A * -4.0), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(t$95$1 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(t\_0 \cdot F\right)\\
t_2 := -t\_0\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\left(\sqrt{F \cdot 2} \cdot \left(-\sqrt{\mathsf{fma}\left(A \cdot -4, C, B\_m \cdot B\_m\right)}\right)\right) \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, 2 \cdot C\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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))) < -1e-218Initial program 49.8%
Applied rewrites70.3%
lift-neg.f64N/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.f6478.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f6478.5
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f6478.5
Applied rewrites78.5%
if -1e-218 < (/.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 18.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6435.6
Applied rewrites35.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification48.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (* (* 2.0 F) t_0))
(t_2
(*
(- (sqrt t_1))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_0)))
(t_3 (* (* 4.0 A) C))
(t_4 (- (pow B_m 2.0) t_3))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4))))
(if (<= t_5 (- INFINITY))
t_2
(if (<= t_5 -1e-218)
(/ (sqrt (* (+ (+ (hypot B_m (- A C)) A) C) t_1)) (fma (- B_m) B_m t_3))
(if (<= t_5 INFINITY)
t_2
(*
(/ (- (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 = (2.0 * F) * t_0;
double t_2 = -sqrt(t_1) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_0);
double t_3 = (4.0 * A) * C;
double t_4 = pow(B_m, 2.0) - t_3;
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_5 <= -1e-218) {
tmp = sqrt((((hypot(B_m, (A - C)) + A) + C) * t_1)) / fma(-B_m, B_m, t_3);
} else if (t_5 <= ((double) INFINITY)) {
tmp = t_2;
} 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(Float64(2.0 * F) * t_0) t_2 = Float64(Float64(-sqrt(t_1)) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_0)) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64((B_m ^ 2.0) - t_3) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = t_2; elseif (t_5 <= -1e-218) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C) * t_1)) / fma(Float64(-B_m), B_m, t_3)); elseif (t_5 <= Inf) tmp = t_2; else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[t$95$1], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], t$95$2, If[LessEqual[t$95$5, -1e-218], N[(N[Sqrt[N[(N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / N[((-B$95$m) * B$95$m + t$95$3), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], t$95$2, N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(2 \cdot F\right) \cdot t\_0\\
t_2 := \left(-\sqrt{t\_1}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_0}\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := {B\_m}^{2} - t\_3\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C\right) \cdot t\_1}}{\mathsf{fma}\left(-B\_m, B\_m, t\_3\right)}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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.0 or -1e-218 < (/.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 11.1%
Applied rewrites40.0%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6431.5
Applied rewrites31.5%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
Applied rewrites99.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification42.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 (- (sqrt 2.0)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4
(*
(- (sqrt (* (* 2.0 F) t_1)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_1))))
(if (<= t_3 -4e+143)
t_4
(if (<= t_3 -5e-153)
(* t_0 (sqrt (/ (* (+ (+ (hypot (- A C) B_m) C) A) F) t_1)))
(if (<= t_3 INFINITY)
t_4
(* (/ t_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(2.0);
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = -sqrt(((2.0 * F) * t_1)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_1);
double tmp;
if (t_3 <= -4e+143) {
tmp = t_4;
} else if (t_3 <= -5e-153) {
tmp = t_0 * sqrt(((((hypot((A - C), B_m) + C) + A) * F) / t_1));
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = (t_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(2.0)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_1))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_1)) tmp = 0.0 if (t_3 <= -4e+143) tmp = t_4; elseif (t_3 <= -5e-153) tmp = Float64(t_0 * sqrt(Float64(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * F) / t_1))); elseif (t_3 <= Inf) tmp = t_4; else tmp = Float64(Float64(t_0 / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -4e+143], t$95$4, If[LessEqual[t$95$3, -5e-153], N[(t$95$0 * 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$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[(t$95$0 / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -\sqrt{2}\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := \left(-\sqrt{\left(2 \cdot F\right) \cdot t\_1}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_1}\\
\mathbf{if}\;t\_3 \leq -4 \cdot 10^{+143}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-153}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{t\_1}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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.0000000000000001e143 or -5.00000000000000033e-153 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 18.3%
Applied rewrites44.8%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.1
Applied rewrites30.1%
if -4.0000000000000001e143 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000033e-153Initial program 99.5%
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 rewrites99.1%
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%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification39.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3
(*
(- (sqrt (* (* 2.0 F) t_0)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_0))))
(if (<= t_2 -4e+143)
t_3
(if (<= t_2 -1e-218)
(/
(* (sqrt (* (* (+ (hypot B_m C) C) F) 2.0)) B_m)
(- (fma (* A -4.0) C (* B_m B_m))))
(if (<= t_2 INFINITY)
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 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -sqrt(((2.0 * F) * t_0)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_0);
double tmp;
if (t_2 <= -4e+143) {
tmp = t_3;
} else if (t_2 <= -1e-218) {
tmp = (sqrt((((hypot(B_m, C) + C) * F) * 2.0)) * B_m) / -fma((A * -4.0), C, (B_m * B_m));
} else if (t_2 <= ((double) INFINITY)) {
tmp = 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 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_0))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_0)) tmp = 0.0 if (t_2 <= -4e+143) tmp = t_3; elseif (t_2 <= -1e-218) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(hypot(B_m, C) + C) * F) * 2.0)) * B_m) / Float64(-fma(Float64(A * -4.0), C, Float64(B_m * B_m)))); elseif (t_2 <= Inf) tmp = t_3; else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+143], t$95$3, If[LessEqual[t$95$2, -1e-218], N[(N[(N[Sqrt[N[(N[(N[(N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * B$95$m), $MachinePrecision] / (-N[(N[(A * -4.0), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := \left(-\sqrt{\left(2 \cdot F\right) \cdot t\_0}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_0}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+143}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(B\_m, C\right) + C\right) \cdot F\right) \cdot 2} \cdot B\_m}{-\mathsf{fma}\left(A \cdot -4, C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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.0000000000000001e143 or -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.0%
Applied rewrites43.3%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.7
Applied rewrites30.7%
if -4.0000000000000001e143 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.5
Applied rewrites48.5%
Applied rewrites48.5%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification32.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3
(*
(- (sqrt (* (* 2.0 F) t_0)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_0))))
(if (<= t_2 -4e+143)
t_3
(if (<= t_2 -1e-218)
(/ (* (sqrt (* 2.0 (* (+ (hypot C B_m) C) F))) B_m) (- (* B_m B_m)))
(if (<= t_2 INFINITY)
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 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -sqrt(((2.0 * F) * t_0)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_0);
double tmp;
if (t_2 <= -4e+143) {
tmp = t_3;
} else if (t_2 <= -1e-218) {
tmp = (sqrt((2.0 * ((hypot(C, B_m) + C) * F))) * B_m) / -(B_m * B_m);
} else if (t_2 <= ((double) INFINITY)) {
tmp = 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 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_0))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_0)) tmp = 0.0 if (t_2 <= -4e+143) tmp = t_3; elseif (t_2 <= -1e-218) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(Float64(hypot(C, B_m) + C) * F))) * B_m) / Float64(-Float64(B_m * B_m))); elseif (t_2 <= Inf) tmp = t_3; else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+143], t$95$3, If[LessEqual[t$95$2, -1e-218], N[(N[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * B$95$m), $MachinePrecision] / (-N[(B$95$m * B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := \left(-\sqrt{\left(2 \cdot F\right) \cdot t\_0}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_0}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+143}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right)} \cdot B\_m}{-B\_m \cdot B\_m}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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.0000000000000001e143 or -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.0%
Applied rewrites43.3%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.7
Applied rewrites30.7%
if -4.0000000000000001e143 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.5
Applied rewrites48.5%
Taylor expanded in A around 0
unpow2N/A
lower-*.f6448.3
Applied rewrites48.3%
Applied rewrites48.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification32.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3
(*
(- (sqrt (* (* 2.0 F) t_0)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_0))))
(if (<= t_2 -4e+143)
t_3
(if (<= t_2 -1e-218)
(/ (* (sqrt (* 2.0 (* (+ (hypot C B_m) C) F))) B_m) (- (* B_m B_m)))
(if (<= t_2 INFINITY) t_3 (/ (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -sqrt(((2.0 * F) * t_0)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_0);
double tmp;
if (t_2 <= -4e+143) {
tmp = t_3;
} else if (t_2 <= -1e-218) {
tmp = (sqrt((2.0 * ((hypot(C, B_m) + C) * F))) * B_m) / -(B_m * B_m);
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_3;
} 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((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_0))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_0)) tmp = 0.0 if (t_2 <= -4e+143) tmp = t_3; elseif (t_2 <= -1e-218) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(Float64(hypot(C, B_m) + C) * F))) * B_m) / Float64(-Float64(B_m * B_m))); elseif (t_2 <= Inf) tmp = t_3; 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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+143], t$95$3, If[LessEqual[t$95$2, -1e-218], N[(N[(N[Sqrt[N[(2.0 * N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * B$95$m), $MachinePrecision] / (-N[(B$95$m * B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, 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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := \left(-\sqrt{\left(2 \cdot F\right) \cdot t\_0}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_0}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+143}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right)} \cdot B\_m}{-B\_m \cdot B\_m}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{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.0000000000000001e143 or -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.0%
Applied rewrites43.3%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.7
Applied rewrites30.7%
if -4.0000000000000001e143 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.5
Applied rewrites48.5%
Taylor expanded in A around 0
unpow2N/A
lower-*.f6448.3
Applied rewrites48.3%
Applied rewrites48.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
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.8
Applied rewrites16.8%
Applied rewrites16.8%
Applied rewrites24.8%
Final simplification31.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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3
(*
(- (sqrt (* (* 2.0 F) t_0)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_0))))
(if (<= t_2 -4e+143)
t_3
(if (<= t_2 -1e-218)
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* (+ (hypot B_m C) C) F)))
(if (<= t_2 INFINITY) t_3 (/ (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -sqrt(((2.0 * F) * t_0)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_0);
double tmp;
if (t_2 <= -4e+143) {
tmp = t_3;
} else if (t_2 <= -1e-218) {
tmp = (-sqrt(2.0) / B_m) * sqrt(((hypot(B_m, C) + C) * F));
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_3;
} 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((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_0))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_0)) tmp = 0.0 if (t_2 <= -4e+143) tmp = t_3; elseif (t_2 <= -1e-218) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(hypot(B_m, C) + C) * F))); elseif (t_2 <= Inf) tmp = t_3; 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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+143], t$95$3, If[LessEqual[t$95$2, -1e-218], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, 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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := \left(-\sqrt{\left(2 \cdot F\right) \cdot t\_0}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_0}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+143}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(\mathsf{hypot}\left(B\_m, C\right) + C\right) \cdot F}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{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.0000000000000001e143 or -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 16.0%
Applied rewrites43.3%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.7
Applied rewrites30.7%
if -4.0000000000000001e143 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.4
Applied rewrites48.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in 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.8
Applied rewrites16.8%
Applied rewrites16.8%
Applied rewrites24.8%
Final simplification31.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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0)))
(t_2
(*
(/ (sqrt 2.0) B_m)
(* (sqrt (* -0.5 (/ (* B_m B_m) A))) (- (sqrt F))))))
(if (<= t_1 (- INFINITY))
t_2
(if (<= t_1 -1e-218)
(*
(/ (- (sqrt 2.0)) B_m)
(sqrt (* F (+ B_m (* A (+ 1.0 (* 0.5 (/ A B_m))))))))
(if (<= t_1 4e-133) t_2 (/ (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double t_2 = (sqrt(2.0) / B_m) * (sqrt((-0.5 * ((B_m * B_m) / A))) * -sqrt(F));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 <= -1e-218) {
tmp = (-sqrt(2.0) / B_m) * sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m)))))));
} else if (t_1 <= 4e-133) {
tmp = t_2;
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_0;
double t_2 = (Math.sqrt(2.0) / B_m) * (Math.sqrt((-0.5 * ((B_m * B_m) / A))) * -Math.sqrt(F));
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 <= -1e-218) {
tmp = (-Math.sqrt(2.0) / B_m) * Math.sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m)))))));
} else if (t_1 <= 4e-133) {
tmp = t_2;
} 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): t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C) t_1 = math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_0 t_2 = (math.sqrt(2.0) / B_m) * (math.sqrt((-0.5 * ((B_m * B_m) / A))) * -math.sqrt(F)) tmp = 0 if t_1 <= -math.inf: tmp = t_2 elif t_1 <= -1e-218: tmp = (-math.sqrt(2.0) / B_m) * math.sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m))))))) elif t_1 <= 4e-133: tmp = t_2 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) t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) t_2 = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) * Float64(-sqrt(F)))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = t_2; elseif (t_1 <= -1e-218) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(F * Float64(B_m + Float64(A * Float64(1.0 + Float64(0.5 * Float64(A / B_m)))))))); elseif (t_1 <= 4e-133) tmp = t_2; 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)
t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_0;
t_2 = (sqrt(2.0) / B_m) * (sqrt((-0.5 * ((B_m * B_m) / A))) * -sqrt(F));
tmp = 0.0;
if (t_1 <= -Inf)
tmp = t_2;
elseif (t_1 <= -1e-218)
tmp = (-sqrt(2.0) / B_m) * sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m)))))));
elseif (t_1 <= 4e-133)
tmp = t_2;
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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$2, If[LessEqual[t$95$1, -1e-218], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(B$95$m + N[(A * N[(1.0 + N[(0.5 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e-133], t$95$2, 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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
t_2 := \frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{-0.5 \cdot \frac{B\_m \cdot B\_m}{A}} \cdot \left(-\sqrt{F}\right)\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(B\_m + A \cdot \left(1 + 0.5 \cdot \frac{A}{B\_m}\right)\right)}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-133}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{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))) < -inf.0 or -1e-218 < (/.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.0000000000000003e-133Initial program 4.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites28.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f647.1
Applied rewrites7.1%
Applied rewrites8.2%
Taylor expanded in A around -inf
Applied rewrites18.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6444.2
Applied rewrites44.2%
Taylor expanded in A around 0
Applied rewrites34.4%
if 4.0000000000000003e-133 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.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-/.f6414.3
Applied rewrites14.3%
Applied rewrites14.3%
Applied rewrites20.9%
Final simplification22.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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0))))
(if (or (<= t_1 (- INFINITY))
(not (or (<= t_1 -1e-218) (not (<= t_1 INFINITY)))))
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* F (* -0.5 (/ (* B_m B_m) A)))))
(/ (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double tmp;
if ((t_1 <= -((double) INFINITY)) || !((t_1 <= -1e-218) || !(t_1 <= ((double) INFINITY)))) {
tmp = (-sqrt(2.0) / B_m) * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_0;
double tmp;
if ((t_1 <= -Double.POSITIVE_INFINITY) || !((t_1 <= -1e-218) || !(t_1 <= Double.POSITIVE_INFINITY))) {
tmp = (-Math.sqrt(2.0) / B_m) * Math.sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} 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): t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C) t_1 = math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_0 tmp = 0 if (t_1 <= -math.inf) or not ((t_1 <= -1e-218) or not (t_1 <= math.inf)): tmp = (-math.sqrt(2.0) / B_m) * math.sqrt((F * (-0.5 * ((B_m * B_m) / A)))) 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) t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) tmp = 0.0 if ((t_1 <= Float64(-Inf)) || !((t_1 <= -1e-218) || !(t_1 <= Inf))) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(F * Float64(-0.5 * Float64(Float64(B_m * B_m) / A))))); 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)
t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_0;
tmp = 0.0;
if ((t_1 <= -Inf) || ~(((t_1 <= -1e-218) || ~((t_1 <= Inf)))))
tmp = (-sqrt(2.0) / B_m) * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[Or[LessEqual[t$95$1, -1e-218], N[Not[LessEqual[t$95$1, Infinity]], $MachinePrecision]]], $MachinePrecision]], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
\mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq -1 \cdot 10^{-218} \lor \neg \left(t\_1 \leq \infty\right)\right):\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{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))) < -inf.0 or -1e-218 < (/.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 11.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites40.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f645.8
Applied rewrites5.8%
Taylor expanded in A around -inf
Applied rewrites14.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218 or +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 30.4%
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-/.f6421.1
Applied rewrites21.1%
Applied rewrites21.1%
Applied rewrites27.8%
Final simplification22.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0)))
(t_2 (/ (- (sqrt 2.0)) B_m))
(t_3 (* t_2 (sqrt (* F (* -0.5 (/ (* B_m B_m) A)))))))
(if (<= t_1 (- INFINITY))
t_3
(if (<= t_1 -1e-218)
(* t_2 (sqrt (* F (+ B_m (* A (+ 1.0 (* 0.5 (/ A B_m))))))))
(if (<= t_1 INFINITY) t_3 (/ (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double t_2 = -sqrt(2.0) / B_m;
double t_3 = t_2 * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = t_3;
} else if (t_1 <= -1e-218) {
tmp = t_2 * sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m)))))));
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_3;
} else {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
}
return tmp;
}
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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_0;
double t_2 = -Math.sqrt(2.0) / B_m;
double t_3 = t_2 * Math.sqrt((F * (-0.5 * ((B_m * B_m) / A))));
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = t_3;
} else if (t_1 <= -1e-218) {
tmp = t_2 * Math.sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m)))))));
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_3;
} 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): t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C) t_1 = math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_0 t_2 = -math.sqrt(2.0) / B_m t_3 = t_2 * math.sqrt((F * (-0.5 * ((B_m * B_m) / A)))) tmp = 0 if t_1 <= -math.inf: tmp = t_3 elif t_1 <= -1e-218: tmp = t_2 * math.sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m))))))) elif t_1 <= math.inf: tmp = t_3 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) t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) t_2 = Float64(Float64(-sqrt(2.0)) / B_m) t_3 = Float64(t_2 * sqrt(Float64(F * Float64(-0.5 * Float64(Float64(B_m * B_m) / A))))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = t_3; elseif (t_1 <= -1e-218) tmp = Float64(t_2 * sqrt(Float64(F * Float64(B_m + Float64(A * Float64(1.0 + Float64(0.5 * Float64(A / B_m)))))))); elseif (t_1 <= Inf) tmp = t_3; 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)
t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_0;
t_2 = -sqrt(2.0) / B_m;
t_3 = t_2 * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
tmp = 0.0;
if (t_1 <= -Inf)
tmp = t_3;
elseif (t_1 <= -1e-218)
tmp = t_2 * sqrt((F * (B_m + (A * (1.0 + (0.5 * (A / B_m)))))));
elseif (t_1 <= Inf)
tmp = t_3;
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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[Sqrt[N[(F * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$3, If[LessEqual[t$95$1, -1e-218], N[(t$95$2 * N[Sqrt[N[(F * N[(B$95$m + N[(A * N[(1.0 + N[(0.5 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$3, 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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
t_2 := \frac{-\sqrt{2}}{B\_m}\\
t_3 := t\_2 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right)}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;t\_2 \cdot \sqrt{F \cdot \left(B\_m + A \cdot \left(1 + 0.5 \cdot \frac{A}{B\_m}\right)\right)}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{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))) < -inf.0 or -1e-218 < (/.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 11.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites40.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f645.8
Applied rewrites5.8%
Taylor expanded in A around -inf
Applied rewrites14.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6444.2
Applied rewrites44.2%
Taylor expanded in A around 0
Applied rewrites34.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in 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.8
Applied rewrites16.8%
Applied rewrites16.8%
Applied rewrites24.8%
Final simplification22.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0)))
(t_2 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_1 -1e-218)
(*
(* (sqrt (* F 2.0)) (- (sqrt (fma (* A -4.0) C (* B_m B_m)))))
(/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) t_2))
(if (<= t_1 INFINITY)
(*
(- (sqrt (* (* 2.0 F) t_2)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_2))
(* (/ (- (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_1 <= -1e-218) {
tmp = (sqrt((F * 2.0)) * -sqrt(fma((A * -4.0), C, (B_m * B_m)))) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / t_2);
} else if (t_1 <= ((double) INFINITY)) {
tmp = -sqrt(((2.0 * F) * t_2)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_2);
} 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((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_1 <= -1e-218) tmp = Float64(Float64(sqrt(Float64(F * 2.0)) * Float64(-sqrt(fma(Float64(A * -4.0), C, Float64(B_m * B_m))))) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / t_2)); elseif (t_1 <= Inf) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_2))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_2)); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-218], N[(N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(N[(A * -4.0), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\left(\sqrt{F \cdot 2} \cdot \left(-\sqrt{\mathsf{fma}\left(A \cdot -4, C, B\_m \cdot B\_m\right)}\right)\right) \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{t\_2}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_2}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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))) < -1e-218Initial program 49.8%
Applied rewrites70.3%
lift-neg.f64N/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.f6478.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f6478.5
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f6478.5
Applied rewrites78.5%
if -1e-218 < (/.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 18.9%
Applied rewrites37.0%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6432.3
Applied rewrites32.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification47.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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0)))
(t_2 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_1 -1e-218)
(*
(* (sqrt (* (fma (* A -4.0) C (* B_m B_m)) 2.0)) (- (sqrt F)))
(/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) t_2))
(if (<= t_1 INFINITY)
(*
(- (sqrt (* (* 2.0 F) t_2)))
(/ (sqrt (+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)) t_2))
(* (/ (- (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_1 <= -1e-218) {
tmp = (sqrt((fma((A * -4.0), C, (B_m * B_m)) * 2.0)) * -sqrt(F)) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / t_2);
} else if (t_1 <= ((double) INFINITY)) {
tmp = -sqrt(((2.0 * F) * t_2)) * (sqrt(((C + (-0.5 * ((B_m * B_m) / A))) + C)) / t_2);
} 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((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_1 <= -1e-218) tmp = Float64(Float64(sqrt(Float64(fma(Float64(A * -4.0), C, Float64(B_m * B_m)) * 2.0)) * Float64(-sqrt(F))) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / t_2)); elseif (t_1 <= Inf) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_2))) * Float64(sqrt(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C)) / t_2)); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * Float64(sqrt(Float64(hypot(B_m, A) + A)) * 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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-218], N[(N[(N[Sqrt[N[(N[(N[(A * -4.0), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(A \cdot -4, C, B\_m \cdot B\_m\right) \cdot 2} \cdot \left(-\sqrt{F}\right)\right) \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{t\_2}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_2}\right) \cdot \frac{\sqrt{\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(B\_m, A\right) + A} \cdot \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))) < -1e-218Initial program 49.8%
Applied rewrites70.3%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites78.3%
if -1e-218 < (/.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 18.9%
Applied rewrites37.0%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6432.3
Applied rewrites32.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6418.3
Applied rewrites18.3%
Applied rewrites27.5%
Final simplification47.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 (sqrt (* (* 2.0 F) t_0))))
(if (<= B_m 2.65e-108)
(* (- t_1) (* (* -0.25 (/ (sqrt 2.0) A)) (sqrt (pow C -1.0))))
(if (<= B_m 1.05e+38)
(* t_1 (/ (sqrt (+ C C)) (- t_0)))
(if (<= B_m 6.5e+97)
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* F (* -0.5 (/ (* B_m B_m) A)))))
(/ (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 = sqrt(((2.0 * F) * t_0));
double tmp;
if (B_m <= 2.65e-108) {
tmp = -t_1 * ((-0.25 * (sqrt(2.0) / A)) * sqrt(pow(C, -1.0)));
} else if (B_m <= 1.05e+38) {
tmp = t_1 * (sqrt((C + C)) / -t_0);
} else if (B_m <= 6.5e+97) {
tmp = (-sqrt(2.0) / B_m) * sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} 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 = sqrt(Float64(Float64(2.0 * F) * t_0)) tmp = 0.0 if (B_m <= 2.65e-108) tmp = Float64(Float64(-t_1) * Float64(Float64(-0.25 * Float64(sqrt(2.0) / A)) * sqrt((C ^ -1.0)))); elseif (B_m <= 1.05e+38) tmp = Float64(t_1 * Float64(sqrt(Float64(C + C)) / Float64(-t_0))); elseif (B_m <= 6.5e+97) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(F * Float64(-0.5 * Float64(Float64(B_m * B_m) / A))))); 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[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.65e-108], N[((-t$95$1) * N[(N[(-0.25 * N[(N[Sqrt[2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[Power[C, -1.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.05e+38], N[(t$95$1 * N[(N[Sqrt[N[(C + C), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.5e+97], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $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)\\
t_1 := \sqrt{\left(2 \cdot F\right) \cdot t\_0}\\
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-108}:\\
\;\;\;\;\left(-t\_1\right) \cdot \left(\left(-0.25 \cdot \frac{\sqrt{2}}{A}\right) \cdot \sqrt{{C}^{-1}}\right)\\
\mathbf{elif}\;B\_m \leq 1.05 \cdot 10^{+38}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{C + C}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{+97}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.64999999999999994e-108Initial program 18.5%
Applied rewrites30.5%
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.6
Applied rewrites11.6%
if 2.64999999999999994e-108 < B < 1.05e38Initial program 53.0%
Applied rewrites67.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower-+.f64N/A
distribute-lft1-inN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6434.0
Applied rewrites34.0%
if 1.05e38 < B < 6.4999999999999999e97Initial program 35.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites48.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6436.6
Applied rewrites36.6%
Taylor expanded in A around -inf
Applied rewrites24.2%
if 6.4999999999999999e97 < B Initial program 3.1%
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-/.f6446.8
Applied rewrites46.8%
Applied rewrites46.9%
Applied rewrites74.6%
Final simplification25.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 1.25e-56)
(*
(- (sqrt (* (* 2.0 F) (fma -4.0 (* C A) (* B_m B_m)))))
(* (* -0.25 (/ (sqrt 2.0) A)) (sqrt (pow C -1.0))))
(if (<= B_m 6.5e+97)
(* (/ (sqrt 2.0) B_m) (* (sqrt (* -0.5 (/ (* B_m B_m) A))) (- (sqrt F))))
(/ (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.25e-56) {
tmp = -sqrt(((2.0 * F) * fma(-4.0, (C * A), (B_m * B_m)))) * ((-0.25 * (sqrt(2.0) / A)) * sqrt(pow(C, -1.0)));
} else if (B_m <= 6.5e+97) {
tmp = (sqrt(2.0) / B_m) * (sqrt((-0.5 * ((B_m * B_m) / A))) * -sqrt(F));
} 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 <= 1.25e-56) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * fma(-4.0, Float64(C * A), Float64(B_m * B_m))))) * Float64(Float64(-0.25 * Float64(sqrt(2.0) / A)) * sqrt((C ^ -1.0)))); elseif (B_m <= 6.5e+97) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) * Float64(-sqrt(F)))); 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, 1.25e-56], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * N[(N[(-0.25 * N[(N[Sqrt[2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[Power[C, -1.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.5e+97], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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 1.25 \cdot 10^{-56}:\\
\;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}\right) \cdot \left(\left(-0.25 \cdot \frac{\sqrt{2}}{A}\right) \cdot \sqrt{{C}^{-1}}\right)\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{+97}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{-0.5 \cdot \frac{B\_m \cdot B\_m}{A}} \cdot \left(-\sqrt{F}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.24999999999999999e-56Initial program 19.9%
Applied rewrites32.1%
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.9
Applied rewrites11.9%
if 1.24999999999999999e-56 < B < 6.4999999999999999e97Initial program 49.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites63.3%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6440.4
Applied rewrites40.4%
Applied rewrites42.5%
Taylor expanded in A around -inf
Applied rewrites23.8%
if 6.4999999999999999e97 < B Initial program 3.1%
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-/.f6446.8
Applied rewrites46.8%
Applied rewrites46.9%
Applied rewrites74.6%
Final simplification23.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 (* -0.5 (/ (* B_m B_m) A)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (sqrt (* (* 2.0 F) t_1))))
(if (<= B_m 1.35e-59)
(* (- t_2) (/ (sqrt (+ (+ C t_0) C)) t_1))
(if (<= B_m 1.05e+38)
(* t_2 (/ (sqrt (+ C C)) (- t_1)))
(if (<= B_m 6.5e+97)
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* F 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 = -0.5 * ((B_m * B_m) / A);
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = sqrt(((2.0 * F) * t_1));
double tmp;
if (B_m <= 1.35e-59) {
tmp = -t_2 * (sqrt(((C + t_0) + C)) / t_1);
} else if (B_m <= 1.05e+38) {
tmp = t_2 * (sqrt((C + C)) / -t_1);
} else if (B_m <= 6.5e+97) {
tmp = (-sqrt(2.0) / B_m) * sqrt((F * 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 = Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = sqrt(Float64(Float64(2.0 * F) * t_1)) tmp = 0.0 if (B_m <= 1.35e-59) tmp = Float64(Float64(-t_2) * Float64(sqrt(Float64(Float64(C + t_0) + C)) / t_1)); elseif (B_m <= 1.05e+38) tmp = Float64(t_2 * Float64(sqrt(Float64(C + C)) / Float64(-t_1))); elseif (B_m <= 6.5e+97) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(F * 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[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 1.35e-59], N[((-t$95$2) * N[(N[Sqrt[N[(N[(C + t$95$0), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.05e+38], N[(t$95$2 * N[(N[Sqrt[N[(C + C), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.5e+97], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * t$95$0), $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 := -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \sqrt{\left(2 \cdot F\right) \cdot t\_1}\\
\mathbf{if}\;B\_m \leq 1.35 \cdot 10^{-59}:\\
\;\;\;\;\left(-t\_2\right) \cdot \frac{\sqrt{\left(C + t\_0\right) + C}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.05 \cdot 10^{+38}:\\
\;\;\;\;t\_2 \cdot \frac{\sqrt{C + C}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{+97}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 1.3499999999999999e-59Initial program 19.4%
Applied rewrites31.7%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.2
Applied rewrites15.2%
if 1.3499999999999999e-59 < B < 1.05e38Initial program 65.8%
Applied rewrites79.6%
Taylor expanded in C around inf
lower-*.f64N/A
lower-+.f64N/A
distribute-lft1-inN/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f6439.8
Applied rewrites39.8%
if 1.05e38 < B < 6.4999999999999999e97Initial program 35.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites48.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6436.6
Applied rewrites36.6%
Taylor expanded in A around -inf
Applied rewrites24.2%
if 6.4999999999999999e97 < B Initial program 3.1%
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-/.f6446.8
Applied rewrites46.8%
Applied rewrites46.9%
Applied rewrites74.6%
Final simplification27.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 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 22.7%
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-/.f6414.5
Applied rewrites14.5%
Applied rewrites14.5%
Applied rewrites18.5%
Final simplification18.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (- (sqrt F)) (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 22.7%
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-/.f6414.5
Applied rewrites14.5%
Applied rewrites14.5%
Applied rewrites18.5%
Final simplification18.5%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 22.7%
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-/.f6414.5
Applied rewrites14.5%
Applied rewrites14.5%
Applied rewrites14.5%
herbie shell --seed 2024340
(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))))