
(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 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (/ (* B_m B_m) A))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3))))
(if (<= t_4 -1e+231)
(/
(* (* (- (sqrt t_0)) (sqrt (* 2.0 (+ (fma t_2 -0.5 C) C)))) (sqrt F))
t_3)
(if (<= t_4 -5e-220)
(*
(sqrt (* (+ (+ (hypot B_m (- A C)) A) C) (* (* 2.0 F) t_1)))
(/ -1.0 t_1))
(if (<= t_4 0.0)
(/
(* (sqrt (* (+ (+ C (* -0.5 t_2)) C) (* t_1 2.0))) (- (sqrt F)))
t_3)
(if (<= t_4 INFINITY)
(/
(*
(- (sqrt (* t_1 F)))
(sqrt (* 2.0 (+ (+ C A) (hypot (- A C) B_m)))))
t_0)
(*
(/ (sqrt 2.0) (- B_m))
(* (sqrt (+ (hypot C B_m) C)) (sqrt 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 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = (B_m * B_m) / A;
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double tmp;
if (t_4 <= -1e+231) {
tmp = ((-sqrt(t_0) * sqrt((2.0 * (fma(t_2, -0.5, C) + C)))) * sqrt(F)) / t_3;
} else if (t_4 <= -5e-220) {
tmp = sqrt((((hypot(B_m, (A - C)) + A) + C) * ((2.0 * F) * t_1))) * (-1.0 / t_1);
} else if (t_4 <= 0.0) {
tmp = (sqrt((((C + (-0.5 * t_2)) + C) * (t_1 * 2.0))) * -sqrt(F)) / t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = (-sqrt((t_1 * F)) * sqrt((2.0 * ((C + A) + hypot((A - C), B_m))))) / t_0;
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt((hypot(C, B_m) + C)) * sqrt(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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = Float64(Float64(B_m * B_m) / A) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_3)) tmp = 0.0 if (t_4 <= -1e+231) tmp = Float64(Float64(Float64(Float64(-sqrt(t_0)) * sqrt(Float64(2.0 * Float64(fma(t_2, -0.5, C) + C)))) * sqrt(F)) / t_3); elseif (t_4 <= -5e-220) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C) * Float64(Float64(2.0 * F) * t_1))) * Float64(-1.0 / t_1)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(C + Float64(-0.5 * t_2)) + C) * Float64(t_1 * 2.0))) * Float64(-sqrt(F))) / t_3); elseif (t_4 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_1 * F))) * sqrt(Float64(2.0 * Float64(Float64(C + A) + hypot(Float64(A - C), B_m))))) / t_0); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) * sqrt(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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, If[LessEqual[t$95$4, -1e+231], N[(N[(N[((-N[Sqrt[t$95$0], $MachinePrecision]) * N[Sqrt[N[(2.0 * N[(N[(t$95$2 * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -5e-220], N[(N[Sqrt[N[(N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(N[(N[(C + N[(-0.5 * t$95$2), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision] * N[(t$95$1 * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[((-N[Sqrt[N[(t$95$1 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \frac{B\_m \cdot B\_m}{A}\\
t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{+231}:\\
\;\;\;\;\frac{\left(\left(-\sqrt{t\_0}\right) \cdot \sqrt{2 \cdot \left(\mathsf{fma}\left(t\_2, -0.5, C\right) + C\right)}\right) \cdot \sqrt{F}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-220}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_1\right)} \cdot \frac{-1}{t\_1}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + -0.5 \cdot t\_2\right) + C\right) \cdot \left(t\_1 \cdot 2\right)} \cdot \left(-\sqrt{F}\right)}{t\_3}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_1 \cdot F}\right) \cdot \sqrt{2 \cdot \left(\left(C + A\right) + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C} \cdot \sqrt{F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.0000000000000001e231Initial program 4.6%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites18.8%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.1
Applied rewrites21.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
Applied rewrites34.1%
if -1.0000000000000001e231 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-220Initial program 99.5%
Applied rewrites99.5%
if -5.0000000000000002e-220 < (/.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))) < -0.0Initial program 3.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites24.9%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6430.6
Applied rewrites30.6%
if -0.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))) < +inf.0Initial program 37.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites0.0%
Applied rewrites42.7%
Applied rewrites82.7%
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
unpow2N/A
unpow2N/A
lower-hypot.f6415.9
Applied rewrites15.9%
Applied rewrites20.6%
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 (sqrt (/ F B_m)))
(t_1 (fma (* C A) -4.0 (* B_m B_m)))
(t_2 (/ (* B_m B_m) A)))
(if (<= (pow B_m 2.0) 1e-277)
(/ (sqrt (* (+ (fma t_2 -0.5 C) C) (* (* t_1 2.0) F))) (- t_1))
(if (<= (pow B_m 2.0) 2e-237)
(fma (* -0.5 (/ t_0 B_m)) (* (+ C A) (sqrt 2.0)) (* t_0 (- (sqrt 2.0))))
(if (<= (pow B_m 2.0) 5e-92)
(/
(*
(sqrt
(*
(+ (+ C (* -0.5 t_2)) C)
(* (fma -4.0 (* C A) (* B_m B_m)) 2.0)))
(- (sqrt F)))
(* -4.0 (* A C)))
(* (/ -1.0 (/ B_m (sqrt 2.0))) (* (sqrt (+ C B_m)) (sqrt 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((F / B_m));
double t_1 = fma((C * A), -4.0, (B_m * B_m));
double t_2 = (B_m * B_m) / A;
double tmp;
if (pow(B_m, 2.0) <= 1e-277) {
tmp = sqrt(((fma(t_2, -0.5, C) + C) * ((t_1 * 2.0) * F))) / -t_1;
} else if (pow(B_m, 2.0) <= 2e-237) {
tmp = fma((-0.5 * (t_0 / B_m)), ((C + A) * sqrt(2.0)), (t_0 * -sqrt(2.0)));
} else if (pow(B_m, 2.0) <= 5e-92) {
tmp = (sqrt((((C + (-0.5 * t_2)) + C) * (fma(-4.0, (C * A), (B_m * B_m)) * 2.0))) * -sqrt(F)) / (-4.0 * (A * C));
} else {
tmp = (-1.0 / (B_m / sqrt(2.0))) * (sqrt((C + B_m)) * sqrt(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 = sqrt(Float64(F / B_m)) t_1 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_2 = Float64(Float64(B_m * B_m) / A) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-277) tmp = Float64(sqrt(Float64(Float64(fma(t_2, -0.5, C) + C) * Float64(Float64(t_1 * 2.0) * F))) / Float64(-t_1)); elseif ((B_m ^ 2.0) <= 2e-237) tmp = fma(Float64(-0.5 * Float64(t_0 / B_m)), Float64(Float64(C + A) * sqrt(2.0)), Float64(t_0 * Float64(-sqrt(2.0)))); elseif ((B_m ^ 2.0) <= 5e-92) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(C + Float64(-0.5 * t_2)) + C) * Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0))) * Float64(-sqrt(F))) / Float64(-4.0 * Float64(A * C))); else tmp = Float64(Float64(-1.0 / Float64(B_m / sqrt(2.0))) * Float64(sqrt(Float64(C + B_m)) * sqrt(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[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-277], N[(N[Sqrt[N[(N[(N[(t$95$2 * -0.5 + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(t$95$1 * 2.0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-237], N[(N[(-0.5 * N[(t$95$0 / B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-92], N[(N[(N[Sqrt[N[(N[(N[(C + N[(-0.5 * t$95$2), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision] * N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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{\frac{F}{B\_m}}\\
t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := \frac{B\_m \cdot B\_m}{A}\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-277}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(t\_2, -0.5, C\right) + C\right) \cdot \left(\left(t\_1 \cdot 2\right) \cdot F\right)}}{-t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-237}:\\
\;\;\;\;\mathsf{fma}\left(-0.5 \cdot \frac{t\_0}{B\_m}, \left(C + A\right) \cdot \sqrt{2}, t\_0 \cdot \left(-\sqrt{2}\right)\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{-92}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + -0.5 \cdot t\_2\right) + C\right) \cdot \left(\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2\right)} \cdot \left(-\sqrt{F}\right)}{-4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}}} \cdot \left(\sqrt{C + B\_m} \cdot \sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999969e-278Initial program 11.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites13.1%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.9
Applied rewrites13.9%
Applied rewrites22.7%
if 9.99999999999999969e-278 < (pow.f64 B #s(literal 2 binary64)) < 2e-237Initial program 44.3%
Taylor expanded in B around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f641.0
Applied rewrites1.0%
Applied rewrites15.9%
if 2e-237 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000011e-92Initial program 11.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites25.9%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.6
Applied rewrites22.6%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6421.9
Applied rewrites21.9%
if 5.00000000000000011e-92 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.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
unpow2N/A
unpow2N/A
lower-hypot.f6421.9
Applied rewrites21.9%
Applied rewrites27.6%
Applied rewrites27.7%
Taylor expanded in C around 0
Applied rewrites22.9%
Final simplification22.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= A -1.9e+87)
(/
(*
(sqrt
(*
(+ (+ C (* -0.5 (/ (* B_m B_m) A))) C)
(* (fma -4.0 (* C A) (* B_m B_m)) 2.0)))
(- (sqrt F)))
(- (pow B_m 2.0) (* (* 4.0 A) C)))
(* (/ (sqrt 2.0) (- B_m)) (* (sqrt (+ (hypot C B_m) C)) (sqrt 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 (A <= -1.9e+87) {
tmp = (sqrt((((C + (-0.5 * ((B_m * B_m) / A))) + C) * (fma(-4.0, (C * A), (B_m * B_m)) * 2.0))) * -sqrt(F)) / (pow(B_m, 2.0) - ((4.0 * A) * C));
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt((hypot(C, B_m) + C)) * sqrt(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 (A <= -1.9e+87) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(C + Float64(-0.5 * Float64(Float64(B_m * B_m) / A))) + C) * Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0))) * Float64(-sqrt(F))) / Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) * sqrt(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_] := If[LessEqual[A, -1.9e+87], N[(N[(N[Sqrt[N[(N[(N[(C + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision] * N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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}\;A \leq -1.9 \cdot 10^{+87}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + -0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) + C\right) \cdot \left(\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2\right)} \cdot \left(-\sqrt{F}\right)}{{B\_m}^{2} - \left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C} \cdot \sqrt{F}\right)\\
\end{array}
\end{array}
if A < -1.90000000000000006e87Initial program 1.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites5.7%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6441.6
Applied rewrites41.6%
if -1.90000000000000006e87 < A Initial program 20.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
unpow2N/A
unpow2N/A
lower-hypot.f6419.4
Applied rewrites19.4%
Applied rewrites24.2%
Final simplification28.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 (* C A) -4.0 (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e-277)
(/
(sqrt (* (+ (fma (/ (* B_m B_m) A) -0.5 C) C) (* (* t_0 2.0) F)))
(- t_0))
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ C B_m)) (- (sqrt 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 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e-277) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, C) + C) * ((t_0 * 2.0) * F))) / -t_0;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + B_m)) * -sqrt(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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-277) 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(2.0) / B_m) * Float64(sqrt(Float64(C + B_m)) * Float64(-sqrt(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[(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], 1e-277], 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[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[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 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-277}:\\
\;\;\;\;\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{2}}{B\_m} \cdot \left(\sqrt{C + B\_m} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999969e-278Initial program 11.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites13.1%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.9
Applied rewrites13.9%
Applied rewrites22.7%
if 9.99999999999999969e-278 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.7%
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
unpow2N/A
unpow2N/A
lower-hypot.f6420.2
Applied rewrites20.2%
Applied rewrites25.6%
Taylor expanded in C around 0
Applied rewrites21.0%
Final simplification21.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 (<= (pow B_m 2.0) 1e-277)
(/
(sqrt (* (* -8.0 (* (* C A) C)) (* F 2.0)))
(- (fma (* C A) -4.0 (* B_m B_m))))
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ C B_m)) (- (sqrt 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) <= 1e-277) {
tmp = sqrt(((-8.0 * ((C * A) * C)) * (F * 2.0))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + B_m)) * -sqrt(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) <= 1e-277) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(Float64(C * A) * C)) * Float64(F * 2.0))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + B_m)) * Float64(-sqrt(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_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-277], N[(N[Sqrt[N[(N[(-8.0 * N[(N[(C * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[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 10^{-277}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(\left(C \cdot A\right) \cdot C\right)\right) \cdot \left(F \cdot 2\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + B\_m} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999969e-278Initial program 11.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites13.1%
Applied rewrites18.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6413.9
Applied rewrites13.9%
Applied rewrites19.2%
if 9.99999999999999969e-278 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.7%
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
unpow2N/A
unpow2N/A
lower-hypot.f6420.2
Applied rewrites20.2%
Applied rewrites25.6%
Taylor expanded in C around 0
Applied rewrites21.0%
Final simplification20.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 1e-277) (/ (sqrt (* -16.0 (* A (* (* C C) F)))) (- (fma (* C A) -4.0 (* B_m B_m)))) (* (/ (sqrt 2.0) B_m) (* (sqrt (+ C B_m)) (- (sqrt 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) <= 1e-277) {
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + B_m)) * -sqrt(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) <= 1e-277) tmp = Float64(sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + B_m)) * Float64(-sqrt(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_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-277], N[(N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[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 10^{-277}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + B\_m} \cdot \left(-\sqrt{F}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999969e-278Initial program 11.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites13.1%
Applied rewrites18.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.0
Applied rewrites16.0%
if 9.99999999999999969e-278 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.7%
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
unpow2N/A
unpow2N/A
lower-hypot.f6420.2
Applied rewrites20.2%
Applied rewrites25.6%
Taylor expanded in C around 0
Applied rewrites21.0%
Final simplification19.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= A -1.9e+87)
(*
(sqrt (* (* t_0 2.0) (+ (fma (/ (* B_m B_m) A) -0.5 C) C)))
(/ (- (sqrt F)) t_0))
(* (/ (sqrt 2.0) (- B_m)) (* (sqrt (+ (hypot C B_m) C)) (sqrt 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 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (A <= -1.9e+87) {
tmp = sqrt(((t_0 * 2.0) * (fma(((B_m * B_m) / A), -0.5, C) + C))) * (-sqrt(F) / t_0);
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt((hypot(C, B_m) + C)) * sqrt(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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (A <= -1.9e+87) tmp = Float64(sqrt(Float64(Float64(t_0 * 2.0) * Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C))) * Float64(Float64(-sqrt(F)) / t_0)); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) * sqrt(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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, -1.9e+87], N[(N[Sqrt[N[(N[(t$95$0 * 2.0), $MachinePrecision] * N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;A \leq -1.9 \cdot 10^{+87}:\\
\;\;\;\;\sqrt{\left(t\_0 \cdot 2\right) \cdot \left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right)} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C} \cdot \sqrt{F}\right)\\
\end{array}
\end{array}
if A < -1.90000000000000006e87Initial program 1.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites5.7%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6441.6
Applied rewrites41.6%
Applied rewrites41.3%
if -1.90000000000000006e87 < A Initial program 20.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
unpow2N/A
unpow2N/A
lower-hypot.f6419.4
Applied rewrites19.4%
Applied rewrites24.2%
Final simplification27.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 (sqrt (/ F B_m)))
(t_1 (fma (* C A) -4.0 (* B_m B_m)))
(t_2 (* t_1 2.0))
(t_3 (+ (fma (/ (* B_m B_m) A) -0.5 C) C))
(t_4 (- (sqrt F))))
(if (<= B_m 1.02e-137)
(/ (sqrt (* t_3 (* t_2 F))) (- t_1))
(if (<= B_m 4.5e-119)
(fma (* -0.5 (/ t_0 B_m)) (* (+ C A) (sqrt 2.0)) (* t_0 (- (sqrt 2.0))))
(if (<= B_m 1.55e-42)
(* (sqrt (* t_2 t_3)) (/ t_4 t_1))
(if (<= B_m 2.05e+189)
(/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
(* (/ (sqrt 2.0) B_m) (* (sqrt (+ C B_m)) t_4))))))))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((F / B_m));
double t_1 = fma((C * A), -4.0, (B_m * B_m));
double t_2 = t_1 * 2.0;
double t_3 = fma(((B_m * B_m) / A), -0.5, C) + C;
double t_4 = -sqrt(F);
double tmp;
if (B_m <= 1.02e-137) {
tmp = sqrt((t_3 * (t_2 * F))) / -t_1;
} else if (B_m <= 4.5e-119) {
tmp = fma((-0.5 * (t_0 / B_m)), ((C + A) * sqrt(2.0)), (t_0 * -sqrt(2.0)));
} else if (B_m <= 1.55e-42) {
tmp = sqrt((t_2 * t_3)) * (t_4 / t_1);
} else if (B_m <= 2.05e+189) {
tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
} else {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + B_m)) * t_4);
}
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 = sqrt(Float64(F / B_m)) t_1 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_2 = Float64(t_1 * 2.0) t_3 = Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) t_4 = Float64(-sqrt(F)) tmp = 0.0 if (B_m <= 1.02e-137) tmp = Float64(sqrt(Float64(t_3 * Float64(t_2 * F))) / Float64(-t_1)); elseif (B_m <= 4.5e-119) tmp = fma(Float64(-0.5 * Float64(t_0 / B_m)), Float64(Float64(C + A) * sqrt(2.0)), Float64(t_0 * Float64(-sqrt(2.0)))); elseif (B_m <= 1.55e-42) tmp = Float64(sqrt(Float64(t_2 * t_3)) * Float64(t_4 / t_1)); elseif (B_m <= 2.05e+189) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + B_m)) * t_4)); 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[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 2.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$4 = (-N[Sqrt[F], $MachinePrecision])}, If[LessEqual[B$95$m, 1.02e-137], N[(N[Sqrt[N[(t$95$3 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[B$95$m, 4.5e-119], N[(N[(-0.5 * N[(t$95$0 / B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.55e-42], N[(N[Sqrt[N[(t$95$2 * t$95$3), $MachinePrecision]], $MachinePrecision] * N[(t$95$4 / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.05e+189], 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[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$4), $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{\frac{F}{B\_m}}\\
t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := t\_1 \cdot 2\\
t_3 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\\
t_4 := -\sqrt{F}\\
\mathbf{if}\;B\_m \leq 1.02 \cdot 10^{-137}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \left(t\_2 \cdot F\right)}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 4.5 \cdot 10^{-119}:\\
\;\;\;\;\mathsf{fma}\left(-0.5 \cdot \frac{t\_0}{B\_m}, \left(C + A\right) \cdot \sqrt{2}, t\_0 \cdot \left(-\sqrt{2}\right)\right)\\
\mathbf{elif}\;B\_m \leq 1.55 \cdot 10^{-42}:\\
\;\;\;\;\sqrt{t\_2 \cdot t\_3} \cdot \frac{t\_4}{t\_1}\\
\mathbf{elif}\;B\_m \leq 2.05 \cdot 10^{+189}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + B\_m} \cdot t\_4\right)\\
\end{array}
\end{array}
if B < 1.02e-137Initial program 14.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites15.9%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.1
Applied rewrites12.1%
Applied rewrites15.2%
if 1.02e-137 < B < 4.5000000000000003e-119Initial program 51.7%
Taylor expanded in B around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f643.6
Applied rewrites3.6%
Applied rewrites55.5%
if 4.5000000000000003e-119 < B < 1.5500000000000001e-42Initial program 20.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites35.2%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.4
Applied rewrites26.4%
Applied rewrites26.4%
if 1.5500000000000001e-42 < B < 2.0500000000000001e189Initial program 23.4%
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
unpow2N/A
unpow2N/A
lower-hypot.f6442.9
Applied rewrites42.9%
Applied rewrites50.8%
Applied rewrites43.1%
if 2.0500000000000001e189 < B 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
unpow2N/A
unpow2N/A
lower-hypot.f6463.0
Applied rewrites63.0%
Applied rewrites92.9%
Taylor expanded in C around 0
Applied rewrites87.9%
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
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= A -1.85e+87)
(*
(sqrt (* (* t_0 2.0) (+ (fma (/ (* B_m B_m) A) -0.5 C) C)))
(/ (- (sqrt F)) t_0))
(if (<= A 2.9e-240)
(* (/ -1.0 (/ B_m (sqrt 2.0))) (* (sqrt (+ C B_m)) (sqrt F)))
(/ (* (sqrt (* (+ (hypot C B_m) C) 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) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (A <= -1.85e+87) {
tmp = sqrt(((t_0 * 2.0) * (fma(((B_m * B_m) / A), -0.5, C) + C))) * (-sqrt(F) / t_0);
} else if (A <= 2.9e-240) {
tmp = (-1.0 / (B_m / sqrt(2.0))) * (sqrt((C + B_m)) * sqrt(F));
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * F)) * sqrt(2.0)) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (A <= -1.85e+87) tmp = Float64(sqrt(Float64(Float64(t_0 * 2.0) * Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C))) * Float64(Float64(-sqrt(F)) / t_0)); elseif (A <= 2.9e-240) tmp = Float64(Float64(-1.0 / Float64(B_m / sqrt(2.0))) * Float64(sqrt(Float64(C + B_m)) * sqrt(F))); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * F)) * sqrt(2.0)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, -1.85e+87], N[(N[Sqrt[N[(N[(t$95$0 * 2.0), $MachinePrecision] * N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, 2.9e-240], N[(N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;A \leq -1.85 \cdot 10^{+87}:\\
\;\;\;\;\sqrt{\left(t\_0 \cdot 2\right) \cdot \left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right)} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{elif}\;A \leq 2.9 \cdot 10^{-240}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}}} \cdot \left(\sqrt{C + B\_m} \cdot \sqrt{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F} \cdot \sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if A < -1.85000000000000001e87Initial program 1.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites5.7%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6441.6
Applied rewrites41.6%
Applied rewrites41.3%
if -1.85000000000000001e87 < A < 2.9000000000000002e-240Initial program 21.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6423.4
Applied rewrites23.4%
Applied rewrites26.9%
Applied rewrites26.9%
Taylor expanded in C around 0
Applied rewrites24.4%
if 2.9000000000000002e-240 < A Initial program 19.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
unpow2N/A
unpow2N/A
lower-hypot.f6416.5
Applied rewrites16.5%
Applied rewrites16.5%
Final simplification24.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 (<= A -1.85e+87)
(*
(sqrt (* (* t_0 2.0) (+ (fma (/ (* B_m B_m) A) -0.5 C) C)))
(/ (- (sqrt F)) t_0))
(if (<= A 2.9e-240)
(* (/ -1.0 (/ B_m (sqrt 2.0))) (* (sqrt (+ C B_m)) (sqrt F)))
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* (+ (hypot B_m C) C) 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 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (A <= -1.85e+87) {
tmp = sqrt(((t_0 * 2.0) * (fma(((B_m * B_m) / A), -0.5, C) + C))) * (-sqrt(F) / t_0);
} else if (A <= 2.9e-240) {
tmp = (-1.0 / (B_m / sqrt(2.0))) * (sqrt((C + B_m)) * sqrt(F));
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt(((hypot(B_m, C) + C) * 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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (A <= -1.85e+87) tmp = Float64(sqrt(Float64(Float64(t_0 * 2.0) * Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C))) * Float64(Float64(-sqrt(F)) / t_0)); elseif (A <= 2.9e-240) tmp = Float64(Float64(-1.0 / Float64(B_m / sqrt(2.0))) * Float64(sqrt(Float64(C + B_m)) * sqrt(F))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(Float64(hypot(B_m, C) + C) * 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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, -1.85e+87], N[(N[Sqrt[N[(N[(t$95$0 * 2.0), $MachinePrecision] * N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, 2.9e-240], N[(N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision] + C), $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 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;A \leq -1.85 \cdot 10^{+87}:\\
\;\;\;\;\sqrt{\left(t\_0 \cdot 2\right) \cdot \left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\right)} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{elif}\;A \leq 2.9 \cdot 10^{-240}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}}} \cdot \left(\sqrt{C + B\_m} \cdot \sqrt{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{\left(\mathsf{hypot}\left(B\_m, C\right) + C\right) \cdot F}\\
\end{array}
\end{array}
if A < -1.85000000000000001e87Initial program 1.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites5.7%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6441.6
Applied rewrites41.6%
Applied rewrites41.3%
if -1.85000000000000001e87 < A < 2.9000000000000002e-240Initial program 21.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6423.4
Applied rewrites23.4%
Applied rewrites26.9%
Applied rewrites26.9%
Taylor expanded in C around 0
Applied rewrites24.4%
if 2.9000000000000002e-240 < A Initial program 19.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
unpow2N/A
unpow2N/A
lower-hypot.f6416.5
Applied rewrites16.5%
Final simplification24.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 (sqrt (/ F B_m)))
(t_1 (fma (* C A) -4.0 (* B_m B_m)))
(t_2 (* t_1 2.0))
(t_3 (+ (fma (/ (* B_m B_m) A) -0.5 C) C)))
(if (<= B_m 1.02e-137)
(/ (sqrt (* t_3 (* t_2 F))) (- t_1))
(if (<= B_m 4.5e-119)
(fma (* -0.5 (/ t_0 B_m)) (* (+ C A) (sqrt 2.0)) (* t_0 (- (sqrt 2.0))))
(if (<= B_m 2.7e-42)
(* (sqrt (* t_2 t_3)) (/ (- (sqrt F)) t_1))
(* (/ -1.0 (/ B_m (sqrt 2.0))) (* (sqrt (+ C B_m)) (sqrt 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((F / B_m));
double t_1 = fma((C * A), -4.0, (B_m * B_m));
double t_2 = t_1 * 2.0;
double t_3 = fma(((B_m * B_m) / A), -0.5, C) + C;
double tmp;
if (B_m <= 1.02e-137) {
tmp = sqrt((t_3 * (t_2 * F))) / -t_1;
} else if (B_m <= 4.5e-119) {
tmp = fma((-0.5 * (t_0 / B_m)), ((C + A) * sqrt(2.0)), (t_0 * -sqrt(2.0)));
} else if (B_m <= 2.7e-42) {
tmp = sqrt((t_2 * t_3)) * (-sqrt(F) / t_1);
} else {
tmp = (-1.0 / (B_m / sqrt(2.0))) * (sqrt((C + B_m)) * sqrt(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 = sqrt(Float64(F / B_m)) t_1 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_2 = Float64(t_1 * 2.0) t_3 = Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, C) + C) tmp = 0.0 if (B_m <= 1.02e-137) tmp = Float64(sqrt(Float64(t_3 * Float64(t_2 * F))) / Float64(-t_1)); elseif (B_m <= 4.5e-119) tmp = fma(Float64(-0.5 * Float64(t_0 / B_m)), Float64(Float64(C + A) * sqrt(2.0)), Float64(t_0 * Float64(-sqrt(2.0)))); elseif (B_m <= 2.7e-42) tmp = Float64(sqrt(Float64(t_2 * t_3)) * Float64(Float64(-sqrt(F)) / t_1)); else tmp = Float64(Float64(-1.0 / Float64(B_m / sqrt(2.0))) * Float64(sqrt(Float64(C + B_m)) * sqrt(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[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 2.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + C), $MachinePrecision] + C), $MachinePrecision]}, If[LessEqual[B$95$m, 1.02e-137], N[(N[Sqrt[N[(t$95$3 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[B$95$m, 4.5e-119], N[(N[(-0.5 * N[(t$95$0 / B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.7e-42], N[(N[Sqrt[N[(t$95$2 * t$95$3), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[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{\frac{F}{B\_m}}\\
t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := t\_1 \cdot 2\\
t_3 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C\right) + C\\
\mathbf{if}\;B\_m \leq 1.02 \cdot 10^{-137}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \left(t\_2 \cdot F\right)}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 4.5 \cdot 10^{-119}:\\
\;\;\;\;\mathsf{fma}\left(-0.5 \cdot \frac{t\_0}{B\_m}, \left(C + A\right) \cdot \sqrt{2}, t\_0 \cdot \left(-\sqrt{2}\right)\right)\\
\mathbf{elif}\;B\_m \leq 2.7 \cdot 10^{-42}:\\
\;\;\;\;\sqrt{t\_2 \cdot t\_3} \cdot \frac{-\sqrt{F}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}}} \cdot \left(\sqrt{C + B\_m} \cdot \sqrt{F}\right)\\
\end{array}
\end{array}
if B < 1.02e-137Initial program 14.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites15.9%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.1
Applied rewrites12.1%
Applied rewrites15.2%
if 1.02e-137 < B < 4.5000000000000003e-119Initial program 51.7%
Taylor expanded in B around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f643.6
Applied rewrites3.6%
Applied rewrites55.5%
if 4.5000000000000003e-119 < B < 2.69999999999999999e-42Initial program 20.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
Applied rewrites35.2%
Taylor expanded in A around -inf
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.4
Applied rewrites26.4%
Applied rewrites26.4%
if 2.69999999999999999e-42 < B Initial program 17.7%
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
unpow2N/A
unpow2N/A
lower-hypot.f6447.8
Applied rewrites47.8%
Applied rewrites61.0%
Applied rewrites61.1%
Taylor expanded in C around 0
Applied rewrites53.5%
Final simplification26.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1e+169) (* (/ (sqrt 2.0) B_m) (* (sqrt (+ C B_m)) (- (sqrt F)))) (* (/ (sqrt 2.0) (- B_m)) (sqrt (* (* 2.0 C) 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 (C <= 1e+169) {
tmp = (sqrt(2.0) / B_m) * (sqrt((C + B_m)) * -sqrt(F));
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt(((2.0 * C) * F));
}
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 <= 1d+169) then
tmp = (sqrt(2.0d0) / b_m) * (sqrt((c + b_m)) * -sqrt(f))
else
tmp = (sqrt(2.0d0) / -b_m) * sqrt(((2.0d0 * c) * f))
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 <= 1e+169) {
tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + B_m)) * -Math.sqrt(F));
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt(((2.0 * C) * 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 C <= 1e+169: tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + B_m)) * -math.sqrt(F)) else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt(((2.0 * C) * 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 (C <= 1e+169) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + B_m)) * Float64(-sqrt(F)))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(Float64(2.0 * C) * 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 (C <= 1e+169)
tmp = (sqrt(2.0) / B_m) * (sqrt((C + B_m)) * -sqrt(F));
else
tmp = (sqrt(2.0) / -B_m) * sqrt(((2.0 * C) * 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[C, 1e+169], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(N[(2.0 * C), $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}\;C \leq 10^{+169}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + B\_m} \cdot \left(-\sqrt{F}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{\left(2 \cdot C\right) \cdot F}\\
\end{array}
\end{array}
if C < 9.99999999999999934e168Initial program 18.2%
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
unpow2N/A
unpow2N/A
lower-hypot.f6416.6
Applied rewrites16.6%
Applied rewrites20.9%
Taylor expanded in C around 0
Applied rewrites18.0%
if 9.99999999999999934e168 < C Initial program 1.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6410.8
Applied rewrites10.8%
Taylor expanded in B around 0
Applied rewrites10.8%
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 (if (<= C 1e+169) (/ (sqrt (* F 2.0)) (- (sqrt B_m))) (* (/ (sqrt 2.0) (- B_m)) (sqrt (* (* 2.0 C) 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 (C <= 1e+169) {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt(((2.0 * C) * F));
}
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 <= 1d+169) then
tmp = sqrt((f * 2.0d0)) / -sqrt(b_m)
else
tmp = (sqrt(2.0d0) / -b_m) * sqrt(((2.0d0 * c) * f))
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 <= 1e+169) {
tmp = Math.sqrt((F * 2.0)) / -Math.sqrt(B_m);
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt(((2.0 * C) * 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 C <= 1e+169: tmp = math.sqrt((F * 2.0)) / -math.sqrt(B_m) else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt(((2.0 * C) * 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 (C <= 1e+169) tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(Float64(2.0 * C) * 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 (C <= 1e+169)
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
else
tmp = (sqrt(2.0) / -B_m) * sqrt(((2.0 * C) * 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[C, 1e+169], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(N[(2.0 * C), $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}\;C \leq 10^{+169}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{\left(2 \cdot C\right) \cdot F}\\
\end{array}
\end{array}
if C < 9.99999999999999934e168Initial program 18.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6415.2
Applied rewrites15.2%
Applied rewrites18.2%
if 9.99999999999999934e168 < C Initial program 1.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6410.8
Applied rewrites10.8%
Taylor expanded in B around 0
Applied rewrites10.8%
Final simplification17.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1e+169) (/ (sqrt (* F 2.0)) (- (sqrt B_m))) (* (/ 2.0 (- B_m)) (sqrt (* C 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 (C <= 1e+169) {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
} else {
tmp = (2.0 / -B_m) * sqrt((C * F));
}
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 <= 1d+169) then
tmp = sqrt((f * 2.0d0)) / -sqrt(b_m)
else
tmp = (2.0d0 / -b_m) * sqrt((c * f))
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 <= 1e+169) {
tmp = Math.sqrt((F * 2.0)) / -Math.sqrt(B_m);
} else {
tmp = (2.0 / -B_m) * Math.sqrt((C * 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 C <= 1e+169: tmp = math.sqrt((F * 2.0)) / -math.sqrt(B_m) else: tmp = (2.0 / -B_m) * math.sqrt((C * 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 (C <= 1e+169) tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); else tmp = Float64(Float64(2.0 / Float64(-B_m)) * sqrt(Float64(C * 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 (C <= 1e+169)
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
else
tmp = (2.0 / -B_m) * sqrt((C * 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[C, 1e+169], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision], N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C * 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}\;C \leq 10^{+169}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 9.99999999999999934e168Initial program 18.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6415.2
Applied rewrites15.2%
Applied rewrites18.2%
if 9.99999999999999934e168 < C Initial program 1.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6410.8
Applied rewrites10.8%
Applied rewrites14.0%
Taylor expanded in B around 0
Applied rewrites10.7%
Final simplification17.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1e+169) (* (- (sqrt F)) (sqrt (/ 2.0 B_m))) (* (/ 2.0 (- B_m)) (sqrt (* C 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 (C <= 1e+169) {
tmp = -sqrt(F) * sqrt((2.0 / B_m));
} else {
tmp = (2.0 / -B_m) * sqrt((C * F));
}
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 <= 1d+169) then
tmp = -sqrt(f) * sqrt((2.0d0 / b_m))
else
tmp = (2.0d0 / -b_m) * sqrt((c * f))
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 <= 1e+169) {
tmp = -Math.sqrt(F) * Math.sqrt((2.0 / B_m));
} else {
tmp = (2.0 / -B_m) * Math.sqrt((C * 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 C <= 1e+169: tmp = -math.sqrt(F) * math.sqrt((2.0 / B_m)) else: tmp = (2.0 / -B_m) * math.sqrt((C * 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 (C <= 1e+169) tmp = Float64(Float64(-sqrt(F)) * sqrt(Float64(2.0 / B_m))); else tmp = Float64(Float64(2.0 / Float64(-B_m)) * sqrt(Float64(C * 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 (C <= 1e+169)
tmp = -sqrt(F) * sqrt((2.0 / B_m));
else
tmp = (2.0 / -B_m) * sqrt((C * 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[C, 1e+169], N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C * 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}\;C \leq 10^{+169}:\\
\;\;\;\;\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 9.99999999999999934e168Initial program 18.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6415.2
Applied rewrites15.2%
Applied rewrites15.3%
Applied rewrites18.1%
if 9.99999999999999934e168 < C Initial program 1.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6410.8
Applied rewrites10.8%
Applied rewrites14.0%
Taylor expanded in B around 0
Applied rewrites10.7%
Final simplification17.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 8.5e+168) (- (sqrt (* F (/ 2.0 B_m)))) (* (/ 2.0 (- B_m)) (sqrt (* C 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 (C <= 8.5e+168) {
tmp = -sqrt((F * (2.0 / B_m)));
} else {
tmp = (2.0 / -B_m) * sqrt((C * F));
}
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 <= 8.5d+168) then
tmp = -sqrt((f * (2.0d0 / b_m)))
else
tmp = (2.0d0 / -b_m) * sqrt((c * f))
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 <= 8.5e+168) {
tmp = -Math.sqrt((F * (2.0 / B_m)));
} else {
tmp = (2.0 / -B_m) * Math.sqrt((C * 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 C <= 8.5e+168: tmp = -math.sqrt((F * (2.0 / B_m))) else: tmp = (2.0 / -B_m) * math.sqrt((C * 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 (C <= 8.5e+168) tmp = Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))); else tmp = Float64(Float64(2.0 / Float64(-B_m)) * sqrt(Float64(C * 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 (C <= 8.5e+168)
tmp = -sqrt((F * (2.0 / B_m)));
else
tmp = (2.0 / -B_m) * sqrt((C * 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[C, 8.5e+168], (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C * 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}\;C \leq 8.5 \cdot 10^{+168}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 8.50000000000000069e168Initial program 18.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6415.2
Applied rewrites15.2%
Applied rewrites15.3%
Applied rewrites15.3%
if 8.50000000000000069e168 < C Initial program 1.6%
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
unpow2N/A
unpow2N/A
lower-hypot.f6410.8
Applied rewrites10.8%
Applied rewrites14.0%
Taylor expanded in B around 0
Applied rewrites10.7%
Final simplification14.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 (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 16.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6413.6
Applied rewrites13.6%
Applied rewrites13.7%
Applied rewrites13.7%
herbie shell --seed 2024327
(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))))