
(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 14 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 C (* A -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B 2.0)))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_2)))
(if (<= t_3 (- INFINITY))
(/
(*
(sqrt (fma (* A C) -8.0 (* 2.0 (* B B))))
(sqrt (* F (+ A (fma (* B B) (/ -0.5 C) A)))))
t_2)
(if (<= t_3 -4e-163)
(/
(sqrt
(*
(* (fma B B (* C (* A -4.0))) (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))
(fma B (- B) (* A (* 4.0 C))))
(/
(sqrt (* 2.0 (* t_0 (* F (fma B (/ B (* C -2.0)) (+ A A))))))
(- t_0))))))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 = t_1 - pow(B, 2.0);
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma((A * C), -8.0, (2.0 * (B * B)))) * sqrt((F * (A + fma((B * B), (-0.5 / C), A))))) / t_2;
} else if (t_3 <= -4e-163) {
tmp = sqrt(((fma(B, B, (C * (A * -4.0))) * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = sqrt((2.0 * (t_0 * (F * fma(B, (B / (C * -2.0)), (A + A)))))) / -t_0;
}
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(t_1 - (B ^ 2.0)) t_3 = 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)))))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(Float64(A * C), -8.0, Float64(2.0 * Float64(B * B)))) * sqrt(Float64(F * Float64(A + fma(Float64(B * B), Float64(-0.5 / C), A))))) / t_2); elseif (t_3 <= -4e-163) tmp = Float64(sqrt(Float64(Float64(fma(B, B, Float64(C * Float64(A * -4.0))) * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(t_0 * Float64(F * fma(B, Float64(B / Float64(C * -2.0)), 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[(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[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * -8.0 + N[(2.0 * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + N[(N[(B * B), $MachinePrecision] * N[(-0.5 / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -4e-163], N[(N[Sqrt[N[(N[(N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $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[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(B * N[(B / N[(C * -2.0), $MachinePrecision]), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B}^{2}\\
t_3 := \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\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -8, 2 \cdot \left(B \cdot B\right)\right)} \cdot \sqrt{F \cdot \left(A + \mathsf{fma}\left(B \cdot B, \frac{-0.5}{C}, A\right)\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-163}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\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, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_0 \cdot \left(F \cdot \mathsf{fma}\left(B, \frac{B}{C \cdot -2}, A + A\right)\right)\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))) < -inf.0Initial program 3.2%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.3
Applied rewrites17.3%
Applied rewrites15.0%
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))) < -3.99999999999999969e-163Initial program 95.3%
Applied rewrites95.5%
if -3.99999999999999969e-163 < (/.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.2%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Applied rewrites13.8%
Applied rewrites13.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites15.5%
Final simplification24.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)))
(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 (- INFINITY))
(*
(sqrt (* 2.0 (* (+ A (fma (* B B) (/ -0.5 C) A)) (* F t_0))))
(/ -1.0 t_0))
(if (<= t_2 -4e-163)
(/
(sqrt
(*
(* (fma B B (* C (* A -4.0))) (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))))
(fma B (- B) (* A (* 4.0 C))))
(/
(sqrt (* 2.0 (* t_0 (* F (fma B (/ B (* C -2.0)) (+ A A))))))
(- t_0))))))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 <= -((double) INFINITY)) {
tmp = sqrt((2.0 * ((A + fma((B * B), (-0.5 / C), A)) * (F * t_0)))) * (-1.0 / t_0);
} else if (t_2 <= -4e-163) {
tmp = sqrt(((fma(B, B, (C * (A * -4.0))) * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B * B)))))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = sqrt((2.0 * (t_0 * (F * fma(B, (B / (C * -2.0)), (A + A)))))) / -t_0;
}
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 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(A + fma(Float64(B * B), Float64(-0.5 / C), A)) * Float64(F * t_0)))) * Float64(-1.0 / t_0)); elseif (t_2 <= -4e-163) tmp = Float64(sqrt(Float64(Float64(fma(B, B, Float64(C * Float64(A * -4.0))) * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(t_0 * Float64(F * fma(B, Float64(B / Float64(C * -2.0)), 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[(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, (-Infinity)], N[(N[Sqrt[N[(2.0 * N[(N[(A + N[(N[(B * B), $MachinePrecision] * N[(-0.5 / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-163], N[(N[Sqrt[N[(N[(N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $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[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(B * N[(B / N[(C * -2.0), $MachinePrecision]), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := \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 -\infty:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(A + \mathsf{fma}\left(B \cdot B, \frac{-0.5}{C}, A\right)\right) \cdot \left(F \cdot t\_0\right)\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-163}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\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, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_0 \cdot \left(F \cdot \mathsf{fma}\left(B, \frac{B}{C \cdot -2}, A + A\right)\right)\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))) < -inf.0Initial program 3.2%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.3
Applied rewrites17.3%
Applied rewrites17.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999969e-163Initial program 95.3%
Applied rewrites95.5%
if -3.99999999999999969e-163 < (/.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.2%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Applied rewrites13.8%
Applied rewrites13.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites15.5%
Final simplification24.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 (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 -2e+201)
(- (/ (sqrt (* 2.0 (* (+ A (fma (* B B) (/ -0.5 C) A)) (* F t_0)))) t_0))
(if (<= t_2 -4e-163)
(*
(sqrt
(/
(* F (+ A (- C (sqrt (fma B B (* (- A C) (- A C)))))))
(fma B B (* (* A C) -4.0))))
(- (sqrt 2.0)))
(/
(sqrt (* 2.0 (* t_0 (* F (fma B (/ B (* C -2.0)) (+ A A))))))
(- t_0))))))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 <= -2e+201) {
tmp = -(sqrt((2.0 * ((A + fma((B * B), (-0.5 / C), A)) * (F * t_0)))) / t_0);
} else if (t_2 <= -4e-163) {
tmp = sqrt(((F * (A + (C - sqrt(fma(B, B, ((A - C) * (A - C))))))) / fma(B, B, ((A * C) * -4.0)))) * -sqrt(2.0);
} else {
tmp = sqrt((2.0 * (t_0 * (F * fma(B, (B / (C * -2.0)), (A + A)))))) / -t_0;
}
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 <= -2e+201) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(A + fma(Float64(B * B), Float64(-0.5 / C), A)) * Float64(F * t_0)))) / t_0)); elseif (t_2 <= -4e-163) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C))))))) / fma(B, B, Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(2.0 * Float64(t_0 * Float64(F * fma(B, Float64(B / Float64(C * -2.0)), 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[(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, -2e+201], (-N[(N[Sqrt[N[(2.0 * N[(N[(A + N[(N[(B * B), $MachinePrecision] * N[(-0.5 / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), If[LessEqual[t$95$2, -4e-163], N[(N[Sqrt[N[(N[(F * N[(A + N[(C - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B * B + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(B * N[(B / N[(C * -2.0), $MachinePrecision]), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := \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 -2 \cdot 10^{+201}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(\left(A + \mathsf{fma}\left(B \cdot B, \frac{-0.5}{C}, A\right)\right) \cdot \left(F \cdot t\_0\right)\right)}}{t\_0}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-163}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)\right)}{\mathsf{fma}\left(B, B, \left(A \cdot C\right) \cdot -4\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_0 \cdot \left(F \cdot \mathsf{fma}\left(B, \frac{B}{C \cdot -2}, A + A\right)\right)\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))) < -2.00000000000000008e201Initial program 8.9%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6416.3
Applied rewrites16.3%
Applied rewrites16.3%
if -2.00000000000000008e201 < (/.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.99999999999999969e-163Initial program 94.8%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.0
Applied rewrites1.0%
Applied rewrites1.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites84.5%
if -3.99999999999999969e-163 < (/.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.2%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Applied rewrites13.8%
Applied rewrites13.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites15.5%
Final simplification22.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 (fma C (* A -4.0) (* B B))) (t_1 (- t_0)))
(if (<= (pow B 2.0) 0.0)
(/ (sqrt (* 2.0 (* -4.0 (* (* A C) (* F (+ A A)))))) t_1)
(if (<= (pow B 2.0) 2e+19)
(/ (sqrt (* 2.0 (* (* F t_0) (+ A A)))) t_1)
(* (sqrt (* F (- A (sqrt (fma B B (* A A)))))) (- (/ (sqrt 2.0) 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 t_1 = -t_0;
double tmp;
if (pow(B, 2.0) <= 0.0) {
tmp = sqrt((2.0 * (-4.0 * ((A * C) * (F * (A + A)))))) / t_1;
} else if (pow(B, 2.0) <= 2e+19) {
tmp = sqrt((2.0 * ((F * t_0) * (A + A)))) / t_1;
} else {
tmp = sqrt((F * (A - sqrt(fma(B, B, (A * A)))))) * -(sqrt(2.0) / 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)) t_1 = Float64(-t_0) tmp = 0.0 if ((B ^ 2.0) <= 0.0) tmp = Float64(sqrt(Float64(2.0 * Float64(-4.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A)))))) / t_1); elseif ((B ^ 2.0) <= 2e+19) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(A + A)))) / t_1); else tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))) * Float64(-Float64(sqrt(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[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 0.0], N[(N[Sqrt[N[(2.0 * N[(-4.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e+19], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], 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]]]]]
\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 := -t\_0\\
\mathbf{if}\;{B}^{2} \leq 0:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(-4 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;{B}^{2} \leq 2 \cdot 10^{+19}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_0\right) \cdot \left(A + A\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 0.0Initial program 17.5%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.8
Applied rewrites22.8%
Applied rewrites22.8%
Taylor expanded in C around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6427.6
Applied rewrites27.6%
if 0.0 < (pow.f64 B #s(literal 2 binary64)) < 2e19Initial program 21.2%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.0
Applied rewrites23.0%
Applied rewrites23.0%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6424.8
Applied rewrites24.8%
if 2e19 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.9%
Taylor expanded in C around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Applied rewrites9.4%
Final simplification18.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 B B (* C (* A -4.0)))) (t_1 (fma C (* A -4.0) (* B B))))
(if (<= C 7.2e-208)
(* (/ (sqrt 2.0) -1.0) (/ (sqrt (* t_0 (* F (- (+ A C) (- A))))) t_0))
(if (<= C 2.5e+19)
(*
(sqrt
(/
(* F (+ A (- C (sqrt (fma B B (* (- A C) (- A C)))))))
(fma B B (* (* A C) -4.0))))
(- (sqrt 2.0)))
(/
(sqrt (* 2.0 (* (* F t_1) (+ A (fma -0.5 (/ (* B B) C) A)))))
(- t_1))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (C * (A * -4.0)));
double t_1 = fma(C, (A * -4.0), (B * B));
double tmp;
if (C <= 7.2e-208) {
tmp = (sqrt(2.0) / -1.0) * (sqrt((t_0 * (F * ((A + C) - -A)))) / t_0);
} else if (C <= 2.5e+19) {
tmp = sqrt(((F * (A + (C - sqrt(fma(B, B, ((A - C) * (A - C))))))) / fma(B, B, ((A * C) * -4.0)))) * -sqrt(2.0);
} else {
tmp = sqrt((2.0 * ((F * t_1) * (A + fma(-0.5, ((B * B) / C), A))))) / -t_1;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(C * Float64(A * -4.0))) t_1 = fma(C, Float64(A * -4.0), Float64(B * B)) tmp = 0.0 if (C <= 7.2e-208) tmp = Float64(Float64(sqrt(2.0) / -1.0) * Float64(sqrt(Float64(t_0 * Float64(F * Float64(Float64(A + C) - Float64(-A))))) / t_0)); elseif (C <= 2.5e+19) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C))))))) / fma(B, B, Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_1) * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A))))) / Float64(-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[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, 7.2e-208], N[(N[(N[Sqrt[2.0], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(t$95$0 * N[(F * N[(N[(A + C), $MachinePrecision] - (-A)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[C, 2.5e+19], N[(N[Sqrt[N[(N[(F * N[(A + N[(C - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B * B + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$1), $MachinePrecision] * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
\mathbf{if}\;C \leq 7.2 \cdot 10^{-208}:\\
\;\;\;\;\frac{\sqrt{2}}{-1} \cdot \frac{\sqrt{t\_0 \cdot \left(F \cdot \left(\left(A + C\right) - \left(-A\right)\right)\right)}}{t\_0}\\
\mathbf{elif}\;C \leq 2.5 \cdot 10^{+19}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)\right)}{\mathsf{fma}\left(B, B, \left(A \cdot C\right) \cdot -4\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_1\right) \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)\right)}}{-t\_1}\\
\end{array}
\end{array}
if C < 7.1999999999999997e-208Initial program 18.0%
Applied rewrites20.0%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f6413.7
Applied rewrites13.7%
if 7.1999999999999997e-208 < C < 2.5e19Initial program 27.3%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites32.8%
if 2.5e19 < C Initial program 2.9%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6433.3
Applied rewrites33.3%
Applied rewrites33.3%
Taylor expanded in C around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6433.3
Applied rewrites33.3%
Final simplification21.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 B B (* C (* A -4.0)))) (t_1 (fma C (* A -4.0) (* B B))))
(if (<= C 7.2e-208)
(* (/ (sqrt 2.0) -1.0) (/ (sqrt (* t_0 (* F (- (+ A C) (- A))))) t_0))
(if (<= C 2.5e+19)
(*
(sqrt
(/
(* F (+ A (- C (sqrt (fma B B (* (- A C) (- A C)))))))
(fma B B (* (* A C) -4.0))))
(- (sqrt 2.0)))
(-
(/
(sqrt (* 2.0 (* (+ A (fma (* B B) (/ -0.5 C) A)) (* F t_1))))
t_1))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (C * (A * -4.0)));
double t_1 = fma(C, (A * -4.0), (B * B));
double tmp;
if (C <= 7.2e-208) {
tmp = (sqrt(2.0) / -1.0) * (sqrt((t_0 * (F * ((A + C) - -A)))) / t_0);
} else if (C <= 2.5e+19) {
tmp = sqrt(((F * (A + (C - sqrt(fma(B, B, ((A - C) * (A - C))))))) / fma(B, B, ((A * C) * -4.0)))) * -sqrt(2.0);
} else {
tmp = -(sqrt((2.0 * ((A + fma((B * B), (-0.5 / C), A)) * (F * t_1)))) / t_1);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(C * Float64(A * -4.0))) t_1 = fma(C, Float64(A * -4.0), Float64(B * B)) tmp = 0.0 if (C <= 7.2e-208) tmp = Float64(Float64(sqrt(2.0) / -1.0) * Float64(sqrt(Float64(t_0 * Float64(F * Float64(Float64(A + C) - Float64(-A))))) / t_0)); elseif (C <= 2.5e+19) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C))))))) / fma(B, B, Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(A + fma(Float64(B * B), Float64(-0.5 / C), A)) * Float64(F * t_1)))) / 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[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, 7.2e-208], N[(N[(N[Sqrt[2.0], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(t$95$0 * N[(F * N[(N[(A + C), $MachinePrecision] - (-A)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[C, 2.5e+19], N[(N[Sqrt[N[(N[(F * N[(A + N[(C - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B * B + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * N[(N[(A + N[(N[(B * B), $MachinePrecision] * N[(-0.5 / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision])]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
\mathbf{if}\;C \leq 7.2 \cdot 10^{-208}:\\
\;\;\;\;\frac{\sqrt{2}}{-1} \cdot \frac{\sqrt{t\_0 \cdot \left(F \cdot \left(\left(A + C\right) - \left(-A\right)\right)\right)}}{t\_0}\\
\mathbf{elif}\;C \leq 2.5 \cdot 10^{+19}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)\right)}{\mathsf{fma}\left(B, B, \left(A \cdot C\right) \cdot -4\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(\left(A + \mathsf{fma}\left(B \cdot B, \frac{-0.5}{C}, A\right)\right) \cdot \left(F \cdot t\_1\right)\right)}}{t\_1}\\
\end{array}
\end{array}
if C < 7.1999999999999997e-208Initial program 18.0%
Applied rewrites20.0%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f6413.7
Applied rewrites13.7%
if 7.1999999999999997e-208 < C < 2.5e19Initial program 27.3%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites32.8%
if 2.5e19 < C Initial program 2.9%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6433.3
Applied rewrites33.3%
Applied rewrites33.3%
Final simplification21.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 C (* A -4.0) (* B B))) (t_1 (* F t_0)))
(if (<= C 9.5e-206)
(/ (sqrt (* 2.0 (* t_1 (+ A A)))) (- t_0))
(if (<= C 2.5e+19)
(*
(sqrt
(/
(* F (+ A (- C (sqrt (fma B B (* (- A C) (- A C)))))))
(fma B B (* (* A C) -4.0))))
(- (sqrt 2.0)))
(- (/ (sqrt (* 2.0 (* (+ A (fma (* B B) (/ -0.5 C) A)) t_1))) t_0))))))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 = F * t_0;
double tmp;
if (C <= 9.5e-206) {
tmp = sqrt((2.0 * (t_1 * (A + A)))) / -t_0;
} else if (C <= 2.5e+19) {
tmp = sqrt(((F * (A + (C - sqrt(fma(B, B, ((A - C) * (A - C))))))) / fma(B, B, ((A * C) * -4.0)))) * -sqrt(2.0);
} else {
tmp = -(sqrt((2.0 * ((A + fma((B * B), (-0.5 / C), A)) * t_1))) / t_0);
}
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(F * t_0) tmp = 0.0 if (C <= 9.5e-206) tmp = Float64(sqrt(Float64(2.0 * Float64(t_1 * Float64(A + A)))) / Float64(-t_0)); elseif (C <= 2.5e+19) tmp = Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C))))))) / fma(B, B, Float64(Float64(A * C) * -4.0)))) * Float64(-sqrt(2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(A + fma(Float64(B * B), Float64(-0.5 / C), A)) * t_1))) / 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[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[C, 9.5e-206], N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[C, 2.5e+19], N[(N[Sqrt[N[(N[(F * N[(A + N[(C - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B * B + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * N[(N[(A + N[(N[(B * B), $MachinePrecision] * N[(-0.5 / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision] * t$95$1), $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 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := F \cdot t\_0\\
\mathbf{if}\;C \leq 9.5 \cdot 10^{-206}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(t\_1 \cdot \left(A + A\right)\right)}}{-t\_0}\\
\mathbf{elif}\;C \leq 2.5 \cdot 10^{+19}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A + \left(C - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)\right)}{\mathsf{fma}\left(B, B, \left(A \cdot C\right) \cdot -4\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(\left(A + \mathsf{fma}\left(B \cdot B, \frac{-0.5}{C}, A\right)\right) \cdot t\_1\right)}}{t\_0}\\
\end{array}
\end{array}
if C < 9.49999999999999979e-206Initial program 18.0%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f647.8
Applied rewrites7.8%
Applied rewrites7.8%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6410.7
Applied rewrites10.7%
if 9.49999999999999979e-206 < C < 2.5e19Initial program 27.3%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites32.8%
if 2.5e19 < C Initial program 2.9%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6433.3
Applied rewrites33.3%
Applied rewrites33.3%
Final simplification19.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 (<= B 9e-9)
(/
(sqrt (* 2.0 (* -4.0 (* (* A C) (* F (+ A A))))))
(- (fma C (* A -4.0) (* B B))))
(* (sqrt (* F (- A (sqrt (fma B B (* A A)))))) (- (/ (sqrt 2.0) B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 9e-9) {
tmp = sqrt((2.0 * (-4.0 * ((A * C) * (F * (A + A)))))) / -fma(C, (A * -4.0), (B * B));
} else {
tmp = sqrt((F * (A - sqrt(fma(B, B, (A * A)))))) * -(sqrt(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 <= 9e-9) tmp = Float64(sqrt(Float64(2.0 * Float64(-4.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A)))))) / Float64(-fma(C, Float64(A * -4.0), Float64(B * B)))); else tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))) * Float64(-Float64(sqrt(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[B, 9e-9], N[(N[Sqrt[N[(2.0 * N[(-4.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], 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]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 9 \cdot 10^{-9}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(-4 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B}\right)\\
\end{array}
\end{array}
if B < 8.99999999999999953e-9Initial program 16.7%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.7
Applied rewrites17.7%
Applied rewrites17.7%
Taylor expanded in C around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6417.7
Applied rewrites17.7%
if 8.99999999999999953e-9 < B Initial program 15.7%
Taylor expanded in C around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Applied rewrites18.3%
Final simplification17.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (if (<= B 1.2e-8) (/ (sqrt (* (* A -8.0) (* (+ A A) (* C F)))) (- (fma C (* A -4.0) (* B B)))) (* (sqrt (* F (- A (sqrt (fma B B (* A A)))))) (- (/ (sqrt 2.0) B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 1.2e-8) {
tmp = sqrt(((A * -8.0) * ((A + A) * (C * F)))) / -fma(C, (A * -4.0), (B * B));
} else {
tmp = sqrt((F * (A - sqrt(fma(B, B, (A * A)))))) * -(sqrt(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 <= 1.2e-8) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(Float64(A + A) * Float64(C * F)))) / Float64(-fma(C, Float64(A * -4.0), Float64(B * B)))); else tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))) * Float64(-Float64(sqrt(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[B, 1.2e-8], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(N[(A + A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], 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]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 1.2 \cdot 10^{-8}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(\left(A + A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B}\right)\\
\end{array}
\end{array}
if B < 1.19999999999999999e-8Initial program 16.7%
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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.7
Applied rewrites17.7%
Applied rewrites17.7%
Taylor expanded in C around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6413.3
Applied rewrites13.3%
if 1.19999999999999999e-8 < B Initial program 15.7%
Taylor expanded in C around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Applied rewrites18.3%
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 (/ (sqrt (* (* A -8.0) (* (+ A A) (* C F)))) (- (fma C (* A -4.0) (* B B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt(((A * -8.0) * ((A + A) * (C * F)))) / -fma(C, (A * -4.0), (B * B));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(Float64(A * -8.0) * Float64(Float64(A + A) * Float64(C * F)))) / Float64(-fma(C, Float64(A * -4.0), Float64(B * 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[(N[(A * -8.0), $MachinePrecision] * N[(N[(A + A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(\left(A + A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}
\end{array}
Initial program 16.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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.0
Applied rewrites14.0%
Applied rewrites14.0%
Taylor expanded in C around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6410.8
Applied rewrites10.8%
Final simplification10.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (- (/ (sqrt (* -16.0 (* F (* C (* A A))))) (fma C (* A -4.0) (* B B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return -(sqrt((-16.0 * (F * (C * (A * A))))) / fma(C, (A * -4.0), (B * B)));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(-Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / fma(C, Float64(A * -4.0), Float64(B * 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[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
-\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}
\end{array}
Initial program 16.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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.0
Applied rewrites14.0%
Applied rewrites14.0%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.4
Applied rewrites11.4%
Final simplification11.4%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (/ (sqrt (* -16.0 (* F (* A (* C C))))) (- (fma C (* A -4.0) (* B B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((-16.0 * (F * (A * (C * C))))) / -fma(C, (A * -4.0), (B * B));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(-16.0 * Float64(F * Float64(A * Float64(C * C))))) / Float64(-fma(C, Float64(A * -4.0), Float64(B * 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[(-16.0 * N[(F * N[(A * N[(C * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{-16 \cdot \left(F \cdot \left(A \cdot \left(C \cdot C\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}
\end{array}
Initial program 16.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
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.0
Applied rewrites14.0%
Applied rewrites14.0%
Taylor expanded in C around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f649.8
Applied rewrites9.8%
Final simplification9.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (sqrt (/ 2.0 (/ B F))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((2.0 / (B / F)));
}
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((2.0d0 / (b / f)))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((2.0 / (B / F)));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((2.0 / (B / F)))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(2.0 / Float64(B / F))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((2.0 / (B / F)));
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[(2.0 / N[(B / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{\frac{2}{\frac{B}{F}}}
\end{array}
Initial program 16.4%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.9
Applied rewrites1.9%
Applied rewrites1.9%
Applied rewrites2.0%
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 16.4%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.9
Applied rewrites1.9%
Applied rewrites1.9%
Applied rewrites1.9%
herbie shell --seed 2024234
(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))))