
(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 23 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
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (sqrt (+ C (+ A (hypot B (- A C))))))
(t_2 (- (pow B 2.0) (* (* 4.0 A) C)))
(t_3
(-
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_2)))
(t_4 (fma B B (* C (* A -4.0))))
(t_5 (- (* B B) (* 4.0 (* A C)))))
(if (<= t_3 -1e-224)
(- (/ (* (sqrt (* 2.0 (* F t_4))) t_1) t_4))
(if (<= t_3 0.0)
(/
(- (sqrt (* 2.0 (* (* F t_0) (+ C (+ C (* -0.5 (/ (* B B) A))))))))
t_0)
(if (<= t_3 INFINITY)
(/ (* (sqrt (* 2.0 (* F t_5))) (- t_1)) t_5)
(*
(* (sqrt (+ A (hypot B A))) (sqrt F))
(* (sqrt 2.0) (/ -1.0 B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = sqrt((C + (A + hypot(B, (A - C)))));
double t_2 = pow(B, 2.0) - ((4.0 * A) * C);
double t_3 = -(sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_2);
double t_4 = fma(B, B, (C * (A * -4.0)));
double t_5 = (B * B) - (4.0 * (A * C));
double tmp;
if (t_3 <= -1e-224) {
tmp = -((sqrt((2.0 * (F * t_4))) * t_1) / t_4);
} else if (t_3 <= 0.0) {
tmp = -sqrt((2.0 * ((F * t_0) * (C + (C + (-0.5 * ((B * B) / A))))))) / t_0;
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((2.0 * (F * t_5))) * -t_1) / t_5;
} else {
tmp = (sqrt((A + hypot(B, A))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B));
}
return tmp;
}
B = abs(B) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = sqrt(Float64(C + Float64(A + hypot(B, Float64(A - C))))) t_2 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(-Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2)) t_4 = fma(B, B, Float64(C * Float64(A * -4.0))) t_5 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (t_3 <= -1e-224) tmp = Float64(-Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_4))) * t_1) / t_4)); elseif (t_3 <= 0.0) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(C + Float64(C + Float64(-0.5 * Float64(Float64(B * B) / A)))))))) / t_0); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_5))) * Float64(-t_1)) / t_5); else tmp = Float64(Float64(sqrt(Float64(A + hypot(B, A))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B))); end return tmp end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision])}, Block[{t$95$4 = N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e-224], (-N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$4), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision] / t$95$4), $MachinePrecision]), If[LessEqual[t$95$3, 0.0], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(C + N[(C + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-t$95$1)), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(N[Sqrt[N[(A + N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \sqrt{C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)}\\
t_2 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := -\frac{\sqrt{\left(2 \cdot \left(t_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_2}\\
t_4 := \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\\
t_5 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;t_3 \leq -1 \cdot 10^{-224}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(F \cdot t_4\right)} \cdot t_1}{t_4}\\
\mathbf{elif}\;t_3 \leq 0:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(C + \left(C + -0.5 \cdot \frac{B \cdot B}{A}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;t_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot t_5\right)} \cdot \left(-t_1\right)}{t_5}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B, A\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B}\right)\\
\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))) < -1e-224Initial program 46.6%
Simplified60.6%
sqrt-prod72.1%
*-commutative72.1%
associate-+r+71.0%
+-commutative71.0%
associate-+r+72.1%
Applied egg-rr72.1%
if -1e-224 < (/.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))) < -0.0Initial program 3.6%
Simplified8.0%
Taylor expanded in A around -inf 35.8%
unpow235.8%
Simplified35.8%
if -0.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))) < +inf.0Initial program 54.6%
associate-*l*54.6%
unpow254.6%
+-commutative54.6%
unpow254.6%
associate-*l*54.6%
unpow254.6%
Simplified54.6%
sqrt-prod53.0%
*-commutative53.0%
*-commutative53.0%
associate-+l+53.0%
unpow253.0%
hypot-udef85.1%
associate-+r+85.1%
+-commutative85.1%
associate-+r+85.1%
Applied egg-rr85.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%
Simplified1.1%
Taylor expanded in C around 0 1.7%
mul-1-neg1.7%
distribute-rgt-neg-in1.7%
unpow21.7%
unpow21.7%
hypot-def22.7%
Simplified22.7%
div-inv22.8%
Applied egg-rr22.8%
sqrt-prod34.1%
Applied egg-rr34.1%
Final simplification51.8%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (- (* B B) (* 4.0 (* A C))))
(t_2
(/
(* (sqrt (* 2.0 (* F t_1))) (- (sqrt (+ C (+ A (hypot B (- A C)))))))
t_1)))
(if (<= B 1.1e-49)
t_2
(if (<= B 1.12e-21)
(/
(- (sqrt (* 2.0 (* (* F t_0) (+ C (+ C (* -0.5 (/ (* B B) A))))))))
t_0)
(if (<= B 8.8e+147)
t_2
(*
(* (sqrt (+ A (hypot B A))) (sqrt F))
(* (sqrt 2.0) (/ -1.0 B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (B * B) - (4.0 * (A * C));
double t_2 = (sqrt((2.0 * (F * t_1))) * -sqrt((C + (A + hypot(B, (A - C)))))) / t_1;
double tmp;
if (B <= 1.1e-49) {
tmp = t_2;
} else if (B <= 1.12e-21) {
tmp = -sqrt((2.0 * ((F * t_0) * (C + (C + (-0.5 * ((B * B) / A))))))) / t_0;
} else if (B <= 8.8e+147) {
tmp = t_2;
} else {
tmp = (sqrt((A + hypot(B, A))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B));
}
return tmp;
}
B = abs(B) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_2 = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_1))) * Float64(-sqrt(Float64(C + Float64(A + hypot(B, Float64(A - C))))))) / t_1) tmp = 0.0 if (B <= 1.1e-49) tmp = t_2; elseif (B <= 1.12e-21) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(C + Float64(C + Float64(-0.5 * Float64(Float64(B * B) / A)))))))) / t_0); elseif (B <= 8.8e+147) tmp = t_2; else tmp = Float64(Float64(sqrt(Float64(A + hypot(B, A))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B))); end return tmp end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[B, 1.1e-49], t$95$2, If[LessEqual[B, 1.12e-21], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(C + N[(C + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 8.8e+147], t$95$2, N[(N[(N[Sqrt[N[(A + N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_2 := \frac{\sqrt{2 \cdot \left(F \cdot t_1\right)} \cdot \left(-\sqrt{C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)}\right)}{t_1}\\
\mathbf{if}\;B \leq 1.1 \cdot 10^{-49}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;B \leq 1.12 \cdot 10^{-21}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(C + \left(C + -0.5 \cdot \frac{B \cdot B}{A}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 8.8 \cdot 10^{+147}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B, A\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B}\right)\\
\end{array}
\end{array}
if B < 1.09999999999999995e-49 or 1.11999999999999998e-21 < B < 8.8000000000000007e147Initial program 25.6%
associate-*l*25.6%
unpow225.6%
+-commutative25.6%
unpow225.6%
associate-*l*25.6%
unpow225.6%
Simplified25.6%
sqrt-prod26.6%
*-commutative26.6%
*-commutative26.6%
associate-+l+26.6%
unpow226.6%
hypot-udef39.9%
associate-+r+39.5%
+-commutative39.5%
associate-+r+40.5%
Applied egg-rr40.5%
if 1.09999999999999995e-49 < B < 1.11999999999999998e-21Initial program 16.5%
Simplified23.0%
Taylor expanded in A around -inf 80.0%
unpow280.0%
Simplified80.0%
if 8.8000000000000007e147 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
div-inv54.8%
Applied egg-rr54.8%
sqrt-prod84.1%
Applied egg-rr84.1%
Final simplification48.6%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (- (* B B) (* 4.0 (* A C))))
(t_2
(/
(* (sqrt (* 2.0 (* F t_1))) (- (sqrt (+ C (+ A (hypot B (- A C)))))))
t_1)))
(if (<= B 1.1e-49)
t_2
(if (<= B 1.12e-21)
(/
(- (sqrt (* 2.0 (* (* F t_0) (+ C (+ C (* -0.5 (/ (* B B) A))))))))
t_0)
(if (<= B 8.8e+147)
t_2
(* (* (sqrt (+ A (hypot B A))) (sqrt F)) (/ (- (sqrt 2.0)) B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (B * B) - (4.0 * (A * C));
double t_2 = (sqrt((2.0 * (F * t_1))) * -sqrt((C + (A + hypot(B, (A - C)))))) / t_1;
double tmp;
if (B <= 1.1e-49) {
tmp = t_2;
} else if (B <= 1.12e-21) {
tmp = -sqrt((2.0 * ((F * t_0) * (C + (C + (-0.5 * ((B * B) / A))))))) / t_0;
} else if (B <= 8.8e+147) {
tmp = t_2;
} else {
tmp = (sqrt((A + hypot(B, A))) * sqrt(F)) * (-sqrt(2.0) / B);
}
return tmp;
}
B = abs(B) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_2 = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_1))) * Float64(-sqrt(Float64(C + Float64(A + hypot(B, Float64(A - C))))))) / t_1) tmp = 0.0 if (B <= 1.1e-49) tmp = t_2; elseif (B <= 1.12e-21) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(C + Float64(C + Float64(-0.5 * Float64(Float64(B * B) / A)))))))) / t_0); elseif (B <= 8.8e+147) tmp = t_2; else tmp = Float64(Float64(sqrt(Float64(A + hypot(B, A))) * sqrt(F)) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[B, 1.1e-49], t$95$2, If[LessEqual[B, 1.12e-21], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(C + N[(C + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 8.8e+147], t$95$2, N[(N[(N[Sqrt[N[(A + N[Sqrt[B ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_2 := \frac{\sqrt{2 \cdot \left(F \cdot t_1\right)} \cdot \left(-\sqrt{C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)}\right)}{t_1}\\
\mathbf{if}\;B \leq 1.1 \cdot 10^{-49}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;B \leq 1.12 \cdot 10^{-21}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(C + \left(C + -0.5 \cdot \frac{B \cdot B}{A}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 8.8 \cdot 10^{+147}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{A + \mathsf{hypot}\left(B, A\right)} \cdot \sqrt{F}\right) \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 1.09999999999999995e-49 or 1.11999999999999998e-21 < B < 8.8000000000000007e147Initial program 25.6%
associate-*l*25.6%
unpow225.6%
+-commutative25.6%
unpow225.6%
associate-*l*25.6%
unpow225.6%
Simplified25.6%
sqrt-prod26.6%
*-commutative26.6%
*-commutative26.6%
associate-+l+26.6%
unpow226.6%
hypot-udef39.9%
associate-+r+39.5%
+-commutative39.5%
associate-+r+40.5%
Applied egg-rr40.5%
if 1.09999999999999995e-49 < B < 1.11999999999999998e-21Initial program 16.5%
Simplified23.0%
Taylor expanded in A around -inf 80.0%
unpow280.0%
Simplified80.0%
if 8.8000000000000007e147 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
sqrt-prod84.1%
Applied egg-rr84.0%
Final simplification48.6%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (- (* B B) (* 4.0 (* A C))))
(t_2
(/
(* (sqrt (* 2.0 (* F t_1))) (- (sqrt (+ C (+ A (hypot B (- A C)))))))
t_1)))
(if (<= B 1.1e-49)
t_2
(if (<= B 1.12e-21)
(/
(- (sqrt (* 2.0 (* (* F t_0) (+ C (+ C (* -0.5 (/ (* B B) A))))))))
t_0)
(if (<= B 1.06e+148)
t_2
(* (/ (sqrt 2.0) B) (* (sqrt (+ B A)) (- (sqrt F)))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (B * B) - (4.0 * (A * C));
double t_2 = (sqrt((2.0 * (F * t_1))) * -sqrt((C + (A + hypot(B, (A - C)))))) / t_1;
double tmp;
if (B <= 1.1e-49) {
tmp = t_2;
} else if (B <= 1.12e-21) {
tmp = -sqrt((2.0 * ((F * t_0) * (C + (C + (-0.5 * ((B * B) / A))))))) / t_0;
} else if (B <= 1.06e+148) {
tmp = t_2;
} else {
tmp = (sqrt(2.0) / B) * (sqrt((B + A)) * -sqrt(F));
}
return tmp;
}
B = abs(B) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_2 = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_1))) * Float64(-sqrt(Float64(C + Float64(A + hypot(B, Float64(A - C))))))) / t_1) tmp = 0.0 if (B <= 1.1e-49) tmp = t_2; elseif (B <= 1.12e-21) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(C + Float64(C + Float64(-0.5 * Float64(Float64(B * B) / A)))))))) / t_0); elseif (B <= 1.06e+148) tmp = t_2; else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(sqrt(Float64(B + A)) * Float64(-sqrt(F)))); end return tmp end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[B, 1.1e-49], t$95$2, If[LessEqual[B, 1.12e-21], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(C + N[(C + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 1.06e+148], t$95$2, N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * N[(N[Sqrt[N[(B + A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_2 := \frac{\sqrt{2 \cdot \left(F \cdot t_1\right)} \cdot \left(-\sqrt{C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)}\right)}{t_1}\\
\mathbf{if}\;B \leq 1.1 \cdot 10^{-49}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;B \leq 1.12 \cdot 10^{-21}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(C + \left(C + -0.5 \cdot \frac{B \cdot B}{A}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 1.06 \cdot 10^{+148}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{B + A} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 1.09999999999999995e-49 or 1.11999999999999998e-21 < B < 1.06e148Initial program 25.6%
associate-*l*25.6%
unpow225.6%
+-commutative25.6%
unpow225.6%
associate-*l*25.6%
unpow225.6%
Simplified25.6%
sqrt-prod26.6%
*-commutative26.6%
*-commutative26.6%
associate-+l+26.6%
unpow226.6%
hypot-udef39.9%
associate-+r+39.5%
+-commutative39.5%
associate-+r+40.5%
Applied egg-rr40.5%
if 1.09999999999999995e-49 < B < 1.11999999999999998e-21Initial program 16.5%
Simplified23.0%
Taylor expanded in A around -inf 80.0%
unpow280.0%
Simplified80.0%
if 1.06e148 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
sqrt-prod84.1%
Applied egg-rr84.0%
Taylor expanded in A around 0 79.7%
+-commutative50.5%
Simplified79.7%
Final simplification47.9%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (fma B B (* C (* A -4.0))))
(t_2 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 8.5e-196)
(/ (- (sqrt (* 2.0 (* (* F t_0) (+ C C))))) t_0)
(if (<= B 1.15e-169)
(- (/ (sqrt (* (* 2.0 (* F t_1)) (+ A A))) t_1))
(if (<= B 7.2e+144)
(/ (- (sqrt (* 2.0 (* (+ C (+ A (hypot B (- A C)))) (* F t_2))))) t_2)
(* (/ (sqrt 2.0) B) (* (sqrt (+ B A)) (- (sqrt F)))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = fma(B, B, (C * (A * -4.0)));
double t_2 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 8.5e-196) {
tmp = -sqrt((2.0 * ((F * t_0) * (C + C)))) / t_0;
} else if (B <= 1.15e-169) {
tmp = -(sqrt(((2.0 * (F * t_1)) * (A + A))) / t_1);
} else if (B <= 7.2e+144) {
tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_2)))) / t_2;
} else {
tmp = (sqrt(2.0) / B) * (sqrt((B + A)) * -sqrt(F));
}
return tmp;
}
B = abs(B) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) 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 <= 8.5e-196) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(F * t_0) * Float64(C + C))))) / t_0); elseif (B <= 1.15e-169) tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_1)) * Float64(A + A))) / t_1)); elseif (B <= 7.2e+144) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(C + Float64(A + hypot(B, Float64(A - C)))) * Float64(F * t_2))))) / t_2); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(sqrt(Float64(B + A)) * Float64(-sqrt(F)))); end return tmp end
NOTE: B should be positive before calling this function
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(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, 8.5e-196], N[((-N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(C + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 1.15e-169], (-N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), If[LessEqual[B, 7.2e+144], N[((-N[Sqrt[N[(2.0 * N[(N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * N[(N[Sqrt[N[(B + A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\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 8.5 \cdot 10^{-196}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(C + C\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 1.15 \cdot 10^{-169}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot \left(F \cdot t_1\right)\right) \cdot \left(A + A\right)}}{t_1}\\
\mathbf{elif}\;B \leq 7.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(F \cdot t_2\right)\right)}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{B + A} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 8.50000000000000004e-196Initial program 19.7%
Simplified27.7%
Taylor expanded in A around -inf 15.0%
if 8.50000000000000004e-196 < B < 1.15e-169Initial program 20.9%
Simplified24.9%
Taylor expanded in A around inf 40.0%
distribute-rgt1-in40.0%
metadata-eval40.0%
mul0-lft40.0%
Simplified40.0%
if 1.15e-169 < B < 7.1999999999999995e144Initial program 39.3%
associate-*l*39.3%
unpow239.3%
+-commutative39.3%
unpow239.3%
associate-*l*39.3%
unpow239.3%
Simplified39.3%
distribute-frac-neg39.3%
Applied egg-rr50.9%
if 7.1999999999999995e144 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
sqrt-prod84.1%
Applied egg-rr84.0%
Taylor expanded in A around 0 79.7%
+-commutative50.5%
Simplified79.7%
Final simplification34.9%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 7.2e+144)
(/ (- (sqrt (* 2.0 (* (+ C (+ A (hypot B (- A C)))) (* F t_0))))) t_0)
(* (/ (sqrt 2.0) B) (* (sqrt (+ B A)) (- (sqrt F)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 7.2e+144) {
tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else {
tmp = (sqrt(2.0) / B) * (sqrt((B + A)) * -sqrt(F));
}
return tmp;
}
B = Math.abs(B);
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 <= 7.2e+144) {
tmp = -Math.sqrt((2.0 * ((C + (A + Math.hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else {
tmp = (Math.sqrt(2.0) / B) * (Math.sqrt((B + A)) * -Math.sqrt(F));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 7.2e+144: tmp = -math.sqrt((2.0 * ((C + (A + math.hypot(B, (A - C)))) * (F * t_0)))) / t_0 else: tmp = (math.sqrt(2.0) / B) * (math.sqrt((B + A)) * -math.sqrt(F)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 7.2e+144) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(C + Float64(A + hypot(B, Float64(A - C)))) * Float64(F * t_0))))) / t_0); else tmp = Float64(Float64(sqrt(2.0) / B) * Float64(sqrt(Float64(B + A)) * Float64(-sqrt(F)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 7.2e+144) tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0; else tmp = (sqrt(2.0) / B) * (sqrt((B + A)) * -sqrt(F)); end tmp_2 = tmp; end
NOTE: B should be positive 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, 7.2e+144], N[((-N[Sqrt[N[(2.0 * N[(N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * N[(N[Sqrt[N[(B + A), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 7.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{B + A} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if B < 7.1999999999999995e144Initial program 25.3%
associate-*l*25.3%
unpow225.3%
+-commutative25.3%
unpow225.3%
associate-*l*25.3%
unpow225.3%
Simplified25.3%
distribute-frac-neg25.3%
Applied egg-rr34.2%
if 7.1999999999999995e144 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
sqrt-prod84.1%
Applied egg-rr84.0%
Taylor expanded in A around 0 79.7%
+-commutative50.5%
Simplified79.7%
Final simplification41.8%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 7.2e+144)
(/ (- (sqrt (* 2.0 (* (+ C (+ A (hypot B (- A C)))) (* F t_0))))) t_0)
(* (* (sqrt F) (sqrt B)) (* (sqrt 2.0) (/ -1.0 B))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 7.2e+144) {
tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else {
tmp = (sqrt(F) * sqrt(B)) * (sqrt(2.0) * (-1.0 / B));
}
return tmp;
}
B = Math.abs(B);
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 <= 7.2e+144) {
tmp = -Math.sqrt((2.0 * ((C + (A + Math.hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else {
tmp = (Math.sqrt(F) * Math.sqrt(B)) * (Math.sqrt(2.0) * (-1.0 / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 7.2e+144: tmp = -math.sqrt((2.0 * ((C + (A + math.hypot(B, (A - C)))) * (F * t_0)))) / t_0 else: tmp = (math.sqrt(F) * math.sqrt(B)) * (math.sqrt(2.0) * (-1.0 / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 7.2e+144) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(C + Float64(A + hypot(B, Float64(A - C)))) * Float64(F * t_0))))) / t_0); else tmp = Float64(Float64(sqrt(F) * sqrt(B)) * Float64(sqrt(2.0) * Float64(-1.0 / B))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 7.2e+144) tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0; else tmp = (sqrt(F) * sqrt(B)) * (sqrt(2.0) * (-1.0 / B)); end tmp_2 = tmp; end
NOTE: B should be positive 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, 7.2e+144], N[((-N[Sqrt[N[(2.0 * N[(N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 7.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{F} \cdot \sqrt{B}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B}\right)\\
\end{array}
\end{array}
if B < 7.1999999999999995e144Initial program 25.3%
associate-*l*25.3%
unpow225.3%
+-commutative25.3%
unpow225.3%
associate-*l*25.3%
unpow225.3%
Simplified25.3%
distribute-frac-neg25.3%
Applied egg-rr34.2%
if 7.1999999999999995e144 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
div-inv54.8%
Applied egg-rr54.8%
sqrt-prod84.1%
Applied egg-rr84.1%
Taylor expanded in A around 0 78.8%
Final simplification41.7%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 7.2e+144)
(/ (- (sqrt (* 2.0 (* (+ C (+ A (hypot B (- A C)))) (* F t_0))))) t_0)
(* (* (sqrt F) (sqrt B)) (/ (- (sqrt 2.0)) B)))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 7.2e+144) {
tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else {
tmp = (sqrt(F) * sqrt(B)) * (-sqrt(2.0) / B);
}
return tmp;
}
B = Math.abs(B);
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 <= 7.2e+144) {
tmp = -Math.sqrt((2.0 * ((C + (A + Math.hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else {
tmp = (Math.sqrt(F) * Math.sqrt(B)) * (-Math.sqrt(2.0) / B);
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 7.2e+144: tmp = -math.sqrt((2.0 * ((C + (A + math.hypot(B, (A - C)))) * (F * t_0)))) / t_0 else: tmp = (math.sqrt(F) * math.sqrt(B)) * (-math.sqrt(2.0) / B) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 7.2e+144) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(C + Float64(A + hypot(B, Float64(A - C)))) * Float64(F * t_0))))) / t_0); else tmp = Float64(Float64(sqrt(F) * sqrt(B)) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 7.2e+144) tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0; else tmp = (sqrt(F) * sqrt(B)) * (-sqrt(2.0) / B); end tmp_2 = tmp; end
NOTE: B should be positive 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, 7.2e+144], N[((-N[Sqrt[N[(2.0 * N[(N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B], $MachinePrecision]), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 7.2 \cdot 10^{+144}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{F} \cdot \sqrt{B}\right) \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 7.1999999999999995e144Initial program 25.3%
associate-*l*25.3%
unpow225.3%
+-commutative25.3%
unpow225.3%
associate-*l*25.3%
unpow225.3%
Simplified25.3%
distribute-frac-neg25.3%
Applied egg-rr34.2%
if 7.1999999999999995e144 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
sqrt-prod84.1%
Applied egg-rr84.0%
Taylor expanded in A around 0 78.8%
Final simplification41.7%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 7.8e+144)
(/ (- (sqrt (* 2.0 (* (+ C (+ A (hypot B (- A C)))) (* F t_0))))) t_0)
(if (<= B 4.6e+294)
(* (sqrt (* F (+ B A))) (* (sqrt 2.0) (/ -1.0 B)))
(* (sqrt 2.0) (- (sqrt (/ F B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 7.8e+144) {
tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else if (B <= 4.6e+294) {
tmp = sqrt((F * (B + A))) * (sqrt(2.0) * (-1.0 / B));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
B = Math.abs(B);
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 <= 7.8e+144) {
tmp = -Math.sqrt((2.0 * ((C + (A + Math.hypot(B, (A - C)))) * (F * t_0)))) / t_0;
} else if (B <= 4.6e+294) {
tmp = Math.sqrt((F * (B + A))) * (Math.sqrt(2.0) * (-1.0 / B));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 7.8e+144: tmp = -math.sqrt((2.0 * ((C + (A + math.hypot(B, (A - C)))) * (F * t_0)))) / t_0 elif B <= 4.6e+294: tmp = math.sqrt((F * (B + A))) * (math.sqrt(2.0) * (-1.0 / B)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 7.8e+144) tmp = Float64(Float64(-sqrt(Float64(2.0 * Float64(Float64(C + Float64(A + hypot(B, Float64(A - C)))) * Float64(F * t_0))))) / t_0); elseif (B <= 4.6e+294) tmp = Float64(sqrt(Float64(F * Float64(B + A))) * Float64(sqrt(2.0) * Float64(-1.0 / B))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 7.8e+144) tmp = -sqrt((2.0 * ((C + (A + hypot(B, (A - C)))) * (F * t_0)))) / t_0; elseif (B <= 4.6e+294) tmp = sqrt((F * (B + A))) * (sqrt(2.0) * (-1.0 / B)); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive 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, 7.8e+144], N[((-N[Sqrt[N[(2.0 * N[(N[(C + N[(A + N[Sqrt[B ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B, 4.6e+294], N[(N[Sqrt[N[(F * N[(B + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 7.8 \cdot 10^{+144}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(C + \left(A + \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{elif}\;B \leq 4.6 \cdot 10^{+294}:\\
\;\;\;\;\sqrt{F \cdot \left(B + A\right)} \cdot \left(\sqrt{2} \cdot \frac{-1}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 7.80000000000000036e144Initial program 25.3%
associate-*l*25.3%
unpow225.3%
+-commutative25.3%
unpow225.3%
associate-*l*25.3%
unpow225.3%
Simplified25.3%
distribute-frac-neg25.3%
Applied egg-rr34.2%
if 7.80000000000000036e144 < B < 4.59999999999999994e294Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def61.7%
Simplified61.7%
div-inv61.7%
Applied egg-rr61.7%
Taylor expanded in A around 0 56.8%
+-commutative56.8%
Simplified56.8%
if 4.59999999999999994e294 < B Initial program 0.0%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def2.4%
Simplified2.4%
Taylor expanded in A around 0 100.0%
mul-1-neg100.0%
Simplified100.0%
Final simplification38.8%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(if (<= F -2e-310)
(/
(*
(sqrt (* (* 2.0 F) (+ (* B B) (* -4.0 (* A C)))))
(- (sqrt (+ A (+ A C)))))
(- (* B B) (* 4.0 (* A C))))
(if (<= F 6e-34)
(* (sqrt (* B F)) (* (sqrt 2.0) (/ -1.0 B)))
(* (sqrt 2.0) (- (sqrt (/ F B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double tmp;
if (F <= -2e-310) {
tmp = (sqrt(((2.0 * F) * ((B * B) + (-4.0 * (A * C))))) * -sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C)));
} else if (F <= 6e-34) {
tmp = sqrt((B * F)) * (sqrt(2.0) * (-1.0 / B));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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 (f <= (-2d-310)) then
tmp = (sqrt(((2.0d0 * f) * ((b * b) + ((-4.0d0) * (a * c))))) * -sqrt((a + (a + c)))) / ((b * b) - (4.0d0 * (a * c)))
else if (f <= 6d-34) then
tmp = sqrt((b * f)) * (sqrt(2.0d0) * ((-1.0d0) / b))
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double tmp;
if (F <= -2e-310) {
tmp = (Math.sqrt(((2.0 * F) * ((B * B) + (-4.0 * (A * C))))) * -Math.sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C)));
} else if (F <= 6e-34) {
tmp = Math.sqrt((B * F)) * (Math.sqrt(2.0) * (-1.0 / B));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): tmp = 0 if F <= -2e-310: tmp = (math.sqrt(((2.0 * F) * ((B * B) + (-4.0 * (A * C))))) * -math.sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C))) elif F <= 6e-34: tmp = math.sqrt((B * F)) * (math.sqrt(2.0) * (-1.0 / B)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) tmp = 0.0 if (F <= -2e-310) tmp = Float64(Float64(sqrt(Float64(Float64(2.0 * F) * Float64(Float64(B * B) + Float64(-4.0 * Float64(A * C))))) * Float64(-sqrt(Float64(A + Float64(A + C))))) / Float64(Float64(B * B) - Float64(4.0 * Float64(A * C)))); elseif (F <= 6e-34) tmp = Float64(sqrt(Float64(B * F)) * Float64(sqrt(2.0) * Float64(-1.0 / B))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) tmp = 0.0; if (F <= -2e-310) tmp = (sqrt(((2.0 * F) * ((B * B) + (-4.0 * (A * C))))) * -sqrt((A + (A + C)))) / ((B * B) - (4.0 * (A * C))); elseif (F <= 6e-34) tmp = sqrt((B * F)) * (sqrt(2.0) * (-1.0 / B)); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := If[LessEqual[F, -2e-310], N[(N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(N[(B * B), $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(N[(B * B), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[F, 6e-34], N[(N[Sqrt[N[(B * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(B \cdot B + -4 \cdot \left(A \cdot C\right)\right)} \cdot \left(-\sqrt{A + \left(A + C\right)}\right)}{B \cdot B - 4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;F \leq 6 \cdot 10^{-34}:\\
\;\;\;\;\sqrt{B \cdot F} \cdot \left(\sqrt{2} \cdot \frac{-1}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if F < -1.999999999999994e-310Initial program 46.5%
associate-*l*46.5%
unpow246.5%
+-commutative46.5%
unpow246.5%
associate-*l*46.5%
unpow246.5%
Simplified46.5%
Taylor expanded in A around inf 41.6%
sqrt-prod51.2%
*-commutative51.2%
*-commutative51.2%
associate-+l+51.2%
Applied egg-rr51.2%
associate-*r*51.2%
unpow251.2%
cancel-sign-sub-inv51.2%
unpow251.2%
metadata-eval51.2%
Simplified51.2%
if -1.999999999999994e-310 < F < 6e-34Initial program 18.8%
Simplified27.5%
Taylor expanded in C around 0 7.2%
mul-1-neg7.2%
distribute-rgt-neg-in7.2%
unpow27.2%
unpow27.2%
hypot-def25.7%
Simplified25.7%
div-inv25.8%
Applied egg-rr25.8%
Taylor expanded in A around 0 21.4%
if 6e-34 < F Initial program 16.6%
Simplified20.7%
Taylor expanded in C around 0 10.3%
mul-1-neg10.3%
distribute-rgt-neg-in10.3%
unpow210.3%
unpow210.3%
hypot-def16.0%
Simplified16.0%
Taylor expanded in A around 0 22.5%
mul-1-neg22.5%
Simplified22.5%
Final simplification25.6%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= F 9.5e-307)
(/ (- (sqrt (* (+ A (+ A C)) (* 2.0 (* F t_0))))) t_0)
(if (<= F 6e-34)
(* (sqrt (* B F)) (* (sqrt 2.0) (/ -1.0 B)))
(* (sqrt 2.0) (- (sqrt (/ F B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (F <= 9.5e-307) {
tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
} else if (F <= 6e-34) {
tmp = sqrt((B * F)) * (sqrt(2.0) * (-1.0 / B));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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 (f <= 9.5d-307) then
tmp = -sqrt(((a + (a + c)) * (2.0d0 * (f * t_0)))) / t_0
else if (f <= 6d-34) then
tmp = sqrt((b * f)) * (sqrt(2.0d0) * ((-1.0d0) / b))
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (F <= 9.5e-307) {
tmp = -Math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
} else if (F <= 6e-34) {
tmp = Math.sqrt((B * F)) * (Math.sqrt(2.0) * (-1.0 / B));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if F <= 9.5e-307: tmp = -math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0 elif F <= 6e-34: tmp = math.sqrt((B * F)) * (math.sqrt(2.0) * (-1.0 / B)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (F <= 9.5e-307) tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(A + C)) * Float64(2.0 * Float64(F * t_0))))) / t_0); elseif (F <= 6e-34) tmp = Float64(sqrt(Float64(B * F)) * Float64(sqrt(2.0) * Float64(-1.0 / B))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (F <= 9.5e-307) tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0; elseif (F <= 6e-34) tmp = sqrt((B * F)) * (sqrt(2.0) * (-1.0 / B)); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive 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[F, 9.5e-307], N[((-N[Sqrt[N[(N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[F, 6e-34], N[(N[Sqrt[N[(B * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;F \leq 9.5 \cdot 10^{-307}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{elif}\;F \leq 6 \cdot 10^{-34}:\\
\;\;\;\;\sqrt{B \cdot F} \cdot \left(\sqrt{2} \cdot \frac{-1}{B}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if F < 9.5e-307Initial program 45.2%
associate-*l*45.2%
unpow245.2%
+-commutative45.2%
unpow245.2%
associate-*l*45.2%
unpow245.2%
Simplified45.2%
Taylor expanded in A around inf 40.6%
if 9.5e-307 < F < 6e-34Initial program 18.9%
Simplified27.7%
Taylor expanded in C around 0 7.3%
mul-1-neg7.3%
distribute-rgt-neg-in7.3%
unpow27.3%
unpow27.3%
hypot-def25.9%
Simplified25.9%
div-inv26.0%
Applied egg-rr26.0%
Taylor expanded in A around 0 21.6%
if 6e-34 < F Initial program 16.6%
Simplified20.7%
Taylor expanded in C around 0 10.3%
mul-1-neg10.3%
distribute-rgt-neg-in10.3%
unpow210.3%
unpow210.3%
hypot-def16.0%
Simplified16.0%
Taylor expanded in A around 0 22.5%
mul-1-neg22.5%
Simplified22.5%
Final simplification24.4%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= F 9.5e-307)
(/ (- (sqrt (* (+ A (+ A C)) (* 2.0 (* F t_0))))) t_0)
(if (<= F 8.6e-35)
(* (/ (sqrt 2.0) B) (- (sqrt (* B F))))
(* (sqrt 2.0) (- (sqrt (/ F B))))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (F <= 9.5e-307) {
tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
} else if (F <= 8.6e-35) {
tmp = (sqrt(2.0) / B) * -sqrt((B * F));
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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 (f <= 9.5d-307) then
tmp = -sqrt(((a + (a + c)) * (2.0d0 * (f * t_0)))) / t_0
else if (f <= 8.6d-35) then
tmp = (sqrt(2.0d0) / b) * -sqrt((b * f))
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (F <= 9.5e-307) {
tmp = -Math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0;
} else if (F <= 8.6e-35) {
tmp = (Math.sqrt(2.0) / B) * -Math.sqrt((B * F));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if F <= 9.5e-307: tmp = -math.sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0 elif F <= 8.6e-35: tmp = (math.sqrt(2.0) / B) * -math.sqrt((B * F)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (F <= 9.5e-307) tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(A + C)) * Float64(2.0 * Float64(F * t_0))))) / t_0); elseif (F <= 8.6e-35) tmp = Float64(Float64(sqrt(2.0) / B) * Float64(-sqrt(Float64(B * F)))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (F <= 9.5e-307) tmp = -sqrt(((A + (A + C)) * (2.0 * (F * t_0)))) / t_0; elseif (F <= 8.6e-35) tmp = (sqrt(2.0) / B) * -sqrt((B * F)); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive 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[F, 9.5e-307], N[((-N[Sqrt[N[(N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[F, 8.6e-35], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * (-N[Sqrt[N[(B * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;F \leq 9.5 \cdot 10^{-307}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{elif}\;F \leq 8.6 \cdot 10^{-35}:\\
\;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(-\sqrt{B \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if F < 9.5e-307Initial program 45.2%
associate-*l*45.2%
unpow245.2%
+-commutative45.2%
unpow245.2%
associate-*l*45.2%
unpow245.2%
Simplified45.2%
Taylor expanded in A around inf 40.6%
if 9.5e-307 < F < 8.6000000000000004e-35Initial program 18.9%
Simplified27.7%
Taylor expanded in C around 0 7.3%
mul-1-neg7.3%
distribute-rgt-neg-in7.3%
unpow27.3%
unpow27.3%
hypot-def25.9%
Simplified25.9%
Taylor expanded in A around 0 21.6%
if 8.6000000000000004e-35 < F Initial program 16.6%
Simplified20.7%
Taylor expanded in C around 0 10.3%
mul-1-neg10.3%
distribute-rgt-neg-in10.3%
unpow210.3%
unpow210.3%
hypot-def16.0%
Simplified16.0%
Taylor expanded in A around 0 22.5%
mul-1-neg22.5%
Simplified22.5%
Final simplification24.4%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 1.3e-56)
(- (/ (pow (* 2.0 (* (* F t_0) (+ A (+ A C)))) 0.5) t_0))
(* (sqrt 2.0) (- (sqrt (/ F B)))))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.3e-56) {
tmp = -(pow((2.0 * ((F * t_0) * (A + (A + C)))), 0.5) / t_0);
} else {
tmp = sqrt(2.0) * -sqrt((F / B));
}
return tmp;
}
NOTE: B should be positive 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.3d-56) then
tmp = -(((2.0d0 * ((f * t_0) * (a + (a + c)))) ** 0.5d0) / t_0)
else
tmp = sqrt(2.0d0) * -sqrt((f / b))
end if
code = tmp
end function
B = Math.abs(B);
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.3e-56) {
tmp = -(Math.pow((2.0 * ((F * t_0) * (A + (A + C)))), 0.5) / t_0);
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B));
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 1.3e-56: tmp = -(math.pow((2.0 * ((F * t_0) * (A + (A + C)))), 0.5) / t_0) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B)) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.3e-56) tmp = Float64(-Float64((Float64(2.0 * Float64(Float64(F * t_0) * Float64(A + Float64(A + C)))) ^ 0.5) / t_0)); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B)))); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 1.3e-56) tmp = -(((2.0 * ((F * t_0) * (A + (A + C)))) ^ 0.5) / t_0); else tmp = sqrt(2.0) * -sqrt((F / B)); end tmp_2 = tmp; end
NOTE: B should be positive 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.3e-56], (-N[(N[Power[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.3 \cdot 10^{-56}:\\
\;\;\;\;-\frac{{\left(2 \cdot \left(\left(F \cdot t_0\right) \cdot \left(A + \left(A + C\right)\right)\right)\right)}^{0.5}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B}}\right)\\
\end{array}
\end{array}
if B < 1.29999999999999998e-56Initial program 23.2%
associate-*l*23.2%
unpow223.2%
+-commutative23.2%
unpow223.2%
associate-*l*23.2%
unpow223.2%
Simplified23.2%
Taylor expanded in A around inf 15.1%
pow1/215.3%
associate-*l*15.3%
*-commutative15.3%
*-commutative15.3%
associate-+l+15.3%
Applied egg-rr15.3%
if 1.29999999999999998e-56 < B Initial program 16.1%
Simplified22.0%
Taylor expanded in C around 0 14.2%
mul-1-neg14.2%
distribute-rgt-neg-in14.2%
unpow214.2%
unpow214.2%
hypot-def45.3%
Simplified45.3%
Taylor expanded in A around 0 40.3%
mul-1-neg40.3%
Simplified40.3%
Final simplification22.7%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))) (t_1 (* 2.0 (* F t_0))))
(if (<= A -6.8e+26)
(/ (- (sqrt (* t_1 (+ C (* -0.5 (/ (* B B) A)))))) t_0)
(if (<= A 2.1e-92)
(/ (- (sqrt (* t_1 (+ B C)))) t_0)
(/ (- (sqrt (* t_1 (+ (+ A C) (- A C))))) t_0)))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = 2.0 * (F * t_0);
double tmp;
if (A <= -6.8e+26) {
tmp = -sqrt((t_1 * (C + (-0.5 * ((B * B) / A))))) / t_0;
} else if (A <= 2.1e-92) {
tmp = -sqrt((t_1 * (B + C))) / t_0;
} else {
tmp = -sqrt((t_1 * ((A + C) + (A - C)))) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
t_1 = 2.0d0 * (f * t_0)
if (a <= (-6.8d+26)) then
tmp = -sqrt((t_1 * (c + ((-0.5d0) * ((b * b) / a))))) / t_0
else if (a <= 2.1d-92) then
tmp = -sqrt((t_1 * (b + c))) / t_0
else
tmp = -sqrt((t_1 * ((a + c) + (a - c)))) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = 2.0 * (F * t_0);
double tmp;
if (A <= -6.8e+26) {
tmp = -Math.sqrt((t_1 * (C + (-0.5 * ((B * B) / A))))) / t_0;
} else if (A <= 2.1e-92) {
tmp = -Math.sqrt((t_1 * (B + C))) / t_0;
} else {
tmp = -Math.sqrt((t_1 * ((A + C) + (A - C)))) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) t_1 = 2.0 * (F * t_0) tmp = 0 if A <= -6.8e+26: tmp = -math.sqrt((t_1 * (C + (-0.5 * ((B * B) / A))))) / t_0 elif A <= 2.1e-92: tmp = -math.sqrt((t_1 * (B + C))) / t_0 else: tmp = -math.sqrt((t_1 * ((A + C) + (A - C)))) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(2.0 * Float64(F * t_0)) tmp = 0.0 if (A <= -6.8e+26) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(C + Float64(-0.5 * Float64(Float64(B * B) / A)))))) / t_0); elseif (A <= 2.1e-92) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(B + C)))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(Float64(A + C) + Float64(A - C))))) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); t_1 = 2.0 * (F * t_0); tmp = 0.0; if (A <= -6.8e+26) tmp = -sqrt((t_1 * (C + (-0.5 * ((B * B) / A))))) / t_0; elseif (A <= 2.1e-92) tmp = -sqrt((t_1 * (B + C))) / t_0; else tmp = -sqrt((t_1 * ((A + C) + (A - C)))) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive 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[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, -6.8e+26], N[((-N[Sqrt[N[(t$95$1 * N[(C + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[A, 2.1e-92], N[((-N[Sqrt[N[(t$95$1 * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(t$95$1 * N[(N[(A + C), $MachinePrecision] + N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := 2 \cdot \left(F \cdot t_0\right)\\
\mathbf{if}\;A \leq -6.8 \cdot 10^{+26}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(C + -0.5 \cdot \frac{B \cdot B}{A}\right)}}{t_0}\\
\mathbf{elif}\;A \leq 2.1 \cdot 10^{-92}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(B + C\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(\left(A + C\right) + \left(A - C\right)\right)}}{t_0}\\
\end{array}
\end{array}
if A < -6.8000000000000005e26Initial program 2.2%
associate-*l*2.2%
unpow22.2%
+-commutative2.2%
unpow22.2%
associate-*l*2.2%
unpow22.2%
Simplified2.2%
Taylor expanded in C around 0 2.3%
unpow22.3%
unpow22.3%
hypot-def3.0%
Simplified3.0%
Taylor expanded in A around -inf 14.8%
+-commutative14.8%
*-commutative14.8%
unpow214.8%
Simplified14.8%
if -6.8000000000000005e26 < A < 2.1e-92Initial program 23.7%
associate-*l*23.7%
unpow223.7%
+-commutative23.7%
unpow223.7%
associate-*l*23.7%
unpow223.7%
Simplified23.7%
Taylor expanded in C around 0 19.4%
unpow219.4%
unpow219.4%
hypot-def19.4%
Simplified19.4%
Taylor expanded in A around 0 12.9%
if 2.1e-92 < A Initial program 29.3%
associate-*l*29.3%
unpow229.3%
+-commutative29.3%
unpow229.3%
associate-*l*29.3%
unpow229.3%
Simplified29.3%
Taylor expanded in B around 0 34.4%
Final simplification20.1%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))) (t_1 (* 2.0 (* F t_0))))
(if (<= A 6.5e-93)
(/ (- (sqrt (* t_1 (+ B C)))) t_0)
(/ (- (sqrt (* t_1 (+ (+ A C) (- A C))))) t_0))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = 2.0 * (F * t_0);
double tmp;
if (A <= 6.5e-93) {
tmp = -sqrt((t_1 * (B + C))) / t_0;
} else {
tmp = -sqrt((t_1 * ((A + C) + (A - C)))) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
t_1 = 2.0d0 * (f * t_0)
if (a <= 6.5d-93) then
tmp = -sqrt((t_1 * (b + c))) / t_0
else
tmp = -sqrt((t_1 * ((a + c) + (a - c)))) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = 2.0 * (F * t_0);
double tmp;
if (A <= 6.5e-93) {
tmp = -Math.sqrt((t_1 * (B + C))) / t_0;
} else {
tmp = -Math.sqrt((t_1 * ((A + C) + (A - C)))) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) t_1 = 2.0 * (F * t_0) tmp = 0 if A <= 6.5e-93: tmp = -math.sqrt((t_1 * (B + C))) / t_0 else: tmp = -math.sqrt((t_1 * ((A + C) + (A - C)))) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(2.0 * Float64(F * t_0)) tmp = 0.0 if (A <= 6.5e-93) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(B + C)))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(Float64(A + C) + Float64(A - C))))) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); t_1 = 2.0 * (F * t_0); tmp = 0.0; if (A <= 6.5e-93) tmp = -sqrt((t_1 * (B + C))) / t_0; else tmp = -sqrt((t_1 * ((A + C) + (A - C)))) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive 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[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, 6.5e-93], N[((-N[Sqrt[N[(t$95$1 * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(t$95$1 * N[(N[(A + C), $MachinePrecision] + N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := 2 \cdot \left(F \cdot t_0\right)\\
\mathbf{if}\;A \leq 6.5 \cdot 10^{-93}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(B + C\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(\left(A + C\right) + \left(A - C\right)\right)}}{t_0}\\
\end{array}
\end{array}
if A < 6.5e-93Initial program 17.3%
associate-*l*17.3%
unpow217.3%
+-commutative17.3%
unpow217.3%
associate-*l*17.3%
unpow217.3%
Simplified17.3%
Taylor expanded in C around 0 14.3%
unpow214.3%
unpow214.3%
hypot-def14.5%
Simplified14.5%
Taylor expanded in A around 0 10.7%
if 6.5e-93 < A Initial program 29.3%
associate-*l*29.3%
unpow229.3%
+-commutative29.3%
unpow229.3%
associate-*l*29.3%
unpow229.3%
Simplified29.3%
Taylor expanded in B around 0 34.4%
Final simplification18.2%
NOTE: B should be positive 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)))
(if (<= A 2.5e-92)
(/ (- (sqrt (* (* 2.0 t_1) (+ B C)))) t_0)
(- (/ (pow (* 2.0 (* t_1 (+ A (+ A C)))) 0.5) t_0)))))B = abs(B);
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 tmp;
if (A <= 2.5e-92) {
tmp = -sqrt(((2.0 * t_1) * (B + C))) / t_0;
} else {
tmp = -(pow((2.0 * (t_1 * (A + (A + C)))), 0.5) / t_0);
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
t_1 = f * t_0
if (a <= 2.5d-92) then
tmp = -sqrt(((2.0d0 * t_1) * (b + c))) / t_0
else
tmp = -(((2.0d0 * (t_1 * (a + (a + c)))) ** 0.5d0) / t_0)
end if
code = tmp
end function
B = Math.abs(B);
public static 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 tmp;
if (A <= 2.5e-92) {
tmp = -Math.sqrt(((2.0 * t_1) * (B + C))) / t_0;
} else {
tmp = -(Math.pow((2.0 * (t_1 * (A + (A + C)))), 0.5) / t_0);
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) t_1 = F * t_0 tmp = 0 if A <= 2.5e-92: tmp = -math.sqrt(((2.0 * t_1) * (B + C))) / t_0 else: tmp = -(math.pow((2.0 * (t_1 * (A + (A + C)))), 0.5) / t_0) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(F * t_0) tmp = 0.0 if (A <= 2.5e-92) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * t_1) * Float64(B + C)))) / t_0); else tmp = Float64(-Float64((Float64(2.0 * Float64(t_1 * Float64(A + Float64(A + C)))) ^ 0.5) / t_0)); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); t_1 = F * t_0; tmp = 0.0; if (A <= 2.5e-92) tmp = -sqrt(((2.0 * t_1) * (B + C))) / t_0; else tmp = -(((2.0 * (t_1 * (A + (A + C)))) ^ 0.5) / t_0); end tmp_2 = tmp; end
NOTE: B should be positive 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]}, If[LessEqual[A, 2.5e-92], N[((-N[Sqrt[N[(N[(2.0 * t$95$1), $MachinePrecision] * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], (-N[(N[Power[N[(2.0 * N[(t$95$1 * N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / t$95$0), $MachinePrecision])]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := F \cdot t_0\\
\mathbf{if}\;A \leq 2.5 \cdot 10^{-92}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot t_1\right) \cdot \left(B + C\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;-\frac{{\left(2 \cdot \left(t_1 \cdot \left(A + \left(A + C\right)\right)\right)\right)}^{0.5}}{t_0}\\
\end{array}
\end{array}
if A < 2.50000000000000006e-92Initial program 17.3%
associate-*l*17.3%
unpow217.3%
+-commutative17.3%
unpow217.3%
associate-*l*17.3%
unpow217.3%
Simplified17.3%
Taylor expanded in C around 0 14.3%
unpow214.3%
unpow214.3%
hypot-def14.5%
Simplified14.5%
Taylor expanded in A around 0 10.7%
if 2.50000000000000006e-92 < A Initial program 29.3%
associate-*l*29.3%
unpow229.3%
+-commutative29.3%
unpow229.3%
associate-*l*29.3%
unpow229.3%
Simplified29.3%
Taylor expanded in A around inf 33.7%
pow1/233.8%
associate-*l*33.8%
*-commutative33.8%
*-commutative33.8%
associate-+l+33.8%
Applied egg-rr33.8%
Final simplification18.0%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= B 1.14e+145)
(- (/ (sqrt (* (* 2.0 (* F t_0)) (+ A (+ B C)))) t_0))
(* (pow (* A F) 0.5) (/ (- 2.0) B)))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (B <= 1.14e+145) {
tmp = -(sqrt(((2.0 * (F * t_0)) * (A + (B + C)))) / t_0);
} else {
tmp = pow((A * F), 0.5) * (-2.0 / B);
}
return tmp;
}
NOTE: B should be positive 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.14d+145) then
tmp = -(sqrt(((2.0d0 * (f * t_0)) * (a + (b + c)))) / t_0)
else
tmp = ((a * f) ** 0.5d0) * (-2.0d0 / b)
end if
code = tmp
end function
B = Math.abs(B);
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.14e+145) {
tmp = -(Math.sqrt(((2.0 * (F * t_0)) * (A + (B + C)))) / t_0);
} else {
tmp = Math.pow((A * F), 0.5) * (-2.0 / B);
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if B <= 1.14e+145: tmp = -(math.sqrt(((2.0 * (F * t_0)) * (A + (B + C)))) / t_0) else: tmp = math.pow((A * F), 0.5) * (-2.0 / B) return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.14e+145) tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(A + Float64(B + C)))) / t_0)); else tmp = Float64((Float64(A * F) ^ 0.5) * Float64(Float64(-2.0) / B)); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (B <= 1.14e+145) tmp = -(sqrt(((2.0 * (F * t_0)) * (A + (B + C)))) / t_0); else tmp = ((A * F) ^ 0.5) * (-2.0 / B); end tmp_2 = tmp; end
NOTE: B should be positive 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.14e+145], (-N[(N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(A + N[(B + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[Power[N[(A * F), $MachinePrecision], 0.5], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B \leq 1.14 \cdot 10^{+145}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot \left(F \cdot t_0\right)\right) \cdot \left(A + \left(B + C\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;{\left(A \cdot F\right)}^{0.5} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if B < 1.14000000000000001e145Initial program 25.3%
associate-*l*25.3%
unpow225.3%
+-commutative25.3%
unpow225.3%
associate-*l*25.3%
unpow225.3%
Simplified25.3%
Taylor expanded in C around 0 21.7%
unpow221.7%
unpow221.7%
hypot-def26.0%
Simplified26.0%
Taylor expanded in A around 0 11.1%
if 1.14000000000000001e145 < B Initial program 0.1%
Simplified0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
distribute-rgt-neg-in2.4%
unpow22.4%
unpow22.4%
hypot-def54.8%
Simplified54.8%
sqrt-prod84.1%
Applied egg-rr84.0%
Taylor expanded in B around 0 7.7%
mul-1-neg7.7%
*-commutative7.7%
unpow27.7%
rem-square-sqrt7.8%
Simplified7.8%
pow1/27.9%
Applied egg-rr7.9%
Final simplification10.6%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))) (t_1 (* 2.0 (* F t_0))))
(if (<= A 6.5e-93)
(/ (- (sqrt (* t_1 (+ B C)))) t_0)
(/ (- (sqrt (* (+ A (+ A C)) t_1))) t_0))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = 2.0 * (F * t_0);
double tmp;
if (A <= 6.5e-93) {
tmp = -sqrt((t_1 * (B + C))) / t_0;
} else {
tmp = -sqrt(((A + (A + C)) * t_1)) / t_0;
}
return tmp;
}
NOTE: B should be positive 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 * (a * c))
t_1 = 2.0d0 * (f * t_0)
if (a <= 6.5d-93) then
tmp = -sqrt((t_1 * (b + c))) / t_0
else
tmp = -sqrt(((a + (a + c)) * t_1)) / t_0
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double t_1 = 2.0 * (F * t_0);
double tmp;
if (A <= 6.5e-93) {
tmp = -Math.sqrt((t_1 * (B + C))) / t_0;
} else {
tmp = -Math.sqrt(((A + (A + C)) * t_1)) / t_0;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) t_1 = 2.0 * (F * t_0) tmp = 0 if A <= 6.5e-93: tmp = -math.sqrt((t_1 * (B + C))) / t_0 else: tmp = -math.sqrt(((A + (A + C)) * t_1)) / t_0 return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) t_1 = Float64(2.0 * Float64(F * t_0)) tmp = 0.0 if (A <= 6.5e-93) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(B + C)))) / t_0); else tmp = Float64(Float64(-sqrt(Float64(Float64(A + Float64(A + C)) * t_1))) / t_0); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); t_1 = 2.0 * (F * t_0); tmp = 0.0; if (A <= 6.5e-93) tmp = -sqrt((t_1 * (B + C))) / t_0; else tmp = -sqrt(((A + (A + C)) * t_1)) / t_0; end tmp_2 = tmp; end
NOTE: B should be positive 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[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, 6.5e-93], N[((-N[Sqrt[N[(t$95$1 * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[((-N[Sqrt[N[(N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
t_1 := 2 \cdot \left(F \cdot t_0\right)\\
\mathbf{if}\;A \leq 6.5 \cdot 10^{-93}:\\
\;\;\;\;\frac{-\sqrt{t_1 \cdot \left(B + C\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{\left(A + \left(A + C\right)\right) \cdot t_1}}{t_0}\\
\end{array}
\end{array}
if A < 6.5e-93Initial program 17.3%
associate-*l*17.3%
unpow217.3%
+-commutative17.3%
unpow217.3%
associate-*l*17.3%
unpow217.3%
Simplified17.3%
Taylor expanded in C around 0 14.3%
unpow214.3%
unpow214.3%
hypot-def14.5%
Simplified14.5%
Taylor expanded in A around 0 10.7%
if 6.5e-93 < A Initial program 29.3%
associate-*l*29.3%
unpow229.3%
+-commutative29.3%
unpow229.3%
associate-*l*29.3%
unpow229.3%
Simplified29.3%
Taylor expanded in A around inf 33.7%
Final simplification18.0%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= A 6.2e+73)
(/ (- (sqrt (* (* 2.0 (* F t_0)) (+ B C)))) t_0)
(/ (* 2.0 (- (sqrt (* A F)))) B))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (A <= 6.2e+73) {
tmp = -sqrt(((2.0 * (F * t_0)) * (B + C))) / t_0;
} else {
tmp = (2.0 * -sqrt((A * F))) / B;
}
return tmp;
}
NOTE: B should be positive 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 (a <= 6.2d+73) then
tmp = -sqrt(((2.0d0 * (f * t_0)) * (b + c))) / t_0
else
tmp = (2.0d0 * -sqrt((a * f))) / b
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (A <= 6.2e+73) {
tmp = -Math.sqrt(((2.0 * (F * t_0)) * (B + C))) / t_0;
} else {
tmp = (2.0 * -Math.sqrt((A * F))) / B;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if A <= 6.2e+73: tmp = -math.sqrt(((2.0 * (F * t_0)) * (B + C))) / t_0 else: tmp = (2.0 * -math.sqrt((A * F))) / B return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (A <= 6.2e+73) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(B + C)))) / t_0); else tmp = Float64(Float64(2.0 * Float64(-sqrt(Float64(A * F)))) / B); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (A <= 6.2e+73) tmp = -sqrt(((2.0 * (F * t_0)) * (B + C))) / t_0; else tmp = (2.0 * -sqrt((A * F))) / B; end tmp_2 = tmp; end
NOTE: B should be positive 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[A, 6.2e+73], N[((-N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(B + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(2.0 * (-N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / B), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;A \leq 6.2 \cdot 10^{+73}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(F \cdot t_0\right)\right) \cdot \left(B + C\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \left(-\sqrt{A \cdot F}\right)}{B}\\
\end{array}
\end{array}
if A < 6.1999999999999999e73Initial program 21.6%
associate-*l*21.6%
unpow221.6%
+-commutative21.6%
unpow221.6%
associate-*l*21.6%
unpow221.6%
Simplified21.6%
Taylor expanded in C around 0 18.3%
unpow218.3%
unpow218.3%
hypot-def18.5%
Simplified18.5%
Taylor expanded in A around 0 10.3%
if 6.1999999999999999e73 < A Initial program 19.1%
Simplified34.9%
Taylor expanded in C around 0 1.4%
mul-1-neg1.4%
distribute-rgt-neg-in1.4%
unpow21.4%
unpow21.4%
hypot-def19.2%
Simplified19.2%
sqrt-prod26.3%
Applied egg-rr26.2%
Taylor expanded in B around 0 7.7%
mul-1-neg7.7%
*-commutative7.7%
unpow27.7%
rem-square-sqrt7.8%
Simplified7.8%
associate-*r/7.9%
Applied egg-rr7.9%
Final simplification9.8%
NOTE: B should be positive before calling this function
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (* B B) (* 4.0 (* A C)))))
(if (<= A -6.6e-252)
(/ (- (sqrt (* C (* 2.0 (* F t_0))))) t_0)
(/ (* 2.0 (- (sqrt (* A F)))) B))))B = abs(B);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (A <= -6.6e-252) {
tmp = -sqrt((C * (2.0 * (F * t_0)))) / t_0;
} else {
tmp = (2.0 * -sqrt((A * F))) / B;
}
return tmp;
}
NOTE: B should be positive 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 (a <= (-6.6d-252)) then
tmp = -sqrt((c * (2.0d0 * (f * t_0)))) / t_0
else
tmp = (2.0d0 * -sqrt((a * f))) / b
end if
code = tmp
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
double t_0 = (B * B) - (4.0 * (A * C));
double tmp;
if (A <= -6.6e-252) {
tmp = -Math.sqrt((C * (2.0 * (F * t_0)))) / t_0;
} else {
tmp = (2.0 * -Math.sqrt((A * F))) / B;
}
return tmp;
}
B = abs(B) def code(A, B, C, F): t_0 = (B * B) - (4.0 * (A * C)) tmp = 0 if A <= -6.6e-252: tmp = -math.sqrt((C * (2.0 * (F * t_0)))) / t_0 else: tmp = (2.0 * -math.sqrt((A * F))) / B return tmp
B = abs(B) function code(A, B, C, F) t_0 = Float64(Float64(B * B) - Float64(4.0 * Float64(A * C))) tmp = 0.0 if (A <= -6.6e-252) tmp = Float64(Float64(-sqrt(Float64(C * Float64(2.0 * Float64(F * t_0))))) / t_0); else tmp = Float64(Float64(2.0 * Float64(-sqrt(Float64(A * F)))) / B); end return tmp end
B = abs(B) function tmp_2 = code(A, B, C, F) t_0 = (B * B) - (4.0 * (A * C)); tmp = 0.0; if (A <= -6.6e-252) tmp = -sqrt((C * (2.0 * (F * t_0)))) / t_0; else tmp = (2.0 * -sqrt((A * F))) / B; end tmp_2 = tmp; end
NOTE: B should be positive 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[A, -6.6e-252], N[((-N[Sqrt[N[(C * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(2.0 * (-N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / B), $MachinePrecision]]]
\begin{array}{l}
B = |B|\\
\\
\begin{array}{l}
t_0 := B \cdot B - 4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;A \leq -6.6 \cdot 10^{-252}:\\
\;\;\;\;\frac{-\sqrt{C \cdot \left(2 \cdot \left(F \cdot t_0\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{2 \cdot \left(-\sqrt{A \cdot F}\right)}{B}\\
\end{array}
\end{array}
if A < -6.60000000000000018e-252Initial program 14.2%
associate-*l*14.2%
unpow214.2%
+-commutative14.2%
unpow214.2%
associate-*l*14.2%
unpow214.2%
Simplified14.2%
Taylor expanded in A around -inf 3.5%
mul-1-neg3.5%
Simplified3.5%
Taylor expanded in A around 0 5.8%
if -6.60000000000000018e-252 < A Initial program 27.0%
Simplified35.4%
Taylor expanded in C around 0 6.0%
mul-1-neg6.0%
distribute-rgt-neg-in6.0%
unpow26.0%
unpow26.0%
hypot-def18.4%
Simplified18.4%
sqrt-prod21.8%
Applied egg-rr21.7%
Taylor expanded in B around 0 5.7%
mul-1-neg5.7%
*-commutative5.7%
unpow25.7%
rem-square-sqrt5.8%
Simplified5.8%
associate-*r/5.8%
Applied egg-rr5.8%
Final simplification5.8%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (* (pow (* A F) 0.5) (/ (- 2.0) B)))
B = abs(B);
double code(double A, double B, double C, double F) {
return pow((A * F), 0.5) * (-2.0 / B);
}
NOTE: B should be positive 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 = ((a * f) ** 0.5d0) * (-2.0d0 / b)
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
return Math.pow((A * F), 0.5) * (-2.0 / B);
}
B = abs(B) def code(A, B, C, F): return math.pow((A * F), 0.5) * (-2.0 / B)
B = abs(B) function code(A, B, C, F) return Float64((Float64(A * F) ^ 0.5) * Float64(Float64(-2.0) / B)) end
B = abs(B) function tmp = code(A, B, C, F) tmp = ((A * F) ^ 0.5) * (-2.0 / B); end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := N[(N[Power[N[(A * F), $MachinePrecision], 0.5], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B = |B|\\
\\
{\left(A \cdot F\right)}^{0.5} \cdot \frac{-2}{B}
\end{array}
Initial program 21.1%
Simplified28.4%
Taylor expanded in C around 0 7.8%
mul-1-neg7.8%
distribute-rgt-neg-in7.8%
unpow27.8%
unpow27.8%
hypot-def18.0%
Simplified18.0%
sqrt-prod23.5%
Applied egg-rr23.5%
Taylor expanded in B around 0 3.2%
mul-1-neg3.2%
*-commutative3.2%
unpow23.2%
rem-square-sqrt3.3%
Simplified3.3%
pow1/23.4%
Applied egg-rr3.4%
Final simplification3.4%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (/ (* 2.0 (- (sqrt (* A F)))) B))
B = abs(B);
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
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);
public static double code(double A, double B, double C, double F) {
return (2.0 * -Math.sqrt((A * F))) / B;
}
B = abs(B) def code(A, B, C, F): return (2.0 * -math.sqrt((A * F))) / B
B = abs(B) function code(A, B, C, F) return Float64(Float64(2.0 * Float64(-sqrt(Float64(A * F)))) / B) end
B = abs(B) function tmp = code(A, B, C, F) tmp = (2.0 * -sqrt((A * F))) / B; end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := N[(N[(2.0 * (-N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / B), $MachinePrecision]
\begin{array}{l}
B = |B|\\
\\
\frac{2 \cdot \left(-\sqrt{A \cdot F}\right)}{B}
\end{array}
Initial program 21.1%
Simplified28.4%
Taylor expanded in C around 0 7.8%
mul-1-neg7.8%
distribute-rgt-neg-in7.8%
unpow27.8%
unpow27.8%
hypot-def18.0%
Simplified18.0%
sqrt-prod23.5%
Applied egg-rr23.5%
Taylor expanded in B around 0 3.2%
mul-1-neg3.2%
*-commutative3.2%
unpow23.2%
rem-square-sqrt3.3%
Simplified3.3%
associate-*r/3.3%
Applied egg-rr3.3%
Final simplification3.3%
NOTE: B should be positive before calling this function (FPCore (A B C F) :precision binary64 (* (sqrt (* A F)) (/ -2.0 B)))
B = abs(B);
double code(double A, double B, double C, double F) {
return sqrt((A * F)) * (-2.0 / B);
}
NOTE: B should be positive before calling this function
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((a * f)) * ((-2.0d0) / b)
end function
B = Math.abs(B);
public static double code(double A, double B, double C, double F) {
return Math.sqrt((A * F)) * (-2.0 / B);
}
B = abs(B) def code(A, B, C, F): return math.sqrt((A * F)) * (-2.0 / B)
B = abs(B) function code(A, B, C, F) return Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B)) end
B = abs(B) function tmp = code(A, B, C, F) tmp = sqrt((A * F)) * (-2.0 / B); end
NOTE: B should be positive before calling this function code[A_, B_, C_, F_] := N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B = |B|\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B}
\end{array}
Initial program 21.1%
Simplified28.4%
Taylor expanded in C around 0 7.8%
mul-1-neg7.8%
distribute-rgt-neg-in7.8%
unpow27.8%
unpow27.8%
hypot-def18.0%
Simplified18.0%
div-inv18.0%
Applied egg-rr18.0%
sqrt-prod23.5%
Applied egg-rr23.5%
Taylor expanded in B around 0 3.2%
associate-*r*3.2%
*-commutative3.2%
unpow23.2%
rem-square-sqrt3.3%
associate-*r/3.3%
metadata-eval3.3%
Simplified3.3%
Final simplification3.3%
herbie shell --seed 2023238
(FPCore (A B C F)
:name "ABCF->ab-angle a"
: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))))