
(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 16 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}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B 2.0)))
(t_2 (- (pow B 2.0) t_0))
(t_3 (* 2.0 (* t_2 F)))
(t_4
(/
(sqrt (* t_3 (- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_1)))
(if (<= t_4 (- INFINITY))
(/ (* (* -2.0 (sqrt (* A F))) (sqrt (fma C (* A -4.0) (* B B)))) t_2)
(if (<= t_4 -1e-217)
(/
(sqrt
(*
t_3
(fma
(* (+ A C) (- A C))
(/ 1.0 (- A C))
(- (sqrt (fma (- A C) (- A C) (* B B)))))))
t_1)
(if (<= t_4 INFINITY)
(/ (sqrt (* t_3 (+ A (fma (/ (* B B) C) -0.5 A)))) t_1)
(/ (* (sqrt (* 2.0 (* F (* -8.0 (* A C))))) (sqrt A)) t_1))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - pow(B, 2.0);
double t_2 = pow(B, 2.0) - t_0;
double t_3 = 2.0 * (t_2 * F);
double t_4 = sqrt((t_3 * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_1;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = ((-2.0 * sqrt((A * F))) * sqrt(fma(C, (A * -4.0), (B * B)))) / t_2;
} else if (t_4 <= -1e-217) {
tmp = sqrt((t_3 * fma(((A + C) * (A - C)), (1.0 / (A - C)), -sqrt(fma((A - C), (A - C), (B * B)))))) / t_1;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * (A + fma(((B * B) / C), -0.5, A)))) / t_1;
} else {
tmp = (sqrt((2.0 * (F * (-8.0 * (A * C))))) * sqrt(A)) / t_1;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B ^ 2.0)) t_2 = Float64((B ^ 2.0) - t_0) t_3 = Float64(2.0 * Float64(t_2 * F)) t_4 = Float64(sqrt(Float64(t_3 * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_1) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-2.0 * sqrt(Float64(A * F))) * sqrt(fma(C, Float64(A * -4.0), Float64(B * B)))) / t_2); elseif (t_4 <= -1e-217) tmp = Float64(sqrt(Float64(t_3 * fma(Float64(Float64(A + C) * Float64(A - C)), Float64(1.0 / Float64(A - C)), Float64(-sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))))) / t_1); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_3 * Float64(A + fma(Float64(Float64(B * B) / C), -0.5, A)))) / t_1); else tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(-8.0 * Float64(A * C))))) * sqrt(A)) / t_1); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$3 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[(-2.0 * N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-217], N[(N[Sqrt[N[(t$95$3 * N[(N[(N[(A + C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(A - C), $MachinePrecision]), $MachinePrecision] + (-N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$3 * N[(A + N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(-8.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B}^{2}\\
t_2 := {B}^{2} - t\_0\\
t_3 := 2 \cdot \left(t\_2 \cdot F\right)\\
t_4 := \frac{\sqrt{t\_3 \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\left(-2 \cdot \sqrt{A \cdot F}\right) \cdot \sqrt{\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \mathsf{fma}\left(\left(A + C\right) \cdot \left(A - C\right), \frac{1}{A - C}, -\sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{t\_1}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \left(A + \mathsf{fma}\left(\frac{B \cdot B}{C}, -0.5, A\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(-8 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{A}}{t\_1}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6420.4
Simplified20.4%
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-*.f6420.5
Simplified20.5%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
pow2N/A
associate-*l*N/A
Applied egg-rr24.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000008e-217Initial program 99.0%
sub-negN/A
flip-+N/A
div-invN/A
accelerator-lowering-fma.f64N/A
sqr-negN/A
difference-of-squaresN/A
sub-negN/A
flip--N/A
sqr-negN/A
sub-negN/A
flip-+N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr99.0%
if -1.00000000000000008e-217 < (/.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 19.6%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6429.6
Simplified29.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 C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f645.6
Simplified5.6%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f645.3
Simplified5.3%
count-2N/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
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f647.9
Applied egg-rr7.9%
Final simplification29.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- t_0 (pow B 2.0)))
(t_2 (- (pow B 2.0) t_0))
(t_3 (* 2.0 (* t_2 F)))
(t_4
(/
(sqrt (* t_3 (- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_1))
(t_5 (fma B B (* -4.0 (* A C)))))
(if (<= t_4 (- INFINITY))
(/ (* (* -2.0 (sqrt (* A F))) (sqrt (fma C (* A -4.0) (* B B)))) t_2)
(if (<= t_4 -1e-217)
(/
-1.0
(/
t_5
(sqrt
(*
(* (* 2.0 F) t_5)
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))))
(if (<= t_4 INFINITY)
(/ (sqrt (* t_3 (+ A (fma (/ (* B B) C) -0.5 A)))) t_1)
(/ (* (sqrt (* 2.0 (* F (* -8.0 (* A C))))) (sqrt A)) t_1))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - pow(B, 2.0);
double t_2 = pow(B, 2.0) - t_0;
double t_3 = 2.0 * (t_2 * F);
double t_4 = sqrt((t_3 * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_1;
double t_5 = fma(B, B, (-4.0 * (A * C)));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = ((-2.0 * sqrt((A * F))) * sqrt(fma(C, (A * -4.0), (B * B)))) / t_2;
} else if (t_4 <= -1e-217) {
tmp = -1.0 / (t_5 / sqrt((((2.0 * F) * t_5) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * (A + fma(((B * B) / C), -0.5, A)))) / t_1;
} else {
tmp = (sqrt((2.0 * (F * (-8.0 * (A * C))))) * sqrt(A)) / t_1;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B ^ 2.0)) t_2 = Float64((B ^ 2.0) - t_0) t_3 = Float64(2.0 * Float64(t_2 * F)) t_4 = Float64(sqrt(Float64(t_3 * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_1) t_5 = fma(B, B, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-2.0 * sqrt(Float64(A * F))) * sqrt(fma(C, Float64(A * -4.0), Float64(B * B)))) / t_2); elseif (t_4 <= -1e-217) tmp = Float64(-1.0 / Float64(t_5 / sqrt(Float64(Float64(Float64(2.0 * F) * t_5) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))))); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_3 * Float64(A + fma(Float64(Float64(B * B) / C), -0.5, A)))) / t_1); else tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(-8.0 * Float64(A * C))))) * sqrt(A)) / t_1); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$3 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$5 = N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[(-2.0 * N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-217], N[(-1.0 / N[(t$95$5 / N[Sqrt[N[(N[(N[(2.0 * F), $MachinePrecision] * t$95$5), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$3 * N[(A + N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(-8.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B}^{2}\\
t_2 := {B}^{2} - t\_0\\
t_3 := 2 \cdot \left(t\_2 \cdot F\right)\\
t_4 := \frac{\sqrt{t\_3 \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1}\\
t_5 := \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\left(-2 \cdot \sqrt{A \cdot F}\right) \cdot \sqrt{\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-217}:\\
\;\;\;\;\frac{-1}{\frac{t\_5}{\sqrt{\left(\left(2 \cdot F\right) \cdot t\_5\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \left(A + \mathsf{fma}\left(\frac{B \cdot B}{C}, -0.5, A\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(-8 \cdot \left(A \cdot C\right)\right)\right)} \cdot \sqrt{A}}{t\_1}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6420.4
Simplified20.4%
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-*.f6420.5
Simplified20.5%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
pow2N/A
associate-*l*N/A
Applied egg-rr24.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000008e-217Initial program 99.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr99.0%
if -1.00000000000000008e-217 < (/.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 19.6%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6429.6
Simplified29.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 C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f645.6
Simplified5.6%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f645.3
Simplified5.3%
count-2N/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
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f647.9
Applied egg-rr7.9%
Final simplification29.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C)))
(t_1 (fma C (* A -4.0) (* B B)))
(t_2 (* (* 4.0 A) C))
(t_3 (- (pow B 2.0) t_2))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B 2.0))))
(t_5 (fma B B t_0)))
(if (<= t_4 (- INFINITY))
(/ (* (* -2.0 (sqrt (* A F))) (sqrt t_1)) t_3)
(if (<= t_4 -1e-217)
(/
-1.0
(/
t_5
(sqrt
(*
(* (* 2.0 F) t_5)
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))))
(/ 1.0 (/ t_1 (* -2.0 (sqrt (* A (* F t_0))))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double t_1 = fma(C, (A * -4.0), (B * B));
double t_2 = (4.0 * A) * C;
double t_3 = pow(B, 2.0) - t_2;
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B, 2.0));
double t_5 = fma(B, B, t_0);
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = ((-2.0 * sqrt((A * F))) * sqrt(t_1)) / t_3;
} else if (t_4 <= -1e-217) {
tmp = -1.0 / (t_5 / sqrt((((2.0 * F) * t_5) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))));
} else {
tmp = 1.0 / (t_1 / (-2.0 * sqrt((A * (F * t_0)))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = fma(C, Float64(A * -4.0), Float64(B * B)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64((B ^ 2.0) - t_2) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B ^ 2.0))) t_5 = fma(B, B, t_0) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-2.0 * sqrt(Float64(A * F))) * sqrt(t_1)) / t_3); elseif (t_4 <= -1e-217) tmp = Float64(-1.0 / Float64(t_5 / sqrt(Float64(Float64(Float64(2.0 * F) * t_5) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))))); else tmp = Float64(1.0 / Float64(t_1 / Float64(-2.0 * sqrt(Float64(A * Float64(F * t_0)))))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(B * B + t$95$0), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[(-2.0 * N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -1e-217], N[(-1.0 / N[(t$95$5 / N[Sqrt[N[(N[(N[(2.0 * F), $MachinePrecision] * t$95$5), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$1 / N[(-2.0 * N[Sqrt[N[(A * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := {B}^{2} - t\_2\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B}^{2}}\\
t_5 := \mathsf{fma}\left(B, B, t\_0\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\left(-2 \cdot \sqrt{A \cdot F}\right) \cdot \sqrt{t\_1}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-217}:\\
\;\;\;\;\frac{-1}{\frac{t\_5}{\sqrt{\left(\left(2 \cdot F\right) \cdot t\_5\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t\_1}{-2 \cdot \sqrt{A \cdot \left(F \cdot t\_0\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6420.4
Simplified20.4%
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-*.f6420.5
Simplified20.5%
pow1/2N/A
*-commutativeN/A
unpow-prod-downN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
pow2N/A
associate-*l*N/A
Applied egg-rr24.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000008e-217Initial program 99.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr99.0%
if -1.00000000000000008e-217 < (/.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 7.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6411.4
Simplified11.4%
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-*.f6411.3
Simplified11.3%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr11.3%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f6412.4
Simplified12.4%
Final simplification27.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0))))
(t_3 (fma C (* A -4.0) (* B B)))
(t_4 (fma B B t_0)))
(if (<= t_2 (- INFINITY))
(/ 1.0 (/ t_3 (* -2.0 (* (sqrt (* A F)) (sqrt t_3)))))
(if (<= t_2 -1e-217)
(/
-1.0
(/
t_4
(sqrt
(*
(* (* 2.0 F) t_4)
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))))
(/ 1.0 (/ t_3 (* -2.0 (sqrt (* A (* F t_0))))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double t_3 = fma(C, (A * -4.0), (B * B));
double t_4 = fma(B, B, t_0);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = 1.0 / (t_3 / (-2.0 * (sqrt((A * F)) * sqrt(t_3))));
} else if (t_2 <= -1e-217) {
tmp = -1.0 / (t_4 / sqrt((((2.0 * F) * t_4) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))));
} else {
tmp = 1.0 / (t_3 / (-2.0 * sqrt((A * (F * t_0)))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) t_3 = fma(C, Float64(A * -4.0), Float64(B * B)) t_4 = fma(B, B, t_0) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(1.0 / Float64(t_3 / Float64(-2.0 * Float64(sqrt(Float64(A * F)) * sqrt(t_3))))); elseif (t_2 <= -1e-217) tmp = Float64(-1.0 / Float64(t_4 / sqrt(Float64(Float64(Float64(2.0 * F) * t_4) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))))); else tmp = Float64(1.0 / Float64(t_3 / Float64(-2.0 * sqrt(Float64(A * Float64(F * t_0)))))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(B * B + t$95$0), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(1.0 / N[(t$95$3 / N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-217], N[(-1.0 / N[(t$95$4 / N[Sqrt[N[(N[(N[(2.0 * F), $MachinePrecision] * t$95$4), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$3 / N[(-2.0 * N[Sqrt[N[(A * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
t_3 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_4 := \mathsf{fma}\left(B, B, t\_0\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{1}{\frac{t\_3}{-2 \cdot \left(\sqrt{A \cdot F} \cdot \sqrt{t\_3}\right)}}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-217}:\\
\;\;\;\;\frac{-1}{\frac{t\_4}{\sqrt{\left(\left(2 \cdot F\right) \cdot t\_4\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t\_3}{-2 \cdot \sqrt{A \cdot \left(F \cdot t\_0\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6420.4
Simplified20.4%
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-*.f6420.5
Simplified20.5%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr20.5%
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6424.8
Applied egg-rr24.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000008e-217Initial program 99.0%
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr99.0%
if -1.00000000000000008e-217 < (/.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 7.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6411.4
Simplified11.4%
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-*.f6411.3
Simplified11.3%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr11.3%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f6412.4
Simplified12.4%
Final simplification27.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (* -4.0 (* A C)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B 2.0)))))
(if (<= t_3 (- INFINITY))
(/ 1.0 (/ t_0 (* -2.0 (* (sqrt (* A F)) (sqrt t_0)))))
(if (<= t_3 -1e-217)
(/
(sqrt
(*
(* (* 2.0 F) (fma B B t_1))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))
(fma B (- B) t_2))
(/ 1.0 (/ t_0 (* -2.0 (sqrt (* A (* F t_1))))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = -4.0 * (A * C);
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = 1.0 / (t_0 / (-2.0 * (sqrt((A * F)) * sqrt(t_0))));
} else if (t_3 <= -1e-217) {
tmp = sqrt((((2.0 * F) * fma(B, B, t_1)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))) / fma(B, -B, t_2);
} else {
tmp = 1.0 / (t_0 / (-2.0 * sqrt((A * (F * t_1)))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(-4.0 * Float64(A * C)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(1.0 / Float64(t_0 / Float64(-2.0 * Float64(sqrt(Float64(A * F)) * sqrt(t_0))))); elseif (t_3 <= -1e-217) tmp = Float64(sqrt(Float64(Float64(Float64(2.0 * F) * fma(B, B, t_1)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / fma(B, Float64(-B), t_2)); else tmp = Float64(1.0 / Float64(t_0 / Float64(-2.0 * sqrt(Float64(A * Float64(F * t_1)))))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(1.0 / N[(t$95$0 / N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-217], N[(N[Sqrt[N[(N[(N[(2.0 * F), $MachinePrecision] * N[(B * B + t$95$1), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + t$95$2), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 / N[(-2.0 * N[Sqrt[N[(A * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := -4 \cdot \left(A \cdot C\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{1}{\frac{t\_0}{-2 \cdot \left(\sqrt{A \cdot F} \cdot \sqrt{t\_0}\right)}}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{\left(\left(2 \cdot F\right) \cdot \mathsf{fma}\left(B, B, t\_1\right)\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{\mathsf{fma}\left(B, -B, t\_2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t\_0}{-2 \cdot \sqrt{A \cdot \left(F \cdot t\_1\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6420.4
Simplified20.4%
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-*.f6420.5
Simplified20.5%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr20.5%
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6424.8
Applied egg-rr24.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000008e-217Initial program 99.0%
remove-double-negN/A
frac-2negN/A
/-lowering-/.f64N/A
Applied egg-rr99.0%
if -1.00000000000000008e-217 < (/.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 7.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6411.4
Simplified11.4%
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-*.f6411.3
Simplified11.3%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr11.3%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f6412.4
Simplified12.4%
Final simplification27.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -4e+200)
(/ 1.0 (/ t_0 (* -2.0 (* (sqrt (* A F)) (sqrt t_0)))))
(if (<= t_2 -2e-162)
(*
(sqrt
(/
(* F (- (+ A C) (sqrt (fma B B (* (- A C) (- A C))))))
(fma (* A C) -4.0 (* B B))))
(- (sqrt 2.0)))
(/ 1.0 (/ t_0 (* -2.0 (sqrt (* A (* F (* -4.0 (* A C))))))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -4e+200) {
tmp = 1.0 / (t_0 / (-2.0 * (sqrt((A * F)) * sqrt(t_0))));
} else if (t_2 <= -2e-162) {
tmp = sqrt(((F * ((A + C) - sqrt(fma(B, B, ((A - C) * (A - C)))))) / fma((A * C), -4.0, (B * B)))) * -sqrt(2.0);
} else {
tmp = 1.0 / (t_0 / (-2.0 * sqrt((A * (F * (-4.0 * (A * C)))))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -4e+200) tmp = Float64(1.0 / Float64(t_0 / Float64(-2.0 * Float64(sqrt(Float64(A * F)) * sqrt(t_0))))); elseif (t_2 <= -2e-162) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C)))))) / fma(Float64(A * C), -4.0, Float64(B * B)))) * Float64(-sqrt(2.0))); else tmp = Float64(1.0 / Float64(t_0 / Float64(-2.0 * sqrt(Float64(A * Float64(F * Float64(-4.0 * Float64(A * C)))))))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+200], N[(1.0 / N[(t$95$0 / N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -2e-162], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(1.0 / N[(t$95$0 / N[(-2.0 * N[Sqrt[N[(A * N[(F * N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+200}:\\
\;\;\;\;\frac{1}{\frac{t\_0}{-2 \cdot \left(\sqrt{A \cdot F} \cdot \sqrt{t\_0}\right)}}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-162}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t\_0}{-2 \cdot \sqrt{A \cdot \left(F \cdot \left(-4 \cdot \left(A \cdot C\right)\right)\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.9999999999999999e200Initial program 5.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6420.2
Simplified20.2%
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-*.f6420.3
Simplified20.3%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr20.2%
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6424.5
Applied egg-rr24.5%
if -3.9999999999999999e200 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999991e-162Initial program 98.9%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
Simplified95.1%
if -1.99999999999999991e-162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6411.3
Simplified11.3%
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-*.f6411.2
Simplified11.2%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr11.2%
Taylor expanded in C around inf
*-lowering-*.f64N/A
*-lowering-*.f6412.3
Simplified12.3%
Final simplification25.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -5e-88)
(* -2.0 (sqrt (/ (* A F) (fma B B t_0))))
(if (<= t_2 -2e-162)
(/ (sqrt (* -2.0 (* F (* B (* B B))))) (fma B (- B) t_1))
(/ (sqrt (* (* -8.0 (* A (* C F))) (+ A A))) (- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -5e-88) {
tmp = -2.0 * sqrt(((A * F) / fma(B, B, t_0)));
} else if (t_2 <= -2e-162) {
tmp = sqrt((-2.0 * (F * (B * (B * B))))) / fma(B, -B, t_1);
} else {
tmp = sqrt(((-8.0 * (A * (C * F))) * (A + A))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -5e-88) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(B, B, t_0)))); elseif (t_2 <= -2e-162) tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B * Float64(B * B))))) / fma(B, Float64(-B), t_1)); else tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(A + A))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-88], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(B * B + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -2e-162], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-88}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(B, B, t\_0\right)}}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-162}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B \cdot \left(B \cdot B\right)\right)\right)}}{\mathsf{fma}\left(B, -B, t\_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(A + A\right)}}{-t\_0}\\
\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))) < -5.00000000000000009e-88Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6419.5
Simplified19.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-*.f6419.5
Simplified19.5%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr19.5%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6419.8
Simplified19.8%
if -5.00000000000000009e-88 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999991e-162Initial program 99.7%
remove-double-negN/A
frac-2negN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in B around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6441.4
Simplified41.4%
if -1.99999999999999991e-162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6411.3
Simplified11.3%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f649.6
Simplified9.6%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6410.7
Simplified10.7%
Final simplification14.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C))) (t_1 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))
-2e-162)
(* -2.0 (sqrt (/ (* A F) (fma B B t_0))))
(/ (sqrt (* (* -8.0 (* A (* C F))) (+ A A))) (- t_0)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double t_1 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0))) <= -2e-162) {
tmp = -2.0 * sqrt(((A * F) / fma(B, B, t_0)));
} else {
tmp = sqrt(((-8.0 * (A * (C * F))) * (A + A))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) <= -2e-162) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(B, B, t_0)))); else tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(A + A))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-162], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(B * B + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}} \leq -2 \cdot 10^{-162}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(B, B, t\_0\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(A + A\right)}}{-t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999991e-162Initial program 44.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6419.9
Simplified19.9%
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-*.f6420.0
Simplified20.0%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr20.0%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6420.3
Simplified20.3%
if -1.99999999999999991e-162 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6411.3
Simplified11.3%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f649.6
Simplified9.6%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6410.7
Simplified10.7%
Final simplification13.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C))))
(if (<= (pow B 2.0) 5e-64)
(/ (* -2.0 (sqrt (* (* A F) (fma B B t_0)))) t_0)
(if (<= (pow B 2.0) 2.3e+114)
(/ (sqrt (* -2.0 (* F (* B (* B B))))) (fma B (- B) (* (* 4.0 A) C)))
(* -2.0 (* (sqrt (* A F)) (/ 1.0 B)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double tmp;
if (pow(B, 2.0) <= 5e-64) {
tmp = (-2.0 * sqrt(((A * F) * fma(B, B, t_0)))) / t_0;
} else if (pow(B, 2.0) <= 2.3e+114) {
tmp = sqrt((-2.0 * (F * (B * (B * B))))) / fma(B, -B, ((4.0 * A) * C));
} else {
tmp = -2.0 * (sqrt((A * F)) * (1.0 / B));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if ((B ^ 2.0) <= 5e-64) tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(A * F) * fma(B, B, t_0)))) / t_0); elseif ((B ^ 2.0) <= 2.3e+114) tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B * Float64(B * B))))) / fma(B, Float64(-B), Float64(Float64(4.0 * A) * C))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) * Float64(1.0 / B))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e-64], N[(N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] * N[(B * B + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2.3e+114], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;{B}^{2} \leq 5 \cdot 10^{-64}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(A \cdot F\right) \cdot \mathsf{fma}\left(B, B, t\_0\right)}}{t\_0}\\
\mathbf{elif}\;{B}^{2} \leq 2.3 \cdot 10^{+114}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B \cdot \left(B \cdot B\right)\right)\right)}}{\mathsf{fma}\left(B, -B, \left(4 \cdot A\right) \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{1}{B}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000033e-64Initial program 20.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6426.6
Simplified26.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-*.f6425.7
Simplified25.7%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6425.5
Simplified25.5%
if 5.00000000000000033e-64 < (pow.f64 B #s(literal 2 binary64)) < 2.3e114Initial program 45.7%
remove-double-negN/A
frac-2negN/A
/-lowering-/.f64N/A
Applied egg-rr45.7%
Taylor expanded in B around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6418.7
Simplified18.7%
if 2.3e114 < (pow.f64 B #s(literal 2 binary64)) Initial program 8.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f642.8
Simplified2.8%
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-*.f642.8
Simplified2.8%
Taylor expanded in A around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f646.0
Simplified6.0%
Final simplification16.5%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B))))
(if (<= B 4.4e-32)
(* (sqrt (* A (* F t_0))) (/ -2.0 t_0))
(if (<= B 9e+156)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double tmp;
if (B <= 4.4e-32) {
tmp = sqrt((A * (F * t_0))) * (-2.0 / t_0);
} else if (B <= 9e+156) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) tmp = 0.0 if (B <= 4.4e-32) tmp = Float64(sqrt(Float64(A * Float64(F * t_0))) * Float64(-2.0 / t_0)); elseif (B <= 9e+156) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 4.4e-32], N[(N[Sqrt[N[(A * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 9e+156], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
\mathbf{if}\;B \leq 4.4 \cdot 10^{-32}:\\
\;\;\;\;\sqrt{A \cdot \left(F \cdot t\_0\right)} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;B \leq 9 \cdot 10^{+156}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if B < 4.4e-32Initial program 19.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6416.9
Simplified16.9%
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-*.f6416.3
Simplified16.3%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr16.8%
if 4.4e-32 < B < 9.00000000000000061e156Initial program 36.2%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified34.7%
if 9.00000000000000061e156 < B Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f640.0
Simplified0.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-*.f640.0
Simplified0.0%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.0%
Taylor expanded in C around 0
associate-*r/N/A
*-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f646.6
Simplified6.6%
Final simplification18.7%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C))))
(if (<= B 2.9e-43)
(/ (* -2.0 (sqrt (* (* A F) (fma B B t_0)))) t_0)
(if (<= B 9e+156)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double tmp;
if (B <= 2.9e-43) {
tmp = (-2.0 * sqrt(((A * F) * fma(B, B, t_0)))) / t_0;
} else if (B <= 9e+156) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if (B <= 2.9e-43) tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(A * F) * fma(B, B, t_0)))) / t_0); elseif (B <= 9e+156) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 2.9e-43], N[(N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] * N[(B * B + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[B, 9e+156], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 2.9 \cdot 10^{-43}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(A \cdot F\right) \cdot \mathsf{fma}\left(B, B, t\_0\right)}}{t\_0}\\
\mathbf{elif}\;B \leq 9 \cdot 10^{+156}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if B < 2.9000000000000001e-43Initial program 19.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6416.9
Simplified16.9%
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-*.f6416.4
Simplified16.4%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6416.3
Simplified16.3%
if 2.9000000000000001e-43 < B < 9.00000000000000061e156Initial program 35.5%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified34.1%
if 9.00000000000000061e156 < B Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f640.0
Simplified0.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-*.f640.0
Simplified0.0%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.0%
Taylor expanded in C around 0
associate-*r/N/A
*-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f646.6
Simplified6.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C))))
(if (<= B 1.8e-42)
(/ (* -2.0 (sqrt (* (* A F) (fma B B t_0)))) t_0)
(if (<= B 9e+156)
(* (sqrt (* F (- A (sqrt (fma B B (* A A)))))) (- (/ (sqrt 2.0) B)))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -4.0 * (A * C);
double tmp;
if (B <= 1.8e-42) {
tmp = (-2.0 * sqrt(((A * F) * fma(B, B, t_0)))) / t_0;
} else if (B <= 9e+156) {
tmp = sqrt((F * (A - sqrt(fma(B, B, (A * A)))))) * -(sqrt(2.0) / B);
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if (B <= 1.8e-42) tmp = Float64(Float64(-2.0 * sqrt(Float64(Float64(A * F) * fma(B, B, t_0)))) / t_0); elseif (B <= 9e+156) tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / B))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.8e-42], N[(N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] * N[(B * B + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[B, 9e+156], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision])), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.8 \cdot 10^{-42}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{\left(A \cdot F\right) \cdot \mathsf{fma}\left(B, B, t\_0\right)}}{t\_0}\\
\mathbf{elif}\;B \leq 9 \cdot 10^{+156}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if B < 1.8000000000000001e-42Initial program 19.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6416.9
Simplified16.9%
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-*.f6416.4
Simplified16.4%
Taylor expanded in B around 0
*-lowering-*.f64N/A
*-lowering-*.f6416.3
Simplified16.3%
if 1.8000000000000001e-42 < B < 9.00000000000000061e156Initial program 35.5%
remove-double-negN/A
frac-2negN/A
/-lowering-/.f64N/A
Applied egg-rr35.5%
Taylor expanded in C around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6434.1
Simplified34.1%
if 9.00000000000000061e156 < B Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f640.0
Simplified0.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-*.f640.0
Simplified0.0%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr0.0%
Taylor expanded in C around 0
associate-*r/N/A
*-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f646.6
Simplified6.6%
Final simplification18.3%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* -2.0 (sqrt (/ (* A F) (fma B B (* -4.0 (* A C)))))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return -2.0 * sqrt(((A * F) / fma(B, B, (-4.0 * (A * C)))));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(B, B, Float64(-4.0 * Float64(A * C)))))) end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)}}
\end{array}
Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6414.1
Simplified14.1%
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-*.f6414.1
Simplified14.1%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr14.1%
Taylor expanded in F around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f649.5
Simplified9.5%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* -2.0 (* (sqrt (* A F)) (/ 1.0 B))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return -2.0 * (sqrt((A * F)) * (1.0 / B));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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
code = (-2.0d0) * (sqrt((a * f)) * (1.0d0 / b))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return -2.0 * (Math.sqrt((A * F)) * (1.0 / B));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return -2.0 * (math.sqrt((A * F)) * (1.0 / B))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(-2.0 * Float64(sqrt(Float64(A * F)) * Float64(1.0 / B))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = -2.0 * (sqrt((A * F)) * (1.0 / B));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
-2 \cdot \left(\sqrt{A \cdot F} \cdot \frac{1}{B}\right)
\end{array}
Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6414.1
Simplified14.1%
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-*.f6414.1
Simplified14.1%
Taylor expanded in A around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f643.9
Simplified3.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* -2.0 (/ (sqrt (* A F)) B)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return -2.0 * (sqrt((A * F)) / B);
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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
code = (-2.0d0) * (sqrt((a * f)) / b)
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return -2.0 * (Math.sqrt((A * F)) / B);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return -2.0 * (math.sqrt((A * F)) / B)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = -2.0 * (sqrt((A * F)) / B);
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
-2 \cdot \frac{\sqrt{A \cdot F}}{B}
\end{array}
Initial program 20.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-lowering-+.f6414.1
Simplified14.1%
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-*.f6414.1
Simplified14.1%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr14.1%
Taylor expanded in C around 0
associate-*r/N/A
*-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f643.9
Simplified3.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (sqrt (* F (/ 2.0 B))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((F * (2.0 / B)));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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
code = sqrt((f * (2.0d0 / b)))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((F * (2.0 / B)));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((F * (2.0 / B)))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(F * Float64(2.0 / B))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((F * (2.0 / B)));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[Sqrt[N[(F * N[(2.0 / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{F \cdot \frac{2}{B}}
\end{array}
Initial program 20.0%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
neg-lowering-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f642.0
Simplified2.0%
mul-1-negN/A
remove-double-negN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f642.0
Applied egg-rr2.0%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f642.0
Applied egg-rr2.0%
herbie shell --seed 2024199
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))