
(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 13 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 (* C (* A 4.0)))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2
(/
(sqrt
(*
(* (* t_1 F) 2.0)
(- (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))))
t_1)))
(if (<= t_2 (- INFINITY))
(*
(sqrt
(*
(/ (- (+ C A) (hypot (- A C) B_m)) (fma (* -4.0 A) C (* B_m B_m)))
F))
(- (sqrt 2.0)))
(if (<= t_2 -1e-201)
t_2
(if (<= t_2 INFINITY)
(/
(sqrt
(*
(+ (fma (/ (* B_m B_m) C) -0.5 A) A)
(* (* F (- (pow B_m 2.0) t_0)) 2.0)))
t_1)
(*
(sqrt (* (- A (hypot B_m A)) F))
(/ -1.0 (/ 1.0 (/ (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 = C * (A * 4.0);
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = sqrt((((t_1 * F) * 2.0) * (sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) - (C + A)))) / t_1;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt(((((C + A) - hypot((A - C), B_m)) / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
} else if (t_2 <= -1e-201) {
tmp = t_2;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / C), -0.5, A) + A) * ((F * (pow(B_m, 2.0) - t_0)) * 2.0))) / t_1;
} else {
tmp = sqrt(((A - hypot(B_m, A)) * F)) * (-1.0 / (1.0 / (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 = Float64(C * Float64(A * 4.0)) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(Float64(t_1 * F) * 2.0) * Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) - Float64(C + A)))) / t_1) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0))); elseif (t_2 <= -1e-201) tmp = t_2; elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0))) / t_1); else tmp = Float64(sqrt(Float64(Float64(A - hypot(B_m, A)) * F)) * Float64(-1.0 / Float64(1.0 / 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(t$95$1 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(C + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -1e-201], t$95$2, If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(\left(t\_1 \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} - \left(C + A\right)\right)}}{t\_1}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F} \cdot \frac{-1}{\frac{1}{\frac{\sqrt{2}}{B\_m}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites64.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))) < -9.99999999999999946e-202Initial program 97.3%
if -9.99999999999999946e-202 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 19.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.4
Applied rewrites30.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6420.1
Applied rewrites20.1%
Applied rewrites20.1%
Applied rewrites20.1%
Final simplification41.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 (* C (* A 4.0)))
(t_1 (- t_0 (pow B_m 2.0)))
(t_2
(/
(sqrt
(*
(* (* t_1 F) 2.0)
(- (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))))
t_1))
(t_3 (- (+ C A) (hypot (- A C) B_m)))
(t_4 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_2 (- INFINITY))
(* (sqrt (* (/ t_3 (fma (* -4.0 A) C (* B_m B_m))) F)) (- (sqrt 2.0)))
(if (<= t_2 -1e-201)
(/ (sqrt (* (* (* t_4 F) 2.0) t_3)) (- t_4))
(if (<= t_2 INFINITY)
(/
(sqrt
(*
(+ (fma (/ (* B_m B_m) C) -0.5 A) A)
(* (* F (- (pow B_m 2.0) t_0)) 2.0)))
t_1)
(*
(sqrt (* (- A (hypot B_m A)) F))
(/ -1.0 (/ 1.0 (/ (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 = C * (A * 4.0);
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = sqrt((((t_1 * F) * 2.0) * (sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) - (C + A)))) / t_1;
double t_3 = (C + A) - hypot((A - C), B_m);
double t_4 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt(((t_3 / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
} else if (t_2 <= -1e-201) {
tmp = sqrt((((t_4 * F) * 2.0) * t_3)) / -t_4;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / C), -0.5, A) + A) * ((F * (pow(B_m, 2.0) - t_0)) * 2.0))) / t_1;
} else {
tmp = sqrt(((A - hypot(B_m, A)) * F)) * (-1.0 / (1.0 / (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 = Float64(C * Float64(A * 4.0)) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(Float64(t_1 * F) * 2.0) * Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) - Float64(C + A)))) / t_1) t_3 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) t_4 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(t_3 / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0))); elseif (t_2 <= -1e-201) tmp = Float64(sqrt(Float64(Float64(Float64(t_4 * F) * 2.0) * t_3)) / Float64(-t_4)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0))) / t_1); else tmp = Float64(sqrt(Float64(Float64(A - hypot(B_m, A)) * F)) * Float64(-1.0 / Float64(1.0 / 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(t$95$1 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(C + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(N[(t$95$3 / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -1e-201], N[(N[Sqrt[N[(N[(N[(t$95$4 * F), $MachinePrecision] * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(\left(t\_1 \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} - \left(C + A\right)\right)}}{t\_1}\\
t_3 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\
t_4 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{t\_3}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_4 \cdot F\right) \cdot 2\right) \cdot t\_3}}{-t\_4}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F} \cdot \frac{-1}{\frac{1}{\frac{\sqrt{2}}{B\_m}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites64.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))) < -9.99999999999999946e-202Initial program 97.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites97.2%
Applied rewrites97.3%
if -9.99999999999999946e-202 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 19.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.4
Applied rewrites30.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6420.1
Applied rewrites20.1%
Applied rewrites20.1%
Applied rewrites20.1%
Final simplification41.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 (- (* C (* A 4.0)) (pow B_m 2.0)))
(t_1
(/
(sqrt
(*
(* (* t_0 F) 2.0)
(- (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))))
t_0))
(t_2 (- (+ C A) (hypot (- A C) B_m)))
(t_3 (fma (* C A) -4.0 (* B_m B_m)))
(t_4 (* t_3 F)))
(if (<= t_1 (- INFINITY))
(* (sqrt (* (/ t_2 (fma (* -4.0 A) C (* B_m B_m))) F)) (- (sqrt 2.0)))
(if (<= t_1 -1e-201)
(/ (sqrt (* (* t_4 2.0) t_2)) (- t_3))
(if (<= t_1 INFINITY)
(/
(* (sqrt (* (+ (+ (* -0.5 (/ (* B_m B_m) C)) A) A) t_4)) (sqrt 2.0))
t_0)
(*
(sqrt (* (- A (hypot B_m A)) F))
(/ -1.0 (/ 1.0 (/ (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 = (C * (A * 4.0)) - pow(B_m, 2.0);
double t_1 = sqrt((((t_0 * F) * 2.0) * (sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) - (C + A)))) / t_0;
double t_2 = (C + A) - hypot((A - C), B_m);
double t_3 = fma((C * A), -4.0, (B_m * B_m));
double t_4 = t_3 * F;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = sqrt(((t_2 / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
} else if (t_1 <= -1e-201) {
tmp = sqrt(((t_4 * 2.0) * t_2)) / -t_3;
} else if (t_1 <= ((double) INFINITY)) {
tmp = (sqrt(((((-0.5 * ((B_m * B_m) / C)) + A) + A) * t_4)) * sqrt(2.0)) / t_0;
} else {
tmp = sqrt(((A - hypot(B_m, A)) * F)) * (-1.0 / (1.0 / (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 = Float64(Float64(C * Float64(A * 4.0)) - (B_m ^ 2.0)) t_1 = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) - Float64(C + A)))) / t_0) t_2 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) t_3 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_4 = Float64(t_3 * F) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(t_2 / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0))); elseif (t_1 <= -1e-201) tmp = Float64(sqrt(Float64(Float64(t_4 * 2.0) * t_2)) / Float64(-t_3)); elseif (t_1 <= Inf) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / C)) + A) + A) * t_4)) * sqrt(2.0)) / t_0); else tmp = Float64(sqrt(Float64(Float64(A - hypot(B_m, A)) * F)) * Float64(-1.0 / Float64(1.0 / 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[(N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(C + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * F), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Sqrt[N[(N[(t$95$2 / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$1, -1e-201], N[(N[Sqrt[N[(N[(t$95$4 * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right) - {B\_m}^{2}\\
t_1 := \frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} - \left(C + A\right)\right)}}{t\_0}\\
t_2 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\
t_3 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_4 := t\_3 \cdot F\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{t\_2}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{\left(t\_4 \cdot 2\right) \cdot t\_2}}{-t\_3}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\left(-0.5 \cdot \frac{B\_m \cdot B\_m}{C} + A\right) + A\right) \cdot t\_4} \cdot \sqrt{2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F} \cdot \frac{-1}{\frac{1}{\frac{\sqrt{2}}{B\_m}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites64.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))) < -9.99999999999999946e-202Initial program 97.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites97.2%
Applied rewrites97.3%
if -9.99999999999999946e-202 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 19.0%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.5
Applied rewrites25.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
sqrt-prodN/A
Applied rewrites25.5%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6430.2
Applied rewrites30.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6420.1
Applied rewrites20.1%
Applied rewrites20.1%
Applied rewrites20.1%
Final simplification41.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 (- (* C (* A 4.0)) (pow B_m 2.0)))
(t_1
(/
(sqrt
(*
(* (* t_0 F) 2.0)
(- (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))))
t_0))
(t_2 (- (+ C A) (hypot (- A C) B_m)))
(t_3 (fma (* C A) -4.0 (* B_m B_m)))
(t_4 (* t_3 F)))
(if (<= t_1 (- INFINITY))
(* (sqrt (* (/ t_2 (fma (* -4.0 A) C (* B_m B_m))) F)) (- (sqrt 2.0)))
(if (<= t_1 -1e-201)
(/ (sqrt (* (* t_4 2.0) t_2)) (- t_3))
(if (<= t_1 INFINITY)
(/ (* (sqrt (* (+ A A) t_4)) (sqrt 2.0)) t_0)
(*
(sqrt (* (- A (hypot B_m A)) F))
(/ -1.0 (/ 1.0 (/ (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 = (C * (A * 4.0)) - pow(B_m, 2.0);
double t_1 = sqrt((((t_0 * F) * 2.0) * (sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) - (C + A)))) / t_0;
double t_2 = (C + A) - hypot((A - C), B_m);
double t_3 = fma((C * A), -4.0, (B_m * B_m));
double t_4 = t_3 * F;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = sqrt(((t_2 / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
} else if (t_1 <= -1e-201) {
tmp = sqrt(((t_4 * 2.0) * t_2)) / -t_3;
} else if (t_1 <= ((double) INFINITY)) {
tmp = (sqrt(((A + A) * t_4)) * sqrt(2.0)) / t_0;
} else {
tmp = sqrt(((A - hypot(B_m, A)) * F)) * (-1.0 / (1.0 / (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 = Float64(Float64(C * Float64(A * 4.0)) - (B_m ^ 2.0)) t_1 = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) - Float64(C + A)))) / t_0) t_2 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) t_3 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_4 = Float64(t_3 * F) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(t_2 / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0))); elseif (t_1 <= -1e-201) tmp = Float64(sqrt(Float64(Float64(t_4 * 2.0) * t_2)) / Float64(-t_3)); elseif (t_1 <= Inf) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * t_4)) * sqrt(2.0)) / t_0); else tmp = Float64(sqrt(Float64(Float64(A - hypot(B_m, A)) * F)) * Float64(-1.0 / Float64(1.0 / 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[(N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(C + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * F), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Sqrt[N[(N[(t$95$2 / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$1, -1e-201], N[(N[Sqrt[N[(N[(t$95$4 * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right) - {B\_m}^{2}\\
t_1 := \frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} - \left(C + A\right)\right)}}{t\_0}\\
t_2 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\
t_3 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_4 := t\_3 \cdot F\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{t\_2}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{\left(t\_4 \cdot 2\right) \cdot t\_2}}{-t\_3}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_4} \cdot \sqrt{2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F} \cdot \frac{-1}{\frac{1}{\frac{\sqrt{2}}{B\_m}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites64.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))) < -9.99999999999999946e-202Initial program 97.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites97.2%
Applied rewrites97.3%
if -9.99999999999999946e-202 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 19.0%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.5
Applied rewrites25.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
sqrt-prodN/A
Applied rewrites25.5%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6426.8
Applied rewrites26.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 C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6420.1
Applied rewrites20.1%
Applied rewrites20.1%
Applied rewrites20.1%
Final simplification40.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (* C (* A 4.0)) (pow B_m 2.0)))
(t_1
(/
(sqrt
(*
(* (* t_0 F) 2.0)
(- (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))))
t_0))
(t_2 (- (+ C A) (hypot (- A C) B_m)))
(t_3 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_1 (- INFINITY))
(* (sqrt (* (/ t_2 (fma (* -4.0 A) C (* B_m B_m))) F)) (- (sqrt 2.0)))
(if (<= t_1 -1e-201)
(/ (sqrt (* (* (* t_3 F) 2.0) t_2)) (- t_3))
(if (<= t_1 INFINITY)
(/ (sqrt (* (+ A A) (* (* (* C A) F) -8.0))) t_0)
(*
(sqrt (* (- A (hypot B_m A)) F))
(/ -1.0 (/ 1.0 (/ (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 = (C * (A * 4.0)) - pow(B_m, 2.0);
double t_1 = sqrt((((t_0 * F) * 2.0) * (sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) - (C + A)))) / t_0;
double t_2 = (C + A) - hypot((A - C), B_m);
double t_3 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = sqrt(((t_2 / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
} else if (t_1 <= -1e-201) {
tmp = sqrt((((t_3 * F) * 2.0) * t_2)) / -t_3;
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt(((A + A) * (((C * A) * F) * -8.0))) / t_0;
} else {
tmp = sqrt(((A - hypot(B_m, A)) * F)) * (-1.0 / (1.0 / (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 = Float64(Float64(C * Float64(A * 4.0)) - (B_m ^ 2.0)) t_1 = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) - Float64(C + A)))) / t_0) t_2 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) t_3 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(t_2 / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0))); elseif (t_1 <= -1e-201) tmp = Float64(sqrt(Float64(Float64(Float64(t_3 * F) * 2.0) * t_2)) / Float64(-t_3)); elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(Float64(Float64(C * A) * F) * -8.0))) / t_0); else tmp = Float64(sqrt(Float64(Float64(A - hypot(B_m, A)) * F)) * Float64(-1.0 / Float64(1.0 / 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[(N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(C + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Sqrt[N[(N[(t$95$2 / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$1, -1e-201], N[(N[Sqrt[N[(N[(N[(t$95$3 * F), $MachinePrecision] * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(N[(C * A), $MachinePrecision] * F), $MachinePrecision] * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right) - {B\_m}^{2}\\
t_1 := \frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} - \left(C + A\right)\right)}}{t\_0}\\
t_2 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\
t_3 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{t\_2}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_3 \cdot F\right) \cdot 2\right) \cdot t\_2}}{-t\_3}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\left(\left(C \cdot A\right) \cdot F\right) \cdot -8\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F} \cdot \frac{-1}{\frac{1}{\frac{\sqrt{2}}{B\_m}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites64.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))) < -9.99999999999999946e-202Initial program 97.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites97.2%
Applied rewrites97.3%
if -9.99999999999999946e-202 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 19.0%
lift--.f64N/A
sub-negN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
div-invN/A
lower-fma.f64N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-neg.f6419.8
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
Applied rewrites19.8%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
lower-neg.f6427.3
Applied rewrites27.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))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6420.1
Applied rewrites20.1%
Applied rewrites20.1%
Applied rewrites20.1%
Final simplification40.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0))))
(if (<= (pow B_m 2.0) 2e-114)
(/
(sqrt (* (+ A A) (* (* (* C A) F) -8.0)))
(- (* C (* A 4.0)) (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+280)
(*
(sqrt
(*
(/ (- (+ C A) (hypot (- A C) B_m)) (fma (* -4.0 A) C (* B_m B_m)))
F))
t_0)
(* (/ t_0 B_m) (sqrt (* (- A (hypot B_m A)) 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 t_0 = -sqrt(2.0);
double tmp;
if (pow(B_m, 2.0) <= 2e-114) {
tmp = sqrt(((A + A) * (((C * A) * F) * -8.0))) / ((C * (A * 4.0)) - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+280) {
tmp = sqrt(((((C + A) - hypot((A - C), B_m)) / fma((-4.0 * A), C, (B_m * B_m))) * F)) * t_0;
} else {
tmp = (t_0 / B_m) * sqrt(((A - hypot(B_m, A)) * 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) t_0 = Float64(-sqrt(2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-114) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(Float64(Float64(C * A) * F) * -8.0))) / Float64(Float64(C * Float64(A * 4.0)) - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+280) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * t_0); else tmp = Float64(Float64(t_0 / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * F))); 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[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-114], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(N[(C * A), $MachinePrecision] * F), $MachinePrecision] * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+280], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(t$95$0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $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 := -\sqrt{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-114}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\left(\left(C \cdot A\right) \cdot F\right) \cdot -8\right)}}{C \cdot \left(A \cdot 4\right) - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+280}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-114Initial program 20.4%
lift--.f64N/A
sub-negN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
div-invN/A
lower-fma.f64N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-neg.f6420.6
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
Applied rewrites20.9%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6420.3
Applied rewrites20.3%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
lower-neg.f6424.7
Applied rewrites24.7%
if 2.0000000000000001e-114 < (pow.f64 B #s(literal 2 binary64)) < 1e280Initial program 30.9%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites52.1%
if 1e280 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.2%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6430.7
Applied rewrites30.7%
Final simplification34.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 (<= (pow B_m 2.0) 100000.0)
(/
(sqrt (* (+ A A) (* (* (* C A) F) -8.0)))
(- (* C (* A 4.0)) (pow B_m 2.0)))
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* (- A (hypot B_m A)) 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 (pow(B_m, 2.0) <= 100000.0) {
tmp = sqrt(((A + A) * (((C * A) * F) * -8.0))) / ((C * (A * 4.0)) - pow(B_m, 2.0));
} else {
tmp = (-sqrt(2.0) / B_m) * sqrt(((A - hypot(B_m, A)) * 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 (Math.pow(B_m, 2.0) <= 100000.0) {
tmp = Math.sqrt(((A + A) * (((C * A) * F) * -8.0))) / ((C * (A * 4.0)) - Math.pow(B_m, 2.0));
} else {
tmp = (-Math.sqrt(2.0) / B_m) * Math.sqrt(((A - Math.hypot(B_m, A)) * 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 math.pow(B_m, 2.0) <= 100000.0: tmp = math.sqrt(((A + A) * (((C * A) * F) * -8.0))) / ((C * (A * 4.0)) - math.pow(B_m, 2.0)) else: tmp = (-math.sqrt(2.0) / B_m) * math.sqrt(((A - math.hypot(B_m, A)) * 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 ((B_m ^ 2.0) <= 100000.0) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(Float64(Float64(C * A) * F) * -8.0))) / Float64(Float64(C * Float64(A * 4.0)) - (B_m ^ 2.0))); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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 ((B_m ^ 2.0) <= 100000.0)
tmp = sqrt(((A + A) * (((C * A) * F) * -8.0))) / ((C * (A * 4.0)) - (B_m ^ 2.0));
else
tmp = (-sqrt(2.0) / B_m) * sqrt(((A - hypot(B_m, A)) * 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[N[Power[B$95$m, 2.0], $MachinePrecision], 100000.0], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(N[(C * A), $MachinePrecision] * F), $MachinePrecision] * -8.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $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}\;{B\_m}^{2} \leq 100000:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\left(\left(C \cdot A\right) \cdot F\right) \cdot -8\right)}}{C \cdot \left(A \cdot 4\right) - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e5Initial program 24.2%
lift--.f64N/A
sub-negN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
div-invN/A
lower-fma.f64N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-neg.f6424.5
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
Applied rewrites24.8%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6419.2
Applied rewrites19.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
lower-neg.f6423.4
Applied rewrites23.4%
if 1e5 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.8%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6428.6
Applied rewrites28.6%
Final simplification25.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 (* (/ (- (sqrt 2.0)) B_m) (sqrt (* (- A (hypot B_m A)) 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) {
return (-sqrt(2.0) / B_m) * sqrt(((A - hypot(B_m, A)) * F));
}
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) * Math.sqrt(((A - Math.hypot(B_m, A)) * F));
}
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) * math.sqrt(((A - math.hypot(B_m, A)) * F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * F))) 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) * sqrt(((A - hypot(B_m, A)) * F));
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[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F}
\end{array}
Initial program 17.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.1
Applied rewrites17.1%
Final simplification17.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 (* (* (- A (hypot A B_m)) F) 2.0)) (- B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((((A - hypot(A, B_m)) * F) * 2.0)) / -B_m;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((((A - Math.hypot(A, B_m)) * F) * 2.0)) / -B_m;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((((A - math.hypot(A, B_m)) * F) * 2.0)) / -B_m
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 2.0)) / 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((((A - hypot(A, B_m)) * F) * 2.0)) / -B_m;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $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{\left(\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F\right) \cdot 2}}{-B\_m}
\end{array}
Initial program 17.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.1
Applied rewrites17.1%
Applied rewrites16.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 (* (- B_m) F)) (/ -1.0 (/ B_m (sqrt 2.0)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((-B_m * F)) * (-1.0 / (B_m / sqrt(2.0)));
}
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((-b_m * f)) * ((-1.0d0) / (b_m / sqrt(2.0d0)))
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((-B_m * F)) * (-1.0 / (B_m / Math.sqrt(2.0)));
}
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((-B_m * F)) * (-1.0 / (B_m / math.sqrt(2.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(sqrt(Float64(Float64(-B_m) * F)) * Float64(-1.0 / Float64(B_m / sqrt(2.0)))) 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((-B_m * F)) * (-1.0 / (B_m / sqrt(2.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[(N[Sqrt[N[((-B$95$m) * F), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\left(-B\_m\right) \cdot F} \cdot \frac{-1}{\frac{B\_m}{\sqrt{2}}}
\end{array}
Initial program 17.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.1
Applied rewrites17.1%
Applied rewrites17.1%
Taylor expanded in B around inf
Applied rewrites15.6%
Final simplification15.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* (* F B_m) -2.0)) (- B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F * B_m) * -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 * b_m) * (-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 * B_m) * -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 * B_m) * -2.0)) / -B_m
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(F * B_m) * -2.0)) / 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(((F * B_m) * -2.0)) / -B_m;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(F * B$95$m), $MachinePrecision] * -2.0), $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{\left(F \cdot B\_m\right) \cdot -2}}{-B\_m}
\end{array}
Initial program 17.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.1
Applied rewrites17.1%
Applied rewrites16.8%
Taylor expanded in B around inf
Applied rewrites15.3%
Final simplification15.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (/ -2.0 B_m) (sqrt (* F A))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return (-2.0 / B_m) * sqrt((F * A));
}
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) / b_m) * sqrt((f * a))
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 / B_m) * Math.sqrt((F * A));
}
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 / B_m) * math.sqrt((F * A))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-2.0 / B_m) * sqrt(Float64(F * A))) 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 / B_m) * sqrt((F * A));
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[(-2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-2}{B\_m} \cdot \sqrt{F \cdot A}
\end{array}
Initial program 17.9%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.1
Applied rewrites17.1%
Taylor expanded in A around -inf
Applied rewrites2.6%
Final simplification2.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 (sqrt (* (/ F B_m) 2.0)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F / B_m) * 2.0));
}
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 / b_m) * 2.0d0))
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 / B_m) * 2.0));
}
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 / B_m) * 2.0))
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(F / B_m) * 2.0)) 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 / B_m) * 2.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[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{F}{B\_m} \cdot 2}
\end{array}
Initial program 17.9%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
herbie shell --seed 2024264
(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))))