
(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 and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma B B (* A (* C -4.0))))
(t_1
(/
(*
(sqrt (fma B B (* C (* A -4.0))))
(- (sqrt (* 2.0 (* F (+ A (- C (hypot (- A C) B))))))))
t_0)))
(if (<= B -7e+146)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(if (<= B -4.8e-21)
t_1
(if (<= B 2.7e-33)
(/
(- (sqrt (* 2.0 (* t_0 (* F (* 2.0 A))))))
(- (* B B) (* 4.0 (* C A))))
(if (<= B 2.5e+133)
t_1
(* (/ (sqrt 2.0) B) (- (sqrt (* F (- A (hypot A B))))))))))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (A * (C * -4.0)));
double t_1 = (sqrt(fma(B, B, (C * (A * -4.0)))) * -sqrt((2.0 * (F * (A + (C - hypot((A - C), B))))))) / t_0;
double tmp;
if (B <= -7e+146) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else if (B <= -4.8e-21) {
tmp = t_1;
} else if (B <= 2.7e-33) {
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / ((B * B) - (4.0 * (C * A)));
} else if (B <= 2.5e+133) {
tmp = t_1;
} else {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - hypot(A, B))));
}
return tmp;
}
A, C = sort([A, C]) function code(A, B, C, F) t_0 = fma(B, B, Float64(A * Float64(C * -4.0))) t_1 = Float64(Float64(sqrt(fma(B, B, Float64(C * Float64(A * -4.0)))) * Float64(-sqrt(Float64(2.0 * Float64(F * Float64(A + Float64(C - hypot(Float64(A - C), B)))))))) / t_0) tmp = 0.0 if (B <= -7e+146) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); elseif (B <= -4.8e-21) tmp = t_1; elseif (B <= 2.7e-33) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); elseif (B <= 2.5e+133) tmp = t_1; else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A - hypot(A, B)))))); end return tmp end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * N[(F * N[(A + N[(C - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[B, -7e+146], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B, -4.8e-21], t$95$1, If[LessEqual[B, 2.7e-33], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 2.5e+133], t$95$1, N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \frac{\sqrt{\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)} \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(A + \left(C - \mathsf{hypot}\left(A - C, B\right)\right)\right)\right)}\right)}{t_0}\\
\mathbf{if}\;B \leq -7 \cdot 10^{+146}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{elif}\;B \leq -4.8 \cdot 10^{-21}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;B \leq 2.7 \cdot 10^{-33}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{elif}\;B \leq 2.5 \cdot 10^{+133}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)}\right)\\
\end{array}
\end{array}
if B < -7.0000000000000002e146Initial program 0.2%
Simplified0.2%
div-inv0.2%
Applied egg-rr0.3%
Taylor expanded in B around -inf 0.2%
Taylor expanded in A around 0 72.1%
mul-1-neg72.1%
distribute-rgt-neg-in72.1%
Simplified72.1%
if -7.0000000000000002e146 < B < -4.7999999999999999e-21 or 2.7000000000000001e-33 < B < 2.4999999999999998e133Initial program 32.5%
Simplified37.2%
sqrt-prod49.9%
associate-*r*49.9%
*-commutative49.9%
associate-*l*49.9%
associate--r-49.8%
+-commutative49.8%
Applied egg-rr49.8%
hypot-def40.7%
unpow240.7%
unpow240.7%
+-commutative40.7%
unpow240.7%
unpow240.7%
hypot-def49.8%
Simplified49.8%
if -4.7999999999999999e-21 < B < 2.7000000000000001e-33Initial program 21.8%
Simplified21.8%
Taylor expanded in A around -inf 33.0%
*-commutative33.0%
Simplified33.0%
*-un-lft-identity33.0%
associate-*l*32.3%
cancel-sign-sub-inv32.3%
metadata-eval32.3%
*-commutative32.3%
associate-*r*32.3%
fma-udef32.3%
*-commutative32.3%
Applied egg-rr32.3%
*-lft-identity32.3%
Simplified32.3%
if 2.4999999999999998e133 < B Initial program 0.1%
Simplified0.1%
Taylor expanded in C around 0 2.5%
mul-1-neg2.5%
*-commutative2.5%
+-commutative2.5%
unpow22.5%
unpow22.5%
hypot-def40.1%
Simplified40.1%
Final simplification43.0%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B -260000000000.0)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(if (<= B 2.9e-32)
(/
(- (sqrt (* 2.0 (* (fma B B (* A (* C -4.0))) (* F (* 2.0 A))))))
(- (* B B) (* 4.0 (* C A))))
(* (/ (sqrt 2.0) B) (- (sqrt (* F (- A (hypot A B)))))))))assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= -260000000000.0) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else if (B <= 2.9e-32) {
tmp = -sqrt((2.0 * (fma(B, B, (A * (C * -4.0))) * (F * (2.0 * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - hypot(A, B))));
}
return tmp;
}
A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= -260000000000.0) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); elseif (B <= 2.9e-32) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(fma(B, B, Float64(A * Float64(C * -4.0))) * Float64(F * Float64(2.0 * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A - hypot(A, B)))))); end return tmp end
NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, -260000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B, 2.9e-32], N[((-N[Sqrt[N[(2.0 * N[(N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq -260000000000:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{elif}\;B \leq 2.9 \cdot 10^{-32}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)}\right)\\
\end{array}
\end{array}
if B < -2.6e11Initial program 14.9%
Simplified14.9%
div-inv14.8%
Applied egg-rr15.0%
Taylor expanded in B around -inf 8.2%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
if -2.6e11 < B < 2.89999999999999996e-32Initial program 21.9%
Simplified21.9%
Taylor expanded in A around -inf 31.5%
*-commutative31.5%
Simplified31.5%
*-un-lft-identity31.5%
associate-*l*30.8%
cancel-sign-sub-inv30.8%
metadata-eval30.8%
*-commutative30.8%
associate-*r*30.8%
fma-udef30.8%
*-commutative30.8%
Applied egg-rr30.8%
*-lft-identity30.8%
Simplified30.8%
if 2.89999999999999996e-32 < B Initial program 21.7%
Simplified21.7%
Taylor expanded in C around 0 23.7%
mul-1-neg23.7%
*-commutative23.7%
+-commutative23.7%
unpow223.7%
unpow223.7%
hypot-def40.2%
Simplified40.2%
Final simplification38.1%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (+ (* B B) (* -4.0 (* C A)))))
(if (<= B -270000000000.0)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(if (<= B 2.8e-32)
(/
(- (sqrt (* 2.0 (* (fma B B (* A (* C -4.0))) (* F (* 2.0 A))))))
(- (* B B) (* 4.0 (* C A))))
(/
(- (sqrt (* 2.0 (* t_0 (* F (+ A (- C (hypot B (- A C)))))))))
t_0)))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (C * A));
double tmp;
if (B <= -270000000000.0) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else if (B <= 2.8e-32) {
tmp = -sqrt((2.0 * (fma(B, B, (A * (C * -4.0))) * (F * (2.0 * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = -sqrt((2.0 * (t_0 * (F * (A + (C - hypot(B, (A - C)))))))) / t_0;
}
return tmp;
}
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) + Float64(-4.0 * Float64(C * A))) tmp = 0.0 if (B <= -270000000000.0) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); elseif (B <= 2.8e-32) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(fma(B, B, Float64(A * Float64(C * -4.0))) * Float64(F * Float64(2.0 * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(A + Float64(C - hypot(B, Float64(A - C))))))))) / t_0); end return tmp end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, -270000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B, 2.8e-32], N[((-N[Sqrt[N[(2.0 * N[(N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(A + N[(C - N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B + -4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq -270000000000:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{elif}\;B \leq 2.8 \cdot 10^{-32}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(A + \left(C - \mathsf{hypot}\left(B, A - C\right)\right)\right)\right)\right)}}{t_0}\\
\end{array}
\end{array}
if B < -2.7e11Initial program 14.9%
Simplified14.9%
div-inv14.8%
Applied egg-rr15.0%
Taylor expanded in B around -inf 8.2%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
if -2.7e11 < B < 2.7999999999999999e-32Initial program 21.9%
Simplified21.9%
Taylor expanded in A around -inf 31.5%
*-commutative31.5%
Simplified31.5%
*-un-lft-identity31.5%
associate-*l*30.8%
cancel-sign-sub-inv30.8%
metadata-eval30.8%
*-commutative30.8%
associate-*r*30.8%
fma-udef30.8%
*-commutative30.8%
Applied egg-rr30.8%
*-lft-identity30.8%
Simplified30.8%
if 2.7999999999999999e-32 < B Initial program 21.7%
Simplified21.7%
distribute-frac-neg21.7%
Applied egg-rr23.8%
Final simplification33.8%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B -220000000000.0)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(if (<= B 3.1e-34)
(/
(- (sqrt (* 2.0 (* (fma B B (* A (* C -4.0))) (* F (* 2.0 A))))))
t_0)
(/ (- (sqrt (* 2.0 (* (- A (hypot A B)) (* F t_0))))) t_0)))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -220000000000.0) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else if (B <= 3.1e-34) {
tmp = -sqrt((2.0 * (fma(B, B, (A * (C * -4.0))) * (F * (2.0 * A))))) / t_0;
} else {
tmp = -sqrt((2.0 * ((A - hypot(A, B)) * (F * t_0)))) / t_0;
}
return tmp;
}
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= -220000000000.0) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); elseif (B <= 3.1e-34) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(fma(B, B, Float64(A * Float64(C * -4.0))) * Float64(F * Float64(2.0 * A)))))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(A - hypot(A, B)) * Float64(F * t_0))))) / t_0); end return tmp end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, -220000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B, 3.1e-34], N[((-N[Sqrt[N[(2.0 * N[(N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq -220000000000:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{elif}\;B \leq 3.1 \cdot 10^{-34}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(A - \mathsf{hypot}\left(A, B\right)\right) \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\end{array}
\end{array}
if B < -2.2e11Initial program 14.9%
Simplified14.9%
div-inv14.8%
Applied egg-rr15.0%
Taylor expanded in B around -inf 8.2%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
if -2.2e11 < B < 3.0999999999999998e-34Initial program 21.9%
Simplified21.9%
Taylor expanded in A around -inf 31.5%
*-commutative31.5%
Simplified31.5%
*-un-lft-identity31.5%
associate-*l*30.8%
cancel-sign-sub-inv30.8%
metadata-eval30.8%
*-commutative30.8%
associate-*r*30.8%
fma-udef30.8%
*-commutative30.8%
Applied egg-rr30.8%
*-lft-identity30.8%
Simplified30.8%
if 3.0999999999999998e-34 < B Initial program 21.7%
Simplified21.7%
Taylor expanded in C around 0 18.9%
+-commutative18.9%
unpow218.9%
unpow218.9%
hypot-def20.5%
Simplified20.5%
Final simplification33.0%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B -100000000000.0)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(if (<= B 3.4e-34)
(/
(- (sqrt (* 2.0 (* (fma B B (* A (* C -4.0))) (* F (* 2.0 A))))))
(- (* B B) (* 4.0 (* C A))))
(*
(sqrt (* 2.0 (* (- A (hypot A B)) (* F (* B B)))))
(/ -1.0 (+ (* B B) (* -4.0 (* C A))))))))assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= -100000000000.0) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else if (B <= 3.4e-34) {
tmp = -sqrt((2.0 * (fma(B, B, (A * (C * -4.0))) * (F * (2.0 * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = sqrt((2.0 * ((A - hypot(A, B)) * (F * (B * B))))) * (-1.0 / ((B * B) + (-4.0 * (C * A))));
}
return tmp;
}
A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= -100000000000.0) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); elseif (B <= 3.4e-34) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(fma(B, B, Float64(A * Float64(C * -4.0))) * Float64(F * Float64(2.0 * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(A - hypot(A, B)) * Float64(F * Float64(B * B))))) * Float64(-1.0 / Float64(Float64(B * B) + Float64(-4.0 * Float64(C * A))))); end return tmp end
NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, -100000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B, 3.4e-34], N[((-N[Sqrt[N[(2.0 * N[(N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision] * N[(F * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq -100000000000:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{elif}\;B \leq 3.4 \cdot 10^{-34}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(A - \mathsf{hypot}\left(A, B\right)\right) \cdot \left(F \cdot \left(B \cdot B\right)\right)\right)} \cdot \frac{-1}{B \cdot B + -4 \cdot \left(C \cdot A\right)}\\
\end{array}
\end{array}
if B < -1e11Initial program 14.9%
Simplified14.9%
div-inv14.8%
Applied egg-rr15.0%
Taylor expanded in B around -inf 8.2%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
if -1e11 < B < 3.4000000000000001e-34Initial program 21.9%
Simplified21.9%
Taylor expanded in A around -inf 31.5%
*-commutative31.5%
Simplified31.5%
*-un-lft-identity31.5%
associate-*l*30.8%
cancel-sign-sub-inv30.8%
metadata-eval30.8%
*-commutative30.8%
associate-*r*30.8%
fma-udef30.8%
*-commutative30.8%
Applied egg-rr30.8%
*-lft-identity30.8%
Simplified30.8%
if 3.4000000000000001e-34 < B Initial program 21.7%
Simplified21.7%
div-inv21.7%
Applied egg-rr23.8%
Taylor expanded in C around 0 19.0%
+-commutative19.0%
unpow219.0%
unpow219.0%
hypot-def20.6%
unpow220.6%
Simplified20.6%
Final simplification33.0%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B -44000000000.0)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(if (<= B 3.5e-32)
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0)
(*
(sqrt (* 2.0 (* (- A (hypot A B)) (* F (* B B)))))
(/ -1.0 (+ (* B B) (* -4.0 (* C A)))))))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -44000000000.0) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else if (B <= 3.5e-32) {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = sqrt((2.0 * ((A - hypot(A, B)) * (F * (B * B))))) * (-1.0 / ((B * B) + (-4.0 * (C * A))));
}
return tmp;
}
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -44000000000.0) {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
} else if (B <= 3.5e-32) {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = Math.sqrt((2.0 * ((A - Math.hypot(A, B)) * (F * (B * B))))) * (-1.0 / ((B * B) + (-4.0 * (C * A))));
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= -44000000000.0: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) elif B <= 3.5e-32: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 else: tmp = math.sqrt((2.0 * ((A - math.hypot(A, B)) * (F * (B * B))))) * (-1.0 / ((B * B) + (-4.0 * (C * A)))) return tmp
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= -44000000000.0) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); elseif (B <= 3.5e-32) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(A - hypot(A, B)) * Float64(F * Float64(B * B))))) * Float64(-1.0 / Float64(Float64(B * B) + Float64(-4.0 * Float64(C * A))))); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= -44000000000.0)
tmp = sqrt(2.0) * -sqrt((F / B));
elseif (B <= 3.5e-32)
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
else
tmp = sqrt((2.0 * ((A - hypot(A, B)) * (F * (B * B))))) * (-1.0 / ((B * B) + (-4.0 * (C * A))));
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, -44000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B, 3.5e-32], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision] * N[(F * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq -44000000000:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{elif}\;B \leq 3.5 \cdot 10^{-32}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(A - \mathsf{hypot}\left(A, B\right)\right) \cdot \left(F \cdot \left(B \cdot B\right)\right)\right)} \cdot \frac{-1}{B \cdot B + -4 \cdot \left(C \cdot A\right)}\\
\end{array}
\end{array}
if B < -4.4e10Initial program 14.9%
Simplified14.9%
div-inv14.8%
Applied egg-rr15.0%
Taylor expanded in B around -inf 8.2%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
if -4.4e10 < B < 3.4999999999999999e-32Initial program 21.9%
Simplified21.9%
Taylor expanded in A around -inf 31.5%
*-commutative31.5%
Simplified31.5%
if 3.4999999999999999e-32 < B Initial program 21.7%
Simplified21.7%
div-inv21.7%
Applied egg-rr23.8%
Taylor expanded in C around 0 19.0%
+-commutative19.0%
unpow219.0%
unpow219.0%
hypot-def20.6%
unpow220.6%
Simplified20.6%
Final simplification33.4%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B -92000000000.0)
(* (sqrt 2.0) (- (sqrt (/ F B))))
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -92000000000.0) {
tmp = sqrt(2.0) * -sqrt((F / B));
} else {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
}
return tmp;
}
NOTE: A and C 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
real(8) :: t_0
real(8) :: tmp
t_0 = (b * b) - (4.0d0 * (c * a))
if (b <= (-92000000000.0d0)) then
tmp = sqrt(2.0d0) * -sqrt((f / b))
else
tmp = -sqrt((2.0d0 * ((f * t_0) * (2.0d0 * a)))) / t_0
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -92000000000.0) {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
} else {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= -92000000000.0: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) else: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 return tmp
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= -92000000000.0) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= -92000000000.0)
tmp = sqrt(2.0) * -sqrt((F / B));
else
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, -92000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq -92000000000:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\end{array}
\end{array}
if B < -9.2e10Initial program 14.9%
Simplified14.9%
div-inv14.8%
Applied egg-rr15.0%
Taylor expanded in B around -inf 8.2%
Taylor expanded in A around 0 52.5%
mul-1-neg52.5%
distribute-rgt-neg-in52.5%
Simplified52.5%
if -9.2e10 < B Initial program 21.9%
Simplified21.8%
Taylor expanded in A around -inf 23.5%
*-commutative23.5%
Simplified23.5%
Final simplification30.0%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))) (t_1 (* F t_0)))
(if (<= B -50000000000000.0)
(/ (- (sqrt (* 2.0 (* t_1 (+ A (+ B C)))))) t_0)
(/ (- (sqrt (* 2.0 (* t_1 (* 2.0 A))))) t_0))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double t_1 = F * t_0;
double tmp;
if (B <= -50000000000000.0) {
tmp = -sqrt((2.0 * (t_1 * (A + (B + C))))) / t_0;
} else {
tmp = -sqrt((2.0 * (t_1 * (2.0 * A)))) / t_0;
}
return tmp;
}
NOTE: A and C 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
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (b * b) - (4.0d0 * (c * a))
t_1 = f * t_0
if (b <= (-50000000000000.0d0)) then
tmp = -sqrt((2.0d0 * (t_1 * (a + (b + c))))) / t_0
else
tmp = -sqrt((2.0d0 * (t_1 * (2.0d0 * a)))) / t_0
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double t_1 = F * t_0;
double tmp;
if (B <= -50000000000000.0) {
tmp = -Math.sqrt((2.0 * (t_1 * (A + (B + C))))) / t_0;
} else {
tmp = -Math.sqrt((2.0 * (t_1 * (2.0 * A)))) / t_0;
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) t_1 = F * t_0 tmp = 0 if B <= -50000000000000.0: tmp = -math.sqrt((2.0 * (t_1 * (A + (B + C))))) / t_0 else: tmp = -math.sqrt((2.0 * (t_1 * (2.0 * A)))) / t_0 return tmp
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) t_1 = Float64(F * t_0) tmp = 0.0 if (B <= -50000000000000.0) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_1 * Float64(A + Float64(B + C)))))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_1 * Float64(2.0 * A))))) / t_0); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
t_1 = F * t_0;
tmp = 0.0;
if (B <= -50000000000000.0)
tmp = -sqrt((2.0 * (t_1 * (A + (B + C))))) / t_0;
else
tmp = -sqrt((2.0 * (t_1 * (2.0 * A)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[B, -50000000000000.0], N[((-N[Sqrt[N[(2.0 * N[(t$95$1 * N[(A + N[(B + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(t$95$1 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
t_1 := F \cdot t_0\\
\mathbf{if}\;B \leq -50000000000000:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_1 \cdot \left(A + \left(B + C\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_1 \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\end{array}
\end{array}
if B < -5e13Initial program 15.1%
Simplified15.1%
Taylor expanded in B around -inf 14.8%
if -5e13 < B Initial program 21.8%
Simplified21.8%
Taylor expanded in A around -inf 23.4%
*-commutative23.4%
Simplified23.4%
Final simplification21.5%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* C A)))))
(if (<= B -5.9e+41)
(* 2.0 (/ (sqrt (* F A)) B))
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0))))assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -5.9e+41) {
tmp = 2.0 * (sqrt((F * A)) / B);
} else {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
}
return tmp;
}
NOTE: A and C 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
real(8) :: t_0
real(8) :: tmp
t_0 = (b * b) - (4.0d0 * (c * a))
if (b <= (-5.9d+41)) then
tmp = 2.0d0 * (sqrt((f * a)) / b)
else
tmp = -sqrt((2.0d0 * ((f * t_0) * (2.0d0 * a)))) / t_0
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (C * A));
double tmp;
if (B <= -5.9e+41) {
tmp = 2.0 * (Math.sqrt((F * A)) / B);
} else {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (C * A)) tmp = 0 if B <= -5.9e+41: tmp = 2.0 * (math.sqrt((F * A)) / B) else: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 return tmp
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(C * A))) tmp = 0.0 if (B <= -5.9e+41) tmp = Float64(2.0 * Float64(sqrt(Float64(F * A)) / B)); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (C * A));
tmp = 0.0;
if (B <= -5.9e+41)
tmp = 2.0 * (sqrt((F * A)) / B);
else
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, -5.9e+41], N[(2.0 * N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(C \cdot A\right)\\
\mathbf{if}\;B \leq -5.9 \cdot 10^{+41}:\\
\;\;\;\;2 \cdot \frac{\sqrt{F \cdot A}}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\end{array}
\end{array}
if B < -5.9000000000000001e41Initial program 10.4%
Simplified10.4%
Taylor expanded in A around -inf 0.8%
*-commutative0.8%
Simplified0.8%
*-un-lft-identity0.8%
associate-*l*0.8%
cancel-sign-sub-inv0.8%
metadata-eval0.8%
*-commutative0.8%
associate-*r*0.8%
fma-udef0.8%
*-commutative0.8%
Applied egg-rr0.8%
*-lft-identity0.8%
Simplified0.8%
Taylor expanded in B around -inf 4.0%
associate-*r/4.0%
*-rgt-identity4.0%
Simplified4.0%
if -5.9000000000000001e41 < B Initial program 22.8%
Simplified22.8%
Taylor expanded in A around -inf 23.0%
*-commutative23.0%
Simplified23.0%
Final simplification19.1%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B 7.5e+20)
(/
(- (sqrt (* 2.0 (* (* 2.0 A) (* -4.0 (* A (* F C)))))))
(- (* B B) (* 4.0 (* C A))))
(* (/ (sqrt (* F A)) B) -2.0)))assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7.5e+20) {
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (F * C)))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = (sqrt((F * A)) / B) * -2.0;
}
return tmp;
}
NOTE: A and C 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
real(8) :: tmp
if (b <= 7.5d+20) then
tmp = -sqrt((2.0d0 * ((2.0d0 * a) * ((-4.0d0) * (a * (f * c)))))) / ((b * b) - (4.0d0 * (c * a)))
else
tmp = (sqrt((f * a)) / b) * (-2.0d0)
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7.5e+20) {
tmp = -Math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (F * C)))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = (Math.sqrt((F * A)) / B) * -2.0;
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if B <= 7.5e+20: tmp = -math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (F * C)))))) / ((B * B) - (4.0 * (C * A))) else: tmp = (math.sqrt((F * A)) / B) * -2.0 return tmp
A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= 7.5e+20) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(2.0 * A) * Float64(-4.0 * Float64(A * Float64(F * C))))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(Float64(sqrt(Float64(F * A)) / B) * -2.0); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (B <= 7.5e+20)
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (F * C)))))) / ((B * B) - (4.0 * (C * A)));
else
tmp = (sqrt((F * A)) / B) * -2.0;
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, 7.5e+20], N[((-N[Sqrt[N[(2.0 * N[(N[(2.0 * A), $MachinePrecision] * N[(-4.0 * N[(A * N[(F * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision] * -2.0), $MachinePrecision]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 7.5 \cdot 10^{+20}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(2 \cdot A\right) \cdot \left(-4 \cdot \left(A \cdot \left(F \cdot C\right)\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot A}}{B} \cdot -2\\
\end{array}
\end{array}
if B < 7.5e20Initial program 21.8%
Simplified21.8%
Taylor expanded in A around -inf 21.8%
*-commutative21.8%
Simplified21.8%
Taylor expanded in B around 0 18.4%
if 7.5e20 < B Initial program 14.3%
Simplified14.3%
Taylor expanded in A around -inf 4.8%
*-commutative4.8%
Simplified4.8%
*-un-lft-identity4.8%
associate-*l*4.8%
cancel-sign-sub-inv4.8%
metadata-eval4.8%
*-commutative4.8%
associate-*r*4.8%
fma-udef4.8%
*-commutative4.8%
Applied egg-rr4.8%
*-lft-identity4.8%
Simplified4.8%
Taylor expanded in B around inf 8.4%
associate-*r/8.4%
*-rgt-identity8.4%
Simplified8.4%
Final simplification16.5%
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B 7.5e-50)
(/
(- (sqrt (* 2.0 (* -8.0 (* (* F C) (* A A))))))
(- (* B B) (* 4.0 (* C A))))
(* (/ (sqrt (* F A)) B) -2.0)))assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7.5e-50) {
tmp = -sqrt((2.0 * (-8.0 * ((F * C) * (A * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = (sqrt((F * A)) / B) * -2.0;
}
return tmp;
}
NOTE: A and C 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
real(8) :: tmp
if (b <= 7.5d-50) then
tmp = -sqrt((2.0d0 * ((-8.0d0) * ((f * c) * (a * a))))) / ((b * b) - (4.0d0 * (c * a)))
else
tmp = (sqrt((f * a)) / b) * (-2.0d0)
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7.5e-50) {
tmp = -Math.sqrt((2.0 * (-8.0 * ((F * C) * (A * A))))) / ((B * B) - (4.0 * (C * A)));
} else {
tmp = (Math.sqrt((F * A)) / B) * -2.0;
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if B <= 7.5e-50: tmp = -math.sqrt((2.0 * (-8.0 * ((F * C) * (A * A))))) / ((B * B) - (4.0 * (C * A))) else: tmp = (math.sqrt((F * A)) / B) * -2.0 return tmp
A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= 7.5e-50) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(-8.0 * Float64(Float64(F * C) * Float64(A * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(C * A)))); else tmp = Float64(Float64(sqrt(Float64(F * A)) / B) * -2.0); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (B <= 7.5e-50)
tmp = -sqrt((2.0 * (-8.0 * ((F * C) * (A * A))))) / ((B * B) - (4.0 * (C * A)));
else
tmp = (sqrt((F * A)) / B) * -2.0;
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, 7.5e-50], N[((-N[Sqrt[N[(2.0 * N[(-8.0 * N[(N[(F * C), $MachinePrecision] * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(C * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision] * -2.0), $MachinePrecision]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 7.5 \cdot 10^{-50}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(-8 \cdot \left(\left(F \cdot C\right) \cdot \left(A \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(C \cdot A\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot A}}{B} \cdot -2\\
\end{array}
\end{array}
if B < 7.5e-50Initial program 19.6%
Simplified19.6%
Taylor expanded in A around -inf 22.5%
*-commutative22.5%
Simplified22.5%
Taylor expanded in B around 0 16.6%
unpow216.6%
Simplified16.6%
if 7.5e-50 < B Initial program 22.0%
Simplified22.0%
Taylor expanded in A around -inf 7.7%
*-commutative7.7%
Simplified7.7%
*-un-lft-identity7.7%
associate-*l*7.7%
cancel-sign-sub-inv7.7%
metadata-eval7.7%
*-commutative7.7%
associate-*r*7.7%
fma-udef7.7%
*-commutative7.7%
Applied egg-rr7.7%
*-lft-identity7.7%
Simplified7.7%
Taylor expanded in B around inf 8.2%
associate-*r/8.2%
*-rgt-identity8.2%
Simplified8.2%
Final simplification14.3%
NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (if (<= B -1e-310) (* 2.0 (/ (sqrt (* F A)) B)) (* -2.0 (* (pow (* F A) 0.5) (/ 1.0 B)))))
assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= -1e-310) {
tmp = 2.0 * (sqrt((F * A)) / B);
} else {
tmp = -2.0 * (pow((F * A), 0.5) * (1.0 / B));
}
return tmp;
}
NOTE: A and C 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
real(8) :: tmp
if (b <= (-1d-310)) then
tmp = 2.0d0 * (sqrt((f * a)) / b)
else
tmp = (-2.0d0) * (((f * a) ** 0.5d0) * (1.0d0 / b))
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (B <= -1e-310) {
tmp = 2.0 * (Math.sqrt((F * A)) / B);
} else {
tmp = -2.0 * (Math.pow((F * A), 0.5) * (1.0 / B));
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if B <= -1e-310: tmp = 2.0 * (math.sqrt((F * A)) / B) else: tmp = -2.0 * (math.pow((F * A), 0.5) * (1.0 / B)) return tmp
A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (B <= -1e-310) tmp = Float64(2.0 * Float64(sqrt(Float64(F * A)) / B)); else tmp = Float64(-2.0 * Float64((Float64(F * A) ^ 0.5) * Float64(1.0 / B))); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (B <= -1e-310)
tmp = 2.0 * (sqrt((F * A)) / B);
else
tmp = -2.0 * (((F * A) ^ 0.5) * (1.0 / B));
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, -1e-310], N[(2.0 * N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Power[N[(F * A), $MachinePrecision], 0.5], $MachinePrecision] * N[(1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq -1 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \frac{\sqrt{F \cdot A}}{B}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left({\left(F \cdot A\right)}^{0.5} \cdot \frac{1}{B}\right)\\
\end{array}
\end{array}
if B < -9.999999999999969e-311Initial program 19.5%
Simplified19.5%
Taylor expanded in A around -inf 21.4%
*-commutative21.4%
Simplified21.4%
*-un-lft-identity21.4%
associate-*l*20.8%
cancel-sign-sub-inv20.8%
metadata-eval20.8%
*-commutative20.8%
associate-*r*20.8%
fma-udef20.8%
*-commutative20.8%
Applied egg-rr20.8%
*-lft-identity20.8%
Simplified20.8%
Taylor expanded in B around -inf 3.3%
associate-*r/3.3%
*-rgt-identity3.3%
Simplified3.3%
if -9.999999999999969e-311 < B Initial program 21.3%
Simplified21.2%
Taylor expanded in A around -inf 15.0%
*-commutative15.0%
Simplified15.0%
Taylor expanded in B around inf 5.2%
pow1/25.4%
Applied egg-rr5.4%
Final simplification4.3%
NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (let* ((t_0 (/ (sqrt (* F A)) B))) (if (<= B -5.3e-306) (* 2.0 t_0) (* t_0 -2.0))))
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = sqrt((F * A)) / B;
double tmp;
if (B <= -5.3e-306) {
tmp = 2.0 * t_0;
} else {
tmp = t_0 * -2.0;
}
return tmp;
}
NOTE: A and C 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
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((f * a)) / b
if (b <= (-5.3d-306)) then
tmp = 2.0d0 * t_0
else
tmp = t_0 * (-2.0d0)
end if
code = tmp
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = Math.sqrt((F * A)) / B;
double tmp;
if (B <= -5.3e-306) {
tmp = 2.0 * t_0;
} else {
tmp = t_0 * -2.0;
}
return tmp;
}
[A, C] = sort([A, C]) def code(A, B, C, F): t_0 = math.sqrt((F * A)) / B tmp = 0 if B <= -5.3e-306: tmp = 2.0 * t_0 else: tmp = t_0 * -2.0 return tmp
A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(sqrt(Float64(F * A)) / B) tmp = 0.0 if (B <= -5.3e-306) tmp = Float64(2.0 * t_0); else tmp = Float64(t_0 * -2.0); end return tmp end
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = sqrt((F * A)) / B;
tmp = 0.0;
if (B <= -5.3e-306)
tmp = 2.0 * t_0;
else
tmp = t_0 * -2.0;
end
tmp_2 = tmp;
end
NOTE: A and C should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]}, If[LessEqual[B, -5.3e-306], N[(2.0 * t$95$0), $MachinePrecision], N[(t$95$0 * -2.0), $MachinePrecision]]]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{F \cdot A}}{B}\\
\mathbf{if}\;B \leq -5.3 \cdot 10^{-306}:\\
\;\;\;\;2 \cdot t_0\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot -2\\
\end{array}
\end{array}
if B < -5.2999999999999998e-306Initial program 19.9%
Simplified19.9%
Taylor expanded in A around -inf 21.8%
*-commutative21.8%
Simplified21.8%
*-un-lft-identity21.8%
associate-*l*21.2%
cancel-sign-sub-inv21.2%
metadata-eval21.2%
*-commutative21.2%
associate-*r*21.2%
fma-udef21.2%
*-commutative21.2%
Applied egg-rr21.2%
*-lft-identity21.2%
Simplified21.2%
Taylor expanded in B around -inf 3.4%
associate-*r/3.4%
*-rgt-identity3.4%
Simplified3.4%
if -5.2999999999999998e-306 < B Initial program 20.8%
Simplified20.8%
Taylor expanded in A around -inf 14.7%
*-commutative14.7%
Simplified14.7%
*-un-lft-identity14.7%
associate-*l*14.6%
cancel-sign-sub-inv14.6%
metadata-eval14.6%
*-commutative14.6%
associate-*r*14.6%
fma-udef14.6%
*-commutative14.6%
Applied egg-rr14.6%
*-lft-identity14.6%
Simplified14.6%
Taylor expanded in B around inf 5.1%
associate-*r/5.1%
*-rgt-identity5.1%
Simplified5.1%
Final simplification4.2%
NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* (/ (sqrt (* F A)) B) -2.0))
assert(A < C);
double code(double A, double B, double C, double F) {
return (sqrt((F * A)) / B) * -2.0;
}
NOTE: A and C 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 * a)) / b) * (-2.0d0)
end function
assert A < C;
public static double code(double A, double B, double C, double F) {
return (Math.sqrt((F * A)) / B) * -2.0;
}
[A, C] = sort([A, C]) def code(A, B, C, F): return (math.sqrt((F * A)) / B) * -2.0
A, C = sort([A, C]) function code(A, B, C, F) return Float64(Float64(sqrt(Float64(F * A)) / B) * -2.0) end
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
tmp = (sqrt((F * A)) / B) * -2.0;
end
NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision] * -2.0), $MachinePrecision]
\begin{array}{l}
[A, C] = \mathsf{sort}([A, C])\\
\\
\frac{\sqrt{F \cdot A}}{B} \cdot -2
\end{array}
Initial program 20.3%
Simplified20.3%
Taylor expanded in A around -inf 18.5%
*-commutative18.5%
Simplified18.5%
*-un-lft-identity18.5%
associate-*l*18.1%
cancel-sign-sub-inv18.1%
metadata-eval18.1%
*-commutative18.1%
associate-*r*18.1%
fma-udef18.1%
*-commutative18.1%
Applied egg-rr18.1%
*-lft-identity18.1%
Simplified18.1%
Taylor expanded in B around inf 2.8%
associate-*r/2.8%
*-rgt-identity2.8%
Simplified2.8%
Final simplification2.8%
herbie shell --seed 2023175
(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))))