
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* 2.0 (+ A (- C (hypot B_m (- A C))))))
(t_1 (- (* (* 4.0 A) C) (pow B_m 2.0)))
(t_2
(/
(sqrt
(*
(- (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))
(* 2.0 (* F t_1))))
t_1))
(t_3 (fma B_m B_m (* A (* C -4.0))))
(t_4 (- t_3))
(t_5 (* F t_3)))
(if (<= t_2 (- INFINITY))
(- (sqrt (/ (* F t_0) (fma -4.0 (* A C) (pow B_m 2.0)))))
(if (<= t_2 -5e-203)
(/ (sqrt (* t_5 t_0)) t_4)
(if (<= t_2 INFINITY)
(/
(sqrt (* t_5 (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
t_4)
(/ -1.0 (/ B_m (sqrt (* F (* 2.0 (- A (hypot B_m A))))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = 2.0 * (A + (C - hypot(B_m, (A - C))));
double t_1 = ((4.0 * A) * C) - pow(B_m, 2.0);
double t_2 = sqrt(((sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) - (A + C)) * (2.0 * (F * t_1)))) / t_1;
double t_3 = fma(B_m, B_m, (A * (C * -4.0)));
double t_4 = -t_3;
double t_5 = F * t_3;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = -sqrt(((F * t_0) / fma(-4.0, (A * C), pow(B_m, 2.0))));
} else if (t_2 <= -5e-203) {
tmp = sqrt((t_5 * t_0)) / t_4;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_5 * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_4;
} else {
tmp = -1.0 / (B_m / sqrt((F * (2.0 * (A - hypot(B_m, A))))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))) t_1 = Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)) * Float64(2.0 * Float64(F * t_1)))) / t_1) t_3 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_4 = Float64(-t_3) t_5 = Float64(F * t_3) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(-sqrt(Float64(Float64(F * t_0) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))); elseif (t_2 <= -5e-203) tmp = Float64(sqrt(Float64(t_5 * t_0)) / t_4); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(t_5 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_4); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(F * Float64(2.0 * Float64(A - hypot(B_m, A))))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(2.0 * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(F * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], (-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$2, -5e-203], N[(N[Sqrt[N[(t$95$5 * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(t$95$5 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(F * N[(2.0 * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := 2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t\_1\right)\right)}}{t\_1}\\
t_3 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_4 := -t\_3\\
t_5 := F \cdot t\_3\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;-\sqrt{\frac{F \cdot t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot t\_0}}{t\_4}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{F \cdot \left(2 \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Simplified14.4%
add-cube-cbrt14.2%
pow314.3%
associate-+r-13.5%
hypot-undefine3.2%
unpow23.2%
unpow23.2%
+-commutative3.2%
unpow23.2%
unpow23.2%
hypot-define13.5%
Applied egg-rr13.5%
Taylor expanded in F around 0 35.2%
mul-1-neg35.2%
rem-cube-cbrt36.0%
associate--l+36.0%
unpow236.0%
unpow236.0%
hypot-undefine59.5%
fma-define59.5%
Simplified59.5%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-203Initial program 97.2%
Simplified97.2%
if -5.0000000000000002e-203 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 14.7%
Simplified26.0%
Taylor expanded in C around inf 29.9%
mul-1-neg29.9%
Simplified29.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0 1.8%
mul-1-neg1.8%
+-commutative1.8%
unpow21.8%
unpow21.8%
hypot-define11.5%
Simplified11.5%
expm1-log1p-u11.3%
expm1-undefine3.7%
associate-*l/3.7%
pow1/23.7%
pow1/23.7%
pow-prod-down3.7%
Applied egg-rr3.7%
expm1-define11.3%
unpow1/211.3%
Simplified11.3%
expm1-log1p-u11.5%
distribute-frac-neg211.5%
add-sqr-sqrt1.4%
sqrt-unprod2.4%
sqr-neg2.4%
sqrt-unprod1.2%
add-sqr-sqrt20.8%
clear-num20.8%
frac-2neg20.8%
metadata-eval20.8%
distribute-frac-neg20.8%
add-sqr-sqrt19.4%
sqrt-unprod2.6%
sqr-neg2.6%
sqrt-unprod10.1%
add-sqr-sqrt11.6%
*-commutative11.6%
associate-*l*11.6%
Applied egg-rr11.6%
Final simplification38.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (fma C (* A -4.0) (pow B_m 2.0)))
(t_2 (- (* (* 4.0 A) C) (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(- (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))
(* 2.0 (* F t_2))))
t_2)))
(if (<= t_3 -5e-203)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (sqrt (* 2.0 t_1)))
(- t_1))
(if (<= t_3 INFINITY)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(/ -1.0 (/ B_m (sqrt (* F (* 2.0 (- A (hypot B_m A)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = fma(C, (A * -4.0), pow(B_m, 2.0));
double t_2 = ((4.0 * A) * C) - pow(B_m, 2.0);
double t_3 = sqrt(((sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) - (A + C)) * (2.0 * (F * t_2)))) / t_2;
double tmp;
if (t_3 <= -5e-203) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * sqrt((2.0 * t_1))) / -t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = -1.0 / (B_m / sqrt((F * (2.0 * (A - hypot(B_m, A))))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) t_2 = Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)) * Float64(2.0 * Float64(F * t_2)))) / t_2) tmp = 0.0 if (t_3 <= -5e-203) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * sqrt(Float64(2.0 * t_1))) / Float64(-t_1)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(F * Float64(2.0 * Float64(A - hypot(B_m, A))))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -5e-203], N[(N[(N[Sqrt[N[(F * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(F * N[(2.0 * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
t_2 := \left(4 \cdot A\right) \cdot C - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t\_2\right)\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)} \cdot \sqrt{2 \cdot t\_1}}{-t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{F \cdot \left(2 \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-203Initial program 49.7%
Simplified44.4%
pow1/244.4%
associate-*r*55.0%
unpow-prod-down77.5%
associate-+r-77.1%
hypot-undefine65.5%
unpow265.5%
unpow265.5%
+-commutative65.5%
unpow265.5%
unpow265.5%
hypot-define77.1%
pow1/277.1%
Applied egg-rr77.1%
unpow1/277.1%
associate-+r-77.5%
hypot-undefine65.5%
unpow265.5%
unpow265.5%
+-commutative65.5%
unpow265.5%
unpow265.5%
hypot-undefine77.5%
Simplified77.5%
if -5.0000000000000002e-203 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 14.7%
Simplified26.0%
Taylor expanded in C around inf 29.9%
mul-1-neg29.9%
Simplified29.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0 1.8%
mul-1-neg1.8%
+-commutative1.8%
unpow21.8%
unpow21.8%
hypot-define11.5%
Simplified11.5%
expm1-log1p-u11.3%
expm1-undefine3.7%
associate-*l/3.7%
pow1/23.7%
pow1/23.7%
pow-prod-down3.7%
Applied egg-rr3.7%
expm1-define11.3%
unpow1/211.3%
Simplified11.3%
expm1-log1p-u11.5%
distribute-frac-neg211.5%
add-sqr-sqrt1.4%
sqrt-unprod2.4%
sqr-neg2.4%
sqrt-unprod1.2%
add-sqr-sqrt20.8%
clear-num20.8%
frac-2neg20.8%
metadata-eval20.8%
distribute-frac-neg20.8%
add-sqr-sqrt19.4%
sqrt-unprod2.6%
sqr-neg2.6%
sqrt-unprod10.1%
add-sqr-sqrt11.6%
*-commutative11.6%
associate-*l*11.6%
Applied egg-rr11.6%
Final simplification38.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))) (t_1 (* F t_0)) (t_2 (- t_0)))
(if (<= (pow B_m 2.0) 1e-202)
(/ (sqrt (* (* 4.0 A) t_1)) t_2)
(if (<= (pow B_m 2.0) 1e+78)
(/ (sqrt (* t_1 (* 2.0 (+ A (- C (hypot B_m (- A C))))))) t_2)
(/ -1.0 (/ B_m (sqrt (* F (* 2.0 (- A (hypot B_m A)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = F * t_0;
double t_2 = -t_0;
double tmp;
if (pow(B_m, 2.0) <= 1e-202) {
tmp = sqrt(((4.0 * A) * t_1)) / t_2;
} else if (pow(B_m, 2.0) <= 1e+78) {
tmp = sqrt((t_1 * (2.0 * (A + (C - hypot(B_m, (A - C))))))) / t_2;
} else {
tmp = -1.0 / (B_m / sqrt((F * (2.0 * (A - hypot(B_m, A))))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(F * t_0) t_2 = Float64(-t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-202) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * t_1)) / t_2); elseif ((B_m ^ 2.0) <= 1e+78) tmp = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C))))))) / t_2); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(F * Float64(2.0 * Float64(A - hypot(B_m, A))))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-202], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+78], N[(N[Sqrt[N[(t$95$1 * N[(2.0 * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(F * N[(2.0 * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := F \cdot t\_0\\
t_2 := -t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-202}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot t\_1}}{t\_2}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+78}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{F \cdot \left(2 \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-202Initial program 20.3%
Simplified28.3%
Taylor expanded in A around -inf 26.9%
if 1e-202 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000001e78Initial program 37.8%
Simplified46.0%
if 1.00000000000000001e78 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.9%
Taylor expanded in C around 0 12.2%
mul-1-neg12.2%
+-commutative12.2%
unpow212.2%
unpow212.2%
hypot-define20.8%
Simplified20.8%
expm1-log1p-u20.3%
expm1-undefine6.9%
associate-*l/6.9%
pow1/26.9%
pow1/26.9%
pow-prod-down6.9%
Applied egg-rr6.9%
expm1-define20.3%
unpow1/220.3%
Simplified20.3%
expm1-log1p-u20.8%
distribute-frac-neg220.8%
add-sqr-sqrt1.3%
sqrt-unprod2.5%
sqr-neg2.5%
sqrt-unprod1.0%
add-sqr-sqrt34.0%
clear-num34.0%
frac-2neg34.0%
metadata-eval34.0%
distribute-frac-neg34.0%
add-sqr-sqrt32.8%
sqrt-unprod28.1%
sqr-neg28.1%
sqrt-unprod19.5%
add-sqr-sqrt20.9%
*-commutative20.9%
associate-*l*20.9%
Applied egg-rr20.9%
Final simplification28.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-181)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-181) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-181) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-181], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-181}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000005e-181Initial program 20.2%
Simplified30.2%
Taylor expanded in A around -inf 27.5%
if 1.00000000000000005e-181 < (pow.f64 B #s(literal 2 binary64)) Initial program 20.7%
Taylor expanded in C around 0 13.3%
mul-1-neg13.3%
+-commutative13.3%
unpow213.3%
unpow213.3%
hypot-define19.5%
Simplified19.5%
neg-sub019.5%
associate-*l/19.6%
pow1/219.6%
pow1/219.6%
pow-prod-down19.6%
Applied egg-rr19.6%
neg-sub019.6%
distribute-neg-frac219.6%
unpow1/219.6%
Simplified19.6%
Final simplification22.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 7.6e-91)
(/
(sqrt (* -4.0 (* A (* C (* F (* 2.0 (+ A A)))))))
(- (fma B_m B_m (* A (* C -4.0)))))
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7.6e-91) {
tmp = sqrt((-4.0 * (A * (C * (F * (2.0 * (A + A))))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7.6e-91) tmp = Float64(sqrt(Float64(-4.0 * Float64(A * Float64(C * Float64(F * Float64(2.0 * Float64(A + A))))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7.6e-91], N[(N[Sqrt[N[(-4.0 * N[(A * N[(C * N[(F * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7.6 \cdot 10^{-91}:\\
\;\;\;\;\frac{\sqrt{-4 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(2 \cdot \left(A + A\right)\right)\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 7.59999999999999957e-91Initial program 21.4%
Simplified26.9%
add-cube-cbrt26.7%
pow326.7%
associate-+r-25.4%
hypot-undefine21.2%
unpow221.2%
unpow221.2%
+-commutative21.2%
unpow221.2%
unpow221.2%
hypot-define25.4%
Applied egg-rr25.4%
Taylor expanded in C around inf 14.4%
rem-cube-cbrt14.6%
mul-1-neg14.6%
Simplified14.6%
if 7.59999999999999957e-91 < B Initial program 18.8%
Taylor expanded in C around 0 26.0%
mul-1-neg26.0%
+-commutative26.0%
unpow226.0%
unpow226.0%
hypot-define38.0%
Simplified38.0%
neg-sub038.0%
associate-*l/38.1%
pow1/238.1%
pow1/238.1%
pow-prod-down38.2%
Applied egg-rr38.2%
neg-sub038.2%
distribute-neg-frac238.2%
unpow1/238.2%
Simplified38.2%
Final simplification22.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 7.5e-91)
(/
-1.0
(/
(fma B_m B_m (* A (* C -4.0)))
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))))
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7.5e-91) {
tmp = -1.0 / (fma(B_m, B_m, (A * (C * -4.0))) / sqrt((-8.0 * (A * (C * (F * (A + A)))))));
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7.5e-91) tmp = Float64(-1.0 / Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) / sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7.5e-91], N[(-1.0 / N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7.5 \cdot 10^{-91}:\\
\;\;\;\;\frac{-1}{\frac{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 7.50000000000000051e-91Initial program 21.4%
Simplified26.9%
clear-num26.9%
inv-pow26.9%
Applied egg-rr25.6%
unpow-125.6%
associate-*l*25.6%
associate-+r-26.9%
hypot-undefine21.9%
unpow221.9%
unpow221.9%
+-commutative21.9%
unpow221.9%
unpow221.9%
hypot-undefine26.9%
Simplified26.9%
Taylor expanded in C around inf 14.6%
mul-1-neg14.6%
Simplified14.6%
if 7.50000000000000051e-91 < B Initial program 18.8%
Taylor expanded in C around 0 26.0%
mul-1-neg26.0%
+-commutative26.0%
unpow226.0%
unpow226.0%
hypot-define38.0%
Simplified38.0%
neg-sub038.0%
associate-*l/38.1%
pow1/238.1%
pow1/238.1%
pow-prod-down38.2%
Applied egg-rr38.2%
neg-sub038.2%
distribute-neg-frac238.2%
unpow1/238.2%
Simplified38.2%
Final simplification22.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 7.2e-91)
(/
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(- (fma B_m B_m (* A (* C -4.0)))))
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7.2e-91) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7.2e-91) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7.2e-91], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7.2 \cdot 10^{-91}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 7.2000000000000001e-91Initial program 21.4%
Simplified26.9%
add-cube-cbrt26.7%
pow326.7%
associate-+r-25.4%
hypot-undefine21.2%
unpow221.2%
unpow221.2%
+-commutative21.2%
unpow221.2%
unpow221.2%
hypot-define25.4%
Applied egg-rr25.4%
*-un-lft-identity25.4%
rem-cube-cbrt25.6%
associate-*l*25.5%
associate--l+26.6%
Applied egg-rr26.6%
*-lft-identity26.6%
Simplified26.6%
Taylor expanded in C around inf 14.6%
if 7.2000000000000001e-91 < B Initial program 18.8%
Taylor expanded in C around 0 26.0%
mul-1-neg26.0%
+-commutative26.0%
unpow226.0%
unpow226.0%
hypot-define38.0%
Simplified38.0%
neg-sub038.0%
associate-*l/38.1%
pow1/238.1%
pow1/238.1%
pow-prod-down38.2%
Applied egg-rr38.2%
neg-sub038.2%
distribute-neg-frac238.2%
unpow1/238.2%
Simplified38.2%
Final simplification22.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 2e-95) (/ 1.0 (/ (* 4.0 (* A C)) (sqrt (* -8.0 (* A (* C (* F (+ A A)))))))) (/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2e-95) {
tmp = 1.0 / ((4.0 * (A * C)) / sqrt((-8.0 * (A * (C * (F * (A + A)))))));
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2e-95) {
tmp = 1.0 / ((4.0 * (A * C)) / Math.sqrt((-8.0 * (A * (C * (F * (A + A)))))));
} else {
tmp = Math.sqrt((2.0 * (F * (A - Math.hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 2e-95: tmp = 1.0 / ((4.0 * (A * C)) / math.sqrt((-8.0 * (A * (C * (F * (A + A))))))) else: tmp = math.sqrt((2.0 * (F * (A - math.hypot(B_m, A))))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2e-95) tmp = Float64(1.0 / Float64(Float64(4.0 * Float64(A * C)) / sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 2e-95)
tmp = 1.0 / ((4.0 * (A * C)) / sqrt((-8.0 * (A * (C * (F * (A + A)))))));
else
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2e-95], N[(1.0 / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2 \cdot 10^{-95}:\\
\;\;\;\;\frac{1}{\frac{4 \cdot \left(A \cdot C\right)}{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 1.99999999999999998e-95Initial program 21.6%
Simplified26.6%
clear-num26.6%
inv-pow26.6%
Applied egg-rr25.3%
unpow-125.3%
associate-*l*25.3%
associate-+r-26.6%
hypot-undefine22.1%
unpow222.1%
unpow222.1%
+-commutative22.1%
unpow222.1%
unpow222.1%
hypot-undefine26.6%
Simplified26.6%
Taylor expanded in C around inf 14.2%
mul-1-neg14.2%
Simplified14.2%
Taylor expanded in B around 0 16.5%
if 1.99999999999999998e-95 < B Initial program 18.5%
Taylor expanded in C around 0 26.5%
mul-1-neg26.5%
+-commutative26.5%
unpow226.5%
unpow226.5%
hypot-define38.3%
Simplified38.3%
neg-sub038.3%
associate-*l/38.4%
pow1/238.4%
pow1/238.4%
pow-prod-down38.4%
Applied egg-rr38.4%
neg-sub038.4%
distribute-neg-frac238.4%
unpow1/238.4%
Simplified38.4%
Final simplification23.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.06e-95) (/ 1.0 (/ (* 4.0 (* A C)) (sqrt (* -8.0 (* A (* C (* F (+ A A)))))))) (/ (sqrt (+ (* -2.0 (* B_m F)) (* 2.0 (* A F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.06e-95) {
tmp = 1.0 / ((4.0 * (A * C)) / sqrt((-8.0 * (A * (C * (F * (A + A)))))));
} else {
tmp = sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 1.06d-95) then
tmp = 1.0d0 / ((4.0d0 * (a * c)) / sqrt(((-8.0d0) * (a * (c * (f * (a + a)))))))
else
tmp = sqrt((((-2.0d0) * (b_m * f)) + (2.0d0 * (a * f)))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.06e-95) {
tmp = 1.0 / ((4.0 * (A * C)) / Math.sqrt((-8.0 * (A * (C * (F * (A + A)))))));
} else {
tmp = Math.sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 1.06e-95: tmp = 1.0 / ((4.0 * (A * C)) / math.sqrt((-8.0 * (A * (C * (F * (A + A))))))) else: tmp = math.sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.06e-95) tmp = Float64(1.0 / Float64(Float64(4.0 * Float64(A * C)) / sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))))); else tmp = Float64(sqrt(Float64(Float64(-2.0 * Float64(B_m * F)) + Float64(2.0 * Float64(A * F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 1.06e-95)
tmp = 1.0 / ((4.0 * (A * C)) / sqrt((-8.0 * (A * (C * (F * (A + A)))))));
else
tmp = sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.06e-95], N[(1.0 / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.06 \cdot 10^{-95}:\\
\;\;\;\;\frac{1}{\frac{4 \cdot \left(A \cdot C\right)}{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right) + 2 \cdot \left(A \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 1.06e-95Initial program 21.6%
Simplified26.6%
clear-num26.6%
inv-pow26.6%
Applied egg-rr25.3%
unpow-125.3%
associate-*l*25.3%
associate-+r-26.6%
hypot-undefine22.1%
unpow222.1%
unpow222.1%
+-commutative22.1%
unpow222.1%
unpow222.1%
hypot-undefine26.6%
Simplified26.6%
Taylor expanded in C around inf 14.2%
mul-1-neg14.2%
Simplified14.2%
Taylor expanded in B around 0 16.5%
if 1.06e-95 < B Initial program 18.5%
Taylor expanded in C around 0 26.5%
mul-1-neg26.5%
+-commutative26.5%
unpow226.5%
unpow226.5%
hypot-define38.3%
Simplified38.3%
neg-sub038.3%
associate-*l/38.4%
pow1/238.4%
pow1/238.4%
pow-prod-down38.4%
Applied egg-rr38.4%
neg-sub038.4%
distribute-neg-frac238.4%
unpow1/238.4%
Simplified38.4%
Taylor expanded in A around 0 33.9%
Final simplification22.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= A -1.85e+210) (/ -1.0 (/ B_m (sqrt (* (* 4.0 A) F)))) (/ (sqrt (+ (* -2.0 (* B_m F)) (* 2.0 (* A F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.85e+210) {
tmp = -1.0 / (B_m / sqrt(((4.0 * A) * F)));
} else {
tmp = sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-1.85d+210)) then
tmp = (-1.0d0) / (b_m / sqrt(((4.0d0 * a) * f)))
else
tmp = sqrt((((-2.0d0) * (b_m * f)) + (2.0d0 * (a * f)))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.85e+210) {
tmp = -1.0 / (B_m / Math.sqrt(((4.0 * A) * F)));
} else {
tmp = Math.sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -1.85e+210: tmp = -1.0 / (B_m / math.sqrt(((4.0 * A) * F))) else: tmp = math.sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= -1.85e+210) tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(4.0 * A) * F)))); else tmp = Float64(sqrt(Float64(Float64(-2.0 * Float64(B_m * F)) + Float64(2.0 * Float64(A * F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (A <= -1.85e+210)
tmp = -1.0 / (B_m / sqrt(((4.0 * A) * F)));
else
tmp = sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -1.85e+210], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -1.85 \cdot 10^{+210}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(4 \cdot A\right) \cdot F}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right) + 2 \cdot \left(A \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -1.84999999999999999e210Initial program 1.7%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define2.8%
Simplified2.8%
expm1-log1p-u2.7%
expm1-undefine2.8%
associate-*l/2.8%
pow1/22.8%
pow1/22.8%
pow-prod-down2.8%
Applied egg-rr2.8%
expm1-define2.7%
unpow1/22.7%
Simplified2.7%
expm1-log1p-u2.8%
distribute-frac-neg22.8%
add-sqr-sqrt0.5%
sqrt-unprod1.1%
sqr-neg1.1%
sqrt-unprod0.5%
add-sqr-sqrt25.3%
clear-num25.5%
frac-2neg25.5%
metadata-eval25.5%
distribute-frac-neg25.5%
add-sqr-sqrt24.7%
sqrt-unprod21.1%
sqr-neg21.1%
sqrt-unprod2.2%
add-sqr-sqrt2.8%
*-commutative2.8%
associate-*l*2.8%
Applied egg-rr2.8%
Taylor expanded in A around -inf 2.8%
if -1.84999999999999999e210 < A Initial program 21.8%
Taylor expanded in C around 0 11.1%
mul-1-neg11.1%
+-commutative11.1%
unpow211.1%
unpow211.1%
hypot-define16.1%
Simplified16.1%
neg-sub016.1%
associate-*l/16.1%
pow1/216.1%
pow1/216.1%
pow-prod-down16.1%
Applied egg-rr16.1%
neg-sub016.1%
distribute-neg-frac216.1%
unpow1/216.1%
Simplified16.1%
Taylor expanded in A around 0 13.2%
Final simplification12.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= A -9.2e+209) (/ -1.0 (/ B_m (sqrt (* (* 4.0 A) F)))) (/ -1.0 (/ B_m (sqrt (* F (* 2.0 (- A B_m))))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -9.2e+209) {
tmp = -1.0 / (B_m / sqrt(((4.0 * A) * F)));
} else {
tmp = -1.0 / (B_m / sqrt((F * (2.0 * (A - B_m)))));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-9.2d+209)) then
tmp = (-1.0d0) / (b_m / sqrt(((4.0d0 * a) * f)))
else
tmp = (-1.0d0) / (b_m / sqrt((f * (2.0d0 * (a - b_m)))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -9.2e+209) {
tmp = -1.0 / (B_m / Math.sqrt(((4.0 * A) * F)));
} else {
tmp = -1.0 / (B_m / Math.sqrt((F * (2.0 * (A - B_m)))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -9.2e+209: tmp = -1.0 / (B_m / math.sqrt(((4.0 * A) * F))) else: tmp = -1.0 / (B_m / math.sqrt((F * (2.0 * (A - B_m))))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= -9.2e+209) tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(4.0 * A) * F)))); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(F * Float64(2.0 * Float64(A - B_m)))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (A <= -9.2e+209)
tmp = -1.0 / (B_m / sqrt(((4.0 * A) * F)));
else
tmp = -1.0 / (B_m / sqrt((F * (2.0 * (A - B_m)))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -9.2e+209], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(F * N[(2.0 * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -9.2 \cdot 10^{+209}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(4 \cdot A\right) \cdot F}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{F \cdot \left(2 \cdot \left(A - B\_m\right)\right)}}}\\
\end{array}
\end{array}
if A < -9.20000000000000038e209Initial program 1.7%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define2.8%
Simplified2.8%
expm1-log1p-u2.7%
expm1-undefine2.8%
associate-*l/2.8%
pow1/22.8%
pow1/22.8%
pow-prod-down2.8%
Applied egg-rr2.8%
expm1-define2.7%
unpow1/22.7%
Simplified2.7%
expm1-log1p-u2.8%
distribute-frac-neg22.8%
add-sqr-sqrt0.5%
sqrt-unprod1.1%
sqr-neg1.1%
sqrt-unprod0.5%
add-sqr-sqrt25.3%
clear-num25.5%
frac-2neg25.5%
metadata-eval25.5%
distribute-frac-neg25.5%
add-sqr-sqrt24.7%
sqrt-unprod21.1%
sqr-neg21.1%
sqrt-unprod2.2%
add-sqr-sqrt2.8%
*-commutative2.8%
associate-*l*2.8%
Applied egg-rr2.8%
Taylor expanded in A around -inf 2.8%
if -9.20000000000000038e209 < A Initial program 21.8%
Taylor expanded in C around 0 11.1%
mul-1-neg11.1%
+-commutative11.1%
unpow211.1%
unpow211.1%
hypot-define16.1%
Simplified16.1%
expm1-log1p-u15.6%
expm1-undefine7.1%
associate-*l/7.1%
pow1/27.1%
pow1/27.1%
pow-prod-down7.1%
Applied egg-rr7.1%
expm1-define15.6%
unpow1/215.6%
Simplified15.6%
expm1-log1p-u16.1%
distribute-frac-neg216.1%
add-sqr-sqrt1.2%
sqrt-unprod2.0%
sqr-neg2.0%
sqrt-unprod1.1%
add-sqr-sqrt21.7%
clear-num21.6%
frac-2neg21.6%
metadata-eval21.6%
distribute-frac-neg21.6%
add-sqr-sqrt20.4%
sqrt-unprod22.0%
sqr-neg22.0%
sqrt-unprod14.9%
add-sqr-sqrt16.1%
*-commutative16.1%
associate-*l*16.1%
Applied egg-rr16.1%
Taylor expanded in A around 0 13.3%
Final simplification12.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= A -1.28e+210) (/ -1.0 (/ B_m (sqrt (* (* 4.0 A) F)))) (/ (sqrt (* -2.0 (* B_m F))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.28e+210) {
tmp = -1.0 / (B_m / sqrt(((4.0 * A) * F)));
} else {
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-1.28d+210)) then
tmp = (-1.0d0) / (b_m / sqrt(((4.0d0 * a) * f)))
else
tmp = sqrt(((-2.0d0) * (b_m * f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.28e+210) {
tmp = -1.0 / (B_m / Math.sqrt(((4.0 * A) * F)));
} else {
tmp = Math.sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -1.28e+210: tmp = -1.0 / (B_m / math.sqrt(((4.0 * A) * F))) else: tmp = math.sqrt((-2.0 * (B_m * F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= -1.28e+210) tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(4.0 * A) * F)))); else tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (A <= -1.28e+210)
tmp = -1.0 / (B_m / sqrt(((4.0 * A) * F)));
else
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -1.28e+210], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -1.28 \cdot 10^{+210}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(4 \cdot A\right) \cdot F}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -1.28e210Initial program 1.7%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define2.8%
Simplified2.8%
expm1-log1p-u2.7%
expm1-undefine2.8%
associate-*l/2.8%
pow1/22.8%
pow1/22.8%
pow-prod-down2.8%
Applied egg-rr2.8%
expm1-define2.7%
unpow1/22.7%
Simplified2.7%
expm1-log1p-u2.8%
distribute-frac-neg22.8%
add-sqr-sqrt0.5%
sqrt-unprod1.1%
sqr-neg1.1%
sqrt-unprod0.5%
add-sqr-sqrt25.3%
clear-num25.5%
frac-2neg25.5%
metadata-eval25.5%
distribute-frac-neg25.5%
add-sqr-sqrt24.7%
sqrt-unprod21.1%
sqr-neg21.1%
sqrt-unprod2.2%
add-sqr-sqrt2.8%
*-commutative2.8%
associate-*l*2.8%
Applied egg-rr2.8%
Taylor expanded in A around -inf 2.8%
if -1.28e210 < A Initial program 21.8%
Taylor expanded in C around 0 11.1%
mul-1-neg11.1%
+-commutative11.1%
unpow211.1%
unpow211.1%
hypot-define16.1%
Simplified16.1%
neg-sub016.1%
associate-*l/16.1%
pow1/216.1%
pow1/216.1%
pow-prod-down16.1%
Applied egg-rr16.1%
neg-sub016.1%
distribute-neg-frac216.1%
unpow1/216.1%
Simplified16.1%
Taylor expanded in A around 0 14.0%
Final simplification13.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= A -1.2e+210) (* (sqrt (* A F)) (/ -2.0 B_m)) (/ (sqrt (* -2.0 (* B_m F))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.2e+210) {
tmp = sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (a <= (-1.2d+210)) then
tmp = sqrt((a * f)) * ((-2.0d0) / b_m)
else
tmp = sqrt(((-2.0d0) * (b_m * f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.2e+210) {
tmp = Math.sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = Math.sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if A <= -1.2e+210: tmp = math.sqrt((A * F)) * (-2.0 / B_m) else: tmp = math.sqrt((-2.0 * (B_m * F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (A <= -1.2e+210) tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B_m)); else tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (A <= -1.2e+210)
tmp = sqrt((A * F)) * (-2.0 / B_m);
else
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[A, -1.2e+210], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -1.2 \cdot 10^{+210}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -1.19999999999999994e210Initial program 1.7%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define2.8%
Simplified2.8%
add-exp-log2.2%
Applied egg-rr2.2%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
unpow20.0%
rem-square-sqrt2.8%
rem-square-sqrt2.8%
metadata-eval2.8%
Simplified2.8%
if -1.19999999999999994e210 < A Initial program 21.8%
Taylor expanded in C around 0 11.1%
mul-1-neg11.1%
+-commutative11.1%
unpow211.1%
unpow211.1%
hypot-define16.1%
Simplified16.1%
neg-sub016.1%
associate-*l/16.1%
pow1/216.1%
pow1/216.1%
pow-prod-down16.1%
Applied egg-rr16.1%
neg-sub016.1%
distribute-neg-frac216.1%
unpow1/216.1%
Simplified16.1%
Taylor expanded in A around 0 14.0%
Final simplification13.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (* A F)) (/ -2.0 B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((A * F)) * (-2.0 / B_m);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((a * f)) * ((-2.0d0) / b_m)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((A * F)) * (-2.0 / B_m);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((A * F)) * (-2.0 / B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((A * F)) * (-2.0 / B_m);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}
\end{array}
Initial program 20.5%
Taylor expanded in C around 0 10.6%
mul-1-neg10.6%
+-commutative10.6%
unpow210.6%
unpow210.6%
hypot-define15.2%
Simplified15.2%
add-exp-log13.2%
Applied egg-rr13.2%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
unpow20.0%
rem-square-sqrt2.7%
rem-square-sqrt2.8%
metadata-eval2.8%
Simplified2.8%
Final simplification2.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (pow (* 2.0 (/ F B_m)) 0.5))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return pow((2.0 * (F / B_m)), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = (2.0d0 * (f / b_m)) ** 0.5d0
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.pow((2.0 * (F / B_m)), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(2.0 * Float64(F / B_m)) ^ 0.5 end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = (2.0 * (F / B_m)) ^ 0.5;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 20.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.9%
Simplified1.9%
Taylor expanded in F around 0 1.9%
*-commutative1.9%
pow1/21.9%
pow1/22.0%
pow-prod-down2.0%
Applied egg-rr2.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ (* 2.0 F) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((2.0 * F) / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((2.0d0 * f) / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(((2.0 * F) / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(((2.0 * F) / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(Float64(2.0 * F) / B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((2.0 * F) / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Initial program 20.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.9%
Simplified1.9%
Taylor expanded in F around 0 1.9%
pow11.9%
*-commutative1.9%
sqrt-unprod1.9%
Applied egg-rr1.9%
unpow11.9%
associate-*r/1.9%
Simplified1.9%
herbie shell --seed 2024185
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))