
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-124)
(/ -1.0 (/ t_0 (sqrt (* (* (* F 2.0) t_0) (+ A A)))))
(if (<= (pow B_m 2.0) 2e+304)
(- (sqrt (* (* (/ (- (+ A C) (hypot (- A C) B_m)) t_0) F) 2.0)))
(/ (* -2.0 (sqrt (* (- A (hypot B_m A)) 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) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-124) {
tmp = -1.0 / (t_0 / sqrt((((F * 2.0) * t_0) * (A + A))));
} else if (pow(B_m, 2.0) <= 2e+304) {
tmp = -sqrt((((((A + C) - hypot((A - C), B_m)) / t_0) * F) * 2.0));
} else {
tmp = (-2.0 * sqrt(((A - hypot(B_m, A)) * F))) / (sqrt(2.0) * B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-124) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(A + A))))); elseif ((B_m ^ 2.0) <= 2e+304) tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(Float64(A + C) - hypot(Float64(A - C), B_m)) / t_0) * F) * 2.0))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(A - hypot(B_m, A)) * F))) / Float64(sqrt(2.0) * B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-124], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+304], (-N[Sqrt[N[(N[(N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), N[(N[(-2.0 * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-124}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+304}:\\
\;\;\;\;-\sqrt{\left(\frac{\left(A + C\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0} \cdot F\right) \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F}}{\sqrt{2} \cdot B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999933e-125Initial program 20.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.5
Applied rewrites27.5%
Applied rewrites27.6%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6427.6
Applied rewrites27.6%
if 9.99999999999999933e-125 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e304Initial program 24.2%
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
associate-/l*N/A
lower-*.f64N/A
Applied rewrites50.1%
Applied rewrites50.3%
if 1.9999999999999999e304 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.8%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites1.8%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6426.1
Applied rewrites26.1%
Applied rewrites26.2%
Final simplification35.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 (/ (* B_m B_m) C))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma (* C -4.0) A (* B_m B_m)))
(t_4 (- t_3))
(t_5 (* (* F 2.0) t_3)))
(if (<= t_2 -2e+138)
(/ (* (sqrt (* (+ (fma t_0 -0.5 A) A) (* F 2.0))) (sqrt t_3)) t_4)
(if (<= t_2 -1e-203)
(/ (sqrt (* (* (+ (- (/ C B_m) 1.0) (/ A B_m)) B_m) t_5)) t_4)
(/ -1.0 (/ t_3 (sqrt (* (+ (fma -0.5 t_0 A) A) t_5))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) / C;
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma((C * -4.0), A, (B_m * B_m));
double t_4 = -t_3;
double t_5 = (F * 2.0) * t_3;
double tmp;
if (t_2 <= -2e+138) {
tmp = (sqrt(((fma(t_0, -0.5, A) + A) * (F * 2.0))) * sqrt(t_3)) / t_4;
} else if (t_2 <= -1e-203) {
tmp = sqrt((((((C / B_m) - 1.0) + (A / B_m)) * B_m) * t_5)) / t_4;
} else {
tmp = -1.0 / (t_3 / sqrt(((fma(-0.5, t_0, A) + A) * t_5)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) / C) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_4 = Float64(-t_3) t_5 = Float64(Float64(F * 2.0) * t_3) tmp = 0.0 if (t_2 <= -2e+138) tmp = Float64(Float64(sqrt(Float64(Float64(fma(t_0, -0.5, A) + A) * Float64(F * 2.0))) * sqrt(t_3)) / t_4); elseif (t_2 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(C / B_m) - 1.0) + Float64(A / B_m)) * B_m) * t_5)) / t_4); else tmp = Float64(-1.0 / Float64(t_3 / sqrt(Float64(Float64(fma(-0.5, t_0, A) + A) * t_5)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+138], N[(N[(N[Sqrt[N[(N[(N[(t$95$0 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$2, -1e-203], N[(N[Sqrt[N[(N[(N[(N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] + N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(-1.0 / N[(t$95$3 / N[Sqrt[N[(N[(N[(-0.5 * t$95$0 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{B\_m \cdot B\_m}{C}\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_4 := -t\_3\\
t_5 := \left(F \cdot 2\right) \cdot t\_3\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(t\_0, -0.5, A\right) + A\right) \cdot \left(F \cdot 2\right)} \cdot \sqrt{t\_3}}{t\_4}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\frac{C}{B\_m} - 1\right) + \frac{A}{B\_m}\right) \cdot B\_m\right) \cdot t\_5}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{t\_3}{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_0, A\right) + A\right) \cdot t\_5}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e138Initial program 12.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.3
Applied rewrites22.3%
Applied rewrites22.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
Applied rewrites19.6%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-/.f6425.0
Applied rewrites25.0%
if -1e-203 < (/.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 8.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.2
Applied rewrites15.2%
Applied rewrites15.2%
Final simplification17.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 (/ (* B_m B_m) C))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma (* C -4.0) A (* B_m B_m)))
(t_4 (- t_3))
(t_5 (* (* F 2.0) t_3)))
(if (<= t_2 -2e+138)
(/ (* (sqrt (* (+ (fma t_0 -0.5 A) A) (* F 2.0))) (sqrt t_3)) t_4)
(if (<= t_2 -1e-203)
(/ (sqrt (* (* (+ (- (/ C B_m) 1.0) (/ A B_m)) B_m) t_5)) t_4)
(/ (sqrt (* (+ (fma -0.5 t_0 A) A) t_5)) t_4)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) / C;
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma((C * -4.0), A, (B_m * B_m));
double t_4 = -t_3;
double t_5 = (F * 2.0) * t_3;
double tmp;
if (t_2 <= -2e+138) {
tmp = (sqrt(((fma(t_0, -0.5, A) + A) * (F * 2.0))) * sqrt(t_3)) / t_4;
} else if (t_2 <= -1e-203) {
tmp = sqrt((((((C / B_m) - 1.0) + (A / B_m)) * B_m) * t_5)) / t_4;
} else {
tmp = sqrt(((fma(-0.5, t_0, A) + A) * t_5)) / t_4;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) / C) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_4 = Float64(-t_3) t_5 = Float64(Float64(F * 2.0) * t_3) tmp = 0.0 if (t_2 <= -2e+138) tmp = Float64(Float64(sqrt(Float64(Float64(fma(t_0, -0.5, A) + A) * Float64(F * 2.0))) * sqrt(t_3)) / t_4); elseif (t_2 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(C / B_m) - 1.0) + Float64(A / B_m)) * B_m) * t_5)) / t_4); else tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_0, A) + A) * t_5)) / t_4); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+138], N[(N[(N[Sqrt[N[(N[(N[(t$95$0 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$2, -1e-203], N[(N[Sqrt[N[(N[(N[(N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] + N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$0 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{B\_m \cdot B\_m}{C}\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_4 := -t\_3\\
t_5 := \left(F \cdot 2\right) \cdot t\_3\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(t\_0, -0.5, A\right) + A\right) \cdot \left(F \cdot 2\right)} \cdot \sqrt{t\_3}}{t\_4}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\frac{C}{B\_m} - 1\right) + \frac{A}{B\_m}\right) \cdot B\_m\right) \cdot t\_5}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_0, A\right) + A\right) \cdot t\_5}}{t\_4}\\
\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))) < -2.0000000000000001e138Initial program 12.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.3
Applied rewrites22.3%
Applied rewrites22.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
Applied rewrites19.6%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-/.f6425.0
Applied rewrites25.0%
if -1e-203 < (/.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 8.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.2
Applied rewrites15.2%
Applied rewrites15.2%
Final simplification17.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (* (* F 2.0) t_0))
(t_4 (/ (* B_m B_m) C))
(t_5 (- t_0)))
(if (<= t_2 -2e+138)
(/ (* (- (sqrt (* t_0 2.0))) (sqrt (* (+ (fma t_4 -0.5 A) A) F))) t_0)
(if (<= t_2 -1e-203)
(/ (sqrt (* (* (+ (- (/ C B_m) 1.0) (/ A B_m)) B_m) t_3)) t_5)
(/ (sqrt (* (+ (fma -0.5 t_4 A) A) t_3)) t_5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = (F * 2.0) * t_0;
double t_4 = (B_m * B_m) / C;
double t_5 = -t_0;
double tmp;
if (t_2 <= -2e+138) {
tmp = (-sqrt((t_0 * 2.0)) * sqrt(((fma(t_4, -0.5, A) + A) * F))) / t_0;
} else if (t_2 <= -1e-203) {
tmp = sqrt((((((C / B_m) - 1.0) + (A / B_m)) * B_m) * t_3)) / t_5;
} else {
tmp = sqrt(((fma(-0.5, t_4, A) + A) * t_3)) / t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = Float64(Float64(F * 2.0) * t_0) t_4 = Float64(Float64(B_m * B_m) / C) t_5 = Float64(-t_0) tmp = 0.0 if (t_2 <= -2e+138) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * 2.0))) * sqrt(Float64(Float64(fma(t_4, -0.5, A) + A) * F))) / t_0); elseif (t_2 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(C / B_m) - 1.0) + Float64(A / B_m)) * B_m) * t_3)) / t_5); else tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_4, A) + A) * t_3)) / t_5); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$5 = (-t$95$0)}, If[LessEqual[t$95$2, -2e+138], N[(N[((-N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(N[(N[(t$95$4 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$2, -1e-203], N[(N[Sqrt[N[(N[(N[(N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] + N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$4 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \left(F \cdot 2\right) \cdot t\_0\\
t_4 := \frac{B\_m \cdot B\_m}{C}\\
t_5 := -t\_0\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{\left(\mathsf{fma}\left(t\_4, -0.5, A\right) + A\right) \cdot F}}{t\_0}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\frac{C}{B\_m} - 1\right) + \frac{A}{B\_m}\right) \cdot B\_m\right) \cdot t\_3}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_4, A\right) + A\right) \cdot t\_3}}{t\_5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e138Initial program 12.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.3
Applied rewrites22.3%
Applied rewrites22.3%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
Applied rewrites19.5%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-/.f6425.0
Applied rewrites25.0%
if -1e-203 < (/.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 8.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.2
Applied rewrites15.2%
Applied rewrites15.2%
Final simplification17.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 (* (* 4.0 A) C))
(t_1
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_0) F) 2.0)))
(- t_0 (pow B_m 2.0))))
(t_2 (fma (* C -4.0) A (* B_m B_m)))
(t_3 (* (* F 2.0) t_2))
(t_4 (- t_2))
(t_5 (/ (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) t_3)) t_4)))
(if (<= t_1 -2e+138)
t_5
(if (<= t_1 -1e-203)
(/ (sqrt (* (* (+ (- (/ C B_m) 1.0) (/ A B_m)) B_m) t_3)) t_4)
t_5))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_0) * F) * 2.0))) / (t_0 - pow(B_m, 2.0));
double t_2 = fma((C * -4.0), A, (B_m * B_m));
double t_3 = (F * 2.0) * t_2;
double t_4 = -t_2;
double t_5 = sqrt(((fma(-0.5, ((B_m * B_m) / C), A) + A) * t_3)) / t_4;
double tmp;
if (t_1 <= -2e+138) {
tmp = t_5;
} else if (t_1 <= -1e-203) {
tmp = sqrt((((((C / B_m) - 1.0) + (A / B_m)) * B_m) * t_3)) / t_4;
} else {
tmp = t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_0) * F) * 2.0))) / Float64(t_0 - (B_m ^ 2.0))) t_2 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_3 = Float64(Float64(F * 2.0) * t_2) t_4 = Float64(-t_2) t_5 = Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) * t_3)) / t_4) tmp = 0.0 if (t_1 <= -2e+138) tmp = t_5; elseif (t_1 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(C / B_m) - 1.0) + Float64(A / B_m)) * B_m) * t_3)) / t_4); else tmp = t_5; end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]}, Block[{t$95$4 = (-t$95$2)}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+138], t$95$5, If[LessEqual[t$95$1, -1e-203], N[(N[Sqrt[N[(N[(N[(N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] + N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] * B$95$m), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], t$95$5]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_0\right) \cdot F\right) \cdot 2\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_3 := \left(F \cdot 2\right) \cdot t\_2\\
t_4 := -t\_2\\
t_5 := \frac{\sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot t\_3}}{t\_4}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;t\_5\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\frac{C}{B\_m} - 1\right) + \frac{A}{B\_m}\right) \cdot B\_m\right) \cdot t\_3}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;t\_5\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e138 or -1e-203 < (/.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 9.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.2
Applied rewrites17.2%
Applied rewrites17.2%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-/.f6425.0
Applied rewrites25.0%
Final simplification18.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 (* (* 4.0 A) C))
(t_1 (fma (* C -4.0) A (* B_m B_m)))
(t_2 (- t_1))
(t_3
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_0) F) 2.0)))
(- t_0 (pow B_m 2.0))))
(t_4 (* (* F 2.0) t_1)))
(if (<= t_3 -2e+138)
(/ -1.0 (/ t_1 (sqrt (* t_4 (+ A A)))))
(if (<= t_3 -1e-203)
(/ (sqrt (* (- B_m) t_4)) t_2)
(/ (sqrt (* (* (* (* F (+ A A)) C) A) -8.0)) t_2)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = fma((C * -4.0), A, (B_m * B_m));
double t_2 = -t_1;
double t_3 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_0) * F) * 2.0))) / (t_0 - pow(B_m, 2.0));
double t_4 = (F * 2.0) * t_1;
double tmp;
if (t_3 <= -2e+138) {
tmp = -1.0 / (t_1 / sqrt((t_4 * (A + A))));
} else if (t_3 <= -1e-203) {
tmp = sqrt((-B_m * t_4)) / t_2;
} else {
tmp = sqrt(((((F * (A + A)) * C) * A) * -8.0)) / t_2;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_2 = Float64(-t_1) t_3 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_0) * F) * 2.0))) / Float64(t_0 - (B_m ^ 2.0))) t_4 = Float64(Float64(F * 2.0) * t_1) tmp = 0.0 if (t_3 <= -2e+138) tmp = Float64(-1.0 / Float64(t_1 / sqrt(Float64(t_4 * Float64(A + A))))); elseif (t_3 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_4)) / t_2); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(F * Float64(A + A)) * C) * A) * -8.0)) / t_2); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(N[Sqrt[N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+138], N[(-1.0 / N[(t$95$1 / N[Sqrt[N[(t$95$4 * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-203], N[(N[Sqrt[N[((-B$95$m) * t$95$4), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_2 := -t\_1\\
t_3 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_0\right) \cdot F\right) \cdot 2\right)}}{t\_0 - {B\_m}^{2}}\\
t_4 := \left(F \cdot 2\right) \cdot t\_1\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;\frac{-1}{\frac{t\_1}{\sqrt{t\_4 \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_4}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(F \cdot \left(A + A\right)\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_2}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e138Initial program 12.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.3
Applied rewrites22.3%
Applied rewrites22.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6419.3
Applied rewrites19.3%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6420.9
Applied rewrites20.9%
if -1e-203 < (/.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 8.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.2
Applied rewrites15.2%
Applied rewrites15.2%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6415.3
Applied rewrites15.3%
Final simplification16.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m)))
(t_1 (* (* F 2.0) t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_2) F) 2.0)))
(- t_2 (pow B_m 2.0))))
(t_4 (- t_0)))
(if (<= t_3 -2e+138)
(/ (sqrt (* t_1 (+ A A))) t_4)
(if (<= t_3 -1e-203)
(/ (sqrt (* (- B_m) t_1)) t_4)
(/ (sqrt (* (* (* (* F (+ A A)) C) A) -8.0)) t_4)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double t_1 = (F * 2.0) * t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_2) * F) * 2.0))) / (t_2 - pow(B_m, 2.0));
double t_4 = -t_0;
double tmp;
if (t_3 <= -2e+138) {
tmp = sqrt((t_1 * (A + A))) / t_4;
} else if (t_3 <= -1e-203) {
tmp = sqrt((-B_m * t_1)) / t_4;
} else {
tmp = sqrt(((((F * (A + A)) * C) * A) * -8.0)) / t_4;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_1 = Float64(Float64(F * 2.0) * t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_2) * F) * 2.0))) / Float64(t_2 - (B_m ^ 2.0))) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -2e+138) tmp = Float64(sqrt(Float64(t_1 * Float64(A + A))) / t_4); elseif (t_3 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_1)) / t_4); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(F * Float64(A + A)) * C) * A) * -8.0)) / t_4); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -2e+138], N[(N[Sqrt[N[(t$95$1 * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$3, -1e-203], N[(N[Sqrt[N[((-B$95$m) * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \left(F \cdot 2\right) \cdot t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_2\right) \cdot F\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(A + A\right)}}{t\_4}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_1}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(F \cdot \left(A + A\right)\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_4}\\
\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))) < -2.0000000000000001e138Initial program 12.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.3
Applied rewrites22.3%
Applied rewrites22.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6419.3
Applied rewrites19.3%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6420.9
Applied rewrites20.9%
if -1e-203 < (/.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 8.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.2
Applied rewrites15.2%
Applied rewrites15.2%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6415.3
Applied rewrites15.3%
Final simplification16.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(/
(sqrt
(*
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_0) F) 2.0)))
(- t_0 (pow B_m 2.0))))
(t_2 (fma (* C -4.0) A (* B_m B_m)))
(t_3 (- t_2))
(t_4 (/ (sqrt (* (* (* (* F (+ A A)) C) A) -8.0)) t_3)))
(if (<= t_1 -2e+138)
t_4
(if (<= t_1 -1e-203) (/ (sqrt (* (- B_m) (* (* F 2.0) t_2))) t_3) t_4))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = sqrt((((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_0) * F) * 2.0))) / (t_0 - pow(B_m, 2.0));
double t_2 = fma((C * -4.0), A, (B_m * B_m));
double t_3 = -t_2;
double t_4 = sqrt(((((F * (A + A)) * C) * A) * -8.0)) / t_3;
double tmp;
if (t_1 <= -2e+138) {
tmp = t_4;
} else if (t_1 <= -1e-203) {
tmp = sqrt((-B_m * ((F * 2.0) * t_2))) / t_3;
} else {
tmp = t_4;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_0) * F) * 2.0))) / Float64(t_0 - (B_m ^ 2.0))) t_2 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_3 = Float64(-t_2) t_4 = Float64(sqrt(Float64(Float64(Float64(Float64(F * Float64(A + A)) * C) * A) * -8.0)) / t_3) tmp = 0.0 if (t_1 <= -2e+138) tmp = t_4; elseif (t_1 <= -1e-203) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(F * 2.0) * t_2))) / t_3); else tmp = t_4; end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(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] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$2)}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+138], t$95$4, If[LessEqual[t$95$1, -1e-203], N[(N[Sqrt[N[((-B$95$m) * N[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], t$95$4]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_0\right) \cdot F\right) \cdot 2\right)}}{t\_0 - {B\_m}^{2}}\\
t_2 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_3 := -t\_2\\
t_4 := \frac{\sqrt{\left(\left(\left(F \cdot \left(A + A\right)\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_3}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+138}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_2\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;t\_4\\
\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))) < -2.0000000000000001e138 or -1e-203 < (/.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 9.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.2
Applied rewrites17.2%
Applied rewrites17.2%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6415.3
Applied rewrites15.3%
if -2.0000000000000001e138 < (/.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-203Initial program 94.6%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.5
Applied rewrites19.5%
Applied rewrites19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6420.9
Applied rewrites20.9%
Final simplification15.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-124)
(/ -1.0 (/ t_0 (sqrt (* (* (* F 2.0) t_0) (+ A A)))))
(/ (* -2.0 (sqrt (* (- A (hypot B_m A)) 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) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-124) {
tmp = -1.0 / (t_0 / sqrt((((F * 2.0) * t_0) * (A + A))));
} else {
tmp = (-2.0 * sqrt(((A - hypot(B_m, A)) * F))) / (sqrt(2.0) * B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-124) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(A + A))))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(A - hypot(B_m, A)) * F))) / Float64(sqrt(2.0) * B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-124], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-124}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(A + A\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F}}{\sqrt{2} \cdot B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999933e-125Initial program 20.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.5
Applied rewrites27.5%
Applied rewrites27.6%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6427.6
Applied rewrites27.6%
if 9.99999999999999933e-125 < (pow.f64 B #s(literal 2 binary64)) Initial program 15.5%
+-lft-identityN/A
flip-+N/A
neg-sub0N/A
lift-neg.f64N/A
Applied rewrites17.7%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6421.0
Applied rewrites21.0%
Applied rewrites21.0%
Final simplification23.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-124)
(/ -1.0 (/ t_0 (sqrt (* (* (* F 2.0) t_0) (+ A A)))))
(* (sqrt (* (- A (hypot A B_m)) 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) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-124) {
tmp = -1.0 / (t_0 / sqrt((((F * 2.0) * t_0) * (A + A))));
} else {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-124) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(A + A))))); else tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-124], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-124}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(A + A\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999933e-125Initial program 20.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6427.5
Applied rewrites27.5%
Applied rewrites27.6%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6427.6
Applied rewrites27.6%
if 9.99999999999999933e-125 < (pow.f64 B #s(literal 2 binary64)) Initial program 15.5%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6421.0
Applied rewrites21.0%
Final simplification23.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m))) (t_1 (* (* F 2.0) t_0)))
(if (<= C 3.5e-127)
(/ -1.0 (/ t_0 (sqrt (* t_1 (+ A A)))))
(* (/ -1.0 t_0) (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) t_1))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double t_1 = (F * 2.0) * t_0;
double tmp;
if (C <= 3.5e-127) {
tmp = -1.0 / (t_0 / sqrt((t_1 * (A + A))));
} else {
tmp = (-1.0 / t_0) * sqrt(((fma(-0.5, ((B_m * B_m) / C), A) + A) * t_1));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_1 = Float64(Float64(F * 2.0) * t_0) tmp = 0.0 if (C <= 3.5e-127) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(t_1 * Float64(A + A))))); else tmp = Float64(Float64(-1.0 / t_0) * sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) * t_1))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[C, 3.5e-127], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(t$95$1 * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision] * t$95$1), $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(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \left(F \cdot 2\right) \cdot t\_0\\
\mathbf{if}\;C \leq 3.5 \cdot 10^{-127}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_1 \cdot \left(A + A\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{t\_0} \cdot \sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot t\_1}\\
\end{array}
\end{array}
if C < 3.49999999999999989e-127Initial program 21.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f648.5
Applied rewrites8.5%
Applied rewrites8.5%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f649.8
Applied rewrites9.8%
if 3.49999999999999989e-127 < C Initial program 11.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6434.7
Applied rewrites34.7%
Applied rewrites34.7%
Final simplification18.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 (* C -4.0) A (* B_m B_m))) (t_1 (* (* F 2.0) t_0)))
(if (<= C 2e-126)
(/ -1.0 (/ t_0 (sqrt (* t_1 (+ A A)))))
(/ (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) t_1)) (- t_0)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * -4.0), A, (B_m * B_m));
double t_1 = (F * 2.0) * t_0;
double tmp;
if (C <= 2e-126) {
tmp = -1.0 / (t_0 / sqrt((t_1 * (A + A))));
} else {
tmp = sqrt(((fma(-0.5, ((B_m * B_m) / C), A) + A) * t_1)) / -t_0;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_1 = Float64(Float64(F * 2.0) * t_0) tmp = 0.0 if (C <= 2e-126) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(t_1 * Float64(A + A))))); else tmp = Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) * t_1)) / Float64(-t_0)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[C, 2e-126], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(t$95$1 * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \left(F \cdot 2\right) \cdot t\_0\\
\mathbf{if}\;C \leq 2 \cdot 10^{-126}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_1 \cdot \left(A + A\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot t\_1}}{-t\_0}\\
\end{array}
\end{array}
if C < 1.9999999999999999e-126Initial program 21.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f648.5
Applied rewrites8.5%
Applied rewrites8.5%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f649.8
Applied rewrites9.8%
if 1.9999999999999999e-126 < C Initial program 11.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6434.7
Applied rewrites34.7%
Applied rewrites34.7%
Final simplification18.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* (* (* (* F (+ A A)) C) A) -8.0)) (- (fma (* C -4.0) A (* B_m B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((((F * (A + A)) * C) * A) * -8.0)) / -fma((C * -4.0), A, (B_m * B_m));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(F * Float64(A + A)) * C) * A) * -8.0)) / Float64(-fma(Float64(C * -4.0), A, Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(F \cdot \left(A + A\right)\right) \cdot C\right) \cdot A\right) \cdot -8}}{-\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 17.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.5
Applied rewrites17.5%
Applied rewrites17.5%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6415.5
Applied rewrites15.5%
Final simplification15.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 C) (* (* A A) -16.0))) (- (fma (* C -4.0) A (* B_m B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F * C) * ((A * A) * -16.0))) / -fma((C * -4.0), A, (B_m * B_m));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(F * C) * Float64(Float64(A * A) * -16.0))) / Float64(-fma(Float64(C * -4.0), A, Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(F * C), $MachinePrecision] * N[(N[(A * A), $MachinePrecision] * -16.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(F \cdot C\right) \cdot \left(\left(A \cdot A\right) \cdot -16\right)}}{-\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 17.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.5
Applied rewrites17.5%
Applied rewrites17.5%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6411.8
Applied rewrites11.8%
Final simplification11.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* (* (* (* C C) F) A) -16.0)) (- (fma (* C -4.0) A (* B_m B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((((C * C) * F) * A) * -16.0)) / -fma((C * -4.0), A, (B_m * B_m));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) / Float64(-fma(Float64(C * -4.0), A, Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -16}}{-\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 17.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.5
Applied rewrites17.5%
Applied rewrites17.5%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f649.0
Applied rewrites9.0%
Final simplification9.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 (/ 1.0 (sqrt (/ B_m (* F 2.0)))))
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 1.0 / sqrt((B_m / (F * 2.0)));
}
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 = 1.0d0 / sqrt((b_m / (f * 2.0d0)))
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 1.0 / Math.sqrt((B_m / (F * 2.0)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return 1.0 / math.sqrt((B_m / (F * 2.0)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(1.0 / sqrt(Float64(B_m / Float64(F * 2.0)))) 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 = 1.0 / sqrt((B_m / (F * 2.0)));
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[(1.0 / N[Sqrt[N[(B$95$m / N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{1}{\sqrt{\frac{B\_m}{F \cdot 2}}}
\end{array}
Initial program 17.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
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.7
Applied rewrites1.7%
Applied rewrites1.7%
Applied rewrites1.7%
Applied rewrites1.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ 2.0 (/ B_m F))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 / (B_m / F)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 / (b_m / f)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 / (B_m / F)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 / (B_m / F)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(2.0 / Float64(B_m / F))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 / (B_m / F)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(2.0 / N[(B$95$m / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2}{\frac{B\_m}{F}}}
\end{array}
Initial program 17.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
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.7
Applied rewrites1.7%
Applied rewrites1.7%
Applied rewrites1.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* (/ 2.0 B_m) F)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((2.0 / B_m) * F));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((2.0d0 / b_m) * f))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(((2.0 / B_m) * F));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(((2.0 / B_m) * F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(Float64(2.0 / B_m) * F)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((2.0 / B_m) * F));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2}{B\_m} \cdot F}
\end{array}
Initial program 17.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
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.7
Applied rewrites1.7%
Applied rewrites1.7%
Applied rewrites1.7%
Final simplification1.7%
herbie shell --seed 2024284
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))