
(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 15 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 (* F t_0))
(t_2
(/
(sqrt (* t_1 (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0)))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 (- INFINITY))
t_2
(if (<= t_4 -5e-172)
(/ -1.0 (/ t_0 (sqrt (* 2.0 (* (+ A (- C (hypot B_m (- A C)))) t_1)))))
(if (<= t_4 INFINITY)
t_2
(/ (sqrt (* 2.0 (* F (- C (hypot C 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 = F * t_0;
double t_2 = sqrt((t_1 * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_4 <= -5e-172) {
tmp = -1.0 / (t_0 / sqrt((2.0 * ((A + (C - hypot(B_m, (A - C)))) * t_1))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = sqrt((2.0 * (F * (C - hypot(C, 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(F * t_0) t_2 = Float64(sqrt(Float64(t_1 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = t_2; elseif (t_4 <= -5e-172) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(2.0 * Float64(Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) * t_1))))); elseif (t_4 <= Inf) tmp = t_2; else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(C, 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[(F * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t$95$1 * 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]}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $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$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], t$95$2, If[LessEqual[t$95$4, -5e-172], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(2.0 * N[(N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$2, N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[C ^ 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 := F \cdot t\_0\\
t_2 := \frac{\sqrt{t\_1 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-172}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{2 \cdot \left(\left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right) \cdot t\_1\right)}}}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(C, 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.0 or -4.9999999999999999e-172 < (/.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 19.1%
Simplified29.8%
Taylor expanded in C around inf 35.4%
mul-1-neg35.4%
Simplified35.4%
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))) < -4.9999999999999999e-172Initial program 97.1%
Simplified97.1%
clear-num97.1%
inv-pow97.1%
Applied egg-rr97.1%
unpow-197.1%
associate-*l*97.1%
associate-+r-97.1%
hypot-undefine97.1%
unpow297.1%
unpow297.1%
+-commutative97.1%
unpow297.1%
unpow297.1%
hypot-undefine97.1%
Simplified97.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 A around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define22.4%
Simplified22.4%
neg-sub022.4%
associate-*l/22.4%
pow1/222.4%
pow1/222.4%
pow-prod-down22.5%
Applied egg-rr22.5%
neg-sub022.5%
distribute-neg-frac222.5%
unpow1/222.4%
Simplified22.4%
Final simplification40.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
(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))))
(t_3 (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= t_2 -5e-172)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (sqrt (* 2.0 t_3)))
(- t_3))
(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 (- C (hypot C 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 t_3 = fma(C, (A * -4.0), pow(B_m, 2.0));
double tmp;
if (t_2 <= -5e-172) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * sqrt((2.0 * t_3))) / -t_3;
} 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 * (C - hypot(C, 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))) t_3 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) tmp = 0.0 if (t_2 <= -5e-172) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * sqrt(Float64(2.0 * t_3))) / Float64(-t_3)); 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(C - hypot(C, 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]}, Block[{t$95$3 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-172], 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$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$3)), $MachinePrecision], 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[(C - N[Sqrt[C ^ 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}}\\
t_3 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-172}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)} \cdot \sqrt{2 \cdot t\_3}}{-t\_3}\\
\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(C - \mathsf{hypot}\left(C, 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))) < -4.9999999999999999e-172Initial program 51.2%
Simplified46.9%
pow1/246.9%
associate-*r*60.7%
unpow-prod-down68.7%
associate-+r-67.6%
hypot-undefine58.0%
unpow258.0%
unpow258.0%
+-commutative58.0%
unpow258.0%
unpow258.0%
hypot-define67.6%
pow1/267.6%
Applied egg-rr67.6%
unpow1/267.6%
associate-+r-68.7%
hypot-undefine58.0%
unpow258.0%
unpow258.0%
+-commutative58.0%
unpow258.0%
unpow258.0%
hypot-undefine68.7%
Simplified68.7%
if -4.9999999999999999e-172 < (/.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 28.6%
Simplified34.2%
Taylor expanded in C around inf 41.2%
mul-1-neg41.2%
Simplified41.2%
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 A around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define22.4%
Simplified22.4%
neg-sub022.4%
associate-*l/22.4%
pow1/222.4%
pow1/222.4%
pow-prod-down22.5%
Applied egg-rr22.5%
neg-sub022.5%
distribute-neg-frac222.5%
unpow1/222.4%
Simplified22.4%
Final simplification42.7%
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) 4e-77)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(if (<= (pow B_m 2.0) 1e+290)
(/
1.0
(/
(- (* (* 4.0 A) C) (pow B_m 2.0))
(* B_m (sqrt (* (* 2.0 F) (- A (hypot B_m A)))))))
(/ (sqrt (* 2.0 (* F (- C (hypot C 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) <= 4e-77) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else if (pow(B_m, 2.0) <= 1e+290) {
tmp = 1.0 / ((((4.0 * A) * C) - pow(B_m, 2.0)) / (B_m * sqrt(((2.0 * F) * (A - hypot(B_m, A))))));
} else {
tmp = sqrt((2.0 * (F * (C - hypot(C, 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) <= 4e-77) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 1e+290) tmp = Float64(1.0 / Float64(Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) / Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A))))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(C, 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], 4e-77], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+290], N[(1.0 / N[(N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[C ^ 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 4 \cdot 10^{-77}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+290}:\\
\;\;\;\;\frac{1}{\frac{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999997e-77Initial program 24.3%
Simplified31.5%
Taylor expanded in A around -inf 27.1%
if 3.9999999999999997e-77 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e290Initial program 40.6%
Taylor expanded in C around 0 25.2%
mul-1-neg25.2%
+-commutative25.2%
unpow225.2%
unpow225.2%
hypot-define28.5%
Simplified28.5%
clear-num28.6%
inv-pow28.6%
*-commutative28.6%
*-commutative28.6%
associate-*l*28.6%
pow1/228.6%
pow1/228.6%
pow-prod-down28.7%
Applied egg-rr28.7%
unpow-128.7%
distribute-rgt-neg-in28.7%
unpow1/228.6%
associate-*r*28.6%
Simplified28.6%
if 1.00000000000000006e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.9%
Taylor expanded in A around 0 1.5%
mul-1-neg1.5%
+-commutative1.5%
unpow21.5%
unpow21.5%
hypot-define23.8%
Simplified23.8%
neg-sub023.8%
associate-*l/23.8%
pow1/223.8%
pow1/223.8%
pow-prod-down24.0%
Applied egg-rr24.0%
neg-sub024.0%
distribute-neg-frac224.0%
unpow1/223.9%
Simplified23.9%
Final simplification26.9%
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 (<= (pow B_m 2.0) 2e-90)
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 1e+290)
(/
1.0
(/
(- (* (* 4.0 A) C) (pow B_m 2.0))
(* B_m (sqrt (* (* 2.0 F) (- A (hypot B_m A)))))))
(/ (sqrt (* 2.0 (* F (- C (hypot C 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 (pow(B_m, 2.0) <= 2e-90) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+290) {
tmp = 1.0 / ((((4.0 * A) * C) - pow(B_m, 2.0)) / (B_m * sqrt(((2.0 * F) * (A - hypot(B_m, A))))));
} else {
tmp = sqrt((2.0 * (F * (C - hypot(C, 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 ((B_m ^ 2.0) <= 2e-90) 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)))); elseif ((B_m ^ 2.0) <= 1e+290) tmp = Float64(1.0 / Float64(Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) / Float64(B_m * sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A))))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(C, 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_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-90], 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], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+290], N[(1.0 / N[(N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / N[(B$95$m * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[C ^ 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}\;{B\_m}^{2} \leq 2 \cdot 10^{-90}:\\
\;\;\;\;\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)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+290}:\\
\;\;\;\;\frac{1}{\frac{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}{B\_m \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999999e-90Initial program 23.9%
Simplified29.8%
Taylor expanded in C around inf 26.1%
associate-*r*26.1%
mul-1-neg26.1%
Simplified26.1%
if 1.99999999999999999e-90 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e290Initial program 40.8%
Taylor expanded in C around 0 24.7%
mul-1-neg24.7%
+-commutative24.7%
unpow224.7%
unpow224.7%
hypot-define29.2%
Simplified29.2%
clear-num29.2%
inv-pow29.2%
*-commutative29.2%
*-commutative29.2%
associate-*l*29.2%
pow1/229.2%
pow1/229.2%
pow-prod-down29.3%
Applied egg-rr29.3%
unpow-129.3%
distribute-rgt-neg-in29.3%
unpow1/229.3%
associate-*r*29.3%
Simplified29.3%
if 1.00000000000000006e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.9%
Taylor expanded in A around 0 1.5%
mul-1-neg1.5%
+-commutative1.5%
unpow21.5%
unpow21.5%
hypot-define23.8%
Simplified23.8%
neg-sub023.8%
associate-*l/23.8%
pow1/223.8%
pow1/223.8%
pow-prod-down24.0%
Applied egg-rr24.0%
neg-sub024.0%
distribute-neg-frac224.0%
unpow1/223.9%
Simplified23.9%
Final simplification26.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 (<= (pow B_m 2.0) 2e-90)
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 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) {
double tmp;
if (pow(B_m, 2.0) <= 2e-90) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -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 ^ 2.0) <= 2e-90) 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)))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / 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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-90], 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], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $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])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-90}:\\
\;\;\;\;\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)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999999e-90Initial program 23.9%
Simplified29.8%
Taylor expanded in C around inf 26.1%
associate-*r*26.1%
mul-1-neg26.1%
Simplified26.1%
if 1.99999999999999999e-90 < (pow.f64 B #s(literal 2 binary64)) Initial program 25.0%
Taylor expanded in C around 0 15.4%
mul-1-neg15.4%
+-commutative15.4%
unpow215.4%
unpow215.4%
hypot-define28.0%
Simplified28.0%
Final simplification27.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 6.5e-43) (/ (sqrt (* (* A -8.0) (* C (* F (+ A A))))) (* (* 4.0 A) C)) (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 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) {
double tmp;
if (B_m <= 6.5e-43) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -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 <= 6.5e-43) {
tmp = Math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -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 <= 6.5e-43: tmp = math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C) else: tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -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 <= 6.5e-43) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / 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 <= 6.5e-43)
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
else
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -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, 6.5e-43], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 6.5 \cdot 10^{-43}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if B < 6.50000000000000001e-43Initial program 22.9%
Simplified26.0%
Taylor expanded in C around inf 17.3%
associate-*r*17.3%
Simplified17.3%
Taylor expanded in C around inf 19.9%
associate-*r*19.2%
mul-1-neg19.2%
Simplified19.9%
if 6.50000000000000001e-43 < B Initial program 29.6%
Taylor expanded in C around 0 32.5%
mul-1-neg32.5%
+-commutative32.5%
unpow232.5%
unpow232.5%
hypot-define55.9%
Simplified55.9%
Final simplification28.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 (<= B_m 2.15e-47) (/ (sqrt (* (* A -8.0) (* C (* F (+ A A))))) (* (* 4.0 A) C)) (/ (sqrt (* 2.0 (* F (- C (hypot C 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 (B_m <= 2.15e-47) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = sqrt((2.0 * (F * (C - hypot(C, 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 (B_m <= 2.15e-47) {
tmp = Math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((2.0 * (F * (C - Math.hypot(C, 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 B_m <= 2.15e-47: tmp = math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C) else: tmp = math.sqrt((2.0 * (F * (C - math.hypot(C, 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 (B_m <= 2.15e-47) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(C, 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 (B_m <= 2.15e-47)
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
else
tmp = sqrt((2.0 * (F * (C - hypot(C, 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[B$95$m, 2.15e-47], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[C ^ 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}\;B\_m \leq 2.15 \cdot 10^{-47}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 2.1499999999999999e-47Initial program 22.5%
Simplified25.6%
Taylor expanded in C around inf 16.9%
associate-*r*16.9%
Simplified16.9%
Taylor expanded in C around inf 20.0%
associate-*r*19.3%
mul-1-neg19.3%
Simplified20.0%
if 2.1499999999999999e-47 < B Initial program 30.7%
Taylor expanded in A around 0 28.5%
mul-1-neg28.5%
+-commutative28.5%
unpow228.5%
unpow228.5%
hypot-define50.9%
Simplified50.9%
neg-sub050.9%
associate-*l/50.9%
pow1/250.9%
pow1/250.9%
pow-prod-down51.0%
Applied egg-rr51.0%
neg-sub051.0%
distribute-neg-frac251.0%
unpow1/251.0%
Simplified51.0%
Final simplification27.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 (<= B_m 3.9e-43) (/ (sqrt (* (* A -8.0) (* C (* F (+ A A))))) (* (* 4.0 A) C)) (/ (sqrt (* F (* B_m -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) {
double tmp;
if (B_m <= 3.9e-43) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = sqrt((F * (B_m * -2.0))) / -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 <= 3.9d-43) then
tmp = sqrt(((a * (-8.0d0)) * (c * (f * (a + a))))) / ((4.0d0 * a) * c)
else
tmp = sqrt((f * (b_m * (-2.0d0)))) / -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 <= 3.9e-43) {
tmp = Math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
} else {
tmp = Math.sqrt((F * (B_m * -2.0))) / -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 <= 3.9e-43: tmp = math.sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C) else: tmp = math.sqrt((F * (B_m * -2.0))) / -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 <= 3.9e-43) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(A + A))))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / 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 <= 3.9e-43)
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / ((4.0 * A) * C);
else
tmp = sqrt((F * (B_m * -2.0))) / -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, 3.9e-43], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $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 3.9 \cdot 10^{-43}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.9e-43Initial program 22.9%
Simplified26.0%
Taylor expanded in C around inf 17.3%
associate-*r*17.3%
Simplified17.3%
Taylor expanded in C around inf 19.9%
associate-*r*19.2%
mul-1-neg19.2%
Simplified19.9%
if 3.9e-43 < B Initial program 29.6%
Taylor expanded in A around 0 29.0%
mul-1-neg29.0%
+-commutative29.0%
unpow229.0%
unpow229.0%
hypot-define51.7%
Simplified51.7%
neg-sub051.7%
associate-*l/51.7%
pow1/251.7%
pow1/251.8%
pow-prod-down51.9%
Applied egg-rr51.9%
neg-sub051.9%
distribute-neg-frac251.9%
unpow1/251.9%
Simplified51.9%
Taylor expanded in C around 0 44.6%
associate-*r*44.6%
Simplified44.6%
Final simplification25.7%
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 (<= C 1.1e+17) (/ (sqrt (* F (* B_m -2.0))) (- B_m)) (/ (* B_m (sqrt (/ F (- C)))) (- 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 (C <= 1.1e+17) {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
} else {
tmp = (B_m * sqrt((F / -C))) / -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 (c <= 1.1d+17) then
tmp = sqrt((f * (b_m * (-2.0d0)))) / -b_m
else
tmp = (b_m * sqrt((f / -c))) / -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 (C <= 1.1e+17) {
tmp = Math.sqrt((F * (B_m * -2.0))) / -B_m;
} else {
tmp = (B_m * Math.sqrt((F / -C))) / -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 C <= 1.1e+17: tmp = math.sqrt((F * (B_m * -2.0))) / -B_m else: tmp = (B_m * math.sqrt((F / -C))) / -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 (C <= 1.1e+17) tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); else tmp = Float64(Float64(B_m * sqrt(Float64(F / Float64(-C)))) / 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 (C <= 1.1e+17)
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
else
tmp = (B_m * sqrt((F / -C))) / -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[C, 1.1e+17], N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(B$95$m * N[Sqrt[N[(F / (-C)), $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}\;C \leq 1.1 \cdot 10^{+17}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{B\_m \cdot \sqrt{\frac{F}{-C}}}{-B\_m}\\
\end{array}
\end{array}
if C < 1.1e17Initial program 32.4%
Taylor expanded in A around 0 13.3%
mul-1-neg13.3%
+-commutative13.3%
unpow213.3%
unpow213.3%
hypot-define19.1%
Simplified19.1%
neg-sub019.1%
associate-*l/19.1%
pow1/219.1%
pow1/219.2%
pow-prod-down19.2%
Applied egg-rr19.2%
neg-sub019.2%
distribute-neg-frac219.2%
unpow1/219.1%
Simplified19.1%
Taylor expanded in C around 0 17.5%
associate-*r*17.5%
Simplified17.5%
if 1.1e17 < C Initial program 1.2%
Taylor expanded in A around 0 2.0%
mul-1-neg2.0%
+-commutative2.0%
unpow22.0%
unpow22.0%
hypot-define20.1%
Simplified20.1%
neg-sub020.1%
associate-*l/20.1%
pow1/220.1%
pow1/220.1%
pow-prod-down20.1%
Applied egg-rr20.1%
neg-sub020.1%
distribute-neg-frac220.1%
unpow1/220.1%
Simplified20.1%
Taylor expanded in C around inf 26.4%
mul-1-neg26.4%
associate-/l*24.0%
Simplified24.0%
pow1/224.0%
distribute-rgt-neg-in24.0%
metadata-eval24.0%
unpow-prod-down21.4%
metadata-eval21.4%
pow1/221.4%
sqrt-pow135.1%
metadata-eval35.1%
pow135.1%
metadata-eval35.1%
Applied egg-rr35.1%
unpow1/235.1%
distribute-neg-frac235.1%
Simplified35.1%
Final simplification22.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 (if (<= F 1e-309) (/ (sqrt (* F (* B_m -2.0))) (- B_m)) (+ (+ 1.0 (sqrt (* 2.0 (/ F B_m)))) -1.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 <= 1e-309) {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
} else {
tmp = (1.0 + sqrt((2.0 * (F / B_m)))) + -1.0;
}
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 <= 1d-309) then
tmp = sqrt((f * (b_m * (-2.0d0)))) / -b_m
else
tmp = (1.0d0 + sqrt((2.0d0 * (f / b_m)))) + (-1.0d0)
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 <= 1e-309) {
tmp = Math.sqrt((F * (B_m * -2.0))) / -B_m;
} else {
tmp = (1.0 + Math.sqrt((2.0 * (F / B_m)))) + -1.0;
}
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 <= 1e-309: tmp = math.sqrt((F * (B_m * -2.0))) / -B_m else: tmp = (1.0 + math.sqrt((2.0 * (F / B_m)))) + -1.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 <= 1e-309) tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); else tmp = Float64(Float64(1.0 + sqrt(Float64(2.0 * Float64(F / B_m)))) + -1.0); 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 <= 1e-309)
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
else
tmp = (1.0 + sqrt((2.0 * (F / B_m)))) + -1.0;
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, 1e-309], N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(1.0 + N[Sqrt[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + -1.0), $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 10^{-309}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \sqrt{2 \cdot \frac{F}{B\_m}}\right) + -1\\
\end{array}
\end{array}
if F < 1.000000000000002e-309Initial program 22.8%
Taylor expanded in A around 0 11.3%
mul-1-neg11.3%
+-commutative11.3%
unpow211.3%
unpow211.3%
hypot-define18.8%
Simplified18.8%
neg-sub018.8%
associate-*l/18.8%
pow1/218.8%
pow1/218.8%
pow-prod-down18.9%
Applied egg-rr18.9%
neg-sub018.9%
distribute-neg-frac218.9%
unpow1/218.9%
Simplified18.9%
Taylor expanded in C around 0 15.8%
associate-*r*15.8%
Simplified15.8%
if 1.000000000000002e-309 < F Initial program 30.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt6.6%
Simplified6.6%
add-cbrt-cube6.4%
pow1/36.4%
add-sqr-sqrt6.4%
pow16.4%
pow1/26.6%
pow-prod-up6.6%
metadata-eval6.6%
Applied egg-rr6.6%
pow-pow6.8%
metadata-eval6.8%
pow1/26.6%
neg-mul-16.6%
distribute-rgt-neg-in6.6%
expm1-log1p-u6.6%
expm1-define13.3%
log1p-undefine13.3%
rem-exp-log13.3%
remove-double-neg13.3%
*-commutative13.3%
sqrt-unprod13.3%
Applied egg-rr13.3%
Final simplification15.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 (<= C 1.8e+295) (/ (sqrt (* F (* B_m -2.0))) (- B_m)) (* B_m (/ (sqrt (/ F C)) 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 (C <= 1.8e+295) {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
} else {
tmp = B_m * (sqrt((F / C)) / 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 (c <= 1.8d+295) then
tmp = sqrt((f * (b_m * (-2.0d0)))) / -b_m
else
tmp = b_m * (sqrt((f / c)) / 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 (C <= 1.8e+295) {
tmp = Math.sqrt((F * (B_m * -2.0))) / -B_m;
} else {
tmp = B_m * (Math.sqrt((F / C)) / 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 C <= 1.8e+295: tmp = math.sqrt((F * (B_m * -2.0))) / -B_m else: tmp = B_m * (math.sqrt((F / C)) / 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 (C <= 1.8e+295) tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); else tmp = Float64(B_m * Float64(sqrt(Float64(F / C)) / 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 (C <= 1.8e+295)
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
else
tmp = B_m * (sqrt((F / C)) / 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[C, 1.8e+295], N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(B$95$m * N[(N[Sqrt[N[(F / C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 1.8 \cdot 10^{+295}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;B\_m \cdot \frac{\sqrt{\frac{F}{C}}}{B\_m}\\
\end{array}
\end{array}
if C < 1.79999999999999992e295Initial program 25.2%
Taylor expanded in A around 0 10.7%
mul-1-neg10.7%
+-commutative10.7%
unpow210.7%
unpow210.7%
hypot-define18.6%
Simplified18.6%
neg-sub018.6%
associate-*l/18.6%
pow1/218.6%
pow1/218.6%
pow-prod-down18.7%
Applied egg-rr18.7%
neg-sub018.7%
distribute-neg-frac218.7%
unpow1/218.6%
Simplified18.6%
Taylor expanded in C around 0 14.7%
associate-*r*14.7%
Simplified14.7%
if 1.79999999999999992e295 < C Initial program 0.6%
Taylor expanded in A around 0 0.9%
mul-1-neg0.9%
+-commutative0.9%
unpow20.9%
unpow20.9%
hypot-define46.4%
Simplified46.4%
neg-sub046.4%
associate-*l/46.4%
pow1/246.4%
pow1/246.4%
pow-prod-down46.4%
Applied egg-rr46.4%
neg-sub046.4%
distribute-neg-frac246.4%
unpow1/246.4%
Simplified46.4%
Taylor expanded in C around inf 32.1%
mul-1-neg32.1%
associate-/l*32.1%
Simplified32.1%
*-un-lft-identity32.1%
distribute-lft-neg-in32.1%
sqrt-prod16.3%
unpow216.3%
distribute-lft-neg-in16.3%
add-sqr-sqrt16.3%
sqrt-unprod17.2%
sqr-neg17.2%
unpow217.2%
sqrt-pow131.7%
metadata-eval31.7%
pow131.7%
unpow231.7%
sqrt-pow132.1%
metadata-eval32.1%
pow132.1%
add-sqr-sqrt31.3%
sqrt-unprod29.4%
sqr-neg29.4%
Applied egg-rr32.1%
*-lft-identity32.1%
associate-/l*45.8%
Simplified45.8%
Final simplification15.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 (* B_m (/ (sqrt (/ F C)) (- 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 B_m * (sqrt((F / C)) / -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 = b_m * (sqrt((f / c)) / -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 B_m * (Math.sqrt((F / C)) / -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 B_m * (math.sqrt((F / C)) / -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(B_m * Float64(sqrt(Float64(F / C)) / Float64(-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 = B_m * (sqrt((F / C)) / -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[(B$95$m * N[(N[Sqrt[N[(F / C), $MachinePrecision]], $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])\\
\\
B\_m \cdot \frac{\sqrt{\frac{F}{C}}}{-B\_m}
\end{array}
Initial program 24.5%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-define19.3%
Simplified19.3%
neg-sub019.3%
associate-*l/19.4%
pow1/219.4%
pow1/219.4%
pow-prod-down19.4%
Applied egg-rr19.4%
neg-sub019.4%
distribute-neg-frac219.4%
unpow1/219.4%
Simplified19.4%
Taylor expanded in C around inf 13.1%
mul-1-neg13.1%
associate-/l*11.3%
Simplified11.3%
distribute-frac-neg211.3%
neg-sub011.3%
distribute-lft-neg-in11.3%
sqrt-prod1.4%
unpow21.4%
distribute-lft-neg-in1.4%
add-sqr-sqrt1.3%
sqrt-unprod2.2%
sqr-neg2.2%
unpow22.2%
sqrt-pow12.9%
metadata-eval2.9%
pow12.9%
unpow22.9%
sqrt-pow13.1%
metadata-eval3.1%
pow13.1%
Applied egg-rr3.1%
neg-sub03.1%
associate-/l*3.5%
distribute-rgt-neg-in3.5%
Simplified3.5%
Final simplification3.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 (* B_m (/ (sqrt (/ F C)) 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 B_m * (sqrt((F / C)) / 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 = b_m * (sqrt((f / c)) / 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 B_m * (Math.sqrt((F / C)) / 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 B_m * (math.sqrt((F / C)) / 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(B_m * Float64(sqrt(Float64(F / C)) / 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 = B_m * (sqrt((F / C)) / 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[(B$95$m * N[(N[Sqrt[N[(F / C), $MachinePrecision]], $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])\\
\\
B\_m \cdot \frac{\sqrt{\frac{F}{C}}}{B\_m}
\end{array}
Initial program 24.5%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
+-commutative10.4%
unpow210.4%
unpow210.4%
hypot-define19.3%
Simplified19.3%
neg-sub019.3%
associate-*l/19.4%
pow1/219.4%
pow1/219.4%
pow-prod-down19.4%
Applied egg-rr19.4%
neg-sub019.4%
distribute-neg-frac219.4%
unpow1/219.4%
Simplified19.4%
Taylor expanded in C around inf 13.1%
mul-1-neg13.1%
associate-/l*11.3%
Simplified11.3%
*-un-lft-identity11.3%
distribute-lft-neg-in11.3%
sqrt-prod1.4%
unpow21.4%
distribute-lft-neg-in1.4%
add-sqr-sqrt1.3%
sqrt-unprod2.2%
sqr-neg2.2%
unpow22.2%
sqrt-pow12.9%
metadata-eval2.9%
pow12.9%
unpow22.9%
sqrt-pow13.1%
metadata-eval3.1%
pow13.1%
add-sqr-sqrt2.0%
sqrt-unprod2.2%
sqr-neg2.2%
Applied egg-rr1.9%
*-lft-identity1.9%
associate-/l*2.3%
Simplified2.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 (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 24.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt3.0%
Simplified3.0%
add-cbrt-cube3.0%
pow1/33.0%
add-sqr-sqrt3.0%
pow13.0%
pow1/23.1%
pow-prod-up3.1%
metadata-eval3.1%
Applied egg-rr3.1%
pow-pow3.2%
metadata-eval3.2%
pow1/23.0%
neg-mul-13.0%
distribute-rgt-neg-in3.0%
remove-double-neg3.0%
*-commutative3.0%
pow1/23.0%
metadata-eval3.0%
pow1/23.2%
metadata-eval3.2%
pow-prod-down3.2%
metadata-eval3.2%
Applied egg-rr3.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(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 24.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt3.0%
Simplified3.0%
add-cbrt-cube3.0%
pow1/33.0%
add-sqr-sqrt3.0%
pow13.0%
pow1/23.1%
pow-prod-up3.1%
metadata-eval3.1%
Applied egg-rr3.1%
pow-pow3.2%
metadata-eval3.2%
pow1/23.0%
neg-mul-13.0%
distribute-rgt-neg-in3.0%
expm1-log1p-u3.0%
expm1-define4.6%
sub-neg4.6%
log1p-undefine4.6%
rem-exp-log4.6%
remove-double-neg4.6%
*-commutative4.6%
sqrt-unprod4.6%
metadata-eval4.6%
Applied egg-rr4.6%
+-commutative4.6%
associate-+r+3.0%
metadata-eval3.0%
+-lft-identity3.0%
Simplified3.0%
herbie shell --seed 2024182
(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))))