
(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 (* C (* A -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2 (* 2.0 (* (- (pow B_m 2.0) t_1) F)))
(t_3 (- t_1 (pow B_m 2.0)))
(t_4
(/
(sqrt (* t_2 (- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/
(* (sqrt (fma (* A C) -8.0 (* 2.0 (* B_m B_m)))) (sqrt (* F (+ A A))))
(- (fma B_m B_m (* (* A C) -4.0))))
(if (<= t_4 -2e-212)
(/
-1.0
(/
t_0
(sqrt
(*
(* t_0 (* 2.0 F))
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))))
(if (<= t_4 INFINITY)
(/ (sqrt (* t_2 (+ A (fma (/ (* B_m B_m) C) -0.5 A)))) t_3)
(* (sqrt 2.0) (* (sqrt (* F (- C (hypot C B_m)))) (/ -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 t_0 = fma(B_m, B_m, (C * (A * -4.0)));
double t_1 = (4.0 * A) * C;
double t_2 = 2.0 * ((pow(B_m, 2.0) - t_1) * F);
double t_3 = t_1 - pow(B_m, 2.0);
double t_4 = sqrt((t_2 * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(fma((A * C), -8.0, (2.0 * (B_m * B_m)))) * sqrt((F * (A + A)))) / -fma(B_m, B_m, ((A * C) * -4.0));
} else if (t_4 <= -2e-212) {
tmp = -1.0 / (t_0 / sqrt(((t_0 * (2.0 * F)) * ((A + C) - sqrt(fma((A - C), (A - C), (B_m * B_m)))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * (A + fma(((B_m * B_m) / C), -0.5, A)))) / t_3;
} else {
tmp = sqrt(2.0) * (sqrt((F * (C - hypot(C, B_m)))) * (-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) t_0 = fma(B_m, B_m, Float64(C * Float64(A * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) t_3 = Float64(t_1 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(t_2 * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(Float64(A * C), -8.0, Float64(2.0 * Float64(B_m * B_m)))) * sqrt(Float64(F * Float64(A + A)))) / Float64(-fma(B_m, B_m, Float64(Float64(A * C) * -4.0)))); elseif (t_4 <= -2e-212) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))))); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_2 * Float64(A + fma(Float64(Float64(B_m * B_m) / C), -0.5, A)))) / t_3); else tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(F * Float64(C - hypot(C, B_m)))) * Float64(-1.0 / 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[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$2 * 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] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * -8.0 + N[(2.0 * N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$4, -2e-212], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$2 * N[(A + N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(C - N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := 2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\\
t_3 := t\_1 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{t\_2 \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -8, 2 \cdot \left(B\_m \cdot B\_m\right)\right)} \cdot \sqrt{F \cdot \left(A + A\right)}}{-\mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-212}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}}}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(A + \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right)\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\sqrt{F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6422.1
Simplified22.1%
Applied egg-rr22.1%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
Applied egg-rr26.3%
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))) < -1.99999999999999991e-212Initial program 99.3%
Applied egg-rr99.5%
if -1.99999999999999991e-212 < (/.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 25.6%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.2
Simplified26.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%
Applied egg-rr0.0%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f641.9
Simplified1.9%
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f6414.4
Applied egg-rr14.4%
Final simplification32.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))))
(if (<= B_m 1.65e+38)
(/ (sqrt (* (+ A A) (* 2.0 (* F t_0)))) (- t_0))
(* (sqrt 2.0) (* (sqrt (* F (- C (hypot C B_m)))) (/ -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 t_0 = fma(B_m, B_m, ((A * C) * -4.0));
double tmp;
if (B_m <= 1.65e+38) {
tmp = sqrt(((A + A) * (2.0 * (F * t_0)))) / -t_0;
} else {
tmp = sqrt(2.0) * (sqrt((F * (C - hypot(C, B_m)))) * (-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) t_0 = fma(B_m, B_m, Float64(Float64(A * C) * -4.0)) tmp = 0.0 if (B_m <= 1.65e+38) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(2.0 * Float64(F * t_0)))) / Float64(-t_0)); else tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(F * Float64(C - hypot(C, B_m)))) * Float64(-1.0 / 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.65e+38], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(C - N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;B\_m \leq 1.65 \cdot 10^{+38}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(2 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\sqrt{F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if B < 1.65e38Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
if 1.65e38 < B Initial program 18.2%
Applied egg-rr18.1%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6423.3
Simplified23.3%
lift-*.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f6446.2
Applied egg-rr46.2%
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
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0))) (t_1 (- t_0)))
(if (<= A -3.2e+142)
(* -2.0 (sqrt (/ (* A F) t_0)))
(if (<= A -1.2e-125)
(/ (sqrt (* -16.0 (* F (* C (* A A))))) t_1)
(if (<= A 8.5e-151)
(- (/ (sqrt (* 2.0 (* F (- C (sqrt (fma B_m B_m (* C C))))))) B_m))
(/ (sqrt (* (+ A A) (* -8.0 (* A (* C F))))) t_1))))))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 = -t_0;
double tmp;
if (A <= -3.2e+142) {
tmp = -2.0 * sqrt(((A * F) / t_0));
} else if (A <= -1.2e-125) {
tmp = sqrt((-16.0 * (F * (C * (A * A))))) / t_1;
} else if (A <= 8.5e-151) {
tmp = -(sqrt((2.0 * (F * (C - sqrt(fma(B_m, B_m, (C * C))))))) / B_m);
} else {
tmp = sqrt(((A + A) * (-8.0 * (A * (C * F))))) / t_1;
}
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(Float64(A * C) * -4.0)) t_1 = Float64(-t_0) tmp = 0.0 if (A <= -3.2e+142) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_0))); elseif (A <= -1.2e-125) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / t_1); elseif (A <= 8.5e-151) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - sqrt(fma(B_m, B_m, Float64(C * C))))))) / B_m)); else tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(-8.0 * Float64(A * Float64(C * F))))) / t_1); 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[A, -3.2e+142], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[A, -1.2e-125], N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[A, 8.5e-151], (-N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\\
t_1 := -t\_0\\
\mathbf{if}\;A \leq -3.2 \cdot 10^{+142}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_0}}\\
\mathbf{elif}\;A \leq -1.2 \cdot 10^{-125}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;A \leq 8.5 \cdot 10^{-151}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)\right)}}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right)}}{t\_1}\\
\end{array}
\end{array}
if A < -3.20000000000000005e142Initial program 7.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.5
Simplified24.5%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6422.5
Simplified22.5%
if -3.20000000000000005e142 < A < -1.2000000000000001e-125Initial program 40.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6437.8
Simplified37.8%
Applied egg-rr37.8%
Taylor expanded in B around 0
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6430.9
Simplified30.9%
if -1.2000000000000001e-125 < A < 8.49999999999999999e-151Initial program 29.1%
Applied egg-rr27.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6424.7
Simplified24.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
frac-timesN/A
neg-mul-1N/A
lower-/.f64N/A
Applied egg-rr24.8%
if 8.49999999999999999e-151 < A Initial program 11.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6410.4
Simplified10.4%
Applied egg-rr10.4%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6410.6
Simplified10.6%
Final simplification20.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0))))
(if (<= B_m 8.6e+37)
(/ (sqrt (* (+ A A) (* 2.0 (* F t_0)))) (- t_0))
(*
(sqrt 2.0)
(* (sqrt (* F (- C (fma 0.5 (/ (* C C) B_m) B_m)))) (/ -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 t_0 = fma(B_m, B_m, ((A * C) * -4.0));
double tmp;
if (B_m <= 8.6e+37) {
tmp = sqrt(((A + A) * (2.0 * (F * t_0)))) / -t_0;
} else {
tmp = sqrt(2.0) * (sqrt((F * (C - fma(0.5, ((C * C) / B_m), B_m)))) * (-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) t_0 = fma(B_m, B_m, Float64(Float64(A * C) * -4.0)) tmp = 0.0 if (B_m <= 8.6e+37) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(2.0 * Float64(F * t_0)))) / Float64(-t_0)); else tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(F * Float64(C - fma(0.5, Float64(Float64(C * C) / B_m), B_m)))) * Float64(-1.0 / 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 8.6e+37], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(C - N[(0.5 * N[(N[(C * C), $MachinePrecision] / B$95$m), $MachinePrecision] + B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;B\_m \leq 8.6 \cdot 10^{+37}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(2 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\sqrt{F \cdot \left(C - \mathsf{fma}\left(0.5, \frac{C \cdot C}{B\_m}, B\_m\right)\right)} \cdot \frac{-1}{B\_m}\right)\\
\end{array}
\end{array}
if B < 8.5999999999999994e37Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
if 8.5999999999999994e37 < B Initial program 18.2%
Applied egg-rr18.1%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6423.3
Simplified23.3%
Taylor expanded in C around 0
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6437.8
Simplified37.8%
Final simplification25.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0))))
(if (<= B_m 7.6e+37)
(/ (sqrt (* (+ A A) (* 2.0 (* F t_0)))) (- t_0))
(*
(sqrt 2.0)
(/ (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, ((A * C) * -4.0));
double tmp;
if (B_m <= 7.6e+37) {
tmp = sqrt(((A + A) * (2.0 * (F * t_0)))) / -t_0;
} else {
tmp = sqrt(2.0) * (sqrt((F * (A - sqrt(fma(A, A, (B_m * 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(Float64(A * C) * -4.0)) tmp = 0.0 if (B_m <= 7.6e+37) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(2.0 * Float64(F * t_0)))) / Float64(-t_0)); else tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 7.6e+37], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}
t_0 := \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;B\_m \leq 7.6 \cdot 10^{+37}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(2 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 7.59999999999999979e37Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
if 7.59999999999999979e37 < B Initial program 18.2%
Applied egg-rr18.1%
Taylor expanded in C around 0
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6424.2
Simplified24.2%
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
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0))))
(if (<= B_m 5.1e+38)
(/ (sqrt (* (+ A A) (* 2.0 (* F t_0)))) (- t_0))
(*
(sqrt (* F (- A (sqrt (fma B_m B_m (* A 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 (B_m <= 5.1e+38) {
tmp = sqrt(((A + A) * (2.0 * (F * t_0)))) / -t_0;
} else {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * 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(Float64(A * C) * -4.0)) tmp = 0.0 if (B_m <= 5.1e+38) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(2.0 * Float64(F * t_0)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5.1e+38], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $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, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;B\_m \leq 5.1 \cdot 10^{+38}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(2 \cdot \left(F \cdot t\_0\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\end{array}
\end{array}
if B < 5.1000000000000001e38Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
if 5.1000000000000001e38 < B Initial program 18.2%
Taylor expanded in C around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Simplified24.2%
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
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0)))
(t_1 (/ (sqrt (* -16.0 (* F (* C (* A A))))) (- t_0))))
(if (<= A -5.8e+142)
(* -2.0 (sqrt (/ (* A F) t_0)))
(if (<= A -4.6e-126)
t_1
(if (<= A 1.1e-150)
(- (/ (sqrt (* 2.0 (* F (- C (sqrt (fma B_m B_m (* C C))))))) B_m))
t_1)))))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 = sqrt((-16.0 * (F * (C * (A * A))))) / -t_0;
double tmp;
if (A <= -5.8e+142) {
tmp = -2.0 * sqrt(((A * F) / t_0));
} else if (A <= -4.6e-126) {
tmp = t_1;
} else if (A <= 1.1e-150) {
tmp = -(sqrt((2.0 * (F * (C - sqrt(fma(B_m, B_m, (C * C))))))) / B_m);
} else {
tmp = t_1;
}
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(Float64(A * C) * -4.0)) t_1 = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / Float64(-t_0)) tmp = 0.0 if (A <= -5.8e+142) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_0))); elseif (A <= -4.6e-126) tmp = t_1; elseif (A <= 1.1e-150) tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - sqrt(fma(B_m, B_m, Float64(C * C))))))) / B_m)); else tmp = t_1; 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, If[LessEqual[A, -5.8e+142], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[A, -4.6e-126], t$95$1, If[LessEqual[A, 1.1e-150], (-N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), t$95$1]]]]]
\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, \left(A \cdot C\right) \cdot -4\right)\\
t_1 := \frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{-t\_0}\\
\mathbf{if}\;A \leq -5.8 \cdot 10^{+142}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_0}}\\
\mathbf{elif}\;A \leq -4.6 \cdot 10^{-126}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;A \leq 1.1 \cdot 10^{-150}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)\right)}}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if A < -5.80000000000000027e142Initial program 7.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.5
Simplified24.5%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6422.5
Simplified22.5%
if -5.80000000000000027e142 < A < -4.60000000000000021e-126 or 1.1e-150 < A Initial program 23.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.2
Simplified21.2%
Applied egg-rr21.2%
Taylor expanded in B around 0
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6417.7
Simplified17.7%
if -4.60000000000000021e-126 < A < 1.1e-150Initial program 28.0%
Applied egg-rr26.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6425.1
Simplified25.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
frac-timesN/A
neg-mul-1N/A
lower-/.f64N/A
Applied egg-rr25.2%
Final simplification20.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
(let* ((t_0 (fma B_m B_m (* (* A C) -4.0))))
(if (<= B_m 6.8e+37)
(/ (* 2.0 (sqrt (* t_0 (* A F)))) (- t_0))
(*
(sqrt (* F (- A (sqrt (fma B_m B_m (* A 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 (B_m <= 6.8e+37) {
tmp = (2.0 * sqrt((t_0 * (A * F)))) / -t_0;
} else {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * 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(Float64(A * C) * -4.0)) tmp = 0.0 if (B_m <= 6.8e+37) tmp = Float64(Float64(2.0 * sqrt(Float64(t_0 * Float64(A * F)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / 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[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 6.8e+37], N[(N[(2.0 * N[Sqrt[N[(t$95$0 * N[(A * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $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, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;B\_m \leq 6.8 \cdot 10^{+37}:\\
\;\;\;\;\frac{2 \cdot \sqrt{t\_0 \cdot \left(A \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\end{array}
\end{array}
if B < 6.80000000000000011e37Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6420.4
Simplified20.4%
if 6.80000000000000011e37 < B Initial program 18.2%
Taylor expanded in C around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Simplified24.2%
Final simplification21.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 (<= B_m 6.8e+37)
(/
(sqrt (* (+ A A) (* 2.0 (* F (fma B_m B_m (* (* A C) -4.0))))))
(* 4.0 (* A C)))
(* (sqrt (* F (- A (sqrt (fma B_m B_m (* A 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.8e+37) {
tmp = sqrt(((A + A) * (2.0 * (F * fma(B_m, B_m, ((A * C) * -4.0)))))) / (4.0 * (A * C));
} else {
tmp = sqrt((F * (A - sqrt(fma(B_m, B_m, (A * 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 <= 6.8e+37) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(Float64(A * C) * -4.0)))))) / Float64(4.0 * Float64(A * C))); else tmp = Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B_m, B_m, Float64(A * A)))))) * Float64(-Float64(sqrt(2.0) / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 6.8e+37], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B$95$m * B$95$m + N[(A * A), $MachinePrecision]), $MachinePrecision]], $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.8 \cdot 10^{+37}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B\_m, B\_m, A \cdot A\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B\_m}\right)\\
\end{array}
\end{array}
if B < 6.80000000000000011e37Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6418.4
Simplified18.4%
if 6.80000000000000011e37 < B Initial program 18.2%
Taylor expanded in C around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Simplified24.2%
Final simplification19.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 (<= B_m 1.8e+38)
(/
(sqrt (* (+ A A) (* 2.0 (* F (fma B_m B_m (* (* A C) -4.0))))))
(* 4.0 (* A C)))
(- (/ (sqrt (* 2.0 (* F (- C (sqrt (fma B_m B_m (* C 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 (B_m <= 1.8e+38) {
tmp = sqrt(((A + A) * (2.0 * (F * fma(B_m, B_m, ((A * C) * -4.0)))))) / (4.0 * (A * C));
} else {
tmp = -(sqrt((2.0 * (F * (C - sqrt(fma(B_m, B_m, (C * 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 (B_m <= 1.8e+38) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(Float64(A * C) * -4.0)))))) / Float64(4.0 * Float64(A * C))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - sqrt(fma(B_m, B_m, Float64(C * C))))))) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.8e+38], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $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 1.8 \cdot 10^{+38}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)\right)}}{B\_m}\\
\end{array}
\end{array}
if B < 1.79999999999999985e38Initial program 23.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.3
Simplified21.3%
Applied egg-rr21.3%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6418.4
Simplified18.4%
if 1.79999999999999985e38 < B Initial program 18.2%
Applied egg-rr18.1%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6423.3
Simplified23.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
frac-timesN/A
neg-mul-1N/A
lower-/.f64N/A
Applied egg-rr23.4%
Final simplification19.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 (<= A -1.2e-99) (* -2.0 (sqrt (/ (* A F) (fma B_m B_m (* (* A C) -4.0))))) (- (/ (sqrt (* 2.0 (* F (- C (sqrt (fma B_m B_m (* C 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 (A <= -1.2e-99) {
tmp = -2.0 * sqrt(((A * F) / fma(B_m, B_m, ((A * C) * -4.0))));
} else {
tmp = -(sqrt((2.0 * (F * (C - sqrt(fma(B_m, B_m, (C * 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 (A <= -1.2e-99) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - sqrt(fma(B_m, B_m, Float64(C * C))))))) / 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[A, -1.2e-99], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $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}\;A \leq -1.2 \cdot 10^{-99}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)}}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)\right)}}{B\_m}\\
\end{array}
\end{array}
if A < -1.2e-99Initial program 29.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6433.7
Simplified33.7%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6424.3
Simplified24.3%
if -1.2e-99 < A Initial program 18.4%
Applied egg-rr17.8%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6414.3
Simplified14.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
frac-timesN/A
neg-mul-1N/A
lower-/.f64N/A
Applied egg-rr14.3%
Final simplification18.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 (* -2.0 (sqrt (/ (* A F) (fma B_m B_m (* (* A C) -4.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) {
return -2.0 * sqrt(((A * F) / fma(B_m, B_m, ((A * C) * -4.0))));
}
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 * sqrt(Float64(Float64(A * F) / fma(B_m, B_m, Float64(Float64(A * C) * -4.0))))) 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[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(B$95$m * B$95$m + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(B\_m, B\_m, \left(A \cdot C\right) \cdot -4\right)}}
\end{array}
Initial program 22.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6418.2
Simplified18.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6410.8
Simplified10.8%
Final simplification10.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* -2.0 (/ (sqrt (* A F)) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -2.0 * (sqrt((A * 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 = (-2.0d0) * (sqrt((a * 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 -2.0 * (Math.sqrt((A * 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 -2.0 * (math.sqrt((A * 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(-2.0 * Float64(sqrt(Float64(A * 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 = -2.0 * (sqrt((A * 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[(-2.0 * N[(N[Sqrt[N[(A * F), $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])\\
\\
-2 \cdot \frac{\sqrt{A \cdot F}}{B\_m}
\end{array}
Initial program 22.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6418.2
Simplified18.2%
Applied egg-rr18.2%
Taylor expanded in B around inf
associate-*r/N/A
*-rgt-identityN/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f642.8
Simplified2.8%
Final simplification2.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (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 22.3%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f642.1
Simplified2.1%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lift-sqrt.f64N/A
lift-*.f64N/A
mul-1-negN/A
remove-double-negN/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f642.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 (* F (/ 2.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(F * Float64(2.0 / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(F * N[(2.0 / 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{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 22.3%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f642.1
Simplified2.1%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lift-sqrt.f64N/A
lift-*.f64N/A
mul-1-negN/A
remove-double-negN/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f642.1
Applied egg-rr2.1%
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f642.0
Applied egg-rr2.0%
herbie shell --seed 2024207
(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))))