
(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 21 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 (* (* 4.0 A) C))
(t_1 (* 2.0 (* (- (pow B_m 2.0) t_0) F)))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3
(/
(sqrt (* t_1 (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2))
(t_4
(/
(*
2.0
(* (sqrt (* F (fma C (* A -4.0) (fma B_m B_m 0.0)))) (sqrt C)))
t_2)))
(if (<= t_3 (- INFINITY))
t_4
(if (<= t_3 -1e-171)
(/
(sqrt
(*
t_1
(fma
(* (+ A C) (- A C))
(/ -1.0 (- C A))
(sqrt (fma (- A C) (- A C) (* B_m B_m))))))
t_2)
(if (<= t_3 0.0)
(/
(*
(sqrt
(*
(fma 2.0 C (/ (* (* B_m B_m) -0.5) A))
(* 2.0 (fma B_m B_m (* -4.0 (* A C))))))
(sqrt F))
t_2)
(if (<= t_3 INFINITY)
t_4
(/ (sqrt (* 2.0 F)) (- 0.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 = (4.0 * A) * C;
double t_1 = 2.0 * ((pow(B_m, 2.0) - t_0) * F);
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = sqrt((t_1 * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_4 = (2.0 * (sqrt((F * fma(C, (A * -4.0), fma(B_m, B_m, 0.0)))) * sqrt(C))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_4;
} else if (t_3 <= -1e-171) {
tmp = sqrt((t_1 * fma(((A + C) * (A - C)), (-1.0 / (C - A)), sqrt(fma((A - C), (A - C), (B_m * B_m)))))) / t_2;
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(2.0, C, (((B_m * B_m) * -0.5) / A)) * (2.0 * fma(B_m, B_m, (-4.0 * (A * C)))))) * sqrt(F)) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = sqrt((2.0 * F)) / (0.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(Float64(4.0 * A) * C) t_1 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) t_4 = Float64(Float64(2.0 * Float64(sqrt(Float64(F * fma(C, Float64(A * -4.0), fma(B_m, B_m, 0.0)))) * sqrt(C))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_4; elseif (t_3 <= -1e-171) tmp = Float64(sqrt(Float64(t_1 * fma(Float64(Float64(A + C) * Float64(A - C)), Float64(-1.0 / Float64(C - A)), sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) / t_2); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(2.0, C, Float64(Float64(Float64(B_m * B_m) * -0.5) / A)) * Float64(2.0 * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * sqrt(F)) / t_2); elseif (t_3 <= Inf) tmp = t_4; else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t$95$1 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(2.0 * N[(N[Sqrt[N[(F * N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$4, If[LessEqual[t$95$3, -1e-171], N[(N[Sqrt[N[(t$95$1 * N[(N[(N[(A + C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(C - A), $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
t_4 := \frac{2 \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(C, A \cdot -4, \mathsf{fma}\left(B\_m, B\_m, 0\right)\right)} \cdot \sqrt{C}\right)}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \mathsf{fma}\left(\left(A + C\right) \cdot \left(A - C\right), \frac{-1}{C - A}, \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, C, \frac{\left(B\_m \cdot B\_m\right) \cdot -0.5}{A}\right) \cdot \left(2 \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{F}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \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 -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 9.4%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6427.0
Simplified27.0%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.9
Simplified25.9%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr37.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
flip-+N/A
div-invN/A
accelerator-lowering-fma.f64N/A
difference-of-squaresN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
--lowering--.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.7%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.1
Simplified29.1%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr41.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
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.8
Simplified17.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6417.9
Applied egg-rr17.9%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification41.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 (* A C) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2))
(t_4
(/
(*
2.0
(* (sqrt (* F (fma C (* A -4.0) (fma B_m B_m 0.0)))) (sqrt C)))
t_2)))
(if (<= t_3 (- INFINITY))
t_4
(if (<= t_3 -1e-171)
(*
(sqrt
(*
(* 2.0 (* F t_0))
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
(/ -1.0 t_0))
(if (<= t_3 0.0)
(/
(*
(sqrt
(*
(fma 2.0 C (/ (* (* B_m B_m) -0.5) A))
(* 2.0 (fma B_m B_m (* -4.0 (* A C))))))
(sqrt F))
t_2)
(if (<= t_3 INFINITY)
t_4
(/ (sqrt (* 2.0 F)) (- 0.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, (A * C), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_4 = (2.0 * (sqrt((F * fma(C, (A * -4.0), fma(B_m, B_m, 0.0)))) * sqrt(C))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_4;
} else if (t_3 <= -1e-171) {
tmp = sqrt(((2.0 * (F * t_0)) * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))))) * (-1.0 / t_0);
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(2.0, C, (((B_m * B_m) * -0.5) / A)) * (2.0 * fma(B_m, B_m, (-4.0 * (A * C)))))) * sqrt(F)) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = sqrt((2.0 * F)) / (0.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(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) t_4 = Float64(Float64(2.0 * Float64(sqrt(Float64(F * fma(C, Float64(A * -4.0), fma(B_m, B_m, 0.0)))) * sqrt(C))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_4; elseif (t_3 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) * Float64(-1.0 / t_0)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(2.0, C, Float64(Float64(Float64(B_m * B_m) * -0.5) / A)) * Float64(2.0 * fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))) * sqrt(F)) / t_2); elseif (t_3 <= Inf) tmp = t_4; else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(2.0 * N[(N[Sqrt[N[(F * N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$4, If[LessEqual[t$95$3, -1e-171], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
t_4 := \frac{2 \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(C, A \cdot -4, \mathsf{fma}\left(B\_m, B\_m, 0\right)\right)} \cdot \sqrt{C}\right)}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(F \cdot t\_0\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, C, \frac{\left(B\_m \cdot B\_m\right) \cdot -0.5}{A}\right) \cdot \left(2 \cdot \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{F}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \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 -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 9.4%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6427.0
Simplified27.0%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.9
Simplified25.9%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr37.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.7%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6429.1
Simplified29.1%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr41.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
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.8
Simplified17.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6417.9
Applied egg-rr17.9%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification41.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 (* A C) (* B_m B_m)))
(t_1 (fma C (* A -4.0) (fma B_m B_m 0.0)))
(t_2 (* (* 4.0 A) C))
(t_3 (- t_2 (pow B_m 2.0)))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_3))
(t_5 (/ (* 2.0 (* (sqrt (* F t_1)) (sqrt C))) t_3)))
(if (<= t_4 (- INFINITY))
t_5
(if (<= t_4 -1e-171)
(*
(sqrt
(*
(* 2.0 (* F t_0))
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
(/ -1.0 t_0))
(if (<= t_4 0.0)
(/ (* 2.0 (* (sqrt F) (sqrt (* C t_1)))) t_3)
(if (<= t_4 INFINITY)
t_5
(/ (sqrt (* 2.0 F)) (- 0.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, (A * C), (B_m * B_m));
double t_1 = fma(C, (A * -4.0), fma(B_m, B_m, 0.0));
double t_2 = (4.0 * A) * C;
double t_3 = t_2 - pow(B_m, 2.0);
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_3;
double t_5 = (2.0 * (sqrt((F * t_1)) * sqrt(C))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = t_5;
} else if (t_4 <= -1e-171) {
tmp = sqrt(((2.0 * (F * t_0)) * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))))) * (-1.0 / t_0);
} else if (t_4 <= 0.0) {
tmp = (2.0 * (sqrt(F) * sqrt((C * t_1)))) / t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = t_5;
} else {
tmp = sqrt((2.0 * F)) / (0.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(A * C), Float64(B_m * B_m)) t_1 = fma(C, Float64(A * -4.0), fma(B_m, B_m, 0.0)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(t_2 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) t_5 = Float64(Float64(2.0 * Float64(sqrt(Float64(F * t_1)) * sqrt(C))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = t_5; elseif (t_4 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) * Float64(-1.0 / t_0)); elseif (t_4 <= 0.0) tmp = Float64(Float64(2.0 * Float64(sqrt(F) * sqrt(Float64(C * t_1)))) / t_3); elseif (t_4 <= Inf) tmp = t_5; else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m + 0.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(N[(2.0 * N[(N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], t$95$5, If[LessEqual[t$95$4, -1e-171], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(2.0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$5, N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, \mathsf{fma}\left(B\_m, B\_m, 0\right)\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := t\_2 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
t_5 := \frac{2 \cdot \left(\sqrt{F \cdot t\_1} \cdot \sqrt{C}\right)}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;t\_5\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(F \cdot t\_0\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{2 \cdot \left(\sqrt{F} \cdot \sqrt{C \cdot t\_1}\right)}{t\_3}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;t\_5\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \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 -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 9.4%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6427.0
Simplified27.0%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.9
Simplified25.9%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr37.9%
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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.7%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6425.5
Simplified25.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.6
Simplified25.6%
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr34.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%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.8
Simplified17.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6417.9
Applied egg-rr17.9%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification40.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2))
(t_4 (fma B_m B_m (* -4.0 (* A C)))))
(if (<= t_3 (- INFINITY))
(/
(* 2.0 (* (sqrt (* F (fma C (* A -4.0) (fma B_m B_m 0.0)))) (sqrt C)))
t_2)
(if (<= t_3 -1e-171)
(*
(sqrt
(*
(* 2.0 (* F t_0))
(+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
(/ -1.0 t_0))
(if (<= t_3 INFINITY)
(/
(sqrt (* (* F t_4) (* 2.0 (fma 2.0 C (/ (* (* B_m B_m) -0.5) A)))))
(- 0.0 t_4))
(/ (sqrt (* 2.0 F)) (- 0.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, (A * C), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_4 = fma(B_m, B_m, (-4.0 * (A * C)));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (2.0 * (sqrt((F * fma(C, (A * -4.0), fma(B_m, B_m, 0.0)))) * sqrt(C))) / t_2;
} else if (t_3 <= -1e-171) {
tmp = sqrt(((2.0 * (F * t_0)) * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))))) * (-1.0 / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_4) * (2.0 * fma(2.0, C, (((B_m * B_m) * -0.5) / A))))) / (0.0 - t_4);
} else {
tmp = sqrt((2.0 * F)) / (0.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(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) t_4 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(2.0 * Float64(sqrt(Float64(F * fma(C, Float64(A * -4.0), fma(B_m, B_m, 0.0)))) * sqrt(C))) / t_2); elseif (t_3 <= -1e-171) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) * Float64(-1.0 / t_0)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_4) * Float64(2.0 * fma(2.0, C, Float64(Float64(Float64(B_m * B_m) * -0.5) / A))))) / Float64(0.0 - t_4)); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(2.0 * N[(N[Sqrt[N[(F * N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -1e-171], N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * t$95$4), $MachinePrecision] * N[(2.0 * N[(2.0 * C + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(0.0 - t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
t_4 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{2 \cdot \left(\sqrt{F \cdot \mathsf{fma}\left(C, A \cdot -4, \mathsf{fma}\left(B\_m, B\_m, 0\right)\right)} \cdot \sqrt{C}\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(F \cdot t\_0\right)\right) \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_4\right) \cdot \left(2 \cdot \mathsf{fma}\left(2, C, \frac{\left(B\_m \cdot B\_m\right) \cdot -0.5}{A}\right)\right)}}{0 - t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \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.0Initial program 3.3%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6424.7
Simplified24.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6423.2
Simplified23.2%
pow1/2N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr38.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))) < -9.9999999999999998e-172Initial program 99.4%
frac-2negN/A
div-invN/A
remove-double-negN/A
frac-2negN/A
metadata-evalN/A
remove-double-negN/A
*-lowering-*.f64N/A
Applied egg-rr99.4%
if -9.9999999999999998e-172 < (/.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 12.4%
Taylor expanded in A around -inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6430.5
Simplified30.5%
distribute-frac-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
Applied egg-rr30.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%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.8
Simplified17.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6417.9
Applied egg-rr17.9%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.3
Applied egg-rr26.3%
Final simplification39.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-32)
(* -2.0 (/ (sqrt (* C (* F t_0))) t_0))
(if (<= (pow B_m 2.0) 2e+283)
(/
(* (sqrt F) (sqrt (* 2.0 (+ C (sqrt (fma B_m B_m (fma C C 0.0)))))))
(- 0.0 B_m))
(/ (sqrt (* 2.0 F)) (- 0.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, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = -2.0 * (sqrt((C * (F * t_0))) / t_0);
} else if (pow(B_m, 2.0) <= 2e+283) {
tmp = (sqrt(F) * sqrt((2.0 * (C + sqrt(fma(B_m, B_m, fma(C, C, 0.0))))))) / (0.0 - B_m);
} else {
tmp = sqrt((2.0 * F)) / (0.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(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(-2.0 * Float64(sqrt(Float64(C * Float64(F * t_0))) / t_0)); elseif ((B_m ^ 2.0) <= 2e+283) tmp = Float64(Float64(sqrt(F) * sqrt(Float64(2.0 * Float64(C + sqrt(fma(B_m, B_m, fma(C, C, 0.0))))))) / Float64(0.0 - B_m)); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(-2.0 * N[(N[Sqrt[N[(C * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+283], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C + 0.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot \left(F \cdot t\_0\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+283}:\\
\;\;\;\;\frac{\sqrt{F} \cdot \sqrt{2 \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \mathsf{fma}\left(C, C, 0\right)\right)}\right)}}{0 - B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6429.6
Simplified29.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.7
Simplified29.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
/-lowering-/.f64N/A
Simplified29.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999991e283Initial program 31.8%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified16.5%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6418.0
Applied egg-rr18.0%
associate-*r*N/A
*-lowering-*.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
distribute-rgt-outN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f6418.0
Applied egg-rr18.0%
if 1.99999999999999991e283 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.1%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6429.5
Simplified29.5%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6429.7
Applied egg-rr29.7%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6444.4
Applied egg-rr44.4%
Final simplification30.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-32)
(* -2.0 (sqrt (/ (* C F) (fma B_m B_m (* -4.0 (* A C))))))
(if (<= (pow B_m 2.0) 1e+262)
(/ (sqrt (* (* 2.0 F) (+ C (sqrt (fma B_m B_m (* C C)))))) (- 0.0 B_m))
(/ (sqrt (* 2.0 F)) (- 0.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 (pow(B_m, 2.0) <= 1e-32) {
tmp = -2.0 * sqrt(((C * F) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else if (pow(B_m, 2.0) <= 1e+262) {
tmp = sqrt(((2.0 * F) * (C + sqrt(fma(B_m, B_m, (C * C)))))) / (0.0 - B_m);
} else {
tmp = sqrt((2.0 * F)) / (0.0 - sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); elseif ((B_m ^ 2.0) <= 1e+262) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))) / Float64(0.0 - B_m)); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+262], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+262}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}}{0 - B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6429.6
Simplified29.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.8
Simplified21.8%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) < 1e262Initial program 34.1%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified17.6%
sub0-negN/A
distribute-frac-neg2N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
Applied egg-rr17.7%
if 1e262 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.3%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6428.9
Simplified28.9%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6429.1
Applied egg-rr29.1%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6442.7
Applied egg-rr42.7%
Final simplification26.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-32)
(* -2.0 (/ (sqrt (* C (* F t_0))) t_0))
(/ (* (sqrt 2.0) (* (sqrt F) (sqrt (+ B_m C)))) (- 0.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(-4.0, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = -2.0 * (sqrt((C * (F * t_0))) / t_0);
} else {
tmp = (sqrt(2.0) * (sqrt(F) * sqrt((B_m + C)))) / (0.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(-4.0, Float64(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(-2.0 * Float64(sqrt(Float64(C * Float64(F * t_0))) / t_0)); else tmp = Float64(Float64(sqrt(2.0) * Float64(sqrt(F) * sqrt(Float64(B_m + C)))) / Float64(0.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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(-2.0 * N[(N[Sqrt[N[(C * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot \left(F \cdot t\_0\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + C}\right)}{0 - B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6429.6
Simplified29.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.7
Simplified29.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
/-lowering-/.f64N/A
Simplified29.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.2%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified9.2%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6410.0
Applied egg-rr10.0%
Taylor expanded in B around inf
Simplified29.9%
Final simplification29.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
(if (<= (pow B_m 2.0) 1e-32)
(/
(* 2.0 (sqrt (* (fma B_m B_m (* -4.0 (* A C))) (* C F))))
(* -4.0 (- 0.0 (* A C))))
(/ (* (sqrt 2.0) (* (sqrt F) (sqrt (+ B_m C)))) (- 0.0 B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-32) {
tmp = (2.0 * sqrt((fma(B_m, B_m, (-4.0 * (A * C))) * (C * F)))) / (-4.0 * (0.0 - (A * C)));
} else {
tmp = (sqrt(2.0) * (sqrt(F) * sqrt((B_m + C)))) / (0.0 - B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(Float64(2.0 * sqrt(Float64(fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) * Float64(C * F)))) / Float64(-4.0 * Float64(0.0 - Float64(A * C)))); else tmp = Float64(Float64(sqrt(2.0) * Float64(sqrt(F) * sqrt(Float64(B_m + C)))) / Float64(0.0 - B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(N[(2.0 * N[Sqrt[N[(N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(0.0 - N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;\frac{2 \cdot \sqrt{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right) \cdot \left(C \cdot F\right)}}{-4 \cdot \left(0 - A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + C}\right)}{0 - B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6429.6
Simplified29.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.7
Simplified29.7%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6428.6
Simplified28.6%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.2%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified9.2%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6410.0
Applied egg-rr10.0%
Taylor expanded in B around inf
Simplified29.9%
Final simplification29.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 2e-127) (* -2.0 (sqrt (/ (* C F) (fma B_m B_m (* -4.0 (* A C)))))) (/ (* (sqrt 2.0) (* (sqrt F) (sqrt (+ B_m C)))) (- 0.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-127) {
tmp = -2.0 * sqrt(((C * F) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else {
tmp = (sqrt(2.0) * (sqrt(F) * sqrt((B_m + C)))) / (0.0 - B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-127) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); else tmp = Float64(Float64(sqrt(2.0) * Float64(sqrt(F) * sqrt(Float64(B_m + C)))) / Float64(0.0 - B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-127], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-127}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + C}\right)}{0 - B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-127Initial program 14.8%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6430.2
Simplified30.2%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6422.9
Simplified22.9%
if 2.0000000000000001e-127 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.2%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified10.4%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6411.1
Applied egg-rr11.1%
Taylor expanded in B around inf
Simplified28.9%
Final simplification26.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 1e-32) (* -2.0 (sqrt (/ (* C F) (fma B_m B_m (* -4.0 (* A C)))))) (/ (sqrt (* 2.0 F)) (- 0.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 (pow(B_m, 2.0) <= 1e-32) {
tmp = -2.0 * sqrt(((C * F) / fma(B_m, B_m, (-4.0 * (A * C)))));
} else {
tmp = sqrt((2.0 * F)) / (0.0 - sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-32) tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C)))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - 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[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-32], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-32}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-32Initial program 16.2%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6429.6
Simplified29.6%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.8
Simplified21.8%
if 1.00000000000000006e-32 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6422.1
Simplified22.1%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6422.3
Applied egg-rr22.3%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6430.3
Applied egg-rr30.3%
Final simplification26.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (fma B_m B_m 0.0))))
(if (<= B_m 5.2e-14)
(/ (* (sqrt (* t_0 (* C F))) -2.0) t_0)
(if (<= B_m 1.7e+138)
(*
(sqrt (* 2.0 (+ C (sqrt (fma B_m B_m (fma C C 0.0))))))
(* (sqrt F) (/ -1.0 B_m)))
(* (sqrt (/ 2.0 B_m)) (- 0.0 (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(C, (A * -4.0), fma(B_m, B_m, 0.0));
double tmp;
if (B_m <= 5.2e-14) {
tmp = (sqrt((t_0 * (C * F))) * -2.0) / t_0;
} else if (B_m <= 1.7e+138) {
tmp = sqrt((2.0 * (C + sqrt(fma(B_m, B_m, fma(C, C, 0.0)))))) * (sqrt(F) * (-1.0 / B_m));
} else {
tmp = sqrt((2.0 / B_m)) * (0.0 - 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(C, Float64(A * -4.0), fma(B_m, B_m, 0.0)) tmp = 0.0 if (B_m <= 5.2e-14) tmp = Float64(Float64(sqrt(Float64(t_0 * Float64(C * F))) * -2.0) / t_0); elseif (B_m <= 1.7e+138) tmp = Float64(sqrt(Float64(2.0 * Float64(C + sqrt(fma(B_m, B_m, fma(C, C, 0.0)))))) * Float64(sqrt(F) * Float64(-1.0 / B_m))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(0.0 - sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m + 0.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5.2e-14], N[(N[(N[Sqrt[N[(t$95$0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 1.7e+138], N[(N[Sqrt[N[(2.0 * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C + 0.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * N[(0.0 - 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(C, A \cdot -4, \mathsf{fma}\left(B\_m, B\_m, 0\right)\right)\\
\mathbf{if}\;B\_m \leq 5.2 \cdot 10^{-14}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(C \cdot F\right)} \cdot -2}{t\_0}\\
\mathbf{elif}\;B\_m \leq 1.7 \cdot 10^{+138}:\\
\;\;\;\;\sqrt{2 \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \mathsf{fma}\left(C, C, 0\right)\right)}\right)} \cdot \left(\sqrt{F} \cdot \frac{-1}{B\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(0 - \sqrt{F}\right)\\
\end{array}
\end{array}
if B < 5.19999999999999993e-14Initial program 15.7%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6421.7
Simplified21.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.7
Simplified21.7%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr21.7%
if 5.19999999999999993e-14 < B < 1.70000000000000006e138Initial program 37.9%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified34.2%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6434.1
Applied egg-rr34.1%
div-invN/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr34.3%
if 1.70000000000000006e138 < B Initial program 0.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6454.3
Simplified54.3%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6454.6
Applied egg-rr54.6%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
sqrt-undivN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6484.1
Applied egg-rr84.1%
Final simplification31.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 C (* A -4.0) (fma B_m B_m 0.0))))
(if (<= B_m 2.4e-14)
(/ (* (sqrt (* t_0 (* C F))) -2.0) t_0)
(if (<= B_m 2.1e+134)
(/
(* (sqrt (* 2.0 F)) (sqrt (+ C (sqrt (fma B_m B_m (fma C C 0.0))))))
(- 0.0 B_m))
(* (sqrt (/ 2.0 B_m)) (- 0.0 (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(C, (A * -4.0), fma(B_m, B_m, 0.0));
double tmp;
if (B_m <= 2.4e-14) {
tmp = (sqrt((t_0 * (C * F))) * -2.0) / t_0;
} else if (B_m <= 2.1e+134) {
tmp = (sqrt((2.0 * F)) * sqrt((C + sqrt(fma(B_m, B_m, fma(C, C, 0.0)))))) / (0.0 - B_m);
} else {
tmp = sqrt((2.0 / B_m)) * (0.0 - 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(C, Float64(A * -4.0), fma(B_m, B_m, 0.0)) tmp = 0.0 if (B_m <= 2.4e-14) tmp = Float64(Float64(sqrt(Float64(t_0 * Float64(C * F))) * -2.0) / t_0); elseif (B_m <= 2.1e+134) tmp = Float64(Float64(sqrt(Float64(2.0 * F)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, fma(C, C, 0.0)))))) / Float64(0.0 - B_m)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(0.0 - sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B$95$m * B$95$m + 0.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.4e-14], N[(N[(N[Sqrt[N[(t$95$0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 2.1e+134], N[(N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C + 0.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * N[(0.0 - 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(C, A \cdot -4, \mathsf{fma}\left(B\_m, B\_m, 0\right)\right)\\
\mathbf{if}\;B\_m \leq 2.4 \cdot 10^{-14}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(C \cdot F\right)} \cdot -2}{t\_0}\\
\mathbf{elif}\;B\_m \leq 2.1 \cdot 10^{+134}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \mathsf{fma}\left(C, C, 0\right)\right)}}}{0 - B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(0 - \sqrt{F}\right)\\
\end{array}
\end{array}
if B < 2.4e-14Initial program 15.7%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6421.7
Simplified21.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.7
Simplified21.7%
pow2N/A
associate-*l*N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr21.7%
if 2.4e-14 < B < 2.1000000000000001e134Initial program 37.9%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified34.2%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6434.1
Applied egg-rr34.1%
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
distribute-rgt-outN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6434.3
Applied egg-rr34.3%
if 2.1000000000000001e134 < B Initial program 0.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6454.3
Simplified54.3%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6454.6
Applied egg-rr54.6%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
sqrt-undivN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6484.1
Applied egg-rr84.1%
Final simplification31.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 (* A C) (* B_m B_m))))
(if (<= B_m 3.3e-14)
(* -2.0 (/ (sqrt (* C (* F t_0))) t_0))
(if (<= B_m 9e+133)
(/
(* (sqrt (* 2.0 F)) (sqrt (+ C (sqrt (fma B_m B_m (fma C C 0.0))))))
(- 0.0 B_m))
(* (sqrt (/ 2.0 B_m)) (- 0.0 (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, (A * C), (B_m * B_m));
double tmp;
if (B_m <= 3.3e-14) {
tmp = -2.0 * (sqrt((C * (F * t_0))) / t_0);
} else if (B_m <= 9e+133) {
tmp = (sqrt((2.0 * F)) * sqrt((C + sqrt(fma(B_m, B_m, fma(C, C, 0.0)))))) / (0.0 - B_m);
} else {
tmp = sqrt((2.0 / B_m)) * (0.0 - 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(A * C), Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 3.3e-14) tmp = Float64(-2.0 * Float64(sqrt(Float64(C * Float64(F * t_0))) / t_0)); elseif (B_m <= 9e+133) tmp = Float64(Float64(sqrt(Float64(2.0 * F)) * sqrt(Float64(C + sqrt(fma(B_m, B_m, fma(C, C, 0.0)))))) / Float64(0.0 - B_m)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(0.0 - 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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 3.3e-14], N[(-2.0 * N[(N[Sqrt[N[(C * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 9e+133], N[(N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C + 0.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(0.0 - B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * N[(0.0 - 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, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 3.3 \cdot 10^{-14}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{C \cdot \left(F \cdot t\_0\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 9 \cdot 10^{+133}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \mathsf{fma}\left(C, C, 0\right)\right)}}}{0 - B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(0 - \sqrt{F}\right)\\
\end{array}
\end{array}
if B < 3.2999999999999998e-14Initial program 15.7%
Taylor expanded in A around -inf
*-commutativeN/A
metadata-evalN/A
distribute-lft-inN/A
mul0-lftN/A
metadata-evalN/A
distribute-lft1-inN/A
distribute-lft-inN/A
distribute-rgt-inN/A
distribute-lft1-inN/A
metadata-evalN/A
mul0-lftN/A
mul0-lftN/A
accelerator-lowering-fma.f6421.7
Simplified21.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6421.7
Simplified21.7%
Taylor expanded in F around 0
*-lowering-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
/-lowering-/.f64N/A
Simplified21.7%
if 3.2999999999999998e-14 < B < 8.9999999999999997e133Initial program 37.9%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified34.2%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6434.1
Applied egg-rr34.1%
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
distribute-rgt-outN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6434.3
Applied egg-rr34.3%
if 8.9999999999999997e133 < B Initial program 0.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6454.3
Simplified54.3%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6454.6
Applied egg-rr54.6%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
sqrt-undivN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6484.1
Applied egg-rr84.1%
Final simplification31.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 (if (<= C 5.8e+192) (/ (sqrt (* 2.0 F)) (- 0.0 (sqrt B_m))) (/ (* -2.0 (sqrt (* C F))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 5.8e+192) {
tmp = sqrt((2.0 * F)) / (0.0 - sqrt(B_m));
} else {
tmp = (-2.0 * sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 5.8d+192) then
tmp = sqrt((2.0d0 * f)) / (0.0d0 - sqrt(b_m))
else
tmp = ((-2.0d0) * sqrt((c * f))) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 5.8e+192) {
tmp = Math.sqrt((2.0 * F)) / (0.0 - Math.sqrt(B_m));
} else {
tmp = (-2.0 * Math.sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 5.8e+192: tmp = math.sqrt((2.0 * F)) / (0.0 - math.sqrt(B_m)) else: tmp = (-2.0 * math.sqrt((C * F))) / B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 5.8e+192) tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(0.0 - sqrt(B_m))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(C * F))) / B_m); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 5.8e+192)
tmp = sqrt((2.0 * F)) / (0.0 - sqrt(B_m));
else
tmp = (-2.0 * sqrt((C * F))) / B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 5.8e+192], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[(0.0 - N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 5.8 \cdot 10^{+192}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{0 - \sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 5.8000000000000003e192Initial program 18.0%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.2
Simplified15.2%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6415.3
Applied egg-rr15.3%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6420.1
Applied egg-rr20.1%
if 5.8000000000000003e192 < C Initial program 1.8%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified1.4%
Taylor expanded in C around inf
mul-1-negN/A
associate-*l/N/A
*-commutativeN/A
distribute-neg-fracN/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
distribute-lft-neg-inN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.8
Simplified8.8%
Final simplification18.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 (if (<= C 4.5e+192) (- 0.0 (/ (sqrt F) (sqrt (* B_m 0.5)))) (/ (* -2.0 (sqrt (* C F))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 4.5e+192) {
tmp = 0.0 - (sqrt(F) / sqrt((B_m * 0.5)));
} else {
tmp = (-2.0 * sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 4.5d+192) then
tmp = 0.0d0 - (sqrt(f) / sqrt((b_m * 0.5d0)))
else
tmp = ((-2.0d0) * sqrt((c * f))) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 4.5e+192) {
tmp = 0.0 - (Math.sqrt(F) / Math.sqrt((B_m * 0.5)));
} else {
tmp = (-2.0 * Math.sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 4.5e+192: tmp = 0.0 - (math.sqrt(F) / math.sqrt((B_m * 0.5))) else: tmp = (-2.0 * math.sqrt((C * F))) / B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 4.5e+192) tmp = Float64(0.0 - Float64(sqrt(F) / sqrt(Float64(B_m * 0.5)))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(C * F))) / B_m); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 4.5e+192)
tmp = 0.0 - (sqrt(F) / sqrt((B_m * 0.5)));
else
tmp = (-2.0 * sqrt((C * F))) / B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 4.5e+192], N[(0.0 - N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 4.5 \cdot 10^{+192}:\\
\;\;\;\;0 - \frac{\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 4.5e192Initial program 18.0%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.2
Simplified15.2%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6415.3
Applied egg-rr15.3%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
sqrt-undivN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6420.1
Applied egg-rr20.1%
sqrt-undivN/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6420.1
Applied egg-rr20.1%
if 4.5e192 < C Initial program 1.8%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified1.4%
Taylor expanded in C around inf
mul-1-negN/A
associate-*l/N/A
*-commutativeN/A
distribute-neg-fracN/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
distribute-lft-neg-inN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.8
Simplified8.8%
Final simplification18.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 (if (<= C 7.6e+192) (* (sqrt (/ 2.0 B_m)) (- 0.0 (sqrt F))) (/ (* -2.0 (sqrt (* C F))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 7.6e+192) {
tmp = sqrt((2.0 / B_m)) * (0.0 - sqrt(F));
} else {
tmp = (-2.0 * sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 7.6d+192) then
tmp = sqrt((2.0d0 / b_m)) * (0.0d0 - sqrt(f))
else
tmp = ((-2.0d0) * sqrt((c * f))) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 7.6e+192) {
tmp = Math.sqrt((2.0 / B_m)) * (0.0 - Math.sqrt(F));
} else {
tmp = (-2.0 * Math.sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 7.6e+192: tmp = math.sqrt((2.0 / B_m)) * (0.0 - math.sqrt(F)) else: tmp = (-2.0 * math.sqrt((C * F))) / B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 7.6e+192) tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(0.0 - sqrt(F))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(C * F))) / B_m); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 7.6e+192)
tmp = sqrt((2.0 / B_m)) * (0.0 - sqrt(F));
else
tmp = (-2.0 * sqrt((C * F))) / B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 7.6e+192], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * N[(0.0 - N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 7.6 \cdot 10^{+192}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(0 - \sqrt{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 7.5999999999999999e192Initial program 18.0%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.2
Simplified15.2%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6415.3
Applied egg-rr15.3%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
sqrt-undivN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6420.0
Applied egg-rr20.0%
if 7.5999999999999999e192 < C Initial program 1.8%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified1.4%
Taylor expanded in C around inf
mul-1-negN/A
associate-*l/N/A
*-commutativeN/A
distribute-neg-fracN/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
distribute-lft-neg-inN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.8
Simplified8.8%
Final simplification18.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 (if (<= C 4.7e+108) (- 0.0 (sqrt (/ (* 2.0 F) B_m))) (/ (* -2.0 (sqrt (* C F))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 4.7e+108) {
tmp = 0.0 - sqrt(((2.0 * F) / B_m));
} else {
tmp = (-2.0 * sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 4.7d+108) then
tmp = 0.0d0 - sqrt(((2.0d0 * f) / b_m))
else
tmp = ((-2.0d0) * sqrt((c * f))) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 4.7e+108) {
tmp = 0.0 - Math.sqrt(((2.0 * F) / B_m));
} else {
tmp = (-2.0 * Math.sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 4.7e+108: tmp = 0.0 - math.sqrt(((2.0 * F) / B_m)) else: tmp = (-2.0 * math.sqrt((C * F))) / B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 4.7e+108) tmp = Float64(0.0 - sqrt(Float64(Float64(2.0 * F) / B_m))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(C * F))) / B_m); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 4.7e+108)
tmp = 0.0 - sqrt(((2.0 * F) / B_m));
else
tmp = (-2.0 * sqrt((C * F))) / B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 4.7e+108], N[(0.0 - N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 4.7 \cdot 10^{+108}:\\
\;\;\;\;0 - \sqrt{\frac{2 \cdot F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 4.6999999999999996e108Initial program 18.5%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6415.9
Simplified15.9%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6416.0
Applied egg-rr16.0%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f6416.0
Applied egg-rr16.0%
if 4.6999999999999996e108 < C Initial program 6.3%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified3.8%
Taylor expanded in C around inf
mul-1-negN/A
associate-*l/N/A
*-commutativeN/A
distribute-neg-fracN/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
distribute-lft-neg-inN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f648.5
Simplified8.5%
Final simplification14.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 (- 0.0 (sqrt (fabs (fma F (/ 2.0 B_m) 0.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 0.0 - sqrt(fabs(fma(F, (2.0 / B_m), 0.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(0.0 - sqrt(abs(fma(F, Float64(2.0 / B_m), 0.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[(0.0 - N[Sqrt[N[Abs[N[(F * N[(2.0 / B$95$m), $MachinePrecision] + 0.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])\\
\\
0 - \sqrt{\left|\mathsf{fma}\left(F, \frac{2}{B\_m}, 0\right)\right|}
\end{array}
Initial program 16.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.8
Simplified13.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6413.9
Applied egg-rr13.9%
+-rgt-identityN/A
rem-square-sqrtN/A
sqrt-unprodN/A
rem-sqrt-squareN/A
fabs-lowering-fabs.f64N/A
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6424.7
Applied egg-rr24.7%
Final simplification24.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 (- 0.0 (sqrt (/ (* 2.0 F) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return 0.0 - sqrt(((2.0 * F) / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = 0.0d0 - sqrt(((2.0d0 * f) / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return 0.0 - Math.sqrt(((2.0 * F) / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return 0.0 - math.sqrt(((2.0 * F) / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(0.0 - sqrt(Float64(Float64(2.0 * F) / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = 0.0 - sqrt(((2.0 * F) / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(0.0 - N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / 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])\\
\\
0 - \sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 16.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.8
Simplified13.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6413.9
Applied egg-rr13.9%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f6413.9
Applied egg-rr13.9%
Final simplification13.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 (- 0.0 (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 0.0 - 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 = 0.0d0 - 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 0.0 - 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 0.0 - 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(0.0 - 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 = 0.0 - 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[(0.0 - N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
0 - \sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 16.2%
Taylor expanded in B around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6413.8
Simplified13.8%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-unprodN/A
+-lft-identityN/A
+-commutativeN/A
distribute-rgt-outN/A
sqrt-unprodN/A
sqrt-unprodN/A
rem-square-sqrtN/A
mul0-lftN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f6413.9
Applied egg-rr13.9%
+-rgt-identityN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6413.9
Applied egg-rr13.9%
Final simplification13.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 (/ 0.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 0.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 = 0.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 0.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 0.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(0.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 = 0.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[(0.0 / B$95$m), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{0}{B\_m}
\end{array}
Initial program 16.2%
Taylor expanded in A around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified7.9%
Taylor expanded in C around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f643.9
Simplified3.9%
Taylor expanded in F around 0
Simplified3.9%
Final simplification3.9%
herbie shell --seed 2024198
(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))))