
(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 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* C (* A 4.0)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (* (* F 2.0) t_1))
(t_3 (* (* F (- (pow B_m 2.0) t_0)) 2.0))
(t_4 (+ (+ (hypot (- A C) B_m) A) C))
(t_5 (- t_0 (pow B_m 2.0)))
(t_6
(/
(sqrt (* (+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A)) t_3))
t_5))
(t_7 (/ (* B_m B_m) A)))
(if (<= t_6 (- INFINITY))
(/ (* (sqrt (* t_1 F)) (sqrt (* (+ (fma -0.5 t_7 C) C) 2.0))) t_5)
(if (<= t_6 -4e-203)
(/ (sqrt (* t_2 t_4)) (- t_1))
(if (<= t_6 4e-48)
(/ (sqrt (* (fma t_7 -0.5 (* C 2.0)) t_3)) t_5)
(if (<= t_6 INFINITY)
(* (/ (sqrt t_2) t_1) (/ (sqrt t_4) -1.0))
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = C * (A * 4.0);
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = (F * 2.0) * t_1;
double t_3 = (F * (pow(B_m, 2.0) - t_0)) * 2.0;
double t_4 = (hypot((A - C), B_m) + A) + C;
double t_5 = t_0 - pow(B_m, 2.0);
double t_6 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * t_3)) / t_5;
double t_7 = (B_m * B_m) / A;
double tmp;
if (t_6 <= -((double) INFINITY)) {
tmp = (sqrt((t_1 * F)) * sqrt(((fma(-0.5, t_7, C) + C) * 2.0))) / t_5;
} else if (t_6 <= -4e-203) {
tmp = sqrt((t_2 * t_4)) / -t_1;
} else if (t_6 <= 4e-48) {
tmp = sqrt((fma(t_7, -0.5, (C * 2.0)) * t_3)) / t_5;
} else if (t_6 <= ((double) INFINITY)) {
tmp = (sqrt(t_2) / t_1) * (sqrt(t_4) / -1.0);
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = Float64(Float64(F * 2.0) * t_1) t_3 = Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0) t_4 = Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) t_5 = Float64(t_0 - (B_m ^ 2.0)) t_6 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * t_3)) / t_5) t_7 = Float64(Float64(B_m * B_m) / A) tmp = 0.0 if (t_6 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(t_1 * F)) * sqrt(Float64(Float64(fma(-0.5, t_7, C) + C) * 2.0))) / t_5); elseif (t_6 <= -4e-203) tmp = Float64(sqrt(Float64(t_2 * t_4)) / Float64(-t_1)); elseif (t_6 <= 4e-48) tmp = Float64(sqrt(Float64(fma(t_7, -0.5, Float64(C * 2.0)) * t_3)) / t_5); elseif (t_6 <= Inf) tmp = Float64(Float64(sqrt(t_2) / t_1) * Float64(sqrt(t_4) / -1.0)); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]}, Block[{t$95$7 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, If[LessEqual[t$95$6, (-Infinity)], N[(N[(N[Sqrt[N[(t$95$1 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(N[(-0.5 * t$95$7 + C), $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, -4e-203], N[(N[Sqrt[N[(t$95$2 * t$95$4), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$6, 4e-48], N[(N[Sqrt[N[(N[(t$95$7 * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(N[(N[Sqrt[t$95$2], $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[Sqrt[t$95$4], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \left(F \cdot 2\right) \cdot t\_1\\
t_3 := \left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\\
t_4 := \left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\\
t_5 := t\_0 - {B\_m}^{2}\\
t_6 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot t\_3}}{t\_5}\\
t_7 := \frac{B\_m \cdot B\_m}{A}\\
\mathbf{if}\;t\_6 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot F} \cdot \sqrt{\left(\mathsf{fma}\left(-0.5, t\_7, C\right) + C\right) \cdot 2}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot t\_4}}{-t\_1}\\
\mathbf{elif}\;t\_6 \leq 4 \cdot 10^{-48}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(t\_7, -0.5, C \cdot 2\right) \cdot t\_3}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2}}{t\_1} \cdot \frac{\sqrt{t\_4}}{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites42.5%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.4
Applied rewrites26.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.0000000000000001e-203Initial program 99.3%
Applied rewrites99.4%
if -4.0000000000000001e-203 < (/.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))) < 3.9999999999999999e-48Initial program 7.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6431.0
Applied rewrites31.0%
if 3.9999999999999999e-48 < (/.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 42.9%
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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification42.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 (+ (+ (hypot (- A C) B_m) A) C))
(t_1 (fma (* -4.0 C) A (* B_m B_m)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (* (* F 2.0) t_2))
(t_4 (* C (* A 4.0)))
(t_5 (- t_4 (pow B_m 2.0)))
(t_6
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_4)) 2.0)))
t_5))
(t_7 (+ (fma -0.5 (/ (* B_m B_m) A) C) C)))
(if (<= t_6 (- INFINITY))
(/ (* (sqrt (* t_2 F)) (sqrt (* t_7 2.0))) t_5)
(if (<= t_6 -4e-203)
(/ (sqrt (* t_3 t_0)) (- t_2))
(if (<= t_6 4e-48)
(/ (- (sqrt 2.0)) (/ t_1 (sqrt (* (* t_7 F) t_1))))
(if (<= t_6 INFINITY)
(* (/ (sqrt t_3) t_2) (/ (sqrt t_0) -1.0))
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = (hypot((A - C), B_m) + A) + C;
double t_1 = fma((-4.0 * C), A, (B_m * B_m));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = (F * 2.0) * t_2;
double t_4 = C * (A * 4.0);
double t_5 = t_4 - pow(B_m, 2.0);
double t_6 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_4)) * 2.0))) / t_5;
double t_7 = fma(-0.5, ((B_m * B_m) / A), C) + C;
double tmp;
if (t_6 <= -((double) INFINITY)) {
tmp = (sqrt((t_2 * F)) * sqrt((t_7 * 2.0))) / t_5;
} else if (t_6 <= -4e-203) {
tmp = sqrt((t_3 * t_0)) / -t_2;
} else if (t_6 <= 4e-48) {
tmp = -sqrt(2.0) / (t_1 / sqrt(((t_7 * F) * t_1)));
} else if (t_6 <= ((double) INFINITY)) {
tmp = (sqrt(t_3) / t_2) * (sqrt(t_0) / -1.0);
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
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(hypot(Float64(A - C), B_m) + A) + C) t_1 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = Float64(Float64(F * 2.0) * t_2) t_4 = Float64(C * Float64(A * 4.0)) t_5 = Float64(t_4 - (B_m ^ 2.0)) t_6 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_4)) * 2.0))) / t_5) t_7 = Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) tmp = 0.0 if (t_6 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(t_2 * F)) * sqrt(Float64(t_7 * 2.0))) / t_5); elseif (t_6 <= -4e-203) tmp = Float64(sqrt(Float64(t_3 * t_0)) / Float64(-t_2)); elseif (t_6 <= 4e-48) tmp = Float64(Float64(-sqrt(2.0)) / Float64(t_1 / sqrt(Float64(Float64(t_7 * F) * t_1)))); elseif (t_6 <= Inf) tmp = Float64(Float64(sqrt(t_3) / t_2) * Float64(sqrt(t_0) / -1.0)); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); 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[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $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[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$4), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]}, Block[{t$95$7 = N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]}, If[LessEqual[t$95$6, (-Infinity)], N[(N[(N[Sqrt[N[(t$95$2 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$7 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, -4e-203], N[(N[Sqrt[N[(t$95$3 * t$95$0), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision], If[LessEqual[t$95$6, 4e-48], N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(t$95$1 / N[Sqrt[N[(N[(t$95$7 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(N[(N[Sqrt[t$95$3], $MachinePrecision] / t$95$2), $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $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 := \left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := \left(F \cdot 2\right) \cdot t\_2\\
t_4 := C \cdot \left(A \cdot 4\right)\\
t_5 := t\_4 - {B\_m}^{2}\\
t_6 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_4\right)\right) \cdot 2\right)}}{t\_5}\\
t_7 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\\
\mathbf{if}\;t\_6 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot F} \cdot \sqrt{t\_7 \cdot 2}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot t\_0}}{-t\_2}\\
\mathbf{elif}\;t\_6 \leq 4 \cdot 10^{-48}:\\
\;\;\;\;\frac{-\sqrt{2}}{\frac{t\_1}{\sqrt{\left(t\_7 \cdot F\right) \cdot t\_1}}}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_3}}{t\_2} \cdot \frac{\sqrt{t\_0}}{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites42.5%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.4
Applied rewrites26.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.0000000000000001e-203Initial program 99.3%
Applied rewrites99.4%
if -4.0000000000000001e-203 < (/.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))) < 3.9999999999999999e-48Initial program 7.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites8.6%
Applied rewrites11.4%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6431.0
Applied rewrites31.0%
if 3.9999999999999999e-48 < (/.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 42.9%
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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification42.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 -4.0 (* C A) (* B_m B_m)))
(t_1 (hypot (- A C) B_m))
(t_2 (+ (+ t_1 A) C))
(t_3 (* C (* A 4.0)))
(t_4
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_3)) 2.0)))
(- t_3 (pow B_m 2.0))))
(t_5 (- (sqrt 2.0)))
(t_6 (fma (* -4.0 C) A (* B_m B_m))))
(if (<= t_4 (- INFINITY))
(* (sqrt (/ (* (+ (+ t_1 C) A) F) (fma (* -4.0 A) C (* B_m B_m)))) t_5)
(if (<= t_4 -4e-203)
(/ (sqrt (* (* (* F 2.0) t_0) t_2)) (- t_0))
(if (<= t_4 0.0)
(/
t_5
(/ t_6 (sqrt (* (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) F) t_6))))
(if (<= t_4 INFINITY)
(/ (* (sqrt (* t_0 F)) (- (sqrt (* t_2 2.0)))) (* (* C A) -4.0))
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = hypot((A - C), B_m);
double t_2 = (t_1 + A) + C;
double t_3 = C * (A * 4.0);
double t_4 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
double t_5 = -sqrt(2.0);
double t_6 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = sqrt(((((t_1 + C) + A) * F) / fma((-4.0 * A), C, (B_m * B_m)))) * t_5;
} else if (t_4 <= -4e-203) {
tmp = sqrt((((F * 2.0) * t_0) * t_2)) / -t_0;
} else if (t_4 <= 0.0) {
tmp = t_5 / (t_6 / sqrt((((fma(-0.5, ((B_m * B_m) / A), C) + C) * F) * t_6)));
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt((t_0 * F)) * -sqrt((t_2 * 2.0))) / ((C * A) * -4.0);
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = hypot(Float64(A - C), B_m) t_2 = Float64(Float64(t_1 + A) + C) t_3 = Float64(C * Float64(A * 4.0)) t_4 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0))) t_5 = Float64(-sqrt(2.0)) t_6 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(t_1 + C) + A) * F) / fma(Float64(-4.0 * A), C, Float64(B_m * B_m)))) * t_5); elseif (t_4 <= -4e-203) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * t_2)) / Float64(-t_0)); elseif (t_4 <= 0.0) tmp = Float64(t_5 / Float64(t_6 / sqrt(Float64(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * F) * t_6)))); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(t_0 * F)) * Float64(-sqrt(Float64(t_2 * 2.0)))) / Float64(Float64(C * A) * -4.0)); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]}, Block[{t$95$2 = N[(N[(t$95$1 + A), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$6 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[Sqrt[N[(N[(N[(N[(t$95$1 + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$5), $MachinePrecision], If[LessEqual[t$95$4, -4e-203], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(t$95$5 / N[(t$95$6 / N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$6), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(t$95$2 * 2.0), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{hypot}\left(A - C, B\_m\right)\\
t_2 := \left(t\_1 + A\right) + C\\
t_3 := C \cdot \left(A \cdot 4\right)\\
t_4 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\
t_5 := -\sqrt{2}\\
t_6 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{\left(\left(t\_1 + C\right) + A\right) \cdot F}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}} \cdot t\_5\\
\mathbf{elif}\;t\_4 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot t\_2}}{-t\_0}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{t\_5}{\frac{t\_6}{\sqrt{\left(\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot F\right) \cdot t\_6}}}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot F} \cdot \left(-\sqrt{t\_2 \cdot 2}\right)}{\left(C \cdot A\right) \cdot -4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.0%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites42.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.0000000000000001e-203Initial program 99.3%
Applied rewrites99.4%
if -4.0000000000000001e-203 < (/.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%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites4.7%
Applied rewrites7.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6432.2
Applied rewrites32.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 48.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites94.3%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6494.3
Applied rewrites94.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification46.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (+ (+ (hypot (- A C) B_m) A) C))
(t_1 (* C (* A 4.0)))
(t_2 (* (* F (- (pow B_m 2.0) t_1)) 2.0))
(t_3 (- t_1 (pow B_m 2.0)))
(t_4
(/
(sqrt (* (+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A)) t_2))
t_3))
(t_5 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_4 -4e-203)
(/
(* (* (sqrt F) (sqrt (* t_0 2.0))) (sqrt (fma (* -4.0 C) A (* B_m B_m))))
t_3)
(if (<= t_4 4e-48)
(/ (sqrt (* (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)) t_2)) t_3)
(if (<= t_4 INFINITY)
(* (/ (sqrt (* (* F 2.0) t_5)) t_5) (/ (sqrt t_0) -1.0))
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = (hypot((A - C), B_m) + A) + C;
double t_1 = C * (A * 4.0);
double t_2 = (F * (pow(B_m, 2.0) - t_1)) * 2.0;
double t_3 = t_1 - pow(B_m, 2.0);
double t_4 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * t_2)) / t_3;
double t_5 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_4 <= -4e-203) {
tmp = ((sqrt(F) * sqrt((t_0 * 2.0))) * sqrt(fma((-4.0 * C), A, (B_m * B_m)))) / t_3;
} else if (t_4 <= 4e-48) {
tmp = sqrt((fma(((B_m * B_m) / A), -0.5, (C * 2.0)) * t_2)) / t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt(((F * 2.0) * t_5)) / t_5) * (sqrt(t_0) / -1.0);
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
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(hypot(Float64(A - C), B_m) + A) + C) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0) t_3 = Float64(t_1 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * t_2)) / t_3) t_5 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= -4e-203) tmp = Float64(Float64(Float64(sqrt(F) * sqrt(Float64(t_0 * 2.0))) * sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)))) / t_3); elseif (t_4 <= 4e-48) tmp = Float64(sqrt(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) * t_2)) / t_3); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * t_5)) / t_5) * Float64(sqrt(t_0) / -1.0)); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); 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[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * t$95$2), $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, -4e-203], N[(N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 4e-48], N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$5), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $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 := \left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\\
t_3 := t\_1 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot t\_2}}{t\_3}\\
t_5 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;\frac{\left(\sqrt{F} \cdot \sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq 4 \cdot 10^{-48}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right) \cdot t\_2}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot t\_5}}{t\_5} \cdot \frac{\sqrt{t\_0}}{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\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.0000000000000001e-203Initial program 46.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites68.3%
lift-neg.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites72.0%
if -4.0000000000000001e-203 < (/.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))) < 3.9999999999999999e-48Initial program 7.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6431.0
Applied rewrites31.0%
if 3.9999999999999999e-48 < (/.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 42.9%
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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification46.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m)))
(t_1 (fma (* -4.0 C) A (* B_m B_m)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (* C (* A 4.0)))
(t_4
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_3)) 2.0)))
(- t_3 (pow B_m 2.0))))
(t_5 (+ (+ (hypot (- A C) B_m) A) C)))
(if (<= t_4 -4e-203)
(* (/ (sqrt (* t_0 F)) t_0) (- (sqrt (* t_5 2.0))))
(if (<= t_4 4e-48)
(/
(- (sqrt 2.0))
(/ t_1 (sqrt (* (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) F) t_1))))
(if (<= t_4 INFINITY)
(* (/ (sqrt (* (* F 2.0) t_2)) t_2) (/ (sqrt t_5) -1.0))
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = fma((-4.0 * C), A, (B_m * B_m));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = C * (A * 4.0);
double t_4 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
double t_5 = (hypot((A - C), B_m) + A) + C;
double tmp;
if (t_4 <= -4e-203) {
tmp = (sqrt((t_0 * F)) / t_0) * -sqrt((t_5 * 2.0));
} else if (t_4 <= 4e-48) {
tmp = -sqrt(2.0) / (t_1 / sqrt((((fma(-0.5, ((B_m * B_m) / A), C) + C) * F) * t_1)));
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt(((F * 2.0) * t_2)) / t_2) * (sqrt(t_5) / -1.0);
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = Float64(C * Float64(A * 4.0)) t_4 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0))) t_5 = Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) tmp = 0.0 if (t_4 <= -4e-203) tmp = Float64(Float64(sqrt(Float64(t_0 * F)) / t_0) * Float64(-sqrt(Float64(t_5 * 2.0)))); elseif (t_4 <= 4e-48) tmp = Float64(Float64(-sqrt(2.0)) / Float64(t_1 / sqrt(Float64(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * F) * t_1)))); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * t_2)) / t_2) * Float64(sqrt(t_5) / -1.0)); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]}, If[LessEqual[t$95$4, -4e-203], N[(N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * (-N[Sqrt[N[(t$95$5 * 2.0), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$4, 4e-48], N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(t$95$1 / N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision] * N[(N[Sqrt[t$95$5], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := C \cdot \left(A \cdot 4\right)\\
t_4 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\
t_5 := \left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\\
\mathbf{if}\;t\_4 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot F}}{t\_0} \cdot \left(-\sqrt{t\_5 \cdot 2}\right)\\
\mathbf{elif}\;t\_4 \leq 4 \cdot 10^{-48}:\\
\;\;\;\;\frac{-\sqrt{2}}{\frac{t\_1}{\sqrt{\left(\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot F\right) \cdot t\_1}}}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot t\_2}}{t\_2} \cdot \frac{\sqrt{t\_5}}{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\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.0000000000000001e-203Initial program 46.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites68.3%
Applied rewrites50.1%
Applied rewrites68.2%
if -4.0000000000000001e-203 < (/.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))) < 3.9999999999999999e-48Initial program 7.5%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites8.6%
Applied rewrites11.4%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6431.0
Applied rewrites31.0%
if 3.9999999999999999e-48 < (/.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 42.9%
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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification45.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)))
(t_1 (fma (* -4.0 C) A (* B_m B_m)))
(t_2 (- (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) 2.0))))
(t_3 (* C (* A 4.0)))
(t_4
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_3)) 2.0)))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 -4e-203)
(* (/ (sqrt (* t_0 F)) t_0) t_2)
(if (<= t_4 0.0)
(/
(- (sqrt 2.0))
(/ t_1 (sqrt (* (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) F) t_1))))
(if (<= t_4 INFINITY)
(* (/ (sqrt (* t_1 F)) t_1) t_2)
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = fma((-4.0 * C), A, (B_m * B_m));
double t_2 = -sqrt((((hypot((A - C), B_m) + A) + C) * 2.0));
double t_3 = C * (A * 4.0);
double t_4 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= -4e-203) {
tmp = (sqrt((t_0 * F)) / t_0) * t_2;
} else if (t_4 <= 0.0) {
tmp = -sqrt(2.0) / (t_1 / sqrt((((fma(-0.5, ((B_m * B_m) / A), C) + C) * F) * t_1)));
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt((t_1 * F)) / t_1) * t_2;
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_2 = Float64(-sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * 2.0))) t_3 = Float64(C * Float64(A * 4.0)) t_4 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= -4e-203) tmp = Float64(Float64(sqrt(Float64(t_0 * F)) / t_0) * t_2); elseif (t_4 <= 0.0) tmp = Float64(Float64(-sqrt(2.0)) / Float64(t_1 / sqrt(Float64(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * F) * t_1)))); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(t_1 * F)) / t_1) * t_2); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -4e-203], N[(N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(t$95$1 / N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(t$95$1 * F), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision] * t$95$2), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_2 := -\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot 2}\\
t_3 := C \cdot \left(A \cdot 4\right)\\
t_4 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot F}}{t\_0} \cdot t\_2\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{-\sqrt{2}}{\frac{t\_1}{\sqrt{\left(\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot F\right) \cdot t\_1}}}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot F}}{t\_1} \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\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.0000000000000001e-203Initial program 46.8%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites68.3%
Applied rewrites50.1%
Applied rewrites68.2%
if -4.0000000000000001e-203 < (/.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%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites4.7%
Applied rewrites7.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6432.2
Applied rewrites32.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 48.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites94.3%
lift-/.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites94.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification45.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 C) A (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(+ (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))) (+ C A))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3
(*
(/ (sqrt (* t_0 F)) t_0)
(- (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) 2.0))))))
(if (<= t_2 -4e-203)
t_3
(if (<= t_2 0.0)
(/
(- (sqrt 2.0))
(/ t_0 (sqrt (* (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) F) t_0))))
(if (<= t_2 INFINITY)
t_3
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(((sqrt((pow((A - C), 2.0) + pow(B_m, 2.0))) + (C + A)) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = (sqrt((t_0 * F)) / t_0) * -sqrt((((hypot((A - C), B_m) + A) + C) * 2.0));
double tmp;
if (t_2 <= -4e-203) {
tmp = t_3;
} else if (t_2 <= 0.0) {
tmp = -sqrt(2.0) / (t_0 / sqrt((((fma(-0.5, ((B_m * B_m) / A), C) + C) * F) * t_0)));
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_3;
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
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)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))) + Float64(C + A)) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = Float64(Float64(sqrt(Float64(t_0 * F)) / t_0) * Float64(-sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * 2.0)))) tmp = 0.0 if (t_2 <= -4e-203) tmp = t_3; elseif (t_2 <= 0.0) tmp = Float64(Float64(-sqrt(2.0)) / Float64(t_0 / sqrt(Float64(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * F) * t_0)))); elseif (t_2 <= Inf) tmp = t_3; else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); 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]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * (-N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]}, If[LessEqual[t$95$2, -4e-203], t$95$3, If[LessEqual[t$95$2, 0.0], N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(t$95$0 / N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $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 C, A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}} + \left(C + A\right)\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \frac{\sqrt{t\_0 \cdot F}}{t\_0} \cdot \left(-\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot 2}\right)\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{-203}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{-\sqrt{2}}{\frac{t\_0}{\sqrt{\left(\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot F\right) \cdot t\_0}}}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\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.0000000000000001e-203 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 47.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites72.9%
lift-/.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites72.8%
if -4.0000000000000001e-203 < (/.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%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites4.7%
Applied rewrites7.6%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6432.2
Applied rewrites32.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.7
Applied rewrites16.7%
Applied rewrites23.9%
Applied rewrites24.1%
Applied rewrites24.1%
Final simplification45.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 5e+29)
(/
(sqrt 2.0)
(/ (- (fma (* -4.0 C) A (* B_m B_m))) (sqrt (* (* (* (* C C) F) A) -8.0))))
(if (<= (pow B_m 2.0) 5e+184)
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* (* -0.5 (/ (* B_m B_m) A)) F)))
(/ (- (sqrt F)) (sqrt (* 0.5 B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e+29) {
tmp = sqrt(2.0) / (-fma((-4.0 * C), A, (B_m * B_m)) / sqrt(((((C * C) * F) * A) * -8.0)));
} else if (pow(B_m, 2.0) <= 5e+184) {
tmp = (-sqrt(2.0) / B_m) * sqrt(((-0.5 * ((B_m * B_m) / A)) * F));
} else {
tmp = -sqrt(F) / sqrt((0.5 * B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+29) tmp = Float64(sqrt(2.0) / Float64(Float64(-fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) / sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -8.0)))); elseif ((B_m ^ 2.0) <= 5e+184) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) * F))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+29], N[(N[Sqrt[2.0], $MachinePrecision] / N[((-N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]) / N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+184], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+29}:\\
\;\;\;\;\frac{\sqrt{2}}{\frac{-\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}{\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -8}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+184}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e29Initial program 28.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites41.2%
Applied rewrites33.4%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6417.3
Applied rewrites17.3%
if 5.0000000000000001e29 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e184Initial program 14.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites31.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6415.0
Applied rewrites15.0%
Taylor expanded in A around -inf
Applied rewrites24.8%
if 4.9999999999999999e184 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.5%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6424.5
Applied rewrites24.5%
Applied rewrites24.6%
Applied rewrites24.6%
Applied rewrites31.7%
Final simplification23.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 5e+184) (* (/ (- (sqrt 2.0)) B_m) (sqrt (* (* -0.5 (/ (* B_m B_m) A)) F))) (/ (- (sqrt F)) (sqrt (* 0.5 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e+184) {
tmp = (-sqrt(2.0) / B_m) * sqrt(((-0.5 * ((B_m * B_m) / A)) * F));
} else {
tmp = -sqrt(F) / sqrt((0.5 * B_m));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 5d+184) then
tmp = (-sqrt(2.0d0) / b_m) * sqrt((((-0.5d0) * ((b_m * b_m) / a)) * f))
else
tmp = -sqrt(f) / sqrt((0.5d0 * b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 5e+184) {
tmp = (-Math.sqrt(2.0) / B_m) * Math.sqrt(((-0.5 * ((B_m * B_m) / A)) * F));
} else {
tmp = -Math.sqrt(F) / Math.sqrt((0.5 * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 5e+184: tmp = (-math.sqrt(2.0) / B_m) * math.sqrt(((-0.5 * ((B_m * B_m) / A)) * F)) else: tmp = -math.sqrt(F) / math.sqrt((0.5 * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+184) tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) * F))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e+184)
tmp = (-sqrt(2.0) / B_m) * sqrt(((-0.5 * ((B_m * B_m) / A)) * F));
else
tmp = -sqrt(F) / sqrt((0.5 * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+184], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+184}:\\
\;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e184Initial program 25.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites39.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f647.5
Applied rewrites7.5%
Taylor expanded in A around -inf
Applied rewrites10.9%
if 4.9999999999999999e184 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.5%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6424.5
Applied rewrites24.5%
Applied rewrites24.6%
Applied rewrites24.6%
Applied rewrites31.7%
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
(let* ((t_0 (fma (* -4.0 C) A (* B_m B_m))))
(if (<= B_m 3.1e+83)
(/
(- (sqrt 2.0))
(/ t_0 (sqrt (* (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) F) t_0))))
(* (/ (* (- 2.0) F) (sqrt (* F 2.0))) (pow 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) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (B_m <= 3.1e+83) {
tmp = -sqrt(2.0) / (t_0 / sqrt((((fma(-0.5, ((B_m * B_m) / A), C) + C) * F) * t_0)));
} else {
tmp = ((-2.0 * F) / sqrt((F * 2.0))) * pow(B_m, -0.5);
}
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 <= 3.1e+83) tmp = Float64(Float64(-sqrt(2.0)) / Float64(t_0 / sqrt(Float64(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * F) * t_0)))); else tmp = Float64(Float64(Float64(Float64(-2.0) * F) / sqrt(Float64(F * 2.0))) * (B_m ^ -0.5)); 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[B$95$m, 3.1e+83], N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(t$95$0 / N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-2.0) * F), $MachinePrecision] / N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[B$95$m, -0.5], $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 C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 3.1 \cdot 10^{+83}:\\
\;\;\;\;\frac{-\sqrt{2}}{\frac{t\_0}{\sqrt{\left(\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot F\right) \cdot t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-2\right) \cdot F}{\sqrt{F \cdot 2}} \cdot {B\_m}^{-0.5}\\
\end{array}
\end{array}
if B < 3.09999999999999992e83Initial program 21.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites33.8%
Applied rewrites25.5%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.8
Applied rewrites17.8%
if 3.09999999999999992e83 < B Initial program 15.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6455.1
Applied rewrites55.1%
Applied rewrites73.6%
Applied rewrites74.1%
Applied rewrites74.1%
Final simplification26.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 (<= B_m 3.1e+83)
(/
(- (sqrt 2.0))
(/ t_0 (sqrt (* (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) F) t_0))))
(/ (- (sqrt F)) (sqrt (* 0.5 B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (B_m <= 3.1e+83) {
tmp = -sqrt(2.0) / (t_0 / sqrt((((fma(-0.5, ((B_m * B_m) / A), C) + C) * F) * t_0)));
} else {
tmp = -sqrt(F) / sqrt((0.5 * 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 <= 3.1e+83) tmp = Float64(Float64(-sqrt(2.0)) / Float64(t_0 / sqrt(Float64(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * F) * t_0)))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * 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[B$95$m, 3.1e+83], N[((-N[Sqrt[2.0], $MachinePrecision]) / N[(t$95$0 / N[Sqrt[N[(N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 3.1 \cdot 10^{+83}:\\
\;\;\;\;\frac{-\sqrt{2}}{\frac{t\_0}{\sqrt{\left(\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot F\right) \cdot t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\end{array}
\end{array}
if B < 3.09999999999999992e83Initial program 21.2%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites33.8%
Applied rewrites25.5%
Taylor expanded in A around -inf
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6417.8
Applied rewrites17.8%
if 3.09999999999999992e83 < B Initial program 15.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6455.1
Applied rewrites55.1%
Applied rewrites55.4%
Applied rewrites55.4%
Applied rewrites74.0%
Final simplification26.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 (- (sqrt 2.0))) (t_1 (fma (* -4.0 C) A (* B_m B_m))))
(if (<= B_m 3e+15)
(/ t_0 (/ t_1 (sqrt (* (* (+ (* (fma 0.0 (/ A C) 1.0) C) C) F) t_1))))
(if (<= B_m 2.3e+92)
(* (/ t_0 B_m) (sqrt (* (* -0.5 (/ (* B_m B_m) A)) F)))
(/ (- (sqrt F)) (sqrt (* 0.5 B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0);
double t_1 = fma((-4.0 * C), A, (B_m * B_m));
double tmp;
if (B_m <= 3e+15) {
tmp = t_0 / (t_1 / sqrt(((((fma(0.0, (A / C), 1.0) * C) + C) * F) * t_1)));
} else if (B_m <= 2.3e+92) {
tmp = (t_0 / B_m) * sqrt(((-0.5 * ((B_m * B_m) / A)) * F));
} else {
tmp = -sqrt(F) / sqrt((0.5 * 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(-sqrt(2.0)) t_1 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 3e+15) tmp = Float64(t_0 / Float64(t_1 / sqrt(Float64(Float64(Float64(Float64(fma(0.0, Float64(A / C), 1.0) * C) + C) * F) * t_1)))); elseif (B_m <= 2.3e+92) tmp = Float64(Float64(t_0 / B_m) * sqrt(Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) * F))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * 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[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 3e+15], N[(t$95$0 / N[(t$95$1 / N[Sqrt[N[(N[(N[(N[(N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision] * C), $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.3e+92], N[(N[(t$95$0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -\sqrt{2}\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 3 \cdot 10^{+15}:\\
\;\;\;\;\frac{t\_0}{\frac{t\_1}{\sqrt{\left(\left(\mathsf{fma}\left(0, \frac{A}{C}, 1\right) \cdot C + C\right) \cdot F\right) \cdot t\_1}}}\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+92}:\\
\;\;\;\;\frac{t\_0}{B\_m} \cdot \sqrt{\left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right) \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\
\end{array}
\end{array}
if B < 3e15Initial program 21.6%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites34.4%
Applied rewrites26.0%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6414.6
Applied rewrites14.6%
if 3e15 < B < 2.29999999999999998e92Initial program 21.1%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites30.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6422.7
Applied rewrites22.7%
Taylor expanded in A around -inf
Applied rewrites29.5%
if 2.29999999999999998e92 < B Initial program 13.5%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6455.2
Applied rewrites55.2%
Applied rewrites55.5%
Applied rewrites55.5%
Applied rewrites75.1%
Final simplification24.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)) (sqrt (* 0.5 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(F) / sqrt((0.5 * B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) / sqrt((0.5d0 * b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) / Math.sqrt((0.5 * B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) / math.sqrt((0.5 * B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) / sqrt((0.5 * B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(0.5 * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}
\end{array}
Initial program 20.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6411.7
Applied rewrites11.7%
Applied rewrites11.7%
Applied rewrites11.7%
Applied rewrites14.9%
Final simplification14.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* (/ 2.0 B_m) F))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(((2.0 / B_m) * F));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((2.0d0 / b_m) * f))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((2.0 / B_m) * F));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((2.0 / B_m) * F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(Float64(2.0 / B_m) * F))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(((2.0 / B_m) * F));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{2}{B\_m} \cdot F}
\end{array}
Initial program 20.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6411.7
Applied rewrites11.7%
Applied rewrites11.7%
Applied rewrites11.7%
Final simplification11.7%
herbie shell --seed 2024268
(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))))