
(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 13 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 (fma A (* C -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2 (* 2.0 (* (- (pow B 2.0) t_1) F)))
(t_3 (- t_1 (pow B 2.0)))
(t_4
(/
(sqrt (* t_2 (- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_3))
(t_5
(*
(* (fma (* A C) -4.0 (* B B)) (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
(if (<= t_4 -5e+52)
(* (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) (/ -1.0 t_0))
(if (<= t_4 -1e-218)
(/ (/ t_5 (sqrt t_5)) t_3)
(/ (sqrt (* t_2 (+ A (fma -0.5 (/ (* B B) C) A)))) t_3)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = 2.0 * ((pow(B, 2.0) - t_1) * F);
double t_3 = t_1 - pow(B, 2.0);
double t_4 = sqrt((t_2 * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_3;
double t_5 = (fma((A * C), -4.0, (B * B)) * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))));
double tmp;
if (t_4 <= -5e+52) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) * (-1.0 / t_0);
} else if (t_4 <= -1e-218) {
tmp = (t_5 / sqrt(t_5)) / t_3;
} else {
tmp = sqrt((t_2 * (A + fma(-0.5, ((B * B) / C), A)))) / t_3;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) t_3 = Float64(t_1 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(t_2 * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) t_5 = Float64(Float64(fma(Float64(A * C), -4.0, Float64(B * B)) * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) tmp = 0.0 if (t_4 <= -5e+52) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) * Float64(-1.0 / t_0)); elseif (t_4 <= -1e-218) tmp = Float64(Float64(t_5 / sqrt(t_5)) / t_3); else tmp = Float64(sqrt(Float64(t_2 * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A)))) / t_3); 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[(A * N[(C * -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[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$2 * 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$3), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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]}, If[LessEqual[t$95$4, -5e+52], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-218], N[(N[(t$95$5 / N[Sqrt[t$95$5], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(t$95$2 * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := 2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\\
t_3 := t\_1 - {B}^{2}\\
t_4 := \frac{\sqrt{t\_2 \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
t_5 := \left(\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right) \cdot \left(2 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)\\
\mathbf{if}\;t\_4 \leq -5 \cdot 10^{+52}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}\right) \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\frac{t\_5}{\sqrt{t\_5}}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)}}{t\_3}\\
\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))) < -5e52Initial program 16.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.4
Simplified25.4%
Applied egg-rr25.5%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied egg-rr32.2%
if -5e52 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.2%
Applied egg-rr99.4%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6411.0
Simplified11.0%
Final simplification27.2%
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 A (* C -4.0) (* B B)))
(t_1 (fma B B (* -4.0 (* A C))))
(t_2 (/ -1.0 t_0))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_3) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B 2.0)))))
(if (<= t_4 -2e+120)
(* (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) t_2)
(if (<= t_4 -1e-132)
(*
(sqrt (/ (* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))) t_1))
(- (sqrt 2.0)))
(if (<= t_4 -1e-218)
(* (sqrt (* F (- C (sqrt (fma B B (* C C)))))) (/ (sqrt 2.0) (- B)))
(* t_2 (* 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(A, (C * -4.0), (B * B));
double t_1 = fma(B, B, (-4.0 * (A * C)));
double t_2 = -1.0 / t_0;
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B, 2.0) - t_3) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B, 2.0));
double tmp;
if (t_4 <= -2e+120) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) * t_2;
} else if (t_4 <= -1e-132) {
tmp = sqrt(((F * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))))) / t_1)) * -sqrt(2.0);
} else if (t_4 <= -1e-218) {
tmp = sqrt((F * (C - sqrt(fma(B, B, (C * C)))))) * (sqrt(2.0) / -B);
} else {
tmp = t_2 * (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(A, Float64(C * -4.0), Float64(B * B)) t_1 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_2 = Float64(-1.0 / t_0) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B ^ 2.0))) tmp = 0.0 if (t_4 <= -2e+120) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) * t_2); elseif (t_4 <= -1e-132) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) / t_1)) * Float64(-sqrt(2.0))); elseif (t_4 <= -1e-218) tmp = Float64(sqrt(Float64(F * Float64(C - sqrt(fma(B, B, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B))); else tmp = Float64(t_2 * Float64(2.0 * sqrt(Float64(Float64(A * 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-1.0 / t$95$0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$3), $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$3 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+120], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-132], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$4, -1e-218], N[(N[Sqrt[N[(F * N[(C - N[Sqrt[N[(B * B + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B)), $MachinePrecision]), $MachinePrecision], N[(t$95$2 * N[(2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$1), $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(A, C \cdot -4, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)\\
t_2 := \frac{-1}{t\_0}\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B}^{2}}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+120}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}\right) \cdot t\_2\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-132}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}{t\_1}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\sqrt{F \cdot \left(C - \sqrt{\mathsf{fma}\left(B, B, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B}\\
\mathbf{else}:\\
\;\;\;\;t\_2 \cdot \left(2 \cdot \sqrt{\left(A \cdot F\right) \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))) < -2e120Initial program 10.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6423.9
Simplified23.9%
Applied egg-rr23.9%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied egg-rr31.4%
if -2e120 < (/.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.9999999999999999e-133Initial program 97.0%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified99.3%
if -9.9999999999999999e-133 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.0%
Taylor expanded in A around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Simplified40.9%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Applied egg-rr8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f649.5
Simplified9.5%
Final simplification25.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 A (* C -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B 2.0)))
(t_3 (- (pow B 2.0) t_1))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_2))
(t_5
(*
(* (fma (* A C) -4.0 (* B B)) (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
(if (<= t_4 -5e+52)
(* (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) (/ -1.0 t_0))
(if (<= t_4 -1e-218)
(/ (/ t_5 (sqrt t_5)) t_2)
(/ (* (sqrt (* t_0 (* A F))) -2.0) t_3)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B, 2.0);
double t_3 = pow(B, 2.0) - t_1;
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_5 = (fma((A * C), -4.0, (B * B)) * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))));
double tmp;
if (t_4 <= -5e+52) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) * (-1.0 / t_0);
} else if (t_4 <= -1e-218) {
tmp = (t_5 / sqrt(t_5)) / t_2;
} else {
tmp = (sqrt((t_0 * (A * F))) * -2.0) / t_3;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B ^ 2.0)) t_3 = Float64((B ^ 2.0) - t_1) 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)))))) / t_2) t_5 = Float64(Float64(fma(Float64(A * C), -4.0, Float64(B * B)) * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) tmp = 0.0 if (t_4 <= -5e+52) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) * Float64(-1.0 / t_0)); elseif (t_4 <= -1e-218) tmp = Float64(Float64(t_5 / sqrt(t_5)) / t_2); else tmp = Float64(Float64(sqrt(Float64(t_0 * Float64(A * F))) * -2.0) / t_3); 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[(A * N[(C * -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[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $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] / t$95$2), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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]}, If[LessEqual[t$95$4, -5e+52], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-218], N[(N[(t$95$5 / N[Sqrt[t$95$5], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[Sqrt[N[(t$95$0 * N[(A * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / t$95$3), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B}^{2}\\
t_3 := {B}^{2} - t\_1\\
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}\\
t_5 := \left(\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right) \cdot \left(2 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)\\
\mathbf{if}\;t\_4 \leq -5 \cdot 10^{+52}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}\right) \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\frac{t\_5}{\sqrt{t\_5}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(A \cdot F\right)} \cdot -2}{t\_3}\\
\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))) < -5e52Initial program 16.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.4
Simplified25.4%
Applied egg-rr25.5%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied egg-rr32.2%
if -5e52 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.2%
Applied egg-rr99.4%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f649.6
Simplified9.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr9.6%
Final simplification26.3%
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 A (* C -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2 (- (pow B 2.0) t_1))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_3 -4e+79)
(* (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) (/ -1.0 t_0))
(if (<= t_3 -1e-218)
(/
(sqrt
(*
(* (fma (* A C) -4.0 (* B B)) (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))
(fma B (- B) (* 4.0 (* A C))))
(/ (* (sqrt (* t_0 (* A F))) -2.0) t_2)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = pow(B, 2.0) - t_1;
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_3 <= -4e+79) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) * (-1.0 / t_0);
} else if (t_3 <= -1e-218) {
tmp = sqrt(((fma((A * C), -4.0, (B * B)) * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))) / fma(B, -B, (4.0 * (A * C)));
} else {
tmp = (sqrt((t_0 * (A * F))) * -2.0) / t_2;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64((B ^ 2.0) - t_1) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * 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_3 <= -4e+79) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) * Float64(-1.0 / t_0)); elseif (t_3 <= -1e-218) tmp = Float64(sqrt(Float64(Float64(fma(Float64(A * C), -4.0, Float64(B * B)) * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / fma(B, Float64(-B), Float64(4.0 * Float64(A * C)))); else tmp = Float64(Float64(sqrt(Float64(t_0 * Float64(A * F))) * -2.0) / t_2); 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[(A * N[(C * -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[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[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$3, -4e+79], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-218], N[(N[Sqrt[N[(N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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) + N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(t$95$0 * N[(A * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / t$95$2), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := {B}^{2} - t\_1\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \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\_3 \leq -4 \cdot 10^{+79}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}\right) \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right) \cdot \left(2 \cdot F\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, 4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(A \cdot F\right)} \cdot -2}{t\_2}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999987e79Initial program 15.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.1
Simplified24.1%
Applied egg-rr24.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied egg-rr31.0%
if -3.99999999999999987e79 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.3%
Applied egg-rr99.3%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f649.6
Simplified9.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr9.6%
Final simplification26.3%
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 A (* C -4.0) (* B B)))
(t_1 (/ -1.0 t_0))
(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 -4e+79)
(* (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) t_1)
(if (<= t_3 -1e-218)
(/
(sqrt
(*
(* (fma (* A C) -4.0 (* B B)) (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))
(fma B (- B) (* 4.0 (* A C))))
(* t_1 (* 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) {
double t_0 = fma(A, (C * -4.0), (B * B));
double t_1 = -1.0 / t_0;
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 <= -4e+79) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) * t_1;
} else if (t_3 <= -1e-218) {
tmp = sqrt(((fma((A * C), -4.0, (B * B)) * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))) / fma(B, -B, (4.0 * (A * C)));
} else {
tmp = t_1 * (2.0 * sqrt(((A * F) * fma(B, B, (-4.0 * (A * C))))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) t_1 = Float64(-1.0 / t_0) 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 <= -4e+79) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) * t_1); elseif (t_3 <= -1e-218) tmp = Float64(sqrt(Float64(Float64(fma(Float64(A * C), -4.0, Float64(B * B)) * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / fma(B, Float64(-B), Float64(4.0 * Float64(A * C)))); else tmp = Float64(t_1 * Float64(2.0 * sqrt(Float64(Float64(A * F) * fma(B, B, 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-1.0 / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(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, -4e+79], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$3, -1e-218], N[(N[Sqrt[N[(N[(N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $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) + N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * 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]), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
t_1 := \frac{-1}{t\_0}\\
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 -4 \cdot 10^{+79}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}\right) \cdot t\_1\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right) \cdot \left(2 \cdot F\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, 4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(2 \cdot \sqrt{\left(A \cdot F\right) \cdot \mathsf{fma}\left(B, B, -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.99999999999999987e79Initial program 15.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.1
Simplified24.1%
Applied egg-rr24.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied egg-rr31.0%
if -3.99999999999999987e79 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.3%
Applied egg-rr99.3%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Applied egg-rr8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f649.5
Simplified9.5%
Final simplification26.2%
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 A (* C -4.0) (* B B)))
(t_1 (/ -1.0 t_0))
(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 -5e+52)
(* (* (sqrt (* 2.0 t_0)) (sqrt (* F (+ A A)))) t_1)
(if (<= t_3 -1e-218)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma A A (* B B))))))) (- B))
(* t_1 (* 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) {
double t_0 = fma(A, (C * -4.0), (B * B));
double t_1 = -1.0 / t_0;
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 <= -5e+52) {
tmp = (sqrt((2.0 * t_0)) * sqrt((F * (A + A)))) * t_1;
} else if (t_3 <= -1e-218) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(A, A, (B * B))))))) / -B;
} else {
tmp = t_1 * (2.0 * sqrt(((A * F) * fma(B, B, (-4.0 * (A * C))))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) t_1 = Float64(-1.0 / t_0) 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 <= -5e+52) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * sqrt(Float64(F * Float64(A + A)))) * t_1); elseif (t_3 <= -1e-218) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B * B))))))) / Float64(-B)); else tmp = Float64(t_1 * Float64(2.0 * sqrt(Float64(Float64(A * F) * fma(B, B, 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[(A * N[(C * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-1.0 / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(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, -5e+52], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$3, -1e-218], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(t$95$1 * 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]), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
t_1 := \frac{-1}{t\_0}\\
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 -5 \cdot 10^{+52}:\\
\;\;\;\;\left(\sqrt{2 \cdot t\_0} \cdot \sqrt{F \cdot \left(A + A\right)}\right) \cdot t\_1\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(2 \cdot \sqrt{\left(A \cdot F\right) \cdot \mathsf{fma}\left(B, B, -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))) < -5e52Initial program 16.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.4
Simplified25.4%
Applied egg-rr25.5%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied egg-rr32.2%
if -5e52 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.2%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Simplified39.9%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Applied egg-rr8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f649.5
Simplified9.5%
Final simplification18.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 A (* C -4.0) (* B B))))
(if (<= (pow B 2.0) 1e-19)
(/ (sqrt (* (+ A A) (* t_0 (* 2.0 F)))) (- t_0))
(if (<= (pow B 2.0) 5e+298)
(/
-1.0
(*
(/ B (sqrt 2.0))
(sqrt (/ 1.0 (* F (- A (sqrt (fma A A (* B B)))))))))
(* (sqrt (* A F)) (/ -2.0 B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B * B));
double tmp;
if (pow(B, 2.0) <= 1e-19) {
tmp = sqrt(((A + A) * (t_0 * (2.0 * F)))) / -t_0;
} else if (pow(B, 2.0) <= 5e+298) {
tmp = -1.0 / ((B / sqrt(2.0)) * sqrt((1.0 / (F * (A - sqrt(fma(A, A, (B * B))))))));
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 1e-19) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(2.0 * F)))) / Float64(-t_0)); elseif ((B ^ 2.0) <= 5e+298) tmp = Float64(-1.0 / Float64(Float64(B / sqrt(2.0)) * sqrt(Float64(1.0 / Float64(F * Float64(A - sqrt(fma(A, A, Float64(B * B))))))))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.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[(A * N[(C * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-19], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e+298], N[(-1.0 / N[(N[(B / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(F * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 10^{-19}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{-1}{\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{1}{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999998e-20Initial program 21.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.2
Simplified21.2%
Applied egg-rr21.2%
if 9.9999999999999998e-20 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 33.7%
Applied egg-rr33.7%
Taylor expanded in C around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6418.5
Simplified18.5%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Applied egg-rr0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
Simplified0.1%
Taylor expanded in A around -inf
unpow2N/A
unpow2N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f645.6
Simplified5.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 A (* C -4.0) (* B B))))
(if (<= (pow B 2.0) 5e-60)
(/ (sqrt (* (+ A A) (* t_0 (* 2.0 F)))) (- t_0))
(if (<= (pow B 2.0) 5e+298)
(* (/ (sqrt 2.0) (- B)) (sqrt (* F (- A (sqrt (fma A A (* B B)))))))
(* (sqrt (* A F)) (/ -2.0 B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(A, (C * -4.0), (B * B));
double tmp;
if (pow(B, 2.0) <= 5e-60) {
tmp = sqrt(((A + A) * (t_0 * (2.0 * F)))) / -t_0;
} else if (pow(B, 2.0) <= 5e+298) {
tmp = (sqrt(2.0) / -B) * sqrt((F * (A - sqrt(fma(A, A, (B * B))))));
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(C * -4.0), Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 5e-60) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(2.0 * F)))) / Float64(-t_0)); elseif ((B ^ 2.0) <= 5e+298) tmp = Float64(Float64(sqrt(2.0) / Float64(-B)) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B * B))))))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.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[(A * N[(C * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e-60], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e+298], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B)), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A, C \cdot -4, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 5 \cdot 10^{-60}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}{-t\_0}\\
\mathbf{elif}\;{B}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{\sqrt{2}}{-B} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e-60Initial program 18.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.2
Simplified20.2%
Applied egg-rr20.2%
if 5.0000000000000001e-60 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 35.1%
Applied egg-rr1.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6419.0
Simplified19.0%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Applied egg-rr0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
Simplified0.1%
Taylor expanded in A around -inf
unpow2N/A
unpow2N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f645.6
Simplified5.6%
Final simplification16.4%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= (pow B 2.0) 4e-121)
(*
(sqrt (* (+ A A) (* (fma A (* C -4.0) (* B B)) (* 2.0 F))))
(/ 1.0 (* 4.0 (* A C))))
(if (<= (pow B 2.0) 5e+298)
(* (/ (sqrt 2.0) (- B)) (sqrt (* F (- A (sqrt (fma A A (* B B)))))))
(* (sqrt (* A F)) (/ -2.0 B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (pow(B, 2.0) <= 4e-121) {
tmp = sqrt(((A + A) * (fma(A, (C * -4.0), (B * B)) * (2.0 * F)))) * (1.0 / (4.0 * (A * C)));
} else if (pow(B, 2.0) <= 5e+298) {
tmp = (sqrt(2.0) / -B) * sqrt((F * (A - sqrt(fma(A, A, (B * B))))));
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if ((B ^ 2.0) <= 4e-121) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(fma(A, Float64(C * -4.0), Float64(B * B)) * Float64(2.0 * F)))) * Float64(1.0 / Float64(4.0 * Float64(A * C)))); elseif ((B ^ 2.0) <= 5e+298) tmp = Float64(Float64(sqrt(2.0) / Float64(-B)) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B * B))))))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.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_] := If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 4e-121], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(A * N[(C * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e+298], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B)), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 4 \cdot 10^{-121}:\\
\;\;\;\;\sqrt{\left(A + A\right) \cdot \left(\mathsf{fma}\left(A, C \cdot -4, B \cdot B\right) \cdot \left(2 \cdot F\right)\right)} \cdot \frac{1}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;{B}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{\sqrt{2}}{-B} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-121Initial program 15.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.2
Simplified20.2%
Applied egg-rr20.2%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6420.1
Simplified20.1%
if 3.9999999999999999e-121 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 35.6%
Applied egg-rr1.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6420.3
Simplified20.3%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Applied egg-rr0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
Simplified0.1%
Taylor expanded in A around -inf
unpow2N/A
unpow2N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f645.6
Simplified5.6%
Final simplification16.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= (pow B 2.0) 1e-90)
(* -2.0 (sqrt (/ (* A F) (fma B B (* -4.0 (* A C))))))
(if (<= (pow B 2.0) 5e+298)
(* (/ (sqrt 2.0) (- B)) (sqrt (* F (- A (sqrt (fma A A (* B B)))))))
(* (sqrt (* A F)) (/ -2.0 B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (pow(B, 2.0) <= 1e-90) {
tmp = -2.0 * sqrt(((A * F) / fma(B, B, (-4.0 * (A * C)))));
} else if (pow(B, 2.0) <= 5e+298) {
tmp = (sqrt(2.0) / -B) * sqrt((F * (A - sqrt(fma(A, A, (B * B))))));
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if ((B ^ 2.0) <= 1e-90) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(B, B, Float64(-4.0 * Float64(A * C)))))); elseif ((B ^ 2.0) <= 5e+298) tmp = Float64(Float64(sqrt(2.0) / Float64(-B)) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B * B))))))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.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_] := If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-90], 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], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e+298], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B)), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 10^{-90}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)}}\\
\mathbf{elif}\;{B}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{\sqrt{2}}{-B} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-91Initial program 17.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.9
Simplified20.9%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6414.8
Simplified14.8%
if 9.99999999999999995e-91 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 35.0%
Applied egg-rr1.2%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6419.6
Simplified19.6%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Applied egg-rr0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
Simplified0.1%
Taylor expanded in A around -inf
unpow2N/A
unpow2N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f645.6
Simplified5.6%
Final simplification14.4%
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.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6413.3
Simplified13.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6410.6
Simplified10.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* (sqrt (* A F)) (/ -2.0 B)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((A * 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((a * 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((A * F)) * (-2.0 / B);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((A * F)) * (-2.0 / B)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(A * 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((A * 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[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B}
\end{array}
Initial program 20.1%
Applied egg-rr14.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
Simplified4.1%
Taylor expanded in A around -inf
unpow2N/A
unpow2N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f643.5
Simplified3.5%
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.1%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.9
Simplified1.9%
lift-/.f64N/A
lift-sqrt.f64N/A
mul-1-negN/A
remove-double-negN/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f641.9
Applied egg-rr1.9%
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f641.9
Applied egg-rr1.9%
herbie shell --seed 2024215
(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))))