
(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 18 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
(*
(+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_0)) 2.0)))
t_1))
(t_3 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_2 -1e-198)
(/
(*
(* (sqrt F) (sqrt (+ (+ C A) (hypot (- A C) B_m))))
(sqrt (* (fma -4.0 (* C A) (* B_m B_m)) 2.0)))
t_1)
(if (<= t_2 INFINITY)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_3 2.0) F)))
(- t_3))
(/ (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (sqrt F)) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = t_0 - pow(B_m, 2.0);
double t_2 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_0)) * 2.0))) / t_1;
double t_3 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_2 <= -1e-198) {
tmp = ((sqrt(F) * sqrt(((C + A) + hypot((A - C), B_m)))) * sqrt((fma(-4.0, (C * A), (B_m * B_m)) * 2.0))) / t_1;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_3 * 2.0) * F))) / -t_3;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = Float64(t_0 - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0))) / t_1) t_3 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_2 <= -1e-198) tmp = Float64(Float64(Float64(sqrt(F) * sqrt(Float64(Float64(C + A) + hypot(Float64(A - C), B_m)))) * sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0))) / t_1); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * Float64(Float64(t_3 * 2.0) * F))) / Float64(-t_3)); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $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[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $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]}, Block[{t$95$3 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e-198], N[(N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$3 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := t\_0 - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_1}\\
t_3 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{-198}:\\
\;\;\;\;\frac{\left(\sqrt{F} \cdot \sqrt{\left(C + A\right) + \mathsf{hypot}\left(A - C, B\_m\right)}\right) \cdot \sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2}}{t\_1}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot \left(\left(t\_3 \cdot 2\right) \cdot F\right)}}{-t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-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))) < -9.9999999999999991e-199Initial program 47.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites72.5%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites77.5%
if -9.9999999999999991e-199 < (/.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.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites8.6%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6418.7
Applied rewrites18.7%
Applied rewrites36.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in A around 0
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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.4
Applied rewrites17.4%
Applied rewrites24.2%
Applied rewrites24.2%
Final simplification44.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 (* C A) -4.0 (* B_m B_m)))
(t_1 (* t_0 2.0))
(t_2 (+ (fma (/ (* B_m B_m) A) -0.5 C) C))
(t_3 (* C (* A 4.0)))
(t_4
(/
(sqrt
(*
(+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_3)) 2.0)))
(- t_3 (pow B_m 2.0))))
(t_5 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_4 (- INFINITY))
(* (- (sqrt t_1)) (/ (sqrt (* t_2 F)) t_0))
(if (<= t_4 -1e-198)
(/ (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) (* (* F 2.0) t_5))) (- t_5))
(if (<= t_4 INFINITY)
(/ (sqrt (* t_2 (* t_1 F))) (- t_0))
(/ (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (sqrt F)) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = t_0 * 2.0;
double t_2 = fma(((B_m * B_m) / A), -0.5, C) + C;
double t_3 = C * (A * 4.0);
double t_4 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
double t_5 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = -sqrt(t_1) * (sqrt((t_2 * F)) / t_0);
} else if (t_4 <= -1e-198) {
tmp = sqrt((((hypot((A - C), B_m) + A) + C) * ((F * 2.0) * t_5))) / -t_5;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * (t_1 * F))) / -t_0;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = Float64(t_0 * 2.0) t_2 = Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) t_3 = Float64(C * Float64(A * 4.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0))) t_5 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(-sqrt(t_1)) * Float64(sqrt(Float64(t_2 * F)) / t_0)); elseif (t_4 <= -1e-198) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * Float64(Float64(F * 2.0) * t_5))) / Float64(-t_5)); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_2 * Float64(t_1 * F))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[((-N[Sqrt[t$95$1], $MachinePrecision]) * N[(N[Sqrt[N[(t$95$2 * F), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-198], N[(N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$5)), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$2 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := t\_0 \cdot 2\\
t_2 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\\
t_3 := C \cdot \left(A \cdot 4\right)\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\
t_5 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\left(-\sqrt{t\_1}\right) \cdot \frac{\sqrt{t\_2 \cdot F}}{t\_0}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-198}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_5\right)}}{-t\_5}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(t\_1 \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-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%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites49.3%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6428.4
Applied rewrites28.4%
Applied rewrites28.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))) < -9.9999999999999991e-199Initial program 96.3%
Applied rewrites96.4%
if -9.9999999999999991e-199 < (/.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.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites8.6%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6418.7
Applied rewrites18.7%
Applied rewrites36.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in A around 0
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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.4
Applied rewrites17.4%
Applied rewrites24.2%
Applied rewrites24.2%
Final simplification39.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 -4.0 (* C A) (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_2 -1e-198)
(*
(/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) t_0)
(/ (sqrt (* (* F 2.0) t_0)) -1.0))
(if (<= t_2 INFINITY)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_3 2.0) F)))
(- t_3))
(/ (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (sqrt F)) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_2 <= -1e-198) {
tmp = (sqrt(((hypot((A - C), B_m) + A) + C)) / t_0) * (sqrt(((F * 2.0) * t_0)) / -1.0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_3 * 2.0) * F))) / -t_3;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_2 <= -1e-198) tmp = Float64(Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / t_0) * Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) / -1.0)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * Float64(Float64(t_3 * 2.0) * F))) / Float64(-t_3)); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $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$2, -1e-198], N[(N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$3 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{-198}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{t\_0} \cdot \frac{\sqrt{\left(F \cdot 2\right) \cdot t\_0}}{-1}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot \left(\left(t\_3 \cdot 2\right) \cdot F\right)}}{-t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-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))) < -9.9999999999999991e-199Initial program 47.2%
Applied rewrites74.6%
if -9.9999999999999991e-199 < (/.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.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites8.6%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6418.7
Applied rewrites18.7%
Applied rewrites36.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in A around 0
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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.4
Applied rewrites17.4%
Applied rewrites24.2%
Applied rewrites24.2%
Final simplification43.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 (* C A) -4.0 (* B_m B_m)))
(t_1 (* (* t_0 2.0) F))
(t_2 (* C (* A 4.0)))
(t_3
(/
(sqrt
(*
(+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_2)) 2.0)))
(- t_2 (pow B_m 2.0))))
(t_4 (- t_0)))
(if (<= t_3 -1e-198)
(/ (* (sqrt t_1) (sqrt (+ (+ (hypot (- A C) B_m) C) A))) t_4)
(if (<= t_3 INFINITY)
(/ (sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) t_1)) t_4)
(/ (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (sqrt F)) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = (t_0 * 2.0) * F;
double t_2 = C * (A * 4.0);
double t_3 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B_m, 2.0));
double t_4 = -t_0;
double tmp;
if (t_3 <= -1e-198) {
tmp = (sqrt(t_1) * sqrt(((hypot((A - C), B_m) + C) + A))) / t_4;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * t_1)) / t_4;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = Float64(Float64(t_0 * 2.0) * F) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B_m ^ 2.0))) t_4 = Float64(-t_0) tmp = 0.0 if (t_3 <= -1e-198) tmp = Float64(Float64(sqrt(t_1) * sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A))) / t_4); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * t_1)) / t_4); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * 2.0), $MachinePrecision] * F), $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, If[LessEqual[t$95$3, -1e-198], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \left(t\_0 \cdot 2\right) \cdot F\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\
t_4 := -t\_0\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{-198}:\\
\;\;\;\;\frac{\sqrt{t\_1} \cdot \sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A}}{t\_4}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot t\_1}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-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))) < -9.9999999999999991e-199Initial program 47.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites72.5%
Applied rewrites48.3%
Applied rewrites74.2%
if -9.9999999999999991e-199 < (/.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.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites8.6%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6418.7
Applied rewrites18.7%
Applied rewrites36.6%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in A around 0
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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6417.4
Applied rewrites17.4%
Applied rewrites24.2%
Applied rewrites24.2%
Final simplification43.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-7)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_0 2.0) F)))
(- t_0))
(if (<= (pow B_m 2.0) 5e+69)
(*
(sqrt
(/
(* (+ (+ (hypot (- A C) B_m) C) A) F)
(fma -4.0 (* C A) (* B_m B_m))))
(- (sqrt 2.0)))
(/ (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (sqrt F)) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-7) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_0 * 2.0) * F))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+69) {
tmp = sqrt(((((hypot((A - C), B_m) + C) + A) * F) / fma(-4.0, (C * A), (B_m * B_m)))) * -sqrt(2.0);
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-7) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * Float64(Float64(t_0 * 2.0) * F))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+69) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * F) / fma(-4.0, Float64(C * A), Float64(B_m * B_m)))) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-7], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$0 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+69], N[(N[Sqrt[N[(N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot \left(\left(t\_0 \cdot 2\right) \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+69}:\\
\;\;\;\;\sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-7Initial program 22.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites26.8%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.3
Applied rewrites19.3%
Applied rewrites25.3%
if 1.9999999999999999e-7 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000036e69Initial program 66.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
lower-/.f64N/A
Applied rewrites83.5%
if 5.00000000000000036e69 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.0%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6426.4
Applied rewrites26.4%
Applied rewrites35.8%
Applied rewrites35.8%
Final simplification32.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 (* C A) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-7)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_0 2.0) F)))
(- t_0))
(if (<= (pow B_m 2.0) 5e+218)
(/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
(/ (* (- (sqrt F)) (sqrt (* (+ C B_m) 2.0))) B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-7) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_0 * 2.0) * F))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+218) {
tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
} else {
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-7) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * Float64(Float64(t_0 * 2.0) * F))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+218) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(Float64(Float64(-sqrt(F)) * sqrt(Float64(Float64(C + B_m) * 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-7], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$0 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+218], N[(N[Sqrt[N[(N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot \left(\left(t\_0 \cdot 2\right) \cdot F\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+218}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-\sqrt{F}\right) \cdot \sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-7Initial program 22.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites26.8%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.3
Applied rewrites19.3%
Applied rewrites25.3%
if 1.9999999999999999e-7 < (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999983e218Initial program 42.3%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6433.1
Applied rewrites33.1%
Applied rewrites33.1%
if 4.99999999999999983e218 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.0%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6424.8
Applied rewrites24.8%
Applied rewrites36.5%
Applied rewrites36.5%
Taylor expanded in C around 0
Applied rewrites33.4%
Final simplification29.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-7)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_0 2.0) F)))
(- t_0))
(/ (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (sqrt F)) (- B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-7) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_0 * 2.0) * F))) / -t_0;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-7) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * Float64(Float64(t_0 * 2.0) * F))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-7], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$0 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot \left(\left(t\_0 \cdot 2\right) \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-7Initial program 22.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites26.8%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.3
Applied rewrites19.3%
Applied rewrites25.3%
if 1.9999999999999999e-7 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.0%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6428.0
Applied rewrites28.0%
Applied rewrites36.6%
Applied rewrites36.6%
Final simplification31.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
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e-7)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_0 2.0) F)))
(- t_0))
(/ (* (- (sqrt F)) (sqrt (* (+ C B_m) 2.0))) B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e-7) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_0 * 2.0) * F))) / -t_0;
} else {
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-7) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) * Float64(Float64(t_0 * 2.0) * F))) / Float64(-t_0)); else tmp = Float64(Float64(Float64(-sqrt(F)) * sqrt(Float64(Float64(C + B_m) * 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-7], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$0 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right) \cdot \left(\left(t\_0 \cdot 2\right) \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-\sqrt{F}\right) \cdot \sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-7Initial program 22.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites26.8%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.3
Applied rewrites19.3%
Applied rewrites25.3%
if 1.9999999999999999e-7 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.0%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6428.0
Applied rewrites28.0%
Applied rewrites36.6%
Applied rewrites36.6%
Taylor expanded in C around 0
Applied rewrites29.7%
Final simplification27.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e+75)
(/ (sqrt (* (* (* C 2.0) (* t_0 2.0)) F)) (- t_0))
(/ (* (- (sqrt F)) (sqrt (* (+ C B_m) 2.0))) B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 5e+75) {
tmp = sqrt((((C * 2.0) * (t_0 * 2.0)) * F)) / -t_0;
} else {
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+75) tmp = Float64(sqrt(Float64(Float64(Float64(C * 2.0) * Float64(t_0 * 2.0)) * F)) / Float64(-t_0)); else tmp = Float64(Float64(Float64(-sqrt(F)) * sqrt(Float64(Float64(C + B_m) * 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+75], N[(N[Sqrt[N[(N[(N[(C * 2.0), $MachinePrecision] * N[(t$95$0 * 2.0), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+75}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C \cdot 2\right) \cdot \left(t\_0 \cdot 2\right)\right) \cdot F}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-\sqrt{F}\right) \cdot \sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e75Initial program 26.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites32.7%
Applied rewrites28.5%
Taylor expanded in A around -inf
lower-*.f6422.3
Applied rewrites22.3%
if 5.0000000000000002e75 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.5%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6425.7
Applied rewrites25.7%
Applied rewrites35.6%
Applied rewrites35.6%
Taylor expanded in C around 0
Applied rewrites30.3%
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 (if (<= (pow B_m 2.0) 2e-7) (/ (sqrt (* (* (* (* C C) A) -16.0) F)) (- (fma (* C A) -4.0 (* B_m B_m)))) (/ (* (- (sqrt F)) (sqrt (* (+ C B_m) 2.0))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e-7) {
tmp = sqrt(((((C * C) * A) * -16.0) * F)) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-7) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * A) * -16.0) * F)) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(Float64(-sqrt(F)) * sqrt(Float64(Float64(C + B_m) * 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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-7], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-7}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(C \cdot C\right) \cdot A\right) \cdot -16\right) \cdot F}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-\sqrt{F}\right) \cdot \sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-7Initial program 22.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites26.8%
Applied rewrites23.5%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6420.0
Applied rewrites20.0%
if 1.9999999999999999e-7 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.0%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6428.0
Applied rewrites28.0%
Applied rewrites36.6%
Applied rewrites36.6%
Taylor expanded in C around 0
Applied rewrites29.7%
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 (if (<= B_m 0.00038) (/ (sqrt (* (* (* (* C C) F) A) -16.0)) (- (fma (* C A) -4.0 (* B_m B_m)))) (/ (* (- (sqrt F)) (sqrt (* (+ C B_m) 2.0))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 0.00038) {
tmp = sqrt(((((C * C) * F) * A) * -16.0)) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 0.00038) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(Float64(-sqrt(F)) * sqrt(Float64(Float64(C + B_m) * 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, 0.00038], N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 0.00038:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -16}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-\sqrt{F}\right) \cdot \sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m}\\
\end{array}
\end{array}
if B < 3.8000000000000002e-4Initial program 19.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites25.0%
Applied rewrites19.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.8
Applied rewrites14.8%
if 3.8000000000000002e-4 < B Initial program 21.5%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6452.4
Applied rewrites52.4%
Applied rewrites69.2%
Applied rewrites69.2%
Taylor expanded in C around 0
Applied rewrites58.3%
Final simplification26.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 (<= C 2.1e+207) (/ (* (- (sqrt F)) (sqrt (* (+ C B_m) 2.0))) B_m) (/ (* (* (sqrt C) 2.0) (sqrt F)) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+207) {
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
} else {
tmp = ((sqrt(C) * 2.0) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.1d+207) then
tmp = (-sqrt(f) * sqrt(((c + b_m) * 2.0d0))) / b_m
else
tmp = ((sqrt(c) * 2.0d0) * sqrt(f)) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+207) {
tmp = (-Math.sqrt(F) * Math.sqrt(((C + B_m) * 2.0))) / B_m;
} else {
tmp = ((Math.sqrt(C) * 2.0) * Math.sqrt(F)) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.1e+207: tmp = (-math.sqrt(F) * math.sqrt(((C + B_m) * 2.0))) / B_m else: tmp = ((math.sqrt(C) * 2.0) * math.sqrt(F)) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.1e+207) tmp = Float64(Float64(Float64(-sqrt(F)) * sqrt(Float64(Float64(C + B_m) * 2.0))) / B_m); else tmp = Float64(Float64(Float64(sqrt(C) * 2.0) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.1e+207)
tmp = (-sqrt(F) * sqrt(((C + B_m) * 2.0))) / B_m;
else
tmp = ((sqrt(C) * 2.0) * sqrt(F)) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.1e+207], N[(N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision], N[(N[(N[(N[Sqrt[C], $MachinePrecision] * 2.0), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.1 \cdot 10^{+207}:\\
\;\;\;\;\frac{\left(-\sqrt{F}\right) \cdot \sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{C} \cdot 2\right) \cdot \sqrt{F}}{-B\_m}\\
\end{array}
\end{array}
if C < 2.0999999999999999e207Initial program 21.3%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6420.8
Applied rewrites20.8%
Applied rewrites25.5%
Applied rewrites25.5%
Taylor expanded in C around 0
Applied rewrites20.6%
if 2.0999999999999999e207 < C Initial program 0.9%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f647.2
Applied rewrites7.2%
Applied rewrites12.3%
Applied rewrites12.2%
Taylor expanded in B around 0
Applied rewrites12.2%
Final simplification19.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 2.1e+207) (/ (- (sqrt F)) (sqrt (* 0.5 B_m))) (/ (* (* (sqrt C) 2.0) (sqrt F)) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+207) {
tmp = -sqrt(F) / sqrt((0.5 * B_m));
} else {
tmp = ((sqrt(C) * 2.0) * sqrt(F)) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.1d+207) then
tmp = -sqrt(f) / sqrt((0.5d0 * b_m))
else
tmp = ((sqrt(c) * 2.0d0) * sqrt(f)) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+207) {
tmp = -Math.sqrt(F) / Math.sqrt((0.5 * B_m));
} else {
tmp = ((Math.sqrt(C) * 2.0) * Math.sqrt(F)) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.1e+207: tmp = -math.sqrt(F) / math.sqrt((0.5 * B_m)) else: tmp = ((math.sqrt(C) * 2.0) * math.sqrt(F)) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.1e+207) tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))); else tmp = Float64(Float64(Float64(sqrt(C) * 2.0) * sqrt(F)) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.1e+207)
tmp = -sqrt(F) / sqrt((0.5 * B_m));
else
tmp = ((sqrt(C) * 2.0) * sqrt(F)) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.1e+207], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[C], $MachinePrecision] * 2.0), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.1 \cdot 10^{+207}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{C} \cdot 2\right) \cdot \sqrt{F}}{-B\_m}\\
\end{array}
\end{array}
if C < 2.0999999999999999e207Initial program 21.3%
Taylor expanded in B around inf
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
lower-/.f6413.6
Applied rewrites13.6%
Applied rewrites13.6%
Applied rewrites13.7%
Applied rewrites20.9%
if 2.0999999999999999e207 < C Initial program 0.9%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f647.2
Applied rewrites7.2%
Applied rewrites12.3%
Applied rewrites12.2%
Taylor expanded in B around 0
Applied rewrites12.2%
Final simplification20.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 (<= C 8e+96) (- (sqrt (* (/ 2.0 B_m) F))) (/ (* (sqrt (* F C)) 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 (C <= 8e+96) {
tmp = -sqrt(((2.0 / B_m) * F));
} else {
tmp = (sqrt((F * C)) * 2.0) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 8d+96) then
tmp = -sqrt(((2.0d0 / b_m) * f))
else
tmp = (sqrt((f * c)) * 2.0d0) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 8e+96) {
tmp = -Math.sqrt(((2.0 / B_m) * F));
} else {
tmp = (Math.sqrt((F * C)) * 2.0) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 8e+96: tmp = -math.sqrt(((2.0 / B_m) * F)) else: tmp = (math.sqrt((F * C)) * 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 (C <= 8e+96) tmp = Float64(-sqrt(Float64(Float64(2.0 / B_m) * F))); else tmp = Float64(Float64(sqrt(Float64(F * C)) * 2.0) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 8e+96)
tmp = -sqrt(((2.0 / B_m) * F));
else
tmp = (sqrt((F * C)) * 2.0) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 8e+96], (-N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), N[(N[(N[Sqrt[N[(F * C), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 8 \cdot 10^{+96}:\\
\;\;\;\;-\sqrt{\frac{2}{B\_m} \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot C} \cdot 2}{-B\_m}\\
\end{array}
\end{array}
if C < 8.0000000000000004e96Initial program 20.6%
Taylor expanded in B around inf
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
lower-/.f6413.8
Applied rewrites13.8%
Applied rewrites13.9%
Applied rewrites13.9%
if 8.0000000000000004e96 < C Initial program 15.8%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6423.3
Applied rewrites23.3%
Applied rewrites29.4%
Applied rewrites29.5%
Taylor expanded in B around 0
Applied rewrites17.0%
Final simplification14.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 8e+96) (- (sqrt (* (/ 2.0 B_m) F))) (* (/ 2.0 (- B_m)) (sqrt (* F C)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 8e+96) {
tmp = -sqrt(((2.0 / B_m) * F));
} else {
tmp = (2.0 / -B_m) * sqrt((F * C));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 8d+96) then
tmp = -sqrt(((2.0d0 / b_m) * f))
else
tmp = (2.0d0 / -b_m) * sqrt((f * c))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 8e+96) {
tmp = -Math.sqrt(((2.0 / B_m) * F));
} else {
tmp = (2.0 / -B_m) * Math.sqrt((F * C));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 8e+96: tmp = -math.sqrt(((2.0 / B_m) * F)) else: tmp = (2.0 / -B_m) * math.sqrt((F * C)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 8e+96) tmp = Float64(-sqrt(Float64(Float64(2.0 / B_m) * F))); else tmp = Float64(Float64(2.0 / Float64(-B_m)) * sqrt(Float64(F * C))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 8e+96)
tmp = -sqrt(((2.0 / B_m) * F));
else
tmp = (2.0 / -B_m) * sqrt((F * C));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 8e+96], (-N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * C), $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}\;C \leq 8 \cdot 10^{+96}:\\
\;\;\;\;-\sqrt{\frac{2}{B\_m} \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{F \cdot C}\\
\end{array}
\end{array}
if C < 8.0000000000000004e96Initial program 20.6%
Taylor expanded in B around inf
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
lower-/.f6413.8
Applied rewrites13.8%
Applied rewrites13.9%
Applied rewrites13.9%
if 8.0000000000000004e96 < C Initial program 15.8%
Taylor expanded in A 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
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6423.3
Applied rewrites23.3%
Applied rewrites29.4%
Applied rewrites29.5%
Taylor expanded in B around 0
Applied rewrites17.0%
Final simplification14.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (- (sqrt F)) (sqrt (* 0.5 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) / sqrt((0.5 * 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) / sqrt((0.5d0 * 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) / Math.sqrt((0.5 * 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) / math.sqrt((0.5 * 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(Float64(-sqrt(F)) / sqrt(Float64(0.5 * 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) / sqrt((0.5 * 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[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * 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])\\
\\
\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}
\end{array}
Initial program 19.8%
Taylor expanded in B around inf
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
lower-/.f6412.9
Applied rewrites12.9%
Applied rewrites12.9%
Applied rewrites12.9%
Applied rewrites19.5%
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 (* (- (sqrt F)) (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) {
return -sqrt(F) * sqrt((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) * sqrt((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) * Math.sqrt((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) * math.sqrt((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(Float64(-sqrt(F)) * sqrt(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) * sqrt((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[F], $MachinePrecision]) * N[Sqrt[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])\\
\\
\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B\_m}}
\end{array}
Initial program 19.8%
Taylor expanded in B around inf
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
lower-/.f6412.9
Applied rewrites12.9%
Applied rewrites12.9%
Applied rewrites19.5%
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 (- (sqrt (* (/ 2.0 B_m) 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) * F));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((2.0d0 / b_m) * f))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((2.0 / B_m) * F));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((2.0 / B_m) * F))
B_m = 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(2.0 / B_m) * 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) * 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[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{2}{B\_m} \cdot F}
\end{array}
Initial program 19.8%
Taylor expanded in B around inf
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
lower-/.f6412.9
Applied rewrites12.9%
Applied rewrites12.9%
Applied rewrites12.9%
Final simplification12.9%
herbie shell --seed 2024283
(FPCore (A B C F)
:name "ABCF->ab-angle a"
: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))))