
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* C (* A 4.0)))
(t_1 (* (* F (- (pow B_m 2.0) t_0)) 2.0))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0)))) t_1))
t_2))
(t_4 (sqrt (* (- A (hypot A B_m)) F))))
(if (<= t_3 -5e-215)
(/ (* t_4 (/ (sqrt (fma (* -4.0 C) A (* B_m B_m))) (pow 0.5 0.5))) t_2)
(if (<= t_3 INFINITY)
(/ (sqrt (* (+ (fma (/ (* B_m B_m) C) -0.5 A) A) t_1)) t_2)
(* t_4 (/ (sqrt 2.0) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = (F * (pow(B_m, 2.0) - t_0)) * 2.0;
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * t_1)) / t_2;
double t_4 = sqrt(((A - hypot(A, B_m)) * F));
double tmp;
if (t_3 <= -5e-215) {
tmp = (t_4 * (sqrt(fma((-4.0 * C), A, (B_m * B_m))) / pow(0.5, 0.5))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / C), -0.5, A) + A) * t_1)) / t_2;
} else {
tmp = t_4 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * t_1)) / t_2) t_4 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) tmp = 0.0 if (t_3 <= -5e-215) tmp = Float64(Float64(t_4 * Float64(sqrt(fma(Float64(-4.0 * C), A, Float64(B_m * B_m))) / (0.5 ^ 0.5))) / t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A) * t_1)) / t_2); else tmp = Float64(t_4 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, -5e-215], N[(N[(t$95$4 * N[(N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Power[0.5, 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(t$95$4 * N[(N[Sqrt[2.0], $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 := C \cdot \left(A \cdot 4\right)\\
t_1 := \left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot t\_1}}{t\_2}\\
t_4 := \sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-215}:\\
\;\;\;\;\frac{t\_4 \cdot \frac{\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)}}{{0.5}^{0.5}}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right) \cdot t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;t\_4 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999956e-215Initial program 45.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites65.6%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6450.9
Applied rewrites50.9%
Applied rewrites51.3%
if -4.99999999999999956e-215 < (/.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 22.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6438.4
Applied rewrites38.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification33.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 (* C (* A 4.0)))
(t_2 (- t_1 (pow B_m 2.0)))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
t_2))
(t_4 (/ (* (sqrt (* t_0 2.0)) (sqrt (* (+ A A) F))) t_2))
(t_5 (sqrt (* (* (* F 2.0) t_0) (- (+ C A) (hypot (- A C) B_m))))))
(if (<= t_3 (- INFINITY))
t_4
(if (<= t_3 -5e-215)
(* (/ -1.0 t_0) t_5)
(if (<= t_3 0.0)
t_4
(if (<= t_3 INFINITY)
(/ t_5 (- t_0))
(* (sqrt (* (- A (hypot A B_m)) F)) (/ (sqrt 2.0) (- B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = t_1 - pow(B_m, 2.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / t_2;
double t_4 = (sqrt((t_0 * 2.0)) * sqrt(((A + A) * F))) / t_2;
double t_5 = sqrt((((F * 2.0) * t_0) * ((C + A) - hypot((A - C), B_m))));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_4;
} else if (t_3 <= -5e-215) {
tmp = (-1.0 / t_0) * t_5;
} else if (t_3 <= 0.0) {
tmp = t_4;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_5 / -t_0;
} else {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(t_1 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / t_2) t_4 = Float64(Float64(sqrt(Float64(t_0 * 2.0)) * sqrt(Float64(Float64(A + A) * F))) / t_2) t_5 = sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(C + A) - hypot(Float64(A - C), B_m)))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_4; elseif (t_3 <= -5e-215) tmp = Float64(Float64(-1.0 / t_0) * t_5); elseif (t_3 <= 0.0) tmp = t_4; elseif (t_3 <= Inf) tmp = Float64(t_5 / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$4, If[LessEqual[t$95$3, -5e-215], N[(N[(-1.0 / t$95$0), $MachinePrecision] * t$95$5), $MachinePrecision], If[LessEqual[t$95$3, 0.0], t$95$4, If[LessEqual[t$95$3, Infinity], N[(t$95$5 / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := t\_1 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_2}\\
t_4 := \frac{\sqrt{t\_0 \cdot 2} \cdot \sqrt{\left(A + A\right) \cdot F}}{t\_2}\\
t_5 := \sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right)}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-215}:\\
\;\;\;\;\frac{-1}{t\_0} \cdot t\_5\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{t\_5}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0 or -4.99999999999999956e-215 < (/.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.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites30.1%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6419.5
Applied rewrites19.5%
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.99999999999999956e-215Initial program 99.2%
Applied rewrites99.3%
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 43.6%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites60.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 C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification34.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 C) A (* B_m B_m)))
(t_1 (* C (* A 4.0)))
(t_2 (sqrt (* (- A (hypot A B_m)) F)))
(t_3 (- t_1 (pow B_m 2.0)))
(t_4
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_1)) 2.0)))
t_3))
(t_5 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_4 -1e+191)
(/ (* (* (sqrt (* (+ A A) F)) (sqrt 2.0)) (sqrt t_0)) t_3)
(if (<= t_4 0.0)
(* (/ t_2 (- t_0)) (sqrt (* t_0 2.0)))
(if (<= t_4 INFINITY)
(/
-1.0
(/ t_5 (sqrt (* (* (* F 2.0) t_5) (- (+ C A) (hypot (- A C) B_m))))))
(* t_2 (/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B_m * B_m));
double t_1 = C * (A * 4.0);
double t_2 = sqrt(((A - hypot(A, B_m)) * F));
double t_3 = t_1 - pow(B_m, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / t_3;
double t_5 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_4 <= -1e+191) {
tmp = ((sqrt(((A + A) * F)) * sqrt(2.0)) * sqrt(t_0)) / t_3;
} else if (t_4 <= 0.0) {
tmp = (t_2 / -t_0) * sqrt((t_0 * 2.0));
} else if (t_4 <= ((double) INFINITY)) {
tmp = -1.0 / (t_5 / sqrt((((F * 2.0) * t_5) * ((C + A) - hypot((A - C), B_m)))));
} else {
tmp = t_2 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) t_3 = Float64(t_1 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / t_3) t_5 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= -1e+191) tmp = Float64(Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * sqrt(2.0)) * sqrt(t_0)) / t_3); elseif (t_4 <= 0.0) tmp = Float64(Float64(t_2 / Float64(-t_0)) * sqrt(Float64(t_0 * 2.0))); elseif (t_4 <= Inf) tmp = Float64(-1.0 / Float64(t_5 / sqrt(Float64(Float64(Float64(F * 2.0) * t_5) * Float64(Float64(C + A) - hypot(Float64(A - C), B_m)))))); else tmp = Float64(t_2 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-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[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $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[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / 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, -1e+191], N[(N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(t$95$2 / (-t$95$0)), $MachinePrecision] * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(-1.0 / N[(t$95$5 / N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$5), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$2 * N[(N[Sqrt[2.0], $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 C, A, B\_m \cdot B\_m\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
t_3 := t\_1 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_3}\\
t_5 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{+191}:\\
\;\;\;\;\frac{\left(\sqrt{\left(A + A\right) \cdot F} \cdot \sqrt{2}\right) \cdot \sqrt{t\_0}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{t\_2}{-t\_0} \cdot \sqrt{t\_0 \cdot 2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{-1}{\frac{t\_5}{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_5\right) \cdot \left(\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;t\_2 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.00000000000000007e191Initial program 10.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites43.7%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6427.8
Applied rewrites27.8%
Applied rewrites28.3%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6425.1
Applied rewrites25.1%
if -1.00000000000000007e191 < (/.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 53.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites57.8%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6457.3
Applied rewrites57.3%
lift-/.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
Applied rewrites54.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 43.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites60.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 C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification32.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)))
(t_1 (fma (* -4.0 C) A (* B_m B_m)))
(t_2 (* C (* A 4.0)))
(t_3 (- t_2 (pow B_m 2.0)))
(t_4
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_2)) 2.0)))
t_3))
(t_5 (sqrt (* (- A (hypot A B_m)) F))))
(if (<= t_4 -2e+178)
(/ (* (sqrt (* t_0 2.0)) (sqrt (* (+ A A) F))) t_3)
(if (<= t_4 0.0)
(* (/ t_5 (- t_1)) (sqrt (* t_1 2.0)))
(if (<= t_4 INFINITY)
(/
-1.0
(/ t_0 (sqrt (* (* (* F 2.0) t_0) (- (+ C A) (hypot (- A C) B_m))))))
(* t_5 (/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = fma((-4.0 * C), A, (B_m * B_m));
double t_2 = C * (A * 4.0);
double t_3 = t_2 - pow(B_m, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / t_3;
double t_5 = sqrt(((A - hypot(A, B_m)) * F));
double tmp;
if (t_4 <= -2e+178) {
tmp = (sqrt((t_0 * 2.0)) * sqrt(((A + A) * F))) / t_3;
} else if (t_4 <= 0.0) {
tmp = (t_5 / -t_1) * sqrt((t_1 * 2.0));
} else if (t_4 <= ((double) INFINITY)) {
tmp = -1.0 / (t_0 / sqrt((((F * 2.0) * t_0) * ((C + A) - hypot((A - C), B_m)))));
} else {
tmp = t_5 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(t_2 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / t_3) t_5 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) tmp = 0.0 if (t_4 <= -2e+178) tmp = Float64(Float64(sqrt(Float64(t_0 * 2.0)) * sqrt(Float64(Float64(A + A) * F))) / t_3); elseif (t_4 <= 0.0) tmp = Float64(Float64(t_5 / Float64(-t_1)) * sqrt(Float64(t_1 * 2.0))); elseif (t_4 <= Inf) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(C + A) - hypot(Float64(A - C), B_m)))))); else tmp = Float64(t_5 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, -2e+178], N[(N[(N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(t$95$5 / (-t$95$1)), $MachinePrecision] * N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$5 * N[(N[Sqrt[2.0], $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := t\_2 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_3}\\
t_5 := \sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+178}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot 2} \cdot \sqrt{\left(A + A\right) \cdot F}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{t\_5}{-t\_1} \cdot \sqrt{t\_1 \cdot 2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e178Initial program 11.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites44.7%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6423.0
Applied rewrites23.0%
if -2.0000000000000001e178 < (/.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 52.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites57.2%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6458.1
Applied rewrites58.1%
lift-/.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
Applied rewrites55.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 43.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites60.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 C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification32.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 (fma (* -4.0 C) A (* B_m B_m)))
(t_2 (* C (* A 4.0)))
(t_3 (- t_2 (pow B_m 2.0)))
(t_4
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_2)) 2.0)))
t_3))
(t_5 (sqrt (* (- A (hypot A B_m)) F))))
(if (<= t_4 -2e+178)
(/ (* (sqrt (* t_0 2.0)) (sqrt (* (+ A A) F))) t_3)
(if (<= t_4 0.0)
(* (/ t_5 (- t_1)) (sqrt (* t_1 2.0)))
(if (<= t_4 INFINITY)
(/
(sqrt (* (* (* F 2.0) t_0) (- (+ C A) (hypot (- A C) B_m))))
(- t_0))
(* t_5 (/ (sqrt 2.0) (- B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = fma((-4.0 * C), A, (B_m * B_m));
double t_2 = C * (A * 4.0);
double t_3 = t_2 - pow(B_m, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / t_3;
double t_5 = sqrt(((A - hypot(A, B_m)) * F));
double tmp;
if (t_4 <= -2e+178) {
tmp = (sqrt((t_0 * 2.0)) * sqrt(((A + A) * F))) / t_3;
} else if (t_4 <= 0.0) {
tmp = (t_5 / -t_1) * sqrt((t_1 * 2.0));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((((F * 2.0) * t_0) * ((C + A) - hypot((A - C), B_m)))) / -t_0;
} else {
tmp = t_5 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(t_2 - (B_m ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / t_3) t_5 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) tmp = 0.0 if (t_4 <= -2e+178) tmp = Float64(Float64(sqrt(Float64(t_0 * 2.0)) * sqrt(Float64(Float64(A + A) * F))) / t_3); elseif (t_4 <= 0.0) tmp = Float64(Float64(t_5 / Float64(-t_1)) * sqrt(Float64(t_1 * 2.0))); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(C + A) - hypot(Float64(A - C), B_m)))) / Float64(-t_0)); else tmp = Float64(t_5 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, -2e+178], N[(N[(N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(t$95$5 / (-t$95$1)), $MachinePrecision] * N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(t$95$5 * N[(N[Sqrt[2.0], $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := t\_2 - {B\_m}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_3}\\
t_5 := \sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+178}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot 2} \cdot \sqrt{\left(A + A\right) \cdot F}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{t\_5}{-t\_1} \cdot \sqrt{t\_1 \cdot 2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;t\_5 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e178Initial program 11.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites44.7%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6423.0
Applied rewrites23.0%
if -2.0000000000000001e178 < (/.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 52.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites57.2%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6458.1
Applied rewrites58.1%
lift-/.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
Applied rewrites55.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 43.6%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites60.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 C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification32.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 A) C (* B_m B_m)))
(t_1 (sqrt (* (- A (hypot A B_m)) F)))
(t_2 (* C (* A 4.0)))
(t_3 (* (* F (- (pow B_m 2.0) t_2)) 2.0))
(t_4 (- t_2 (pow B_m 2.0)))
(t_5
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0)))) t_3))
t_4)))
(if (<= t_5 -5e-215)
(* (/ (sqrt t_0) t_0) (* (- (sqrt 2.0)) t_1))
(if (<= t_5 INFINITY)
(/ (sqrt (* (+ (fma (/ (* B_m B_m) C) -0.5 A) A) t_3)) t_4)
(* t_1 (/ (sqrt 2.0) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = sqrt(((A - hypot(A, B_m)) * F));
double t_2 = C * (A * 4.0);
double t_3 = (F * (pow(B_m, 2.0) - t_2)) * 2.0;
double t_4 = t_2 - pow(B_m, 2.0);
double t_5 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * t_3)) / t_4;
double tmp;
if (t_5 <= -5e-215) {
tmp = (sqrt(t_0) / t_0) * (-sqrt(2.0) * t_1);
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt(((fma(((B_m * B_m) / C), -0.5, A) + A) * t_3)) / t_4;
} else {
tmp = t_1 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0) t_4 = Float64(t_2 - (B_m ^ 2.0)) t_5 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * t_3)) / t_4) tmp = 0.0 if (t_5 <= -5e-215) tmp = Float64(Float64(sqrt(t_0) / t_0) * Float64(Float64(-sqrt(2.0)) * t_1)); elseif (t_5 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, A) + A) * t_3)) / t_4); else tmp = Float64(t_1 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, -5e-215], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] / t$95$0), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(t$95$1 * N[(N[Sqrt[2.0], $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{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\\
t_4 := t\_2 - {B\_m}^{2}\\
t_5 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot t\_3}}{t\_4}\\
\mathbf{if}\;t\_5 \leq -5 \cdot 10^{-215}:\\
\;\;\;\;\frac{\sqrt{t\_0}}{t\_0} \cdot \left(\left(-\sqrt{2}\right) \cdot t\_1\right)\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A\right) + A\right) \cdot t\_3}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999956e-215Initial program 45.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites65.6%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6450.9
Applied rewrites50.9%
Applied rewrites51.2%
Applied rewrites51.2%
if -4.99999999999999956e-215 < (/.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 22.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6438.4
Applied rewrites38.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification33.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 A) C (* B_m B_m)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (sqrt (* (- A (hypot A B_m)) F)))
(t_3 (* C (* A 4.0)))
(t_4
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_3)) 2.0)))
(- t_3 (pow B_m 2.0)))))
(if (<= t_4 0.0)
(* (/ (sqrt t_0) t_0) (* (- (sqrt 2.0)) t_2))
(if (<= t_4 INFINITY)
(/
-1.0
(/ t_1 (sqrt (* (* (* F 2.0) t_1) (- (+ C A) (hypot (- A C) B_m))))))
(* t_2 (/ (sqrt 2.0) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = sqrt(((A - hypot(A, B_m)) * F));
double t_3 = C * (A * 4.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
double tmp;
if (t_4 <= 0.0) {
tmp = (sqrt(t_0) / t_0) * (-sqrt(2.0) * t_2);
} else if (t_4 <= ((double) INFINITY)) {
tmp = -1.0 / (t_1 / sqrt((((F * 2.0) * t_1) * ((C + A) - hypot((A - C), B_m)))));
} else {
tmp = t_2 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) t_3 = Float64(C * Float64(A * 4.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0))) tmp = 0.0 if (t_4 <= 0.0) tmp = Float64(Float64(sqrt(t_0) / t_0) * Float64(Float64(-sqrt(2.0)) * t_2)); elseif (t_4 <= Inf) tmp = Float64(-1.0 / Float64(t_1 / sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * Float64(Float64(C + A) - hypot(Float64(A - C), B_m)))))); else tmp = Float64(t_2 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] / t$95$0), $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(-1.0 / N[(t$95$1 / N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$2 * N[(N[Sqrt[2.0], $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(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
t_3 := C \cdot \left(A \cdot 4\right)\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{t\_0}}{t\_0} \cdot \left(\left(-\sqrt{2}\right) \cdot t\_2\right)\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{-1}{\frac{t\_1}{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot \left(\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;t\_2 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 34.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites51.6%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6444.2
Applied rewrites44.2%
Applied rewrites44.4%
Applied rewrites44.4%
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 43.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites60.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 C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification34.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 (- (+ C A) (hypot (- A C) B_m)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (* C (* A 4.0)))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_2)) 2.0)))
(- t_2 (pow B_m 2.0)))))
(if (<= t_3 (- INFINITY))
(* (sqrt (* (/ t_0 t_1) F)) (- (sqrt 2.0)))
(if (<= t_3 INFINITY)
(/ (sqrt (* (* (* F 2.0) t_1) t_0)) (- t_1))
(* (sqrt (* (- A (hypot A B_m)) F)) (/ (sqrt 2.0) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (C + A) - hypot((A - C), B_m);
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = C * (A * 4.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B_m, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt(((t_0 / t_1) * F)) * -sqrt(2.0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((((F * 2.0) * t_1) * t_0)) / -t_1;
} else {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B_m ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(t_0 / t_1) * F)) * Float64(-sqrt(2.0))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * t_0)) / Float64(-t_1)); else tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[N[(N[(t$95$0 / t$95$1), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $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 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\sqrt{\frac{t\_0}{t\_1} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot t\_0}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.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
associate-/l*N/A
lower-*.f64N/A
Applied rewrites50.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))) < +inf.0Initial program 52.6%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites57.3%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.3
Applied rewrites14.3%
Final simplification38.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* C (* A 4.0))))
(if (<=
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* F (- (pow B_m 2.0) t_0)) 2.0)))
(- t_0 (pow B_m 2.0)))
-2e-106)
(*
(sqrt
(*
(/ (- (+ C A) (hypot (- A C) B_m)) (fma -4.0 (* C A) (* B_m B_m)))
F))
(- (sqrt 2.0)))
(* (sqrt (* (- A (hypot A B_m)) F)) (/ (sqrt 2.0) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = C * (A * 4.0);
double tmp;
if ((sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_0)) * 2.0))) / (t_0 - pow(B_m, 2.0))) <= -2e-106) {
tmp = sqrt(((((C + A) - hypot((A - C), B_m)) / fma(-4.0, (C * A), (B_m * B_m))) * F)) * -sqrt(2.0);
} else {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(C * Float64(A * 4.0)) tmp = 0.0 if (Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0))) / Float64(t_0 - (B_m ^ 2.0))) <= -2e-106) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / fma(-4.0, Float64(C * A), Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-106], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $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 := C \cdot \left(A \cdot 4\right)\\
\mathbf{if}\;\frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_0 - {B\_m}^{2}} \leq -2 \cdot 10^{-106}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999988e-106Initial program 40.1%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites63.6%
if -1.99999999999999988e-106 < (/.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 12.3%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6412.2
Applied rewrites12.2%
Final simplification28.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 (* (- A (hypot A B_m)) F)))
(t_1 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= (pow B_m 2.0) 2.5e-280)
(/ (* (sqrt (* t_1 2.0)) t_0) (- (* (* C A) -4.0)))
(if (<= (pow B_m 2.0) 4e+271)
(* (sqrt (* (/ (- (+ C A) (hypot (- A C) B_m)) t_1) F)) (- (sqrt 2.0)))
(* t_0 (/ (sqrt 2.0) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt(((A - hypot(A, B_m)) * F));
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2.5e-280) {
tmp = (sqrt((t_1 * 2.0)) * t_0) / -((C * A) * -4.0);
} else if (pow(B_m, 2.0) <= 4e+271) {
tmp = sqrt(((((C + A) - hypot((A - C), B_m)) / t_1) * F)) * -sqrt(2.0);
} else {
tmp = t_0 * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2.5e-280) tmp = Float64(Float64(sqrt(Float64(t_1 * 2.0)) * t_0) / Float64(-Float64(Float64(C * A) * -4.0))); elseif ((B_m ^ 2.0) <= 4e+271) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_1) * F)) * Float64(-sqrt(2.0))); else tmp = Float64(t_0 * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2.5e-280], N[(N[(N[Sqrt[N[(t$95$1 * 2.0), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+271], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(t$95$0 * N[(N[Sqrt[2.0], $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 := \sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F}\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2.5 \cdot 10^{-280}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot 2} \cdot t\_0}{-\left(C \cdot A\right) \cdot -4}\\
\mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{+271}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_1} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.50000000000000014e-280Initial program 18.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites20.7%
Taylor expanded in C around 0
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6415.7
Applied rewrites15.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6414.9
Applied rewrites14.9%
if 2.50000000000000014e-280 < (pow.f64 B #s(literal 2 binary64)) < 3.99999999999999981e271Initial program 32.4%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites41.6%
if 3.99999999999999981e271 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.5%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6421.6
Applied rewrites21.6%
Final simplification29.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* C (* A 4.0))))
(if (<= (pow B_m 2.0) 2e+30)
(/
(sqrt (* (+ A A) (* (* F (- (pow B_m 2.0) t_0)) 2.0)))
(- t_0 (pow B_m 2.0)))
(* (sqrt (* (- A (hypot A B_m)) F)) (/ (sqrt 2.0) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = C * (A * 4.0);
double tmp;
if (pow(B_m, 2.0) <= 2e+30) {
tmp = sqrt(((A + A) * ((F * (pow(B_m, 2.0) - t_0)) * 2.0))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = C * (A * 4.0);
double tmp;
if (Math.pow(B_m, 2.0) <= 2e+30) {
tmp = Math.sqrt(((A + A) * ((F * (Math.pow(B_m, 2.0) - t_0)) * 2.0))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = Math.sqrt(((A - Math.hypot(A, B_m)) * F)) * (Math.sqrt(2.0) / -B_m);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = C * (A * 4.0) tmp = 0 if math.pow(B_m, 2.0) <= 2e+30: tmp = math.sqrt(((A + A) * ((F * (math.pow(B_m, 2.0) - t_0)) * 2.0))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = math.sqrt(((A - math.hypot(A, B_m)) * F)) * (math.sqrt(2.0) / -B_m) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(C * Float64(A * 4.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+30) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_0)) * 2.0))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(sqrt(Float64(Float64(A - hypot(A, B_m)) * F)) * Float64(sqrt(2.0) / Float64(-B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = C * (A * 4.0);
tmp = 0.0;
if ((B_m ^ 2.0) <= 2e+30)
tmp = sqrt(((A + A) * ((F * ((B_m ^ 2.0) - t_0)) * 2.0))) / (t_0 - (B_m ^ 2.0));
else
tmp = sqrt(((A - hypot(A, B_m)) * F)) * (sqrt(2.0) / -B_m);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+30], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $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 := C \cdot \left(A \cdot 4\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+30}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F} \cdot \frac{\sqrt{2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e30Initial program 24.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6426.0
Applied rewrites26.0%
if 2e30 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.6%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6422.6
Applied rewrites22.6%
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 (if (<= C 2.1e+92) (/ (sqrt (* (* (- A (hypot A B_m)) F) 2.0)) (- B_m)) (/ (sqrt (/ (* (* B_m B_m) F) (- 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 tmp;
if (C <= 2.1e+92) {
tmp = sqrt((((A - hypot(A, B_m)) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((((B_m * B_m) * F) / -C)) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.1e+92) {
tmp = Math.sqrt((((A - Math.hypot(A, B_m)) * F) * 2.0)) / -B_m;
} else {
tmp = Math.sqrt((((B_m * B_m) * F) / -C)) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.1e+92: tmp = math.sqrt((((A - math.hypot(A, B_m)) * F) * 2.0)) / -B_m else: tmp = math.sqrt((((B_m * B_m) * F) / -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) tmp = 0.0 if (C <= 2.1e+92) tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(Float64(Float64(B_m * B_m) * F) / Float64(-C))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.1e+92)
tmp = sqrt((((A - hypot(A, B_m)) * F) * 2.0)) / -B_m;
else
tmp = sqrt((((B_m * B_m) * F) / -C)) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.1e+92], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision] / (-C)), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.1 \cdot 10^{+92}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{\left(B\_m \cdot B\_m\right) \cdot F}{-C}}}{-B\_m}\\
\end{array}
\end{array}
if C < 2.09999999999999986e92Initial program 26.1%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6416.5
Applied rewrites16.5%
Applied rewrites16.6%
if 2.09999999999999986e92 < C Initial program 1.3%
Taylor expanded in A around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f648.0
Applied rewrites8.0%
Applied rewrites6.1%
Taylor expanded in B around 0
Applied rewrites21.1%
Final simplification17.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 4.7e+90) (/ (sqrt (* (* F B_m) -2.0)) (- B_m)) (/ (sqrt (/ (* (* B_m B_m) F) (- 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 tmp;
if (C <= 4.7e+90) {
tmp = sqrt(((F * B_m) * -2.0)) / -B_m;
} else {
tmp = sqrt((((B_m * B_m) * F) / -C)) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 4.7d+90) then
tmp = sqrt(((f * b_m) * (-2.0d0))) / -b_m
else
tmp = sqrt((((b_m * b_m) * f) / -c)) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 4.7e+90) {
tmp = Math.sqrt(((F * B_m) * -2.0)) / -B_m;
} else {
tmp = Math.sqrt((((B_m * B_m) * F) / -C)) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 4.7e+90: tmp = math.sqrt(((F * B_m) * -2.0)) / -B_m else: tmp = math.sqrt((((B_m * B_m) * F) / -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) tmp = 0.0 if (C <= 4.7e+90) tmp = Float64(sqrt(Float64(Float64(F * B_m) * -2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(Float64(Float64(B_m * B_m) * F) / Float64(-C))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 4.7e+90)
tmp = sqrt(((F * B_m) * -2.0)) / -B_m;
else
tmp = sqrt((((B_m * B_m) * F) / -C)) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 4.7e+90], N[(N[Sqrt[N[(N[(F * B$95$m), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision] / (-C)), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 4.7 \cdot 10^{+90}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot B\_m\right) \cdot -2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{\left(B\_m \cdot B\_m\right) \cdot F}{-C}}}{-B\_m}\\
\end{array}
\end{array}
if C < 4.7000000000000001e90Initial program 26.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
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6415.9
Applied rewrites15.9%
Applied rewrites15.9%
Taylor expanded in B around inf
Applied rewrites13.9%
if 4.7000000000000001e90 < C Initial program 1.3%
Taylor expanded in A around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f648.0
Applied rewrites8.0%
Applied rewrites6.1%
Taylor expanded in B around 0
Applied rewrites21.1%
Final simplification15.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)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F * B_m) * -2.0)) / -B_m;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((f * b_m) * (-2.0d0))) / -b_m
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(((F * B_m) * -2.0)) / -B_m;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(((F * B_m) * -2.0)) / -B_m
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(Float64(F * B_m) * -2.0)) / Float64(-B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((F * B_m) * -2.0)) / -B_m;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(N[(F * B$95$m), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(F \cdot B\_m\right) \cdot -2}}{-B\_m}
\end{array}
Initial program 21.3%
Taylor expanded in A around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f6414.4
Applied rewrites14.4%
Applied rewrites14.0%
Taylor expanded in B around inf
Applied rewrites12.1%
Final simplification12.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ 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 sqrt(Float64(2.0 / Float64(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[(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])\\
\\
\sqrt{\frac{2}{\frac{B\_m}{F}}}
\end{array}
Initial program 21.3%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Applied rewrites1.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 (* (/ F B_m) 2.0)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F / B_m) * 2.0));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((f / b_m) * 2.0d0))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(((F / B_m) * 2.0));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(((F / B_m) * 2.0))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(Float64(F / B_m) * 2.0)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((F / B_m) * 2.0));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{F}{B\_m} \cdot 2}
\end{array}
Initial program 21.3%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
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 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 21.3%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Applied rewrites1.8%
Final simplification1.8%
herbie shell --seed 2024304
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))