
(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 (- (* (* 4.0 A) C) (pow B_m 2.0)))
(t_1
(/
(sqrt
(*
(- (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))
(* 2.0 (* F t_0))))
t_0))
(t_2 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))
(t_3 (* A (* C -4.0)))
(t_4 (fma B_m B_m t_3))
(t_5 (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= t_1 (- INFINITY))
(/ (* (hypot B_m (sqrt t_3)) (- (sqrt (* F (* 2.0 t_2))))) t_4)
(if (<= t_1 -5e-194)
(/ (sqrt (* (* F t_4) (* 2.0 (- A (- (hypot B_m (- A C)) C))))) (- t_4))
(if (<= t_1 INFINITY)
(/ (sqrt (* F (* (* 2.0 t_5) t_2))) (- t_5))
(/ (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 = ((4.0 * A) * C) - pow(B_m, 2.0);
double t_1 = sqrt(((sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) - (A + C)) * (2.0 * (F * t_0)))) / t_0;
double t_2 = A + (A + (-0.5 * (pow(B_m, 2.0) / C)));
double t_3 = A * (C * -4.0);
double t_4 = fma(B_m, B_m, t_3);
double t_5 = fma(C, (A * -4.0), pow(B_m, 2.0));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (hypot(B_m, sqrt(t_3)) * -sqrt((F * (2.0 * t_2)))) / t_4;
} else if (t_1 <= -5e-194) {
tmp = sqrt(((F * t_4) * (2.0 * (A - (hypot(B_m, (A - C)) - C))))) / -t_4;
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((F * ((2.0 * t_5) * t_2))) / -t_5;
} 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 = Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) t_1 = Float64(sqrt(Float64(Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)) * Float64(2.0 * Float64(F * t_0)))) / t_0) t_2 = Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C)))) t_3 = Float64(A * Float64(C * -4.0)) t_4 = fma(B_m, B_m, t_3) t_5 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(hypot(B_m, sqrt(t_3)) * Float64(-sqrt(Float64(F * Float64(2.0 * t_2))))) / t_4); elseif (t_1 <= -5e-194) tmp = Float64(sqrt(Float64(Float64(F * t_4) * Float64(2.0 * Float64(A - Float64(hypot(B_m, Float64(A - C)) - C))))) / Float64(-t_4)); elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(F * Float64(Float64(2.0 * t_5) * t_2))) / Float64(-t_5)); 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[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(B$95$m * B$95$m + t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[Sqrt[B$95$m ^ 2 + N[Sqrt[t$95$3], $MachinePrecision] ^ 2], $MachinePrecision] * (-N[Sqrt[N[(F * N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$1, -5e-194], N[(N[Sqrt[N[(N[(F * t$95$4), $MachinePrecision] * N[(2.0 * N[(A - N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(F * N[(N[(2.0 * t$95$5), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$5)), $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 := \left(4 \cdot A\right) \cdot C - {B\_m}^{2}\\
t_1 := \frac{\sqrt{\left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t\_0\right)\right)}}{t\_0}\\
t_2 := A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\\
t_3 := A \cdot \left(C \cdot -4\right)\\
t_4 := \mathsf{fma}\left(B\_m, B\_m, t\_3\right)\\
t_5 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{\mathsf{hypot}\left(B\_m, \sqrt{t\_3}\right) \cdot \left(-\sqrt{F \cdot \left(2 \cdot t\_2\right)}\right)}{t\_4}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_4\right) \cdot \left(2 \cdot \left(A - \left(\mathsf{hypot}\left(B\_m, A - C\right) - C\right)\right)\right)}}{-t\_4}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(\left(2 \cdot t\_5\right) \cdot t\_2\right)}}{-t\_5}\\
\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.0Initial program 3.2%
Simplified15.1%
Taylor expanded in C around inf 10.6%
mul-1-neg8.3%
Simplified10.6%
pow1/211.8%
associate-*l*11.8%
unpow-prod-down18.1%
pow1/218.1%
fma-undefine18.1%
add-sqr-sqrt14.9%
hypot-define14.9%
Applied egg-rr14.9%
unpow1/214.5%
associate-+r-14.5%
Simplified14.5%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-194Initial program 99.2%
Simplified99.2%
if -5.0000000000000002e-194 < (/.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 21.4%
Simplified28.7%
Taylor expanded in C around inf 22.8%
mul-1-neg22.8%
Simplified22.8%
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 4.0%
mul-1-neg4.0%
+-commutative4.0%
unpow24.0%
unpow24.0%
hypot-define26.2%
Simplified26.2%
neg-sub026.2%
associate-*l/26.2%
pow1/226.2%
pow1/226.3%
pow-prod-down26.3%
Applied egg-rr26.3%
neg-sub026.3%
distribute-neg-frac226.3%
unpow1/226.3%
Simplified26.3%
Final simplification30.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 C (* A -4.0) (pow B_m 2.0)))
(t_1 (* 2.0 t_0))
(t_2 (- (* (* 4.0 A) C) (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(- (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))
(* 2.0 (* F t_2))))
t_2))
(t_4 (- t_0)))
(if (<= t_3 -5e-194)
(/ (* (sqrt (* F (- A (- (hypot B_m (- A C)) C)))) (sqrt t_1)) t_4)
(if (<= t_3 INFINITY)
(/ (sqrt (* F (* t_1 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C))))))) t_4)
(/ (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(C, (A * -4.0), pow(B_m, 2.0));
double t_1 = 2.0 * t_0;
double t_2 = ((4.0 * A) * C) - pow(B_m, 2.0);
double t_3 = sqrt(((sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) - (A + C)) * (2.0 * (F * t_2)))) / t_2;
double t_4 = -t_0;
double tmp;
if (t_3 <= -5e-194) {
tmp = (sqrt((F * (A - (hypot(B_m, (A - C)) - C)))) * sqrt(t_1)) / t_4;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((F * (t_1 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_4;
} 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(C, Float64(A * -4.0), (B_m ^ 2.0)) t_1 = Float64(2.0 * t_0) t_2 = Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)) * Float64(2.0 * Float64(F * t_2)))) / t_2) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -5e-194) tmp = Float64(Float64(sqrt(Float64(F * Float64(A - Float64(hypot(B_m, Float64(A - C)) - C)))) * sqrt(t_1)) / t_4); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(F * Float64(t_1 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_4); 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[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -5e-194], N[(N[(N[Sqrt[N[(F * N[(A - N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(F * N[(t$95$1 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(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(C, A \cdot -4, {B\_m}^{2}\right)\\
t_1 := 2 \cdot t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t\_2\right)\right)}}{t\_2}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-194}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A - \left(\mathsf{hypot}\left(B\_m, A - C\right) - C\right)\right)} \cdot \sqrt{t\_1}}{t\_4}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(t\_1 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_4}\\
\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))) < -5.0000000000000002e-194Initial program 38.5%
Simplified36.2%
pow1/236.2%
associate-*r*44.9%
unpow-prod-down59.4%
associate-+r-58.7%
hypot-undefine45.6%
unpow245.6%
unpow245.6%
+-commutative45.6%
unpow245.6%
unpow245.6%
hypot-define58.7%
pow1/258.7%
Applied egg-rr58.7%
unpow1/258.7%
associate-+r-59.4%
hypot-undefine45.6%
unpow245.6%
unpow245.6%
+-commutative45.6%
unpow245.6%
unpow245.6%
hypot-undefine59.4%
Simplified59.4%
if -5.0000000000000002e-194 < (/.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 21.4%
Simplified28.7%
Taylor expanded in C around inf 22.8%
mul-1-neg22.8%
Simplified22.8%
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 4.0%
mul-1-neg4.0%
+-commutative4.0%
unpow24.0%
unpow24.0%
hypot-define26.2%
Simplified26.2%
neg-sub026.2%
associate-*l/26.2%
pow1/226.2%
pow1/226.3%
pow-prod-down26.3%
Applied egg-rr26.3%
neg-sub026.3%
distribute-neg-frac226.3%
unpow1/226.3%
Simplified26.3%
Final simplification34.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-191)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(if (<= (pow B_m 2.0) 5e+217)
(/
1.0
(*
(sqrt
(/
(fma -4.0 (* A C) (pow B_m 2.0))
(* F (- (+ A C) (hypot B_m (- A C))))))
(/ -1.0 (sqrt 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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-191) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+217) {
tmp = 1.0 / (sqrt((fma(-4.0, (A * C), pow(B_m, 2.0)) / (F * ((A + C) - hypot(B_m, (A - C)))))) * (-1.0 / sqrt(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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-191) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+217) tmp = Float64(1.0 / Float64(sqrt(Float64(fma(-4.0, Float64(A * C), (B_m ^ 2.0)) / Float64(F * Float64(Float64(A + C) - hypot(B_m, Float64(A - C)))))) * Float64(-1.0 / sqrt(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_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-191], 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], 5e+217], N[(1.0 / N[(N[Sqrt[N[(N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[Sqrt[2.0], $MachinePrecision]), $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+217}:\\
\;\;\;\;\frac{1}{\sqrt{\frac{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}{F \cdot \left(\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right)}} \cdot \frac{-1}{\sqrt{2}}}\\
\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)) < 1e-191Initial program 15.0%
Simplified24.9%
Taylor expanded in A around -inf 18.3%
if 1e-191 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000041e217Initial program 27.3%
Simplified34.2%
clear-num34.2%
inv-pow34.2%
Applied egg-rr43.2%
unpow-143.2%
associate-+r-40.6%
hypot-undefine28.2%
unpow228.2%
unpow228.2%
+-commutative28.2%
unpow228.2%
unpow228.2%
hypot-undefine40.6%
Simplified40.6%
Taylor expanded in F around 0 31.0%
mul-1-neg31.0%
fma-define31.0%
unpow231.0%
unpow231.0%
hypot-undefine48.9%
Simplified48.9%
if 5.00000000000000041e217 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.6%
Taylor expanded in C around 0 4.6%
mul-1-neg4.6%
+-commutative4.6%
unpow24.6%
unpow24.6%
hypot-define29.0%
Simplified29.0%
Final simplification30.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) 1e-191)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(if (<= (pow B_m 2.0) 5e+217)
(*
(sqrt
(/
(* F (- A (- (hypot B_m (- A C)) C)))
(fma -4.0 (* A C) (pow B_m 2.0))))
(- (sqrt 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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-191) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+217) {
tmp = sqrt(((F * (A - (hypot(B_m, (A - C)) - C))) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * -sqrt(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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-191) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+217) tmp = Float64(sqrt(Float64(Float64(F * Float64(A - Float64(hypot(B_m, Float64(A - C)) - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-sqrt(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_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-191], 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], 5e+217], N[(N[Sqrt[N[(N[(F * N[(A - N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+217}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(A - \left(\mathsf{hypot}\left(B\_m, A - C\right) - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{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)) < 1e-191Initial program 15.0%
Simplified24.9%
Taylor expanded in A around -inf 18.3%
if 1e-191 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000041e217Initial program 27.3%
Taylor expanded in F around 0 31.3%
Simplified48.3%
if 5.00000000000000041e217 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.6%
Taylor expanded in C around 0 4.6%
mul-1-neg4.6%
+-commutative4.6%
unpow24.6%
unpow24.6%
hypot-define29.0%
Simplified29.0%
Final simplification30.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 (<= (pow B_m 2.0) 1e-191)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- 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 tmp;
if (pow(B_m, 2.0) <= 1e-191) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -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))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-191) 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(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], 1e-191], 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[(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 10^{-191}:\\
\;\;\;\;\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(C - \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-191Initial program 15.0%
Simplified24.9%
Taylor expanded in A around -inf 18.3%
if 1e-191 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.1%
Taylor expanded in A around 0 8.9%
mul-1-neg8.9%
+-commutative8.9%
unpow28.9%
unpow28.9%
hypot-define24.3%
Simplified24.3%
neg-sub024.3%
associate-*l/24.3%
pow1/224.3%
pow1/224.3%
pow-prod-down24.4%
Applied egg-rr24.4%
neg-sub024.4%
distribute-neg-frac224.4%
unpow1/224.3%
Simplified24.3%
Final simplification21.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) 1e-191)
(/
(sqrt (* (* A -8.0) (* C (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.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 tmp;
if (pow(B_m, 2.0) <= 1e-191) {
tmp = sqrt(((A * -8.0) * (C * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.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) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-191) 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(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], 1e-191], 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[(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 10^{-191}:\\
\;\;\;\;\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}:\\
\;\;\;\;\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)) < 1e-191Initial program 15.0%
Simplified27.2%
Taylor expanded in C around inf 16.5%
associate-*r*16.5%
mul-1-neg16.5%
Simplified16.5%
if 1e-191 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.1%
Taylor expanded in A around 0 8.9%
mul-1-neg8.9%
+-commutative8.9%
unpow28.9%
unpow28.9%
hypot-define24.3%
Simplified24.3%
neg-sub024.3%
associate-*l/24.3%
pow1/224.3%
pow1/224.3%
pow-prod-down24.4%
Applied egg-rr24.4%
neg-sub024.4%
distribute-neg-frac224.4%
unpow1/224.3%
Simplified24.3%
Final simplification21.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 (<= F -1.8e+65)
(- (sqrt (/ (* F (- (* 2.0 (/ A B_m)) 2.0)) B_m)))
(if (<= F -2.7e-273)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
(* (pow (pow (* 2.0 (* F (- C (hypot C B_m)))) 0.25) 2.0) (/ -1.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 (F <= -1.8e+65) {
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= -2.7e-273) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = pow(pow((2.0 * (F * (C - hypot(C, B_m)))), 0.25), 2.0) * (-1.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 (F <= -1.8e+65) {
tmp = -Math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= -2.7e-273) {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = Math.pow(Math.pow((2.0 * (F * (C - Math.hypot(C, B_m)))), 0.25), 2.0) * (-1.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 F <= -1.8e+65: tmp = -math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m)) elif F <= -2.7e-273: tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m) else: tmp = math.pow(math.pow((2.0 * (F * (C - math.hypot(C, B_m)))), 0.25), 2.0) * (-1.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 (F <= -1.8e+65) tmp = Float64(-sqrt(Float64(Float64(F * Float64(Float64(2.0 * Float64(A / B_m)) - 2.0)) / B_m))); elseif (F <= -2.7e-273) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(((Float64(2.0 * Float64(F * Float64(C - hypot(C, B_m)))) ^ 0.25) ^ 2.0) * Float64(-1.0 / 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.8e+65)
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
elseif (F <= -2.7e-273)
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
else
tmp = (((2.0 * (F * (C - hypot(C, B_m)))) ^ 0.25) ^ 2.0) * (-1.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[F, -1.8e+65], (-N[Sqrt[N[(N[(F * N[(N[(2.0 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), If[LessEqual[F, -2.7e-273], 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], N[(N[Power[N[Power[N[(2.0 * N[(F * N[(C - N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision], 2.0], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -1.8 \cdot 10^{+65}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot \frac{A}{B\_m} - 2\right)}{B\_m}}\\
\mathbf{elif}\;F \leq -2.7 \cdot 10^{-273}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)\right)\right)}^{0.25}\right)}^{2} \cdot \frac{-1}{B\_m}\\
\end{array}
\end{array}
if F < -1.79999999999999989e65Initial program 14.1%
Simplified15.4%
Taylor expanded in B around inf 5.4%
sqrt-prod0.5%
*-commutative0.5%
fmm-def0.5%
+-commutative0.5%
metadata-eval0.5%
Applied egg-rr0.5%
Taylor expanded in C around 0 17.9%
if -1.79999999999999989e65 < F < -2.69999999999999984e-273Initial program 13.9%
Taylor expanded in C around 0 9.5%
mul-1-neg9.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define25.1%
Simplified25.1%
if -2.69999999999999984e-273 < F Initial program 20.5%
Taylor expanded in A around 0 11.2%
mul-1-neg11.2%
+-commutative11.2%
unpow211.2%
unpow211.2%
hypot-define28.2%
Simplified28.2%
neg-sub028.2%
associate-*l/28.2%
pow1/228.2%
pow1/228.3%
pow-prod-down28.3%
Applied egg-rr28.3%
neg-sub028.3%
distribute-neg-frac228.3%
unpow1/228.2%
Simplified28.2%
div-inv28.2%
associate-*r*28.2%
Applied egg-rr28.2%
add-sqr-sqrt28.2%
pow228.2%
pow1/228.4%
sqrt-pow128.4%
associate-*l*28.4%
metadata-eval28.4%
Applied egg-rr28.4%
Final simplification23.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 -9e+64)
(- (sqrt (/ (* F (- (* 2.0 (/ A B_m)) 2.0)) B_m)))
(if (<= F -1e-272)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
(* (/ -1.0 B_m) (sqrt (* (- C (hypot C B_m)) (* 2.0 F)))))))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 <= -9e+64) {
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= -1e-272) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
} else {
tmp = (-1.0 / B_m) * sqrt(((C - hypot(C, B_m)) * (2.0 * F)));
}
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 <= -9e+64) {
tmp = -Math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= -1e-272) {
tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = (-1.0 / B_m) * Math.sqrt(((C - Math.hypot(C, B_m)) * (2.0 * F)));
}
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 <= -9e+64: tmp = -math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m)) elif F <= -1e-272: tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m) else: tmp = (-1.0 / B_m) * math.sqrt(((C - math.hypot(C, B_m)) * (2.0 * F))) 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 <= -9e+64) tmp = Float64(-sqrt(Float64(Float64(F * Float64(Float64(2.0 * Float64(A / B_m)) - 2.0)) / B_m))); elseif (F <= -1e-272) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(Float64(-1.0 / B_m) * sqrt(Float64(Float64(C - hypot(C, B_m)) * Float64(2.0 * F)))); 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 <= -9e+64)
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
elseif (F <= -1e-272)
tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
else
tmp = (-1.0 / B_m) * sqrt(((C - hypot(C, B_m)) * (2.0 * F)));
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, -9e+64], (-N[Sqrt[N[(N[(F * N[(N[(2.0 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), If[LessEqual[F, -1e-272], 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], N[(N[(-1.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(C - N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -9 \cdot 10^{+64}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot \frac{A}{B\_m} - 2\right)}{B\_m}}\\
\mathbf{elif}\;F \leq -1 \cdot 10^{-272}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{B\_m} \cdot \sqrt{\left(C - \mathsf{hypot}\left(C, B\_m\right)\right) \cdot \left(2 \cdot F\right)}\\
\end{array}
\end{array}
if F < -8.99999999999999946e64Initial program 14.1%
Simplified15.4%
Taylor expanded in B around inf 5.4%
sqrt-prod0.5%
*-commutative0.5%
fmm-def0.5%
+-commutative0.5%
metadata-eval0.5%
Applied egg-rr0.5%
Taylor expanded in C around 0 17.9%
if -8.99999999999999946e64 < F < -9.9999999999999993e-273Initial program 13.9%
Taylor expanded in C around 0 9.5%
mul-1-neg9.5%
+-commutative9.5%
unpow29.5%
unpow29.5%
hypot-define25.1%
Simplified25.1%
if -9.9999999999999993e-273 < F Initial program 20.5%
Taylor expanded in A around 0 11.2%
mul-1-neg11.2%
+-commutative11.2%
unpow211.2%
unpow211.2%
hypot-define28.2%
Simplified28.2%
neg-sub028.2%
associate-*l/28.2%
pow1/228.2%
pow1/228.3%
pow-prod-down28.3%
Applied egg-rr28.3%
neg-sub028.3%
distribute-neg-frac228.3%
unpow1/228.2%
Simplified28.2%
div-inv28.2%
associate-*r*28.2%
Applied egg-rr28.2%
Final simplification23.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 -3.6e-106)
(- (sqrt (/ (* F (- (* 2.0 (/ A B_m)) 2.0)) B_m)))
(if (<= F 4.5e-281)
(/ (sqrt (* -2.0 (* B_m F))) (- B_m))
(/ (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 (F <= -3.6e-106) {
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= 4.5e-281) {
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
} 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 (F <= -3.6e-106) {
tmp = -Math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= 4.5e-281) {
tmp = Math.sqrt((-2.0 * (B_m * F))) / -B_m;
} 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 F <= -3.6e-106: tmp = -math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m)) elif F <= 4.5e-281: tmp = math.sqrt((-2.0 * (B_m * F))) / -B_m 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 (F <= -3.6e-106) tmp = Float64(-sqrt(Float64(Float64(F * Float64(Float64(2.0 * Float64(A / B_m)) - 2.0)) / B_m))); elseif (F <= 4.5e-281) tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(C, B_m))))) / 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.6e-106)
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
elseif (F <= 4.5e-281)
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
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[F, -3.6e-106], (-N[Sqrt[N[(N[(F * N[(N[(2.0 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), If[LessEqual[F, 4.5e-281], N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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}\;F \leq -3.6 \cdot 10^{-106}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot \frac{A}{B\_m} - 2\right)}{B\_m}}\\
\mathbf{elif}\;F \leq 4.5 \cdot 10^{-281}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\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 F < -3.60000000000000013e-106Initial program 12.8%
Simplified16.3%
Taylor expanded in B around inf 5.1%
sqrt-prod0.6%
*-commutative0.6%
fmm-def0.6%
+-commutative0.6%
metadata-eval0.6%
Applied egg-rr0.6%
Taylor expanded in C around 0 19.7%
if -3.60000000000000013e-106 < F < 4.49999999999999993e-281Initial program 15.9%
Taylor expanded in A around 0 7.7%
mul-1-neg7.7%
+-commutative7.7%
unpow27.7%
unpow27.7%
hypot-define19.9%
Simplified19.9%
neg-sub019.9%
associate-*l/19.9%
pow1/219.9%
pow1/219.9%
pow-prod-down19.9%
Applied egg-rr19.9%
neg-sub019.9%
distribute-neg-frac219.9%
unpow1/219.9%
Simplified19.9%
Taylor expanded in C around 0 18.7%
if 4.49999999999999993e-281 < F Initial program 23.5%
Taylor expanded in A around 0 12.6%
mul-1-neg12.6%
+-commutative12.6%
unpow212.6%
unpow212.6%
hypot-define33.5%
Simplified33.5%
neg-sub033.5%
associate-*l/33.5%
pow1/233.5%
pow1/233.7%
pow-prod-down33.7%
Applied egg-rr33.7%
neg-sub033.7%
distribute-neg-frac233.7%
unpow1/233.5%
Simplified33.5%
div-inv33.5%
associate-*r*33.5%
Applied egg-rr33.5%
add-log-exp33.5%
div-inv33.5%
*-un-lft-identity33.5%
log-prod33.5%
metadata-eval33.5%
rem-log-exp33.5%
associate-*l*33.5%
add-sqr-sqrt12.6%
sqrt-unprod14.6%
sqr-neg14.6%
sqrt-unprod20.9%
add-sqr-sqrt33.5%
Applied egg-rr33.5%
+-lft-identity33.5%
Simplified33.5%
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 -3.6e-106)
(- (sqrt (/ (* F (- (* 2.0 (/ A B_m)) 2.0)) B_m)))
(if (<= F -8.6e-278)
(/ (sqrt (* -2.0 (* B_m F))) (- B_m))
(/ (sqrt (* (/ F C) (- (pow 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 (F <= -3.6e-106) {
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= -8.6e-278) {
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
} else {
tmp = sqrt(((F / C) * -pow(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 (f <= (-3.6d-106)) then
tmp = -sqrt(((f * ((2.0d0 * (a / b_m)) - 2.0d0)) / b_m))
else if (f <= (-8.6d-278)) then
tmp = sqrt(((-2.0d0) * (b_m * f))) / -b_m
else
tmp = sqrt(((f / c) * -(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 (F <= -3.6e-106) {
tmp = -Math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else if (F <= -8.6e-278) {
tmp = Math.sqrt((-2.0 * (B_m * F))) / -B_m;
} else {
tmp = Math.sqrt(((F / C) * -Math.pow(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 F <= -3.6e-106: tmp = -math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m)) elif F <= -8.6e-278: tmp = math.sqrt((-2.0 * (B_m * F))) / -B_m else: tmp = math.sqrt(((F / C) * -math.pow(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 (F <= -3.6e-106) tmp = Float64(-sqrt(Float64(Float64(F * Float64(Float64(2.0 * Float64(A / B_m)) - 2.0)) / B_m))); elseif (F <= -8.6e-278) tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(Float64(F / C) * 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 (F <= -3.6e-106)
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
elseif (F <= -8.6e-278)
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
else
tmp = sqrt(((F / C) * -(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[F, -3.6e-106], (-N[Sqrt[N[(N[(F * N[(N[(2.0 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), If[LessEqual[F, -8.6e-278], N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(N[(F / C), $MachinePrecision] * (-N[Power[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}\;F \leq -3.6 \cdot 10^{-106}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot \frac{A}{B\_m} - 2\right)}{B\_m}}\\
\mathbf{elif}\;F \leq -8.6 \cdot 10^{-278}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{F}{C} \cdot \left(-{B\_m}^{2}\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -3.60000000000000013e-106Initial program 12.8%
Simplified16.3%
Taylor expanded in B around inf 5.1%
sqrt-prod0.6%
*-commutative0.6%
fmm-def0.6%
+-commutative0.6%
metadata-eval0.6%
Applied egg-rr0.6%
Taylor expanded in C around 0 19.7%
if -3.60000000000000013e-106 < F < -8.5999999999999998e-278Initial program 17.7%
Taylor expanded in A around 0 7.3%
mul-1-neg7.3%
+-commutative7.3%
unpow27.3%
unpow27.3%
hypot-define22.4%
Simplified22.4%
neg-sub022.4%
associate-*l/22.4%
pow1/222.4%
pow1/222.4%
pow-prod-down22.4%
Applied egg-rr22.4%
neg-sub022.4%
distribute-neg-frac222.4%
unpow1/222.4%
Simplified22.4%
Taylor expanded in C around 0 20.4%
if -8.5999999999999998e-278 < F Initial program 20.3%
Taylor expanded in A around 0 11.8%
mul-1-neg11.8%
+-commutative11.8%
unpow211.8%
unpow211.8%
hypot-define28.2%
Simplified28.2%
neg-sub028.2%
associate-*l/28.2%
pow1/228.2%
pow1/228.4%
pow-prod-down28.4%
Applied egg-rr28.4%
neg-sub028.4%
distribute-neg-frac228.4%
unpow1/228.2%
Simplified28.2%
Taylor expanded in C around inf 29.6%
mul-1-neg29.6%
associate-/l*29.4%
Simplified29.4%
Final simplification22.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 (if (<= F -3.6e-106) (- (sqrt (/ (* F (- (* 2.0 (/ A B_m)) 2.0)) B_m))) (/ (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 (F <= -3.6e-106) {
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} 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 (F <= -3.6e-106) {
tmp = -Math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} 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 F <= -3.6e-106: tmp = -math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m)) 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 (F <= -3.6e-106) tmp = Float64(-sqrt(Float64(Float64(F * Float64(Float64(2.0 * Float64(A / B_m)) - 2.0)) / B_m))); 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 (F <= -3.6e-106)
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
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[F, -3.6e-106], (-N[Sqrt[N[(N[(F * N[(N[(2.0 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / B$95$m), $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}\;F \leq -3.6 \cdot 10^{-106}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot \frac{A}{B\_m} - 2\right)}{B\_m}}\\
\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 F < -3.60000000000000013e-106Initial program 12.8%
Simplified16.3%
Taylor expanded in B around inf 5.1%
sqrt-prod0.6%
*-commutative0.6%
fmm-def0.6%
+-commutative0.6%
metadata-eval0.6%
Applied egg-rr0.6%
Taylor expanded in C around 0 19.7%
if -3.60000000000000013e-106 < F Initial program 19.1%
Taylor expanded in A around 0 9.7%
mul-1-neg9.7%
+-commutative9.7%
unpow29.7%
unpow29.7%
hypot-define25.5%
Simplified25.5%
neg-sub025.5%
associate-*l/25.5%
pow1/225.5%
pow1/225.6%
pow-prod-down25.6%
Applied egg-rr25.6%
neg-sub025.6%
distribute-neg-frac225.6%
unpow1/225.5%
Simplified25.5%
Final simplification22.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F -3.2e-106) (- (sqrt (/ (* F (- (* 2.0 (/ A B_m)) 2.0)) B_m))) (/ (sqrt (* -2.0 (* B_m F))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -3.2e-106) {
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else {
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= (-3.2d-106)) then
tmp = -sqrt(((f * ((2.0d0 * (a / b_m)) - 2.0d0)) / b_m))
else
tmp = sqrt(((-2.0d0) * (b_m * f))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -3.2e-106) {
tmp = -Math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
} else {
tmp = Math.sqrt((-2.0 * (B_m * F))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= -3.2e-106: tmp = -math.sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m)) else: tmp = math.sqrt((-2.0 * (B_m * F))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= -3.2e-106) tmp = Float64(-sqrt(Float64(Float64(F * Float64(Float64(2.0 * Float64(A / B_m)) - 2.0)) / B_m))); else tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= -3.2e-106)
tmp = -sqrt(((F * ((2.0 * (A / B_m)) - 2.0)) / B_m));
else
tmp = sqrt((-2.0 * (B_m * F))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, -3.2e-106], (-N[Sqrt[N[(N[(F * N[(N[(2.0 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -3.2 \cdot 10^{-106}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot \frac{A}{B\_m} - 2\right)}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -3.2e-106Initial program 12.8%
Simplified16.3%
Taylor expanded in B around inf 5.1%
sqrt-prod0.6%
*-commutative0.6%
fmm-def0.6%
+-commutative0.6%
metadata-eval0.6%
Applied egg-rr0.6%
Taylor expanded in C around 0 19.7%
if -3.2e-106 < F Initial program 19.1%
Taylor expanded in A around 0 9.7%
mul-1-neg9.7%
+-commutative9.7%
unpow29.7%
unpow29.7%
hypot-define25.5%
Simplified25.5%
neg-sub025.5%
associate-*l/25.5%
pow1/225.5%
pow1/225.6%
pow-prod-down25.6%
Applied egg-rr25.6%
neg-sub025.6%
distribute-neg-frac225.6%
unpow1/225.5%
Simplified25.5%
Taylor expanded in C around 0 16.9%
Final simplification18.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 (/ (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) {
return sqrt((-2.0 * (B_m * 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) * (b_m * 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 * (B_m * 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 * (B_m * 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(B_m * F))) / 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 = sqrt((-2.0 * (B_m * 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[(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])\\
\\
\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}
\end{array}
Initial program 15.7%
Taylor expanded in A around 0 8.3%
mul-1-neg8.3%
+-commutative8.3%
unpow28.3%
unpow28.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.2%
Simplified19.2%
Taylor expanded in C around 0 14.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 (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 15.7%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.0%
Simplified2.0%
Taylor expanded in F around 0 2.0%
sqrt-unprod2.0%
pow1/22.1%
Applied egg-rr2.1%
Final simplification2.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 (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 15.7%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.0%
Simplified2.0%
Taylor expanded in F around 0 2.0%
pow12.0%
sqrt-unprod2.0%
Applied egg-rr2.0%
unpow12.0%
associate-*l/2.0%
Simplified2.0%
Final simplification2.0%
herbie shell --seed 2024173
(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))))