
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
NOTE: B should be positive before calling this function
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 (* A C))))
(t_1 (* (* 4.0 A) C))
(t_2
(-
(/
(sqrt
(*
(* 2.0 (* F (- t_1 (pow B 2.0))))
(- (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))) (+ A C))))
(- (pow B 2.0) t_1)))))
(if (<= t_2 -5e-202)
(/
(*
(sqrt (* 2.0 (* F (+ A (- C (hypot (- A C) B))))))
(- (sqrt (fma B B (* C (* A -4.0))))))
(fma B B (* A (* C -4.0))))
(if (<= t_2 INFINITY)
(-
(/ (sqrt (* 2.0 (* (* F t_0) (+ A (fma -0.5 (/ (* B B) C) A))))) t_0))
(- (/ (sqrt (* (* 2.0 F) (- A (hypot B A)))) B))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = (4.0 * A) * C;
double t_2 = -(sqrt(((2.0 * (F * (t_1 - pow(B, 2.0)))) * (sqrt((pow(B, 2.0) + pow((A - C), 2.0))) - (A + C)))) / (pow(B, 2.0) - t_1));
double tmp;
if (t_2 <= -5e-202) {
tmp = (sqrt((2.0 * (F * (A + (C - hypot((A - C), B)))))) * -sqrt(fma(B, B, (C * (A * -4.0))))) / fma(B, B, (A * (C * -4.0)));
} else if (t_2 <= ((double) INFINITY)) {
tmp = -(sqrt((2.0 * ((F * t_0) * (A + fma(-0.5, ((B * B) / C), A))))) / t_0);
} else {
tmp = -(sqrt(((2.0 * F) * (A - hypot(B, A)))) / B);
}
return tmp;
}
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(-Float64(sqrt(Float64(Float64(2.0 * Float64(F * Float64(t_1 - (B ^ 2.0)))) * Float64(sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)))) / Float64((B ^ 2.0) - t_1))) tmp = 0.0 if (t_2 <= -5e-202) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * Float64(A + Float64(C - hypot(Float64(A - C), B)))))) * Float64(-sqrt(fma(B, B, Float64(C * Float64(A * -4.0)))))) / fma(B, B, Float64(A * Float64(C * -4.0)))); elseif (t_2 <= Inf) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A))))) / t_0)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B, A)))) / B)); end return tmp end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $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[(F * N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision])}, If[LessEqual[t$95$2, -5e-202], N[(N[(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] * (-N[Sqrt[N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(B * B + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], (-N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), (-N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision])]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := -\frac{\sqrt{\left(2 \cdot \left(F \cdot \left(t_1 - {B}^{2}\right)\right)\right) \cdot \left(\sqrt{{B}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right)}}{{B}^{2} - t_1}\\
\mathbf{if}\;t_2 \leq -5 \cdot 10^{-202}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A + \left(C - \mathsf{hypot}\left(A - C, B\right)\right)\right)\right)} \cdot \left(-\sqrt{\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)}\right)}{\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)}}{B}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -4.99999999999999973e-202Initial program 37.4%
Simplified44.6%
sqrt-prod58.2%
associate-*r*58.2%
*-commutative58.2%
associate-*l*58.2%
associate--r-57.8%
+-commutative57.8%
Applied egg-rr57.8%
hypot-def48.3%
unpow248.3%
unpow248.3%
+-commutative48.3%
unpow248.3%
unpow248.3%
hypot-def57.8%
Simplified57.8%
if -4.99999999999999973e-202 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 12.6%
Simplified12.6%
Taylor expanded in C around inf 31.9%
associate--l+31.9%
fma-neg31.9%
associate--l+31.9%
unpow231.9%
unpow231.9%
unpow231.9%
mul-1-neg31.9%
mul-1-neg31.9%
sqr-neg31.9%
mul-1-neg31.9%
Simplified31.9%
Taylor expanded in A around 0 32.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified0.0%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
*-commutative1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-def21.7%
Simplified21.7%
associate-*l/21.8%
Applied egg-rr21.8%
pow121.8%
sqrt-unprod21.8%
Applied egg-rr21.8%
unpow121.8%
associate-*r*21.8%
hypot-def1.9%
unpow21.9%
unpow21.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-def21.8%
Simplified21.8%
Final simplification35.2%
NOTE: B should be positive before calling this function
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 (* A C))))
(t_1 (fma B B (* C (* A -4.0))))
(t_2 (+ (* B B) (* -4.0 (* A C)))))
(if (<= B 7.5e-99)
(- (/ (sqrt (* 2.0 (* (* F t_0) (+ A (fma -0.5 (/ (* B B) C) A))))) t_0))
(if (<= B 1.5e-5)
(/ (- (sqrt (* (* 2.0 (* F t_1)) (- A (- (hypot B (- A C)) C))))) t_1)
(if (<= B 7e+30)
(*
(sqrt (* 2.0 (* (* F t_2) (+ A (fma -0.5 (/ (fma B B 0.0) C) A)))))
(/ -1.0 t_2))
(- (/ (sqrt (* (* 2.0 F) (- A (hypot B A)))) B)))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = fma(B, B, (C * (A * -4.0)));
double t_2 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 7.5e-99) {
tmp = -(sqrt((2.0 * ((F * t_0) * (A + fma(-0.5, ((B * B) / C), A))))) / t_0);
} else if (B <= 1.5e-5) {
tmp = -sqrt(((2.0 * (F * t_1)) * (A - (hypot(B, (A - C)) - C)))) / t_1;
} else if (B <= 7e+30) {
tmp = sqrt((2.0 * ((F * t_2) * (A + fma(-0.5, (fma(B, B, 0.0) / C), A))))) * (-1.0 / t_2);
} else {
tmp = -(sqrt(((2.0 * F) * (A - hypot(B, A)))) / B);
}
return tmp;
}
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = fma(B, B, Float64(C * Float64(A * -4.0))) t_2 = Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B <= 7.5e-99) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A))))) / t_0)); elseif (B <= 1.5e-5) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(F * t_1)) * Float64(A - Float64(hypot(B, Float64(A - C)) - C))))) / t_1); elseif (B <= 7e+30) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_2) * Float64(A + fma(-0.5, Float64(fma(B, B, 0.0) / C), A))))) * Float64(-1.0 / t_2)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B, A)))) / B)); end return tmp end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 7.5e-99], (-N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), If[LessEqual[B, 1.5e-5], N[((-N[Sqrt[N[(N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision] * N[(A - N[(N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B, 7e+30], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$2), $MachinePrecision] * N[(A + N[(-0.5 * N[(N[(B * B + 0.0), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$2), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision])]]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\\
t_2 := B \cdot B + -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 7.5 \cdot 10^{-99}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 1.5 \cdot 10^{-5}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(F \cdot t_1\right)\right) \cdot \left(A - \left(\mathsf{hypot}\left(B, A - C\right) - C\right)\right)}}{t_1}\\
\mathbf{elif}\;B \leq 7 \cdot 10^{+30}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(F \cdot t_2\right) \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{\mathsf{fma}\left(B, B, 0\right)}{C}, A\right)\right)\right)} \cdot \frac{-1}{t_2}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)}}{B}\\
\end{array}
\end{array}
if B < 7.4999999999999999e-99Initial program 14.4%
Simplified14.4%
Taylor expanded in C around inf 15.5%
associate--l+15.5%
fma-neg15.5%
associate--l+14.9%
unpow214.9%
unpow214.9%
unpow214.9%
mul-1-neg14.9%
mul-1-neg14.9%
sqr-neg14.9%
mul-1-neg14.9%
Simplified14.9%
Taylor expanded in A around 0 15.8%
if 7.4999999999999999e-99 < B < 1.50000000000000004e-5Initial program 29.4%
Simplified34.6%
if 1.50000000000000004e-5 < B < 7.00000000000000042e30Initial program 27.3%
Simplified27.3%
Taylor expanded in C around inf 24.6%
associate--l+24.6%
fma-neg24.6%
associate--l+24.6%
unpow224.6%
unpow224.6%
unpow224.6%
mul-1-neg24.6%
mul-1-neg24.6%
sqr-neg24.6%
mul-1-neg24.6%
Simplified24.6%
div-inv25.0%
Applied egg-rr25.0%
if 7.00000000000000042e30 < B Initial program 8.5%
Simplified8.5%
Taylor expanded in C around 0 16.0%
mul-1-neg16.0%
*-commutative16.0%
+-commutative16.0%
unpow216.0%
unpow216.0%
hypot-def51.5%
Simplified51.5%
associate-*l/51.6%
Applied egg-rr51.6%
pow151.6%
sqrt-unprod51.7%
Applied egg-rr51.7%
unpow151.7%
associate-*r*51.7%
hypot-def16.1%
unpow216.1%
unpow216.1%
+-commutative16.1%
unpow216.1%
unpow216.1%
hypot-def51.7%
Simplified51.7%
Final simplification26.8%
NOTE: B should be positive before calling this function
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 (* A C))))
(t_1 (+ (* B B) (* -4.0 (* A C))))
(t_2 (* F t_0)))
(if (<= B 1.08e-104)
(- (/ (sqrt (* 2.0 (* t_2 (+ A (fma -0.5 (/ (* B B) C) A))))) t_0))
(if (<= B 2.5e-5)
(- (/ (sqrt (* 2.0 (* t_2 (- A (hypot A B))))) t_0))
(if (<= B 2.7e+31)
(*
(sqrt (* 2.0 (* (* F t_1) (+ A (fma -0.5 (/ (fma B B 0.0) C) A)))))
(/ -1.0 t_1))
(- (/ (sqrt (* (* 2.0 F) (- A (hypot B A)))) B)))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = (B * B) + (-4.0 * (A * C));
double t_2 = F * t_0;
double tmp;
if (B <= 1.08e-104) {
tmp = -(sqrt((2.0 * (t_2 * (A + fma(-0.5, ((B * B) / C), A))))) / t_0);
} else if (B <= 2.5e-5) {
tmp = -(sqrt((2.0 * (t_2 * (A - hypot(A, B))))) / t_0);
} else if (B <= 2.7e+31) {
tmp = sqrt((2.0 * ((F * t_1) * (A + fma(-0.5, (fma(B, B, 0.0) / C), A))))) * (-1.0 / t_1);
} else {
tmp = -(sqrt(((2.0 * F) * (A - hypot(B, A)))) / B);
}
return tmp;
}
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C))) t_2 = Float64(F * t_0) tmp = 0.0 if (B <= 1.08e-104) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_2 * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A))))) / t_0)); elseif (B <= 2.5e-5) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_2 * Float64(A - hypot(A, B))))) / t_0)); elseif (B <= 2.7e+31) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_1) * Float64(A + fma(-0.5, Float64(fma(B, B, 0.0) / C), A))))) * Float64(-1.0 / t_1)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B, A)))) / B)); end return tmp end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[B, 1.08e-104], (-N[(N[Sqrt[N[(2.0 * N[(t$95$2 * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), If[LessEqual[B, 2.5e-5], (-N[(N[Sqrt[N[(2.0 * N[(t$95$2 * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), If[LessEqual[B, 2.7e+31], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$1), $MachinePrecision] * N[(A + N[(-0.5 * N[(N[(B * B + 0.0), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision])]]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := B \cdot B + -4 \cdot \left(A \cdot C\right)\\
t_2 := F \cdot t_0\\
\mathbf{if}\;B \leq 1.08 \cdot 10^{-104}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_2 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 2.5 \cdot 10^{-5}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_2 \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 2.7 \cdot 10^{+31}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(F \cdot t_1\right) \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{\mathsf{fma}\left(B, B, 0\right)}{C}, A\right)\right)\right)} \cdot \frac{-1}{t_1}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)}}{B}\\
\end{array}
\end{array}
if B < 1.07999999999999997e-104Initial program 14.4%
Simplified14.4%
Taylor expanded in C around inf 15.5%
associate--l+15.5%
fma-neg15.5%
associate--l+14.9%
unpow214.9%
unpow214.9%
unpow214.9%
mul-1-neg14.9%
mul-1-neg14.9%
sqr-neg14.9%
mul-1-neg14.9%
Simplified14.9%
Taylor expanded in A around 0 15.8%
if 1.07999999999999997e-104 < B < 2.50000000000000012e-5Initial program 29.4%
Simplified29.4%
Taylor expanded in C around 0 21.6%
+-commutative21.6%
unpow221.6%
unpow221.6%
hypot-def21.7%
Simplified21.7%
if 2.50000000000000012e-5 < B < 2.69999999999999986e31Initial program 27.3%
Simplified27.3%
Taylor expanded in C around inf 24.6%
associate--l+24.6%
fma-neg24.6%
associate--l+24.6%
unpow224.6%
unpow224.6%
unpow224.6%
mul-1-neg24.6%
mul-1-neg24.6%
sqr-neg24.6%
mul-1-neg24.6%
Simplified24.6%
div-inv25.0%
Applied egg-rr25.0%
if 2.69999999999999986e31 < B Initial program 8.5%
Simplified8.5%
Taylor expanded in C around 0 16.0%
mul-1-neg16.0%
*-commutative16.0%
+-commutative16.0%
unpow216.0%
unpow216.0%
hypot-def51.5%
Simplified51.5%
associate-*l/51.6%
Applied egg-rr51.6%
pow151.6%
sqrt-unprod51.7%
Applied egg-rr51.7%
unpow151.7%
associate-*r*51.7%
hypot-def16.1%
unpow216.1%
unpow216.1%
+-commutative16.1%
unpow216.1%
unpow216.1%
hypot-def51.7%
Simplified51.7%
Final simplification25.7%
NOTE: B should be positive before calling this function
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 (* A C))))
(t_1 (* F t_0))
(t_2
(- (/ (sqrt (* 2.0 (* t_1 (+ A (fma -0.5 (/ (* B B) C) A))))) t_0))))
(if (<= B 1.6e-100)
t_2
(if (<= B 0.015)
(- (/ (sqrt (* 2.0 (* t_1 (- A (hypot A B))))) t_0))
(if (<= B 5.6e+31)
t_2
(- (/ (sqrt (* (* 2.0 F) (- A (hypot B A)))) B)))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = F * t_0;
double t_2 = -(sqrt((2.0 * (t_1 * (A + fma(-0.5, ((B * B) / C), A))))) / t_0);
double tmp;
if (B <= 1.6e-100) {
tmp = t_2;
} else if (B <= 0.015) {
tmp = -(sqrt((2.0 * (t_1 * (A - hypot(A, B))))) / t_0);
} else if (B <= 5.6e+31) {
tmp = t_2;
} else {
tmp = -(sqrt(((2.0 * F) * (A - hypot(B, A)))) / B);
}
return tmp;
}
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(F * t_0) t_2 = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_1 * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A))))) / t_0)) tmp = 0.0 if (B <= 1.6e-100) tmp = t_2; elseif (B <= 0.015) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(t_1 * Float64(A - hypot(A, B))))) / t_0)); elseif (B <= 5.6e+31) tmp = t_2; else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B, A)))) / B)); end return tmp end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision])}, If[LessEqual[B, 1.6e-100], t$95$2, If[LessEqual[B, 0.015], (-N[(N[Sqrt[N[(2.0 * N[(t$95$1 * N[(A - N[Sqrt[A ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), If[LessEqual[B, 5.6e+31], t$95$2, (-N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision])]]]]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := F \cdot t_0\\
t_2 := -\frac{\sqrt{2 \cdot \left(t_1 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)\right)}}{t_0}\\
\mathbf{if}\;B \leq 1.6 \cdot 10^{-100}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;B \leq 0.015:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(t_1 \cdot \left(A - \mathsf{hypot}\left(A, B\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 5.6 \cdot 10^{+31}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)}}{B}\\
\end{array}
\end{array}
if B < 1.60000000000000008e-100 or 0.014999999999999999 < B < 5.60000000000000034e31Initial program 14.7%
Simplified14.7%
Taylor expanded in C around inf 15.7%
associate--l+15.7%
fma-neg15.7%
associate--l+15.1%
unpow215.1%
unpow215.1%
unpow215.1%
mul-1-neg15.1%
mul-1-neg15.1%
sqr-neg15.1%
mul-1-neg15.1%
Simplified15.1%
Taylor expanded in A around 0 16.0%
if 1.60000000000000008e-100 < B < 0.014999999999999999Initial program 29.4%
Simplified29.4%
Taylor expanded in C around 0 21.6%
+-commutative21.6%
unpow221.6%
unpow221.6%
hypot-def21.7%
Simplified21.7%
if 5.60000000000000034e31 < B Initial program 8.5%
Simplified8.5%
Taylor expanded in C around 0 16.0%
mul-1-neg16.0%
*-commutative16.0%
+-commutative16.0%
unpow216.0%
unpow216.0%
hypot-def51.5%
Simplified51.5%
associate-*l/51.6%
Applied egg-rr51.6%
pow151.6%
sqrt-unprod51.7%
Applied egg-rr51.7%
unpow151.7%
associate-*r*51.7%
hypot-def16.1%
unpow216.1%
unpow216.1%
+-commutative16.1%
unpow216.1%
unpow216.1%
hypot-def51.7%
Simplified51.7%
Final simplification25.7%
NOTE: B should be positive before calling this function
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 (* A C)))))
(if (<= B 9.5e-67)
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0)
(/ (- (sqrt (* (* 2.0 F) (- A (hypot B A))))) B))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 9.5e-67) {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = -sqrt(((2.0 * F) * (A - hypot(B, A)))) / B;
}
return tmp;
}
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 9.5e-67) {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = -Math.sqrt(((2.0 * F) * (A - Math.hypot(B, A)))) / B;
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 9.5e-67: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 else: tmp = -math.sqrt(((2.0 * F) * (A - math.hypot(B, A)))) / B return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 9.5e-67) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B, A))))) / B); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (A * C));
tmp = 0.0;
if (B <= 9.5e-67)
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
else
tmp = -sqrt(((2.0 * F) * (A - hypot(B, A)))) / B;
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 9.5e-67], 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[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / B), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 9.5 \cdot 10^{-67}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)}}{B}\\
\end{array}
\end{array}
if B < 9.4999999999999994e-67Initial program 15.2%
Simplified15.2%
Taylor expanded in A around -inf 14.8%
*-commutative14.8%
Simplified14.8%
if 9.4999999999999994e-67 < B Initial program 12.7%
Simplified12.7%
Taylor expanded in C around 0 17.6%
mul-1-neg17.6%
*-commutative17.6%
+-commutative17.6%
unpow217.6%
unpow217.6%
hypot-def44.6%
Simplified44.6%
associate-*l/44.7%
Applied egg-rr44.7%
pow144.7%
sqrt-unprod44.8%
Applied egg-rr44.8%
unpow144.8%
associate-*r*44.8%
hypot-def17.7%
unpow217.7%
unpow217.7%
+-commutative17.7%
unpow217.7%
unpow217.7%
hypot-def44.8%
Simplified44.8%
Final simplification25.0%
NOTE: B should be positive before calling this function
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 (* A C)))))
(if (<= B 3.1e+37)
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0)
(* (/ (sqrt 2.0) B) (- (sqrt (* F (- A B))))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 3.1e+37) {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - B)));
}
return tmp;
}
NOTE: B should be positive before calling this function
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 * (a * c))
if (b <= 3.1d+37) then
tmp = -sqrt((2.0d0 * ((f * t_0) * (2.0d0 * a)))) / t_0
else
tmp = (sqrt(2.0d0) / b) * -sqrt((f * (a - b)))
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 3.1e+37) {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((F * (A - B)));
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 3.1e+37: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 else: tmp = (math.sqrt(2.0) / B) * -math.sqrt((F * (A - B))) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 3.1e+37) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(F * Float64(A - B))))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (A * C));
tmp = 0.0;
if (B <= 3.1e+37)
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
else
tmp = (sqrt(2.0) / B) * -sqrt((F * (A - B)));
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 3.1e+37], 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[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 3.1 \cdot 10^{+37}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{F \cdot \left(A - B\right)}\right)\\
\end{array}
\end{array}
if B < 3.1000000000000002e37Initial program 16.3%
Simplified16.3%
Taylor expanded in A around -inf 14.0%
*-commutative14.0%
Simplified14.0%
if 3.1000000000000002e37 < B Initial program 8.6%
Simplified8.6%
Taylor expanded in C around 0 16.2%
mul-1-neg16.2%
*-commutative16.2%
+-commutative16.2%
unpow216.2%
unpow216.2%
hypot-def52.2%
Simplified52.2%
Taylor expanded in A around 0 46.8%
mul-1-neg46.8%
unsub-neg46.8%
Simplified46.8%
Final simplification22.4%
NOTE: B should be positive before calling this function
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 (* A C)))))
(if (<= B 1.75e+36)
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0)
(* (sqrt (* B (- F))) (/ (- (sqrt 2.0)) B)))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.75e+36) {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = sqrt((B * -F)) * (-sqrt(2.0) / B);
}
return tmp;
}
NOTE: B should be positive before calling this function
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 * (a * c))
if (b <= 1.75d+36) then
tmp = -sqrt((2.0d0 * ((f * t_0) * (2.0d0 * a)))) / t_0
else
tmp = sqrt((b * -f)) * (-sqrt(2.0d0) / b)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.75e+36) {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = Math.sqrt((B * -F)) * (-Math.sqrt(2.0) / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 1.75e+36: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 else: tmp = math.sqrt((B * -F)) * (-math.sqrt(2.0) / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.75e+36) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); else tmp = Float64(sqrt(Float64(B * Float64(-F))) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (A * C));
tmp = 0.0;
if (B <= 1.75e+36)
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
else
tmp = sqrt((B * -F)) * (-sqrt(2.0) / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.75e+36], 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[(B * (-F)), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.75 \cdot 10^{+36}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{B \cdot \left(-F\right)} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 1.7499999999999999e36Initial program 16.3%
Simplified16.3%
Taylor expanded in A around -inf 14.0%
*-commutative14.0%
Simplified14.0%
if 1.7499999999999999e36 < B Initial program 8.6%
Simplified8.6%
Taylor expanded in C around 0 16.2%
mul-1-neg16.2%
*-commutative16.2%
+-commutative16.2%
unpow216.2%
unpow216.2%
hypot-def52.2%
Simplified52.2%
Taylor expanded in A around 0 46.3%
mul-1-neg46.3%
Simplified46.3%
Final simplification22.2%
NOTE: B should be positive before calling this function
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 (* A C)))))
(if (<= B 1.55e+36)
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0)
(/ (* (sqrt (* B (- F))) (- (sqrt 2.0))) B))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.55e+36) {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = (sqrt((B * -F)) * -sqrt(2.0)) / B;
}
return tmp;
}
NOTE: B should be positive before calling this function
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 * (a * c))
if (b <= 1.55d+36) then
tmp = -sqrt((2.0d0 * ((f * t_0) * (2.0d0 * a)))) / t_0
else
tmp = (sqrt((b * -f)) * -sqrt(2.0d0)) / b
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.55e+36) {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = (Math.sqrt((B * -F)) * -Math.sqrt(2.0)) / B;
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 1.55e+36: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 else: tmp = (math.sqrt((B * -F)) * -math.sqrt(2.0)) / B return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.55e+36) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); else tmp = Float64(Float64(sqrt(Float64(B * Float64(-F))) * Float64(-sqrt(2.0))) / B); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (A * C));
tmp = 0.0;
if (B <= 1.55e+36)
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
else
tmp = (sqrt((B * -F)) * -sqrt(2.0)) / B;
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.55e+36], 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[(N[Sqrt[N[(B * (-F)), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision] / B), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.55 \cdot 10^{+36}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{B \cdot \left(-F\right)} \cdot \left(-\sqrt{2}\right)}{B}\\
\end{array}
\end{array}
if B < 1.55e36Initial program 16.3%
Simplified16.3%
Taylor expanded in A around -inf 14.0%
*-commutative14.0%
Simplified14.0%
if 1.55e36 < B Initial program 8.6%
Simplified8.6%
Taylor expanded in C around 0 16.2%
mul-1-neg16.2%
*-commutative16.2%
+-commutative16.2%
unpow216.2%
unpow216.2%
hypot-def52.2%
Simplified52.2%
associate-*l/52.3%
Applied egg-rr52.3%
Taylor expanded in A around 0 46.4%
mul-1-neg46.4%
distribute-rgt-neg-out46.4%
Simplified46.4%
Final simplification22.3%
NOTE: B should be positive before calling this function
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 (* A C)))))
(if (<= B 4.4e+111)
(/ (- (sqrt (* 2.0 (* t_0 (* F (* 2.0 A)))))) t_0)
(* (sqrt (* A F)) (- (/ 2.0 B))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 4.4e+111) {
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else {
tmp = sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
NOTE: B should be positive before calling this function
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) * (a * c))
if (b <= 4.4d+111) then
tmp = -sqrt((2.0d0 * (t_0 * (f * (2.0d0 * a))))) / t_0
else
tmp = sqrt((a * f)) * -(2.0d0 / b)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) + (-4.0 * (A * C));
double tmp;
if (B <= 4.4e+111) {
tmp = -Math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
} else {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) + (-4.0 * (A * C)) tmp = 0 if B <= 4.4e+111: tmp = -math.sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0 else: tmp = math.sqrt((A * F)) * -(2.0 / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B <= 4.4e+111) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(t_0 * Float64(F * Float64(2.0 * A)))))) / t_0); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) + (-4.0 * (A * C));
tmp = 0.0;
if (B <= 4.4e+111)
tmp = -sqrt((2.0 * (t_0 * (F * (2.0 * A))))) / t_0;
else
tmp = sqrt((A * F)) * -(2.0 / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 4.4e+111], N[((-N[Sqrt[N[(2.0 * N[(t$95$0 * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B + -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 4.4 \cdot 10^{+111}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(t_0 \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\end{array}
\end{array}
if B < 4.39999999999999997e111Initial program 16.6%
Simplified16.6%
Taylor expanded in A around -inf 15.0%
*-commutative15.0%
Simplified15.0%
distribute-frac-neg15.0%
associate-*l*14.5%
cancel-sign-sub-inv14.5%
metadata-eval14.5%
cancel-sign-sub-inv14.5%
metadata-eval14.5%
Applied egg-rr14.5%
if 4.39999999999999997e111 < B Initial program 4.7%
Simplified4.7%
Taylor expanded in C around 0 10.6%
mul-1-neg10.6%
*-commutative10.6%
+-commutative10.6%
unpow210.6%
unpow210.6%
hypot-def57.2%
Simplified57.2%
Taylor expanded in A around -inf 7.2%
count-27.2%
Simplified7.2%
Taylor expanded in B around 0 7.2%
*-commutative7.2%
*-commutative7.2%
unpow27.2%
rem-square-sqrt7.2%
Simplified7.2%
Final simplification13.1%
NOTE: B should be positive before calling this function
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 (* A C)))))
(if (<= B 1.05e+108)
(/ (- (sqrt (* 2.0 (* (* F t_0) (* 2.0 A))))) t_0)
(* (sqrt (* A F)) (- (/ 2.0 B))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.05e+108) {
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
NOTE: B should be positive before calling this function
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 * (a * c))
if (b <= 1.05d+108) then
tmp = -sqrt((2.0d0 * ((f * t_0) * (2.0d0 * a)))) / t_0
else
tmp = sqrt((a * f)) * -(2.0d0 / b)
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.05e+108) {
tmp = -Math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
} else {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 1.05e+108: tmp = -math.sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0 else: tmp = math.sqrt((A * F)) * -(2.0 / B) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.05e+108) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(2.0 * A))))) / t_0); else tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
t_0 = (B * B) - (4.0 * (A * C));
tmp = 0.0;
if (B <= 1.05e+108)
tmp = -sqrt((2.0 * ((F * t_0) * (2.0 * A)))) / t_0;
else
tmp = sqrt((A * F)) * -(2.0 / B);
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function
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[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.05e+108], 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[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.05 \cdot 10^{+108}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(2 \cdot A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\end{array}
\end{array}
if B < 1.05000000000000005e108Initial program 16.6%
Simplified16.6%
Taylor expanded in A around -inf 15.0%
*-commutative15.0%
Simplified15.0%
if 1.05000000000000005e108 < B Initial program 4.7%
Simplified4.7%
Taylor expanded in C around 0 10.6%
mul-1-neg10.6%
*-commutative10.6%
+-commutative10.6%
unpow210.6%
unpow210.6%
hypot-def57.2%
Simplified57.2%
Taylor expanded in A around -inf 7.2%
count-27.2%
Simplified7.2%
Taylor expanded in B around 0 7.2%
*-commutative7.2%
*-commutative7.2%
unpow27.2%
rem-square-sqrt7.2%
Simplified7.2%
Final simplification13.5%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= A -5.8e+231)
(* (sqrt (* A F)) (- (/ 2.0 B)))
(/
(- (sqrt (* 2.0 (* (* 2.0 A) (* -4.0 (* A (* C F)))))))
(- (* B B) (* 4.0 (* A C))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (A <= -5.8e+231) {
tmp = sqrt((A * F)) * -(2.0 / B);
} else {
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (A * C)));
}
return tmp;
}
NOTE: B should be positive before calling this function
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 (a <= (-5.8d+231)) then
tmp = sqrt((a * f)) * -(2.0d0 / b)
else
tmp = -sqrt((2.0d0 * ((2.0d0 * a) * ((-4.0d0) * (a * (c * f)))))) / ((b * b) - (4.0d0 * (a * c)))
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (A <= -5.8e+231) {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
} else {
tmp = -Math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (A * C)));
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if A <= -5.8e+231: tmp = math.sqrt((A * F)) * -(2.0 / B) else: tmp = -math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (A * C))) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (A <= -5.8e+231) tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(2.0 * A) * Float64(-4.0 * Float64(A * Float64(C * F))))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (A <= -5.8e+231)
tmp = sqrt((A * F)) * -(2.0 / B);
else
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (A * (C * F)))))) / ((B * B) - (4.0 * (A * C)));
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[A, -5.8e+231], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(N[(2.0 * A), $MachinePrecision] * N[(-4.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5.8 \cdot 10^{+231}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(2 \cdot A\right) \cdot \left(-4 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right)\right)}}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\end{array}
\end{array}
if A < -5.8000000000000002e231Initial program 1.1%
Simplified1.1%
Taylor expanded in C around 0 0.7%
mul-1-neg0.7%
*-commutative0.7%
+-commutative0.7%
unpow20.7%
unpow20.7%
hypot-def19.2%
Simplified19.2%
Taylor expanded in A around -inf 19.2%
count-219.2%
Simplified19.2%
Taylor expanded in B around 0 19.0%
*-commutative19.0%
*-commutative19.0%
unpow219.0%
rem-square-sqrt19.3%
Simplified19.3%
if -5.8000000000000002e231 < A Initial program 15.2%
Simplified15.2%
Taylor expanded in A around -inf 12.6%
*-commutative12.6%
Simplified12.6%
Taylor expanded in B around 0 11.1%
*-commutative11.1%
Simplified11.1%
Final simplification11.6%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= A -9e+231)
(* (sqrt (* A F)) (- (/ 2.0 B)))
(/
(- (sqrt (* 2.0 (* (* 2.0 A) (* -4.0 (* C (* A F)))))))
(- (* B B) (* 4.0 (* A C))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (A <= -9e+231) {
tmp = sqrt((A * F)) * -(2.0 / B);
} else {
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (C * (A * F)))))) / ((B * B) - (4.0 * (A * C)));
}
return tmp;
}
NOTE: B should be positive before calling this function
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 (a <= (-9d+231)) then
tmp = sqrt((a * f)) * -(2.0d0 / b)
else
tmp = -sqrt((2.0d0 * ((2.0d0 * a) * ((-4.0d0) * (c * (a * f)))))) / ((b * b) - (4.0d0 * (a * c)))
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (A <= -9e+231) {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
} else {
tmp = -Math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (C * (A * F)))))) / ((B * B) - (4.0 * (A * C)));
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if A <= -9e+231: tmp = math.sqrt((A * F)) * -(2.0 / B) else: tmp = -math.sqrt((2.0 * ((2.0 * A) * (-4.0 * (C * (A * F)))))) / ((B * B) - (4.0 * (A * C))) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (A <= -9e+231) tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(2.0 * A) * Float64(-4.0 * Float64(C * Float64(A * F))))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (A <= -9e+231)
tmp = sqrt((A * F)) * -(2.0 / B);
else
tmp = -sqrt((2.0 * ((2.0 * A) * (-4.0 * (C * (A * F)))))) / ((B * B) - (4.0 * (A * C)));
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[A, -9e+231], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(N[(2.0 * A), $MachinePrecision] * N[(-4.0 * N[(C * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -9 \cdot 10^{+231}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(2 \cdot A\right) \cdot \left(-4 \cdot \left(C \cdot \left(A \cdot F\right)\right)\right)\right)}}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\end{array}
\end{array}
if A < -8.99999999999999982e231Initial program 1.1%
Simplified1.1%
Taylor expanded in C around 0 0.7%
mul-1-neg0.7%
*-commutative0.7%
+-commutative0.7%
unpow20.7%
unpow20.7%
hypot-def19.2%
Simplified19.2%
Taylor expanded in A around -inf 19.2%
count-219.2%
Simplified19.2%
Taylor expanded in B around 0 19.0%
*-commutative19.0%
*-commutative19.0%
unpow219.0%
rem-square-sqrt19.3%
Simplified19.3%
if -8.99999999999999982e231 < A Initial program 15.2%
Simplified15.2%
Taylor expanded in A around -inf 12.6%
*-commutative12.6%
Simplified12.6%
Taylor expanded in B around 0 11.1%
*-commutative11.1%
associate-*r*11.8%
*-commutative11.8%
Simplified11.8%
Final simplification12.3%
NOTE: B should be positive before calling this function
NOTE: A and C should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= A -1.1e+153)
(* (sqrt (* A F)) (- (/ 2.0 B)))
(/
(- (sqrt (* 2.0 (* -8.0 (* (* C F) (* A A))))))
(- (* B B) (* 4.0 (* A C))))))B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
double tmp;
if (A <= -1.1e+153) {
tmp = sqrt((A * F)) * -(2.0 / B);
} else {
tmp = -sqrt((2.0 * (-8.0 * ((C * F) * (A * A))))) / ((B * B) - (4.0 * (A * C)));
}
return tmp;
}
NOTE: B should be positive before calling this function
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 (a <= (-1.1d+153)) then
tmp = sqrt((a * f)) * -(2.0d0 / b)
else
tmp = -sqrt((2.0d0 * ((-8.0d0) * ((c * f) * (a * a))))) / ((b * b) - (4.0d0 * (a * c)))
end if
code = tmp
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
double tmp;
if (A <= -1.1e+153) {
tmp = Math.sqrt((A * F)) * -(2.0 / B);
} else {
tmp = -Math.sqrt((2.0 * (-8.0 * ((C * F) * (A * A))))) / ((B * B) - (4.0 * (A * C)));
}
return tmp;
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): tmp = 0 if A <= -1.1e+153: tmp = math.sqrt((A * F)) * -(2.0 / B) else: tmp = -math.sqrt((2.0 * (-8.0 * ((C * F) * (A * A))))) / ((B * B) - (4.0 * (A * C))) return tmp
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) tmp = 0.0 if (A <= -1.1e+153) tmp = Float64(sqrt(Float64(A * F)) * Float64(-Float64(2.0 / B))); else tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(-8.0 * Float64(Float64(C * F) * Float64(A * A)))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); end return tmp end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (A <= -1.1e+153)
tmp = sqrt((A * F)) * -(2.0 / B);
else
tmp = -sqrt((2.0 * (-8.0 * ((C * F) * (A * A))))) / ((B * B) - (4.0 * (A * C)));
end
tmp_2 = tmp;
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[A, -1.1e+153], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * (-N[(2.0 / B), $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[N[(2.0 * N[(-8.0 * N[(N[(C * F), $MachinePrecision] * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -1.1 \cdot 10^{+153}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \left(-\frac{2}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(-8 \cdot \left(\left(C \cdot F\right) \cdot \left(A \cdot A\right)\right)\right)}}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\end{array}
\end{array}
if A < -1.1e153Initial program 4.9%
Simplified4.9%
Taylor expanded in C around 0 4.5%
mul-1-neg4.5%
*-commutative4.5%
+-commutative4.5%
unpow24.5%
unpow24.5%
hypot-def20.3%
Simplified20.3%
Taylor expanded in A around -inf 16.5%
count-216.5%
Simplified16.5%
Taylor expanded in B around 0 16.4%
*-commutative16.4%
*-commutative16.4%
unpow216.4%
rem-square-sqrt16.6%
Simplified16.6%
if -1.1e153 < A Initial program 15.4%
Simplified15.4%
Taylor expanded in A around -inf 12.2%
*-commutative12.2%
Simplified12.2%
Taylor expanded in B around 0 10.4%
unpow210.4%
*-commutative10.4%
Simplified10.4%
Final simplification11.0%
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* -2.0 (/ (sqrt (* A F)) B)))
B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
return -2.0 * (sqrt((A * F)) / B);
}
NOTE: B should be positive before calling this function
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 = (-2.0d0) * (sqrt((a * f)) / b)
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
return -2.0 * (Math.sqrt((A * F)) / B);
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): return -2.0 * (math.sqrt((A * F)) / B)
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) return Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)) end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
tmp = -2.0 * (sqrt((A * F)) / B);
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
-2 \cdot \frac{\sqrt{A \cdot F}}{B}
\end{array}
Initial program 14.3%
Simplified14.3%
Taylor expanded in A around -inf 12.3%
*-commutative12.3%
Simplified12.3%
Taylor expanded in B around inf 3.7%
associate-*r/3.7%
*-rgt-identity3.7%
*-commutative3.7%
Simplified3.7%
Final simplification3.7%
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (- (pow (/ F A) 0.5)))
B = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
return -pow((F / A), 0.5);
}
NOTE: B should be positive before calling this function
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 = -((f / a) ** 0.5d0)
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
return -Math.pow((F / A), 0.5);
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): return -math.pow((F / A), 0.5)
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) return Float64(-(Float64(F / A) ^ 0.5)) end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
tmp = -((F / A) ^ 0.5);
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := (-N[Power[N[(F / A), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
-{\left(\frac{F}{A}\right)}^{0.5}
\end{array}
Initial program 14.3%
Simplified15.8%
Taylor expanded in A around -inf 8.4%
fma-def8.4%
unpow28.4%
mul-1-neg8.4%
Simplified8.4%
Taylor expanded in B around inf 2.5%
mul-1-neg2.5%
Simplified2.5%
pow1/22.8%
Applied egg-rr2.8%
Final simplification2.8%
NOTE: B should be positive before calling this function 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 = abs(B);
assert(A < C);
double code(double A, double B, double C, double F) {
return -sqrt((F / A));
}
NOTE: B should be positive before calling this function
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))
end function
B = Math.abs(B);
assert A < C;
public static double code(double A, double B, double C, double F) {
return -Math.sqrt((F / A));
}
B = abs(B) [A, C] = sort([A, C]) def code(A, B, C, F): return -math.sqrt((F / A))
B = abs(B) A, C = sort([A, C]) function code(A, B, C, F) return Float64(-sqrt(Float64(F / A))) end
B = abs(B)
A, C = num2cell(sort([A, C])){:}
function tmp = code(A, B, C, F)
tmp = -sqrt((F / A));
end
NOTE: B should be positive before calling this function NOTE: A and C should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := (-N[Sqrt[N[(F / A), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B = |B|\\
[A, C] = \mathsf{sort}([A, C])\\
\\
-\sqrt{\frac{F}{A}}
\end{array}
Initial program 14.3%
Simplified15.8%
Taylor expanded in A around -inf 8.4%
fma-def8.4%
unpow28.4%
mul-1-neg8.4%
Simplified8.4%
Taylor expanded in B around inf 2.5%
mul-1-neg2.5%
Simplified2.5%
Final simplification2.5%
herbie shell --seed 2023228
(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))))