
(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 21 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 (/ (* B_m B_m) A))
(t_1 (fma -0.5 t_0 (* C 2.0)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (- (sqrt F)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (fma (* -4.0 A) C (* B_m B_m))))
(if (<= t_5 -5e+180)
(/
(*
(sqrt (fma t_0 -0.5 (* C 2.0)))
(* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) t_3))
t_4)
(if (<= t_5 -1e-200)
(*
(/ (sqrt (* (* 2.0 F) t_2)) -1.0)
(/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) t_2))
(if (<= t_5 0.0)
(* (sqrt (* t_1 2.0)) (* (sqrt t_6) (/ t_3 t_6)))
(if (<= t_5 INFINITY)
(/
(*
(- (sqrt (* (fma (* C A) -4.0 (* B_m B_m)) F)))
(sqrt (* 2.0 t_1)))
t_4)
(* (sqrt (* F 2.0)) (/ (sqrt (+ (hypot C B_m) C)) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) / A;
double t_1 = fma(-0.5, t_0, (C * 2.0));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = -sqrt(F);
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = fma((-4.0 * A), C, (B_m * B_m));
double tmp;
if (t_5 <= -5e+180) {
tmp = (sqrt(fma(t_0, -0.5, (C * 2.0))) * (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * t_3)) / t_4;
} else if (t_5 <= -1e-200) {
tmp = (sqrt(((2.0 * F) * t_2)) / -1.0) * (sqrt(((hypot((A - C), B_m) + A) + C)) / t_2);
} else if (t_5 <= 0.0) {
tmp = sqrt((t_1 * 2.0)) * (sqrt(t_6) * (t_3 / t_6));
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((fma((C * A), -4.0, (B_m * B_m)) * F)) * sqrt((2.0 * t_1))) / t_4;
} else {
tmp = sqrt((F * 2.0)) * (sqrt((hypot(C, B_m) + C)) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) / A) t_1 = fma(-0.5, t_0, Float64(C * 2.0)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = Float64(-sqrt(F)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) tmp = 0.0 if (t_5 <= -5e+180) tmp = Float64(Float64(sqrt(fma(t_0, -0.5, Float64(C * 2.0))) * Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * t_3)) / t_4); elseif (t_5 <= -1e-200) tmp = Float64(Float64(sqrt(Float64(Float64(2.0 * F) * t_2)) / -1.0) * Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / t_2)); elseif (t_5 <= 0.0) tmp = Float64(sqrt(Float64(t_1 * 2.0)) * Float64(sqrt(t_6) * Float64(t_3 / t_6))); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(fma(Float64(C * A), -4.0, Float64(B_m * B_m)) * F))) * sqrt(Float64(2.0 * t_1))) / t_4); else tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * t$95$0 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-N[Sqrt[F], $MachinePrecision])}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, -5e+180], N[(N[(N[Sqrt[N[(t$95$0 * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, -1e-200], N[(N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$6], $MachinePrecision] * N[(t$95$3 / t$95$6), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{B\_m \cdot B\_m}{A}\\
t_1 := \mathsf{fma}\left(-0.5, t\_0, C \cdot 2\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := -\sqrt{F}\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_5 \leq -5 \cdot 10^{+180}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(t\_0, -0.5, C \cdot 2\right)} \cdot \left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot t\_3\right)}{t\_4}\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-200}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot F\right) \cdot t\_2}}{-1} \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{t\_2}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\sqrt{t\_1 \cdot 2} \cdot \left(\sqrt{t\_6} \cdot \frac{t\_3}{t\_6}\right)\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right) \cdot F}\right) \cdot \sqrt{2 \cdot t\_1}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-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))) < -4.9999999999999996e180Initial program 5.4%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6412.9
Applied rewrites12.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites19.4%
Applied rewrites34.7%
if -4.9999999999999996e180 < (/.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.9999999999999998e-201Initial program 98.1%
Applied rewrites98.2%
if -9.9999999999999998e-201 < (/.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.4%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.8
Applied rewrites18.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites21.6%
Applied rewrites21.4%
Applied rewrites20.5%
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 53.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6435.0
Applied rewrites35.0%
Applied rewrites34.9%
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.7
Applied rewrites17.7%
Applied rewrites17.8%
Applied rewrites28.7%
Applied rewrites28.7%
Final simplification40.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 -0.5 (/ (* B_m B_m) A) (* C 2.0)))
(t_1 (fma (* -4.0 A) C (* B_m B_m)))
(t_2 (* (sqrt (* t_0 2.0)) (* (sqrt t_1) (/ (- (sqrt F)) t_1))))
(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)))
(t_5 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_4 (- INFINITY))
t_2
(if (<= t_4 -1e-200)
(*
(/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) -1.0)
(/ (sqrt (* (* 2.0 F) t_5)) t_5))
(if (<= t_4 0.0)
t_2
(if (<= t_4 INFINITY)
(/
(*
(- (sqrt (* (fma (* C A) -4.0 (* B_m B_m)) F)))
(sqrt (* 2.0 t_0)))
t_3)
(* (sqrt (* F 2.0)) (/ (sqrt (+ (hypot C B_m) C)) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double t_1 = fma((-4.0 * A), C, (B_m * B_m));
double t_2 = sqrt((t_0 * 2.0)) * (sqrt(t_1) * (-sqrt(F) / t_1));
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 t_5 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_4 <= -1e-200) {
tmp = (sqrt(((hypot((A - C), B_m) + A) + C)) / -1.0) * (sqrt(((2.0 * F) * t_5)) / t_5);
} else if (t_4 <= 0.0) {
tmp = t_2;
} else if (t_4 <= ((double) INFINITY)) {
tmp = (-sqrt((fma((C * A), -4.0, (B_m * B_m)) * F)) * sqrt((2.0 * t_0))) / t_3;
} else {
tmp = sqrt((F * 2.0)) * (sqrt((hypot(C, B_m) + C)) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) t_1 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_2 = Float64(sqrt(Float64(t_0 * 2.0)) * Float64(sqrt(t_1) * Float64(Float64(-sqrt(F)) / t_1))) 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)) t_5 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = t_2; elseif (t_4 <= -1e-200) tmp = Float64(Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / -1.0) * Float64(sqrt(Float64(Float64(2.0 * F) * t_5)) / t_5)); elseif (t_4 <= 0.0) tmp = t_2; elseif (t_4 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(fma(Float64(C * A), -4.0, Float64(B_m * B_m)) * F))) * sqrt(Float64(2.0 * t_0))) / t_3); else tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$1], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$1), $MachinePrecision]), $MachinePrecision]), $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]}, 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)], t$95$2, If[LessEqual[t$95$4, -1e-200], N[(N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], t$95$2, If[LessEqual[t$95$4, Infinity], N[(N[((-N[Sqrt[N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_2 := \sqrt{t\_0 \cdot 2} \cdot \left(\sqrt{t\_1} \cdot \frac{-\sqrt{F}}{t\_1}\right)\\
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}\\
t_5 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-200}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{-1} \cdot \frac{\sqrt{\left(2 \cdot F\right) \cdot t\_5}}{t\_5}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right) \cdot F}\right) \cdot \sqrt{2 \cdot t\_0}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-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.0 or -9.9999999999999998e-201 < (/.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.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.2
Applied rewrites15.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites19.7%
Applied rewrites19.6%
Applied rewrites25.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999998e-201Initial program 98.1%
Applied rewrites98.2%
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 53.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6435.0
Applied rewrites35.0%
Applied rewrites34.9%
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.7
Applied rewrites17.7%
Applied rewrites17.8%
Applied rewrites28.7%
Applied rewrites28.7%
Final simplification39.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 (* -4.0 A) C (* B_m B_m)))
(t_1
(*
(sqrt (* (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)) 2.0))
(* (sqrt t_0) (/ (- (sqrt F)) t_0))))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4 (fma -4.0 (* C A) (* B_m B_m)))
(t_5
(*
(/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) -1.0)
(/ (sqrt (* (* 2.0 F) t_4)) t_4))))
(if (<= t_3 (- INFINITY))
t_1
(if (<= t_3 -1e-200)
t_5
(if (<= t_3 0.0)
t_1
(if (<= t_3 INFINITY)
t_5
(* (sqrt (* F 2.0)) (/ (sqrt (+ (hypot C B_m) C)) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = sqrt((fma(-0.5, ((B_m * B_m) / A), (C * 2.0)) * 2.0)) * (sqrt(t_0) * (-sqrt(F) / t_0));
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = fma(-4.0, (C * A), (B_m * B_m));
double t_5 = (sqrt(((hypot((A - C), B_m) + A) + C)) / -1.0) * (sqrt(((2.0 * F) * t_4)) / t_4);
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_1;
} else if (t_3 <= -1e-200) {
tmp = t_5;
} else if (t_3 <= 0.0) {
tmp = t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_5;
} else {
tmp = sqrt((F * 2.0)) * (sqrt((hypot(C, B_m) + C)) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) * 2.0)) * Float64(sqrt(t_0) * Float64(Float64(-sqrt(F)) / t_0))) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_5 = Float64(Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / -1.0) * Float64(sqrt(Float64(Float64(2.0 * F) * t_4)) / t_4)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_1; elseif (t_3 <= -1e-200) tmp = t_5; elseif (t_3 <= 0.0) tmp = t_1; elseif (t_3 <= Inf) tmp = t_5; else tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * 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$2)), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$1, If[LessEqual[t$95$3, -1e-200], t$95$5, If[LessEqual[t$95$3, 0.0], t$95$1, If[LessEqual[t$95$3, Infinity], t$95$5, N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right) \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\right)\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_5 := \frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{-1} \cdot \frac{\sqrt{\left(2 \cdot F\right) \cdot t\_4}}{t\_4}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-200}:\\
\;\;\;\;t\_5\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_5\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-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.0 or -9.9999999999999998e-201 < (/.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.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.2
Applied rewrites15.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites19.7%
Applied rewrites19.6%
Applied rewrites25.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999998e-201 or -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 84.8%
Applied rewrites94.0%
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.7
Applied rewrites17.7%
Applied rewrites17.8%
Applied rewrites28.7%
Applied rewrites28.7%
Final simplification43.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 (* -4.0 A) C (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(*
(sqrt (* (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)) 2.0))
(* (sqrt t_0) (/ (- (sqrt F)) t_0))))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_4 (fma -4.0 (* C A) (* B_m B_m)))
(t_5
(*
(/ (sqrt (* (* 2.0 F) t_4)) -1.0)
(/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) t_4))))
(if (<= t_3 (- INFINITY))
t_2
(if (<= t_3 -1e-200)
t_5
(if (<= t_3 0.0)
t_2
(if (<= t_3 INFINITY)
t_5
(* (sqrt (* F 2.0)) (/ (sqrt (+ (hypot C B_m) C)) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt((fma(-0.5, ((B_m * B_m) / A), (C * 2.0)) * 2.0)) * (sqrt(t_0) * (-sqrt(F) / t_0));
double t_3 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_4 = fma(-4.0, (C * A), (B_m * B_m));
double t_5 = (sqrt(((2.0 * F) * t_4)) / -1.0) * (sqrt(((hypot((A - C), B_m) + A) + C)) / t_4);
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_3 <= -1e-200) {
tmp = t_5;
} else if (t_3 <= 0.0) {
tmp = t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_5;
} else {
tmp = sqrt((F * 2.0)) * (sqrt((hypot(C, B_m) + C)) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) * 2.0)) * Float64(sqrt(t_0) * Float64(Float64(-sqrt(F)) / t_0))) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_4 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_5 = Float64(Float64(sqrt(Float64(Float64(2.0 * F) * t_4)) / -1.0) * Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / t_4)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_2; elseif (t_3 <= -1e-200) tmp = t_5; elseif (t_3 <= 0.0) tmp = t_2; elseif (t_3 <= Inf) tmp = t_5; else tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * 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$1)), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] / -1.0), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$2, If[LessEqual[t$95$3, -1e-200], t$95$5, If[LessEqual[t$95$3, 0.0], t$95$2, If[LessEqual[t$95$3, Infinity], t$95$5, N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right) \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\right)\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_4 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_5 := \frac{\sqrt{\left(2 \cdot F\right) \cdot t\_4}}{-1} \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{t\_4}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-200}:\\
\;\;\;\;t\_5\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_5\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-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.0 or -9.9999999999999998e-201 < (/.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.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.2
Applied rewrites15.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites19.7%
Applied rewrites19.6%
Applied rewrites25.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999998e-201 or -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 84.8%
Applied rewrites93.9%
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.7
Applied rewrites17.7%
Applied rewrites17.8%
Applied rewrites28.7%
Applied rewrites28.7%
Final simplification43.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 -0.5 (/ (* B_m B_m) A) (* C 2.0)))
(t_1 (fma (* C A) -4.0 (* B_m B_m)))
(t_2 (fma (* -4.0 A) C (* B_m B_m)))
(t_3 (fma -4.0 (* C A) (* B_m B_m)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (* (sqrt (* t_0 2.0)) (* (sqrt t_2) (/ (- (sqrt F)) t_2)))))
(if (<= t_5 (- INFINITY))
t_6
(if (<= t_5 -1e-200)
(/ (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) (* (* 2.0 F) t_3))) (- t_3))
(if (<= t_5 0.0)
t_6
(if (<= t_5 INFINITY)
(/ -1.0 (/ t_1 (sqrt (* t_0 (* (* t_1 F) 2.0)))))
(* (sqrt (* F 2.0)) (/ (sqrt (+ (hypot C B_m) C)) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double t_1 = fma((C * A), -4.0, (B_m * B_m));
double t_2 = fma((-4.0 * A), C, (B_m * B_m));
double t_3 = fma(-4.0, (C * A), (B_m * B_m));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = sqrt((t_0 * 2.0)) * (sqrt(t_2) * (-sqrt(F) / t_2));
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = t_6;
} else if (t_5 <= -1e-200) {
tmp = sqrt((((hypot((A - C), B_m) + A) + C) * ((2.0 * F) * t_3))) / -t_3;
} else if (t_5 <= 0.0) {
tmp = t_6;
} else if (t_5 <= ((double) INFINITY)) {
tmp = -1.0 / (t_1 / sqrt((t_0 * ((t_1 * F) * 2.0))));
} else {
tmp = sqrt((F * 2.0)) * (sqrt((hypot(C, B_m) + C)) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) t_1 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_2 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_3 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = Float64(sqrt(Float64(t_0 * 2.0)) * Float64(sqrt(t_2) * Float64(Float64(-sqrt(F)) / t_2))) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = t_6; elseif (t_5 <= -1e-200) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * Float64(Float64(2.0 * F) * t_3))) / Float64(-t_3)); elseif (t_5 <= 0.0) tmp = t_6; elseif (t_5 <= Inf) tmp = Float64(-1.0 / Float64(t_1 / sqrt(Float64(t_0 * Float64(Float64(t_1 * F) * 2.0))))); else tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$2], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], t$95$6, If[LessEqual[t$95$5, -1e-200], N[(N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$5, 0.0], t$95$6, If[LessEqual[t$95$5, Infinity], N[(-1.0 / N[(t$95$1 / N[Sqrt[N[(t$95$0 * N[(N[(t$95$1 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_3 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := \sqrt{t\_0 \cdot 2} \cdot \left(\sqrt{t\_2} \cdot \frac{-\sqrt{F}}{t\_2}\right)\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-200}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_3\right)}}{-t\_3}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{-1}{\frac{t\_1}{\sqrt{t\_0 \cdot \left(\left(t\_1 \cdot F\right) \cdot 2\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-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.0 or -9.9999999999999998e-201 < (/.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.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.2
Applied rewrites15.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites19.7%
Applied rewrites19.6%
Applied rewrites25.3%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999998e-201Initial program 98.1%
Applied rewrites98.1%
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 53.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6435.0
Applied rewrites35.0%
Applied rewrites35.0%
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.7
Applied rewrites17.7%
Applied rewrites17.8%
Applied rewrites28.7%
Applied rewrites28.7%
Final simplification39.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 (* -4.0 A) C (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)))
(t_4 (* (sqrt (* t_3 2.0)) (* (sqrt t_0) (/ (- (sqrt F)) t_0))))
(t_5 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_2 -1e+52)
t_4
(if (<= t_2 -1e-200)
(/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
(if (<= t_2 0.0)
t_4
(if (<= t_2 INFINITY)
(/ -1.0 (/ t_5 (sqrt (* t_3 (* (* t_5 F) 2.0)))))
(/ (* (sqrt (+ C B_m)) (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) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double t_4 = sqrt((t_3 * 2.0)) * (sqrt(t_0) * (-sqrt(F) / t_0));
double t_5 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_2 <= -1e+52) {
tmp = t_4;
} else if (t_2 <= -1e-200) {
tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
} else if (t_2 <= 0.0) {
tmp = t_4;
} else if (t_2 <= ((double) INFINITY)) {
tmp = -1.0 / (t_5 / sqrt((t_3 * ((t_5 * F) * 2.0))));
} else {
tmp = (sqrt((C + B_m)) * sqrt((F * 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(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) t_4 = Float64(sqrt(Float64(t_3 * 2.0)) * Float64(sqrt(t_0) * Float64(Float64(-sqrt(F)) / t_0))) t_5 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_2 <= -1e+52) tmp = t_4; elseif (t_2 <= -1e-200) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m)); elseif (t_2 <= 0.0) tmp = t_4; elseif (t_2 <= Inf) tmp = Float64(-1.0 / Float64(t_5 / sqrt(Float64(t_3 * Float64(Float64(t_5 * F) * 2.0))))); else tmp = Float64(Float64(sqrt(Float64(C + B_m)) * sqrt(Float64(F * 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * 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$1)), $MachinePrecision]}, Block[{t$95$3 = N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$3 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+52], t$95$4, If[LessEqual[t$95$2, -1e-200], 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], If[LessEqual[t$95$2, 0.0], t$95$4, If[LessEqual[t$95$2, Infinity], N[(-1.0 / N[(t$95$5 / N[Sqrt[N[(t$95$3 * N[(N[(t$95$5 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 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(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
t_4 := \sqrt{t\_3 \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\right)\\
t_5 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+52}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-200}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{-1}{\frac{t\_5}{\sqrt{t\_3 \cdot \left(\left(t\_5 \cdot F\right) \cdot 2\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C + B\_m} \cdot \sqrt{F \cdot 2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999999e51 or -9.9999999999999998e-201 < (/.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 15.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.8
Applied rewrites18.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites22.8%
Applied rewrites22.6%
Applied rewrites27.6%
if -9.9999999999999999e51 < (/.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.9999999999999998e-201Initial program 99.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
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6444.4
Applied rewrites44.4%
Applied rewrites44.5%
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 53.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6435.0
Applied rewrites35.0%
Applied rewrites35.0%
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.7
Applied rewrites17.7%
Applied rewrites17.8%
Applied rewrites28.7%
Taylor expanded in C around 0
Applied rewrites23.2%
Final simplification28.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 (* -4.0 A) C (* B_m B_m)))
(t_1 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(if (<= (pow B_m 2.0) 1e-243)
(* (sqrt (* t_1 2.0)) (* (sqrt t_0) (/ (- (sqrt F)) t_0)))
(if (<= (pow B_m 2.0) 200.0)
(/ (sqrt (* (* (* t_0 t_1) 2.0) F)) (- t_0))
(/ (* (sqrt (+ (hypot C B_m) C)) (- (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) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double tmp;
if (pow(B_m, 2.0) <= 1e-243) {
tmp = sqrt((t_1 * 2.0)) * (sqrt(t_0) * (-sqrt(F) / t_0));
} else if (pow(B_m, 2.0) <= 200.0) {
tmp = sqrt((((t_0 * t_1) * 2.0) * F)) / -t_0;
} else {
tmp = (sqrt((hypot(C, B_m) + C)) * -sqrt((F * 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(-4.0 * A), C, Float64(B_m * B_m)) t_1 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-243) tmp = Float64(sqrt(Float64(t_1 * 2.0)) * Float64(sqrt(t_0) * Float64(Float64(-sqrt(F)) / t_0))); elseif ((B_m ^ 2.0) <= 200.0) tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * t_1) * 2.0) * F)) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(hypot(C, B_m) + C)) * Float64(-sqrt(Float64(F * 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-243], N[(N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 200.0], N[(N[Sqrt[N[(N[(N[(t$95$0 * t$95$1), $MachinePrecision] * 2.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(F * 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(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-243}:\\
\;\;\;\;\sqrt{t\_1 \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 200:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot t\_1\right) \cdot 2\right) \cdot F}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C} \cdot \left(-\sqrt{F \cdot 2}\right)}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-244Initial program 17.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6417.3
Applied rewrites17.3%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites17.6%
Applied rewrites17.4%
Applied rewrites21.5%
if 9.99999999999999995e-244 < (pow.f64 B #s(literal 2 binary64)) < 200Initial program 35.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6425.5
Applied rewrites25.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites22.5%
Applied rewrites22.5%
Applied rewrites25.3%
if 200 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.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.f6427.0
Applied rewrites27.0%
Applied rewrites27.0%
Applied rewrites36.8%
Final simplification29.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m)))
(t_1 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(if (<= (pow B_m 2.0) 1e-243)
(* (sqrt (* t_1 2.0)) (* (sqrt t_0) (/ (- (sqrt F)) t_0)))
(if (<= (pow B_m 2.0) 200.0)
(/ (sqrt (* (* (* t_0 t_1) 2.0) F)) (- t_0))
(* (sqrt (* F 2.0)) (/ (sqrt (+ (hypot C B_m) C)) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double tmp;
if (pow(B_m, 2.0) <= 1e-243) {
tmp = sqrt((t_1 * 2.0)) * (sqrt(t_0) * (-sqrt(F) / t_0));
} else if (pow(B_m, 2.0) <= 200.0) {
tmp = sqrt((((t_0 * t_1) * 2.0) * F)) / -t_0;
} else {
tmp = sqrt((F * 2.0)) * (sqrt((hypot(C, B_m) + C)) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-243) tmp = Float64(sqrt(Float64(t_1 * 2.0)) * Float64(sqrt(t_0) * Float64(Float64(-sqrt(F)) / t_0))); elseif ((B_m ^ 2.0) <= 200.0) tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * t_1) * 2.0) * F)) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-243], N[(N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 200.0], N[(N[Sqrt[N[(N[(N[(t$95$0 * t$95$1), $MachinePrecision] * 2.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-243}:\\
\;\;\;\;\sqrt{t\_1 \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 200:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot t\_1\right) \cdot 2\right) \cdot F}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999995e-244Initial program 17.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6417.3
Applied rewrites17.3%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites17.6%
Applied rewrites17.4%
Applied rewrites21.5%
if 9.99999999999999995e-244 < (pow.f64 B #s(literal 2 binary64)) < 200Initial program 35.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6425.5
Applied rewrites25.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites22.5%
Applied rewrites22.5%
Applied rewrites25.3%
if 200 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.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.f6427.0
Applied rewrites27.0%
Applied rewrites27.0%
Applied rewrites36.8%
Applied rewrites36.9%
Final simplification29.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e+73)
(*
(sqrt (* (* (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)) 2.0) t_0))
(/ (- (sqrt F)) t_0))
(/ (* (sqrt (+ C B_m)) (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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e+73) {
tmp = sqrt(((fma(((B_m * B_m) / A), -0.5, (C * 2.0)) * 2.0) * t_0)) * (-sqrt(F) / t_0);
} else {
tmp = (sqrt((C + B_m)) * sqrt((F * 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(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e+73) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) * 2.0) * t_0)) * Float64(Float64(-sqrt(F)) / t_0)); else tmp = Float64(Float64(sqrt(Float64(C + B_m)) * sqrt(Float64(F * 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[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+73], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 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(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{+73}:\\
\;\;\;\;\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right) \cdot 2\right) \cdot t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C + B\_m} \cdot \sqrt{F \cdot 2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999983e72Initial program 27.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.1
Applied rewrites19.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites18.8%
Applied rewrites18.7%
if 9.99999999999999983e72 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.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.f6428.1
Applied rewrites28.1%
Applied rewrites28.2%
Applied rewrites39.6%
Taylor expanded in C around 0
Applied rewrites33.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 (<= (pow B_m 2.0) 200.0)
(/
(sqrt (* (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)) (* (* t_0 F) 2.0)))
(- t_0))
(/ (* (sqrt (+ C B_m)) (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) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 200.0) {
tmp = sqrt((fma(-0.5, ((B_m * B_m) / A), (C * 2.0)) * ((t_0 * F) * 2.0))) / -t_0;
} else {
tmp = (sqrt((C + B_m)) * sqrt((F * 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) <= 200.0) tmp = Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(C + B_m)) * sqrt(Float64(F * 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[N[Power[B$95$m, 2.0], $MachinePrecision], 200.0], N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 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 200:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C + B\_m} \cdot \sqrt{F \cdot 2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 200Initial program 25.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.7
Applied rewrites20.7%
Applied rewrites20.7%
if 200 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.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.f6427.0
Applied rewrites27.0%
Applied rewrites27.0%
Applied rewrites36.8%
Taylor expanded in C around 0
Applied rewrites30.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 (* -4.0 A) C (* B_m B_m))))
(if (<= (pow B_m 2.0) 200.0)
(/
(sqrt (* (* (* t_0 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) 2.0) F))
(- t_0))
(/ (* (sqrt (+ C B_m)) (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) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 200.0) {
tmp = sqrt((((t_0 * fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) * 2.0) * F)) / -t_0;
} else {
tmp = (sqrt((C + B_m)) * sqrt((F * 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(-4.0 * A), C, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 200.0) tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) * 2.0) * F)) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(C + B_m)) * sqrt(Float64(F * 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 200.0], N[(N[Sqrt[N[(N[(N[(t$95$0 * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 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(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 200:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\right) \cdot 2\right) \cdot F}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C + B\_m} \cdot \sqrt{F \cdot 2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 200Initial program 25.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.7
Applied rewrites20.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites19.6%
Applied rewrites19.5%
Applied rewrites19.1%
if 200 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.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.f6427.0
Applied rewrites27.0%
Applied rewrites27.0%
Applied rewrites36.8%
Taylor expanded in C around 0
Applied rewrites30.4%
Final simplification24.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 (* -4.0 A) C (* B_m B_m)))
(t_1 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(if (<= B_m 1.1e-121)
(* (sqrt (* t_1 2.0)) (* (sqrt t_0) (/ (- (sqrt F)) t_0)))
(if (<= B_m 20.0)
(/ (sqrt (* (* (* t_0 t_1) 2.0) F)) (- t_0))
(/ (* (sqrt (+ C B_m)) (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) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double tmp;
if (B_m <= 1.1e-121) {
tmp = sqrt((t_1 * 2.0)) * (sqrt(t_0) * (-sqrt(F) / t_0));
} else if (B_m <= 20.0) {
tmp = sqrt((((t_0 * t_1) * 2.0) * F)) / -t_0;
} else {
tmp = (sqrt((C + B_m)) * sqrt((F * 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(-4.0 * A), C, Float64(B_m * B_m)) t_1 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) tmp = 0.0 if (B_m <= 1.1e-121) tmp = Float64(sqrt(Float64(t_1 * 2.0)) * Float64(sqrt(t_0) * Float64(Float64(-sqrt(F)) / t_0))); elseif (B_m <= 20.0) tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * t_1) * 2.0) * F)) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(C + B_m)) * sqrt(Float64(F * 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.1e-121], N[(N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[((-N[Sqrt[F], $MachinePrecision]) / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 20.0], N[(N[Sqrt[N[(N[(N[(t$95$0 * t$95$1), $MachinePrecision] * 2.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 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(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
\mathbf{if}\;B\_m \leq 1.1 \cdot 10^{-121}:\\
\;\;\;\;\sqrt{t\_1 \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{-\sqrt{F}}{t\_0}\right)\\
\mathbf{elif}\;B\_m \leq 20:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot t\_1\right) \cdot 2\right) \cdot F}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C + B\_m} \cdot \sqrt{F \cdot 2}}{-B\_m}\\
\end{array}
\end{array}
if B < 1.10000000000000011e-121Initial program 19.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6411.6
Applied rewrites11.6%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites11.5%
Applied rewrites11.4%
Applied rewrites13.5%
if 1.10000000000000011e-121 < B < 20Initial program 35.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6427.5
Applied rewrites27.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites29.2%
Applied rewrites29.1%
Applied rewrites30.1%
if 20 < B Initial program 20.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.f6451.7
Applied rewrites51.7%
Applied rewrites51.8%
Applied rewrites71.3%
Taylor expanded in C around 0
Applied rewrites61.2%
Final simplification26.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (sqrt (* F 2.0))))
(if (<= C 6.5e+220)
(/ (* (sqrt (+ C B_m)) t_0) (- B_m))
(/ (* (* (sqrt C) (sqrt 2.0)) t_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 = sqrt((F * 2.0));
double tmp;
if (C <= 6.5e+220) {
tmp = (sqrt((C + B_m)) * t_0) / -B_m;
} else {
tmp = ((sqrt(C) * sqrt(2.0)) * t_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) :: t_0
real(8) :: tmp
t_0 = sqrt((f * 2.0d0))
if (c <= 6.5d+220) then
tmp = (sqrt((c + b_m)) * t_0) / -b_m
else
tmp = ((sqrt(c) * sqrt(2.0d0)) * t_0) / -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 t_0 = Math.sqrt((F * 2.0));
double tmp;
if (C <= 6.5e+220) {
tmp = (Math.sqrt((C + B_m)) * t_0) / -B_m;
} else {
tmp = ((Math.sqrt(C) * Math.sqrt(2.0)) * t_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): t_0 = math.sqrt((F * 2.0)) tmp = 0 if C <= 6.5e+220: tmp = (math.sqrt((C + B_m)) * t_0) / -B_m else: tmp = ((math.sqrt(C) * math.sqrt(2.0)) * t_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 = sqrt(Float64(F * 2.0)) tmp = 0.0 if (C <= 6.5e+220) tmp = Float64(Float64(sqrt(Float64(C + B_m)) * t_0) / Float64(-B_m)); else tmp = Float64(Float64(Float64(sqrt(C) * sqrt(2.0)) * t_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)
t_0 = sqrt((F * 2.0));
tmp = 0.0;
if (C <= 6.5e+220)
tmp = (sqrt((C + B_m)) * t_0) / -B_m;
else
tmp = ((sqrt(C) * sqrt(2.0)) * t_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_] := Block[{t$95$0 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[C, 6.5e+220], N[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * t$95$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}
t_0 := \sqrt{F \cdot 2}\\
\mathbf{if}\;C \leq 6.5 \cdot 10^{+220}:\\
\;\;\;\;\frac{\sqrt{C + B\_m} \cdot t\_0}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{C} \cdot \sqrt{2}\right) \cdot t\_0}{-B\_m}\\
\end{array}
\end{array}
if C < 6.5000000000000001e220Initial 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
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6415.5
Applied rewrites15.5%
Applied rewrites15.5%
Applied rewrites21.2%
Taylor expanded in C around 0
Applied rewrites18.4%
if 6.5000000000000001e220 < 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
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6422.0
Applied rewrites22.0%
Applied rewrites22.1%
Applied rewrites34.9%
Taylor expanded in B around 0
Applied rewrites29.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 (+ C B_m)) (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((C + B_m)) * 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((c + b_m)) * 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((C + B_m)) * 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((C + B_m)) * 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(Float64(sqrt(Float64(C + B_m)) * sqrt(Float64(F * 2.0))) / Float64(-B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = (sqrt((C + B_m)) * 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[(N[(N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\frac{\sqrt{C + B\_m} \cdot \sqrt{F \cdot 2}}{-B\_m}
\end{array}
Initial program 22.1%
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.f6415.9
Applied rewrites15.9%
Applied rewrites15.9%
Applied rewrites22.0%
Taylor expanded in C around 0
Applied rewrites17.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 (<= F 5.6e+16) (/ (sqrt (* (* (+ C B_m) F) 2.0)) (- B_m)) (- (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) {
double tmp;
if (F <= 5.6e+16) {
tmp = sqrt((((C + B_m) * F) * 2.0)) / -B_m;
} else {
tmp = -sqrt((2.0 / (B_m / 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 (f <= 5.6d+16) then
tmp = sqrt((((c + b_m) * f) * 2.0d0)) / -b_m
else
tmp = -sqrt((2.0d0 / (b_m / 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 (F <= 5.6e+16) {
tmp = Math.sqrt((((C + B_m) * F) * 2.0)) / -B_m;
} else {
tmp = -Math.sqrt((2.0 / (B_m / F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 5.6e+16: tmp = math.sqrt((((C + B_m) * F) * 2.0)) / -B_m else: tmp = -math.sqrt((2.0 / (B_m / F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 5.6e+16) tmp = Float64(sqrt(Float64(Float64(Float64(C + B_m) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(-sqrt(Float64(2.0 / Float64(B_m / F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 5.6e+16)
tmp = sqrt((((C + B_m) * F) * 2.0)) / -B_m;
else
tmp = -sqrt((2.0 / (B_m / F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 5.6e+16], N[(N[Sqrt[N[(N[(N[(C + B$95$m), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[Sqrt[N[(2.0 / N[(B$95$m / 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}\;F \leq 5.6 \cdot 10^{+16}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + B\_m\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2}{\frac{B\_m}{F}}}\\
\end{array}
\end{array}
if F < 5.6e16Initial program 27.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.f6419.2
Applied rewrites19.2%
Applied rewrites19.3%
Taylor expanded in C around 0
Applied rewrites14.6%
if 5.6e16 < F Initial program 14.1%
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.f6419.8
Applied rewrites19.8%
Applied rewrites19.9%
Applied rewrites19.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 (<= F 5e-42) (/ (sqrt (* 2.0 (* B_m F))) (- B_m)) (- (sqrt (* (/ F B_m) 2.0)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 5e-42) {
tmp = sqrt((2.0 * (B_m * F))) / -B_m;
} else {
tmp = -sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= 5d-42) then
tmp = sqrt((2.0d0 * (b_m * f))) / -b_m
else
tmp = -sqrt(((f / b_m) * 2.0d0))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 5e-42) {
tmp = Math.sqrt((2.0 * (B_m * F))) / -B_m;
} else {
tmp = -Math.sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= 5e-42: tmp = math.sqrt((2.0 * (B_m * F))) / -B_m else: tmp = -math.sqrt(((F / B_m) * 2.0)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= 5e-42) tmp = Float64(sqrt(Float64(2.0 * Float64(B_m * F))) / Float64(-B_m)); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= 5e-42)
tmp = sqrt((2.0 * (B_m * F))) / -B_m;
else
tmp = -sqrt(((F / B_m) * 2.0));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 5e-42], N[(N[Sqrt[N[(2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 5 \cdot 10^{-42}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if F < 5.00000000000000003e-42Initial program 26.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
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6416.7
Applied rewrites16.7%
Applied rewrites16.8%
Taylor expanded in B around inf
Applied rewrites13.1%
if 5.00000000000000003e-42 < F Initial program 17.3%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites21.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* F 2.0)) (- (sqrt 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)) / -sqrt(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)) / -sqrt(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)) / -Math.sqrt(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)) / -math.sqrt(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 * 2.0)) / Float64(-sqrt(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)) / -sqrt(B_m);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}
\end{array}
Initial program 22.1%
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.7
Applied rewrites15.7%
Applied rewrites18.2%
Final simplification18.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 (/ (- (sqrt F)) (sqrt (* B_m 0.5))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(F) / sqrt((B_m * 0.5));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) / sqrt((b_m * 0.5d0))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) / math.sqrt((B_m * 0.5))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) / sqrt((B_m * 0.5));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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{B\_m \cdot 0.5}}
\end{array}
Initial program 22.1%
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.7
Applied rewrites15.7%
Applied rewrites15.8%
Applied rewrites15.7%
Applied rewrites18.2%
Final simplification18.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 (* (- (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 22.1%
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.7
Applied rewrites15.7%
Applied rewrites15.8%
Applied rewrites18.2%
Final simplification18.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 (- (sqrt (* (/ F B_m) 2.0))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(((F / B_m) * 2.0));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((f / b_m) * 2.0d0))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((F / B_m) * 2.0));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((F / B_m) * 2.0))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(((F / B_m) * 2.0));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{F}{B\_m} \cdot 2}
\end{array}
Initial program 22.1%
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.7
Applied rewrites15.7%
Applied rewrites15.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 22.1%
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.7
Applied rewrites15.7%
Applied rewrites15.8%
Applied rewrites15.7%
herbie shell --seed 2024307
(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))))