
(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 12 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 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 (- INFINITY))
(*
(sqrt
(*
F
(/ (- (+ A C) (hypot B_m (- A C))) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_2 -2e-211)
t_2
(if (<= t_2 INFINITY)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(/ (sqrt (* 2.0 (* F (- A (hypot A B_m))))) (- 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 t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt((F * (((A + C) - hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_2 <= -2e-211) {
tmp = t_2;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = sqrt((2.0 * (F * (A - hypot(A, B_m))))) / -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))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) - hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_2 <= -2e-211) tmp = t_2; elseif (t_2 <= 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(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(A, B_m))))) / 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]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(F * N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -2e-211], t$95$2, If[LessEqual[t$95$2, 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[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 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)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-211}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_2 \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{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)\right)}}{-B\_m}\\
\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.3%
Simplified13.2%
clear-num13.2%
inv-pow13.2%
Applied egg-rr22.4%
unpow-122.4%
associate-+r-23.1%
hypot-undefine3.3%
unpow23.3%
unpow23.3%
+-commutative3.3%
unpow23.3%
unpow23.3%
hypot-undefine23.1%
Simplified23.1%
Taylor expanded in F around 0 11.5%
mul-1-neg11.5%
associate-/l*26.4%
unpow226.4%
unpow226.4%
hypot-undefine63.7%
fma-define63.7%
Simplified63.7%
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))) < -2.00000000000000017e-211Initial program 94.6%
if -2.00000000000000017e-211 < (/.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 22.7%
Simplified26.9%
Taylor expanded in C around inf 34.1%
mul-1-neg34.1%
Simplified34.1%
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.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define17.4%
Simplified17.4%
neg-sub017.4%
associate-*l/17.4%
pow1/217.4%
pow1/217.5%
hypot-undefine2.0%
unpow22.0%
unpow22.0%
pow-prod-down2.0%
unpow22.0%
unpow22.0%
hypot-undefine17.5%
Applied egg-rr17.5%
neg-sub017.5%
distribute-neg-frac217.5%
unpow1/217.5%
hypot-undefine1.9%
unpow21.9%
unpow21.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-undefine17.5%
Simplified17.5%
Final simplification40.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)))))
(if (<= (pow B_m 2.0) 5e-229)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(if (<= (pow B_m 2.0) 1e+296)
(*
(sqrt
(*
F
(/
(- (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(- (expm1 (log1p (/ (sqrt (* 2.0 (* F (- A (hypot A B_m))))) 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) <= 5e-229) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+296) {
tmp = sqrt((F * (((A + C) - hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else {
tmp = -expm1(log1p((sqrt((2.0 * (F * (A - hypot(A, B_m))))) / 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) <= 5e-229) 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)); elseif ((B_m ^ 2.0) <= 1e+296) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) - hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); else tmp = Float64(-expm1(log1p(Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(A, B_m))))) / 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], 5e-229], 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], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+296], N[(N[Sqrt[N[(F * N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[(Exp[N[Log[1 + N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]] - 1), $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 5 \cdot 10^{-229}:\\
\;\;\;\;\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{elif}\;{B\_m}^{2} \leq 10^{+296}:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)\right)}}{B\_m}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000016e-229Initial program 23.1%
Simplified26.8%
Taylor expanded in C around inf 21.2%
mul-1-neg21.2%
Simplified21.2%
if 5.00000000000000016e-229 < (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999981e295Initial program 22.5%
Simplified25.9%
clear-num25.9%
inv-pow25.9%
Applied egg-rr33.9%
unpow-133.9%
associate-+r-34.8%
hypot-undefine23.7%
unpow223.7%
unpow223.7%
+-commutative23.7%
unpow223.7%
unpow223.7%
hypot-undefine34.8%
Simplified34.8%
Taylor expanded in F around 0 24.4%
mul-1-neg24.4%
associate-/l*32.2%
unpow232.2%
unpow232.2%
hypot-undefine51.9%
fma-define51.9%
Simplified51.9%
if 9.99999999999999981e295 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in C around 0 1.6%
mul-1-neg1.6%
+-commutative1.6%
unpow21.6%
unpow21.6%
hypot-define26.6%
Simplified26.6%
hypot-undefine1.6%
unpow21.6%
unpow21.6%
expm1-log1p-u1.1%
expm1-undefine1.1%
Applied egg-rr3.9%
expm1-define26.6%
unpow1/226.6%
hypot-undefine1.1%
unpow21.1%
unpow21.1%
+-commutative1.1%
unpow21.1%
unpow21.1%
hypot-undefine26.6%
Simplified26.6%
Final simplification34.4%
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 (<= B_m 3.5e+48)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(/ (sqrt (* 2.0 (* F (- A (hypot A B_m))))) (- 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 (B_m <= 3.5e+48) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else {
tmp = sqrt((2.0 * (F * (A - hypot(A, B_m))))) / -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 <= 3.5e+48) 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(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(A, B_m))))) / 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[B$95$m, 3.5e+48], 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[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 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 \leq 3.5 \cdot 10^{+48}:\\
\;\;\;\;\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{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.4999999999999997e48Initial program 18.7%
Simplified24.6%
Taylor expanded in C around inf 16.1%
mul-1-neg16.1%
Simplified16.1%
if 3.4999999999999997e48 < B Initial program 9.1%
Taylor expanded in C around 0 14.8%
mul-1-neg14.8%
+-commutative14.8%
unpow214.8%
unpow214.8%
hypot-define51.6%
Simplified51.6%
neg-sub051.6%
associate-*l/51.7%
pow1/251.7%
pow1/251.7%
hypot-undefine14.8%
unpow214.8%
unpow214.8%
pow-prod-down15.0%
unpow215.0%
unpow215.0%
hypot-undefine52.0%
Applied egg-rr52.0%
neg-sub052.0%
distribute-neg-frac252.0%
unpow1/252.0%
hypot-undefine15.0%
unpow215.0%
unpow215.0%
+-commutative15.0%
unpow215.0%
unpow215.0%
hypot-undefine52.0%
Simplified52.0%
Final simplification23.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e+97)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/ (sqrt (* 2.0 (* F (- A (hypot A B_m))))) (- 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) <= 2e+97) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = sqrt((2.0 * (F * (A - hypot(A, B_m))))) / -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) <= 2e+97) 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(A, B_m))))) / 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], 2e+97], 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[A ^ 2 + B$95$m ^ 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 2 \cdot 10^{+97}:\\
\;\;\;\;\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(A, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e97Initial program 23.5%
Simplified30.8%
Taylor expanded in A around -inf 18.3%
if 2.0000000000000001e97 < (pow.f64 B #s(literal 2 binary64)) Initial program 6.7%
Taylor expanded in C around 0 7.7%
mul-1-neg7.7%
+-commutative7.7%
unpow27.7%
unpow27.7%
hypot-define26.1%
Simplified26.1%
neg-sub026.1%
associate-*l/26.1%
pow1/226.1%
pow1/226.1%
hypot-undefine7.8%
unpow27.8%
unpow27.8%
pow-prod-down7.8%
unpow27.8%
unpow27.8%
hypot-undefine26.3%
Applied egg-rr26.3%
neg-sub026.3%
distribute-neg-frac226.3%
unpow1/226.3%
hypot-undefine7.8%
unpow27.8%
unpow27.8%
+-commutative7.8%
unpow27.8%
unpow27.8%
hypot-undefine26.3%
Simplified26.3%
Final simplification21.5%
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 (<= F -4.7e+86)
(- (sqrt (* -2.0 (/ F B_m))))
(if (<= F -4.7e-303)
(/ (sqrt (* 2.0 (* F (- A (hypot A B_m))))) (- B_m))
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0)))))))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 (F <= -4.7e+86) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else if (F <= -4.7e-303) {
tmp = sqrt((2.0 * (F * (A - hypot(A, B_m))))) / -B_m;
} else {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
}
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 (F <= -4.7e+86) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); elseif (F <= -4.7e-303) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(A, B_m))))) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); 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[F, -4.7e+86], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[F, -4.7e-303], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $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}\;F \leq -4.7 \cdot 10^{+86}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{elif}\;F \leq -4.7 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\end{array}
\end{array}
if F < -4.7000000000000002e86Initial program 15.1%
Simplified12.0%
Taylor expanded in B around inf 1.7%
Taylor expanded in C around 0 1.3%
mul-1-neg1.3%
Simplified1.3%
add-cube-cbrt1.3%
pow31.3%
*-commutative1.3%
cbrt-prod1.3%
cbrt-prod1.3%
unpow31.3%
add-cbrt-cube3.1%
Applied egg-rr3.1%
Taylor expanded in B around 0 18.8%
mul-1-neg18.8%
rem-cube-cbrt19.2%
*-commutative19.2%
associate-/l*19.2%
Simplified19.2%
if -4.7000000000000002e86 < F < -4.6999999999999997e-303Initial program 12.1%
Taylor expanded in C around 0 8.2%
mul-1-neg8.2%
+-commutative8.2%
unpow28.2%
unpow28.2%
hypot-define22.6%
Simplified22.6%
neg-sub022.6%
associate-*l/22.6%
pow1/222.6%
pow1/222.6%
hypot-undefine8.2%
unpow28.2%
unpow28.2%
pow-prod-down8.2%
unpow28.2%
unpow28.2%
hypot-undefine22.7%
Applied egg-rr22.7%
neg-sub022.7%
distribute-neg-frac222.7%
unpow1/222.7%
hypot-undefine8.2%
unpow28.2%
unpow28.2%
+-commutative8.2%
unpow28.2%
unpow28.2%
hypot-undefine22.7%
Simplified22.7%
if -4.6999999999999997e-303 < F Initial program 42.0%
Simplified41.1%
Taylor expanded in C around inf 29.3%
associate-*r*29.3%
mul-1-neg29.3%
Simplified29.3%
Final simplification22.4%
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 (<= F -1.4e+84) (- (sqrt (* -2.0 (/ F B_m)))) (/ (sqrt (* 2.0 (* F (- A (hypot A B_m))))) (- 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 (F <= -1.4e+84) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((2.0 * (F * (A - hypot(A, B_m))))) / -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 (F <= -1.4e+84) {
tmp = -Math.sqrt((-2.0 * (F / B_m)));
} else {
tmp = Math.sqrt((2.0 * (F * (A - Math.hypot(A, B_m))))) / -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 F <= -1.4e+84: tmp = -math.sqrt((-2.0 * (F / B_m))) else: tmp = math.sqrt((2.0 * (F * (A - math.hypot(A, B_m))))) / -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 (F <= -1.4e+84) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(A, B_m))))) / 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 (F <= -1.4e+84)
tmp = -sqrt((-2.0 * (F / B_m)));
else
tmp = sqrt((2.0 * (F * (A - hypot(A, B_m))))) / -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[F, -1.4e+84], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 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}\;F \leq -1.4 \cdot 10^{+84}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -1.39999999999999991e84Initial program 15.1%
Simplified12.0%
Taylor expanded in B around inf 1.7%
Taylor expanded in C around 0 1.3%
mul-1-neg1.3%
Simplified1.3%
add-cube-cbrt1.3%
pow31.3%
*-commutative1.3%
cbrt-prod1.3%
cbrt-prod1.3%
unpow31.3%
add-cbrt-cube3.1%
Applied egg-rr3.1%
Taylor expanded in B around 0 18.8%
mul-1-neg18.8%
rem-cube-cbrt19.2%
*-commutative19.2%
associate-/l*19.2%
Simplified19.2%
if -1.39999999999999991e84 < F Initial program 17.7%
Taylor expanded in C around 0 6.7%
mul-1-neg6.7%
+-commutative6.7%
unpow26.7%
unpow26.7%
hypot-define18.5%
Simplified18.5%
neg-sub018.5%
associate-*l/18.6%
pow1/218.6%
pow1/218.7%
hypot-undefine6.9%
unpow26.9%
unpow26.9%
pow-prod-down6.9%
unpow26.9%
unpow26.9%
hypot-undefine18.7%
Applied egg-rr18.7%
neg-sub018.7%
distribute-neg-frac218.7%
unpow1/218.6%
hypot-undefine6.7%
unpow26.7%
unpow26.7%
+-commutative6.7%
unpow26.7%
unpow26.7%
hypot-undefine18.6%
Simplified18.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 (<= F -0.0056) (- (sqrt (* -2.0 (/ F B_m)))) (/ (sqrt (* B_m (+ (* F -2.0) (* 2.0 (/ (* A F) B_m))))) (- 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 (F <= -0.0056) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m))))) / -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 (f <= (-0.0056d0)) then
tmp = -sqrt(((-2.0d0) * (f / b_m)))
else
tmp = sqrt((b_m * ((f * (-2.0d0)) + (2.0d0 * ((a * f) / b_m))))) / -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 (F <= -0.0056) {
tmp = -Math.sqrt((-2.0 * (F / B_m)));
} else {
tmp = Math.sqrt((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m))))) / -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 F <= -0.0056: tmp = -math.sqrt((-2.0 * (F / B_m))) else: tmp = math.sqrt((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m))))) / -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 (F <= -0.0056) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(B_m * Float64(Float64(F * -2.0) + Float64(2.0 * Float64(Float64(A * F) / B_m))))) / 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 (F <= -0.0056)
tmp = -sqrt((-2.0 * (F / B_m)));
else
tmp = sqrt((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m))))) / -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[F, -0.0056], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(B$95$m * N[(N[(F * -2.0), $MachinePrecision] + N[(2.0 * N[(N[(A * F), $MachinePrecision] / B$95$m), $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}\;F \leq -0.0056:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{B\_m \cdot \left(F \cdot -2 + 2 \cdot \frac{A \cdot F}{B\_m}\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -0.00559999999999999994Initial program 17.1%
Simplified15.0%
Taylor expanded in B around inf 2.5%
Taylor expanded in C around 0 2.1%
mul-1-neg2.1%
Simplified2.1%
add-cube-cbrt2.1%
pow32.1%
*-commutative2.1%
cbrt-prod2.1%
cbrt-prod2.1%
unpow32.1%
add-cbrt-cube3.5%
Applied egg-rr3.5%
Taylor expanded in B around 0 17.3%
mul-1-neg17.3%
rem-cube-cbrt17.7%
*-commutative17.7%
associate-/l*17.7%
Simplified17.7%
if -0.00559999999999999994 < F Initial program 16.7%
Taylor expanded in C around 0 6.6%
mul-1-neg6.6%
+-commutative6.6%
unpow26.6%
unpow26.6%
hypot-define19.4%
Simplified19.4%
neg-sub019.4%
associate-*l/19.4%
pow1/219.4%
pow1/219.6%
hypot-undefine6.8%
unpow26.8%
unpow26.8%
pow-prod-down6.8%
unpow26.8%
unpow26.8%
hypot-undefine19.6%
Applied egg-rr19.6%
neg-sub019.6%
distribute-neg-frac219.6%
unpow1/219.5%
hypot-undefine6.6%
unpow26.6%
unpow26.6%
+-commutative6.6%
unpow26.6%
unpow26.6%
hypot-undefine19.5%
Simplified19.5%
Taylor expanded in B around inf 15.5%
Final simplification16.4%
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 (<= F -3e-5) (- (sqrt (* -2.0 (/ F B_m)))) (/ (sqrt (* 2.0 (- (* A F) (* 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 (F <= -3e-5) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((2.0 * ((A * F) - (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 (f <= (-3d-5)) then
tmp = -sqrt(((-2.0d0) * (f / b_m)))
else
tmp = sqrt((2.0d0 * ((a * f) - (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 (F <= -3e-5) {
tmp = -Math.sqrt((-2.0 * (F / B_m)));
} else {
tmp = Math.sqrt((2.0 * ((A * F) - (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 F <= -3e-5: tmp = -math.sqrt((-2.0 * (F / B_m))) else: tmp = math.sqrt((2.0 * ((A * F) - (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 (F <= -3e-5) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(A * F) - 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 (F <= -3e-5)
tmp = -sqrt((-2.0 * (F / B_m)));
else
tmp = sqrt((2.0 * ((A * F) - (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[F, -3e-5], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 * N[(N[(A * F), $MachinePrecision] - N[(B$95$m * 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}\;F \leq -3 \cdot 10^{-5}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A \cdot F - B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -3.00000000000000008e-5Initial program 17.1%
Simplified15.0%
Taylor expanded in B around inf 2.5%
Taylor expanded in C around 0 2.1%
mul-1-neg2.1%
Simplified2.1%
add-cube-cbrt2.1%
pow32.1%
*-commutative2.1%
cbrt-prod2.1%
cbrt-prod2.1%
unpow32.1%
add-cbrt-cube3.5%
Applied egg-rr3.5%
Taylor expanded in B around 0 17.3%
mul-1-neg17.3%
rem-cube-cbrt17.7%
*-commutative17.7%
associate-/l*17.7%
Simplified17.7%
if -3.00000000000000008e-5 < F Initial program 16.7%
Taylor expanded in C around 0 6.6%
mul-1-neg6.6%
+-commutative6.6%
unpow26.6%
unpow26.6%
hypot-define19.4%
Simplified19.4%
neg-sub019.4%
associate-*l/19.4%
pow1/219.4%
pow1/219.6%
hypot-undefine6.8%
unpow26.8%
unpow26.8%
pow-prod-down6.8%
unpow26.8%
unpow26.8%
hypot-undefine19.6%
Applied egg-rr19.6%
neg-sub019.6%
distribute-neg-frac219.6%
unpow1/219.5%
hypot-undefine6.6%
unpow26.6%
unpow26.6%
+-commutative6.6%
unpow26.6%
unpow26.6%
hypot-undefine19.5%
Simplified19.5%
Taylor expanded in A around 0 15.5%
+-commutative15.5%
mul-1-neg15.5%
unsub-neg15.5%
*-commutative15.5%
Simplified15.5%
Final simplification16.4%
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 (<= F -3.8e+39) (- (sqrt (* -2.0 (/ F 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 (F <= -3.8e+39) {
tmp = -sqrt((-2.0 * (F / 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 (f <= (-3.8d+39)) then
tmp = -sqrt(((-2.0d0) * (f / 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 (F <= -3.8e+39) {
tmp = -Math.sqrt((-2.0 * (F / 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 F <= -3.8e+39: tmp = -math.sqrt((-2.0 * (F / 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 (F <= -3.8e+39) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / 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 (F <= -3.8e+39)
tmp = -sqrt((-2.0 * (F / 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[F, -3.8e+39], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $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}\;F \leq -3.8 \cdot 10^{+39}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -3.7999999999999998e39Initial program 16.6%
Simplified14.5%
Taylor expanded in B around inf 2.6%
Taylor expanded in C around 0 2.1%
mul-1-neg2.1%
Simplified2.1%
add-cube-cbrt2.1%
pow32.1%
*-commutative2.1%
cbrt-prod2.1%
cbrt-prod2.1%
unpow32.1%
add-cbrt-cube3.6%
Applied egg-rr3.6%
Taylor expanded in B around 0 17.6%
mul-1-neg17.6%
rem-cube-cbrt18.0%
*-commutative18.0%
associate-/l*18.0%
Simplified18.0%
if -3.7999999999999998e39 < F Initial program 17.0%
Taylor expanded in C around 0 6.6%
mul-1-neg6.6%
+-commutative6.6%
unpow26.6%
unpow26.6%
hypot-define19.1%
Simplified19.1%
neg-sub019.1%
associate-*l/19.2%
pow1/219.2%
pow1/219.3%
hypot-undefine6.8%
unpow26.8%
unpow26.8%
pow-prod-down6.8%
unpow26.8%
unpow26.8%
hypot-undefine19.4%
Applied egg-rr19.4%
neg-sub019.4%
distribute-neg-frac219.4%
unpow1/219.2%
hypot-undefine6.6%
unpow26.6%
unpow26.6%
+-commutative6.6%
unpow26.6%
unpow26.6%
hypot-undefine19.2%
Simplified19.2%
Taylor expanded in A around 0 16.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.55e+196) (* (sqrt (* A F)) (/ -2.0 B_m)) (- (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) {
double tmp;
if (A <= -1.55e+196) {
tmp = sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = -sqrt((-2.0 * (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.55d+196)) then
tmp = sqrt((a * f)) * ((-2.0d0) / b_m)
else
tmp = -sqrt(((-2.0d0) * (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.55e+196) {
tmp = Math.sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = -Math.sqrt((-2.0 * (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.55e+196: tmp = math.sqrt((A * F)) * (-2.0 / B_m) else: tmp = -math.sqrt((-2.0 * (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.55e+196) tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B_m)); else tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / 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.55e+196)
tmp = sqrt((A * F)) * (-2.0 / B_m);
else
tmp = -sqrt((-2.0 * (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.55e+196], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $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 -1.55 \cdot 10^{+196}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if A < -1.55000000000000005e196Initial program 2.4%
Taylor expanded in C around 0 1.6%
mul-1-neg1.6%
+-commutative1.6%
Simplified1.6%
unpow21.6%
unpow21.6%
hypot-undefine15.6%
add-exp-log14.8%
Applied egg-rr14.8%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt15.5%
unpow215.5%
rem-square-sqrt15.7%
metadata-eval15.7%
Simplified15.7%
if -1.55000000000000005e196 < A Initial program 18.5%
Simplified18.3%
Taylor expanded in B around inf 3.2%
Taylor expanded in C around 0 2.3%
mul-1-neg2.3%
Simplified2.3%
add-cube-cbrt2.3%
pow32.3%
*-commutative2.3%
cbrt-prod2.3%
cbrt-prod2.3%
unpow32.3%
add-cbrt-cube3.9%
Applied egg-rr3.9%
Taylor expanded in B around 0 13.0%
mul-1-neg13.0%
rem-cube-cbrt13.2%
*-commutative13.2%
associate-/l*13.2%
Simplified13.2%
Final simplification13.5%
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 Float64(-sqrt(Float64(-2.0 * Float64(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[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{-2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 16.8%
Simplified17.8%
Taylor expanded in B around inf 3.1%
Taylor expanded in C around 0 2.3%
mul-1-neg2.3%
Simplified2.3%
add-cube-cbrt2.3%
pow32.3%
*-commutative2.3%
cbrt-prod2.3%
cbrt-prod2.3%
unpow32.3%
add-cbrt-cube3.7%
Applied egg-rr3.7%
Taylor expanded in B around 0 12.0%
mul-1-neg12.0%
rem-cube-cbrt12.2%
*-commutative12.2%
associate-/l*12.2%
Simplified12.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 (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 16.8%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.8%
Simplified1.8%
Taylor expanded in F around 0 1.8%
pow11.8%
sqrt-unprod1.8%
Applied egg-rr1.8%
unpow11.8%
*-commutative1.8%
associate-*r/1.8%
Simplified1.8%
herbie shell --seed 2024143
(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))))