
(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 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (pow B_m 2.0)))
(t_1 (- (pow B_m 2.0) (* C (* 4.0 A))))
(t_2 (* t_1 F))
(t_3 (* 2.0 t_2))
(t_4
(/
(-
(sqrt
(* t_3 (- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_1))
(t_5 (fma B_m B_m (* A (* C -4.0)))))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* 2.0 t_0)) (- (sqrt (* F (+ A A))))) t_0)
(if (<= t_4 -5e-212)
(/
1.0
(/ t_1 (- (sqrt (* 2.0 (* (+ A (- C (hypot B_m (- A C)))) t_2))))))
(if (<= t_4 4e-13)
(*
(sqrt
(*
t_5
(*
F
(*
2.0
(+
A
(-
A
(*
-0.5
(/ (- (- (pow (- A) 2.0) (pow B_m 2.0)) (pow A 2.0)) C))))))))
(/ -1.0 t_5))
(if (<= t_4 INFINITY)
(/ (- (sqrt (* t_3 (+ A (+ A C))))) t_1)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (- (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(A, (C * -4.0), pow(B_m, 2.0));
double t_1 = pow(B_m, 2.0) - (C * (4.0 * A));
double t_2 = t_1 * F;
double t_3 = 2.0 * t_2;
double t_4 = -sqrt((t_3 * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_1;
double t_5 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt((2.0 * t_0)) * -sqrt((F * (A + A)))) / t_0;
} else if (t_4 <= -5e-212) {
tmp = 1.0 / (t_1 / -sqrt((2.0 * ((A + (C - hypot(B_m, (A - C)))) * t_2))));
} else if (t_4 <= 4e-13) {
tmp = sqrt((t_5 * (F * (2.0 * (A + (A - (-0.5 * (((pow(-A, 2.0) - pow(B_m, 2.0)) - pow(A, 2.0)) / C)))))))) * (-1.0 / t_5);
} else if (t_4 <= ((double) INFINITY)) {
tmp = -sqrt((t_3 * (A + (A + C)))) / t_1;
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-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(A, Float64(C * -4.0), (B_m ^ 2.0)) t_1 = Float64((B_m ^ 2.0) - Float64(C * Float64(4.0 * A))) t_2 = Float64(t_1 * F) t_3 = Float64(2.0 * t_2) t_4 = Float64(Float64(-sqrt(Float64(t_3 * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_1) t_5 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * Float64(-sqrt(Float64(F * Float64(A + A))))) / t_0); elseif (t_4 <= -5e-212) tmp = Float64(1.0 / Float64(t_1 / Float64(-sqrt(Float64(2.0 * Float64(Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) * t_2)))))); elseif (t_4 <= 4e-13) tmp = Float64(sqrt(Float64(t_5 * Float64(F * Float64(2.0 * Float64(A + Float64(A - Float64(-0.5 * Float64(Float64(Float64((Float64(-A) ^ 2.0) - (B_m ^ 2.0)) - (A ^ 2.0)) / C)))))))) * Float64(-1.0 / t_5)); elseif (t_4 <= Inf) tmp = Float64(Float64(-sqrt(Float64(t_3 * Float64(A + Float64(A + C))))) / t_1); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * F), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(t$95$3 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision]}, Block[{t$95$5 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$4, -5e-212], N[(1.0 / N[(t$95$1 / (-N[Sqrt[N[(2.0 * N[(N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 4e-13], N[(N[Sqrt[N[(t$95$5 * N[(F * N[(2.0 * N[(A + N[(A - N[(-0.5 * N[(N[(N[(N[Power[(-A), 2.0], $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - N[Power[A, 2.0], $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[((-N[Sqrt[N[(t$95$3 * N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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(A, C \cdot -4, {B_m}^{2}\right)\\
t_1 := {B_m}^{2} - C \cdot \left(4 \cdot A\right)\\
t_2 := t_1 \cdot F\\
t_3 := 2 \cdot t_2\\
t_4 := \frac{-\sqrt{t_3 \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_1}\\
t_5 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;t_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot t_0} \cdot \left(-\sqrt{F \cdot \left(A + A\right)}\right)}{t_0}\\
\mathbf{elif}\;t_4 \leq -5 \cdot 10^{-212}:\\
\;\;\;\;\frac{1}{\frac{t_1}{-\sqrt{2 \cdot \left(\left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right) \cdot t_2\right)}}}\\
\mathbf{elif}\;t_4 \leq 4 \cdot 10^{-13}:\\
\;\;\;\;\sqrt{t_5 \cdot \left(F \cdot \left(2 \cdot \left(A + \left(A - -0.5 \cdot \frac{\left({\left(-A\right)}^{2} - {B_m}^{2}\right) - {A}^{2}}{C}\right)\right)\right)\right)} \cdot \frac{-1}{t_5}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\frac{-\sqrt{t_3 \cdot \left(A + \left(A + C\right)\right)}}{t_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.3%
Simplified10.2%
pow1/210.2%
associate-*r*18.8%
unpow-prod-down51.2%
associate-+r-48.9%
pow1/248.9%
Applied egg-rr48.9%
unpow1/248.9%
+-commutative48.9%
associate-+r-49.7%
Simplified49.7%
Taylor expanded in C around inf 24.6%
mul-1-neg24.6%
Simplified24.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -5.00000000000000043e-212Initial program 99.3%
clear-num99.4%
inv-pow99.4%
Applied egg-rr99.4%
unpow-199.4%
*-commutative99.4%
+-commutative99.4%
associate-+r-99.4%
Simplified99.4%
if -5.00000000000000043e-212 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 4.0000000000000001e-13Initial program 8.6%
Simplified10.9%
div-inv10.8%
associate-*l*11.5%
*-commutative11.5%
associate-+r-9.3%
+-commutative9.3%
Applied egg-rr9.3%
Taylor expanded in C around inf 34.5%
associate--l+34.5%
associate--l+34.5%
mul-1-neg34.5%
mul-1-neg34.5%
Simplified34.5%
if 4.0000000000000001e-13 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 27.4%
Taylor expanded in A around -inf 31.4%
mul-1-neg31.4%
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified0.7%
Taylor expanded in C around 0 3.1%
mul-1-neg3.1%
*-commutative3.1%
distribute-rgt-neg-in3.1%
+-commutative3.1%
unpow23.1%
unpow23.1%
hypot-def12.8%
Simplified12.8%
Final simplification32.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma A (* C -4.0) (pow B_m 2.0)))
(t_1 (hypot B_m (- A C)))
(t_2 (- (pow B_m 2.0) (* C (* 4.0 A))))
(t_3 (* t_2 F))
(t_4
(/
(-
(sqrt
(*
(* 2.0 t_3)
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_2))
(t_5 (fma B_m B_m (* A (* C -4.0)))))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* 2.0 t_0)) (- (sqrt (* F (+ A A))))) t_0)
(if (<= t_4 -5e-212)
(/ 1.0 (/ t_2 (- (sqrt (* 2.0 (* (+ A (- C t_1)) t_3))))))
(if (<= t_4 1e+183)
(/
(-
(sqrt
(*
(* F t_5)
(*
2.0
(+
A
(-
A
(*
-0.5
(/ (- (- (pow (- A) 2.0) (pow B_m 2.0)) (pow A 2.0)) C))))))))
t_5)
(if (<= t_4 INFINITY)
(/
(- (pow (sqrt (sqrt (* t_5 (* F (* 2.0 (- (+ A C) t_1)))))) 2.0))
t_5)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (- (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(A, (C * -4.0), pow(B_m, 2.0));
double t_1 = hypot(B_m, (A - C));
double t_2 = pow(B_m, 2.0) - (C * (4.0 * A));
double t_3 = t_2 * F;
double t_4 = -sqrt(((2.0 * t_3) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_5 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt((2.0 * t_0)) * -sqrt((F * (A + A)))) / t_0;
} else if (t_4 <= -5e-212) {
tmp = 1.0 / (t_2 / -sqrt((2.0 * ((A + (C - t_1)) * t_3))));
} else if (t_4 <= 1e+183) {
tmp = -sqrt(((F * t_5) * (2.0 * (A + (A - (-0.5 * (((pow(-A, 2.0) - pow(B_m, 2.0)) - pow(A, 2.0)) / C))))))) / t_5;
} else if (t_4 <= ((double) INFINITY)) {
tmp = -pow(sqrt(sqrt((t_5 * (F * (2.0 * ((A + C) - t_1)))))), 2.0) / t_5;
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-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(A, Float64(C * -4.0), (B_m ^ 2.0)) t_1 = hypot(B_m, Float64(A - C)) t_2 = Float64((B_m ^ 2.0) - Float64(C * Float64(4.0 * A))) t_3 = Float64(t_2 * F) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * t_3) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_2) t_5 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * Float64(-sqrt(Float64(F * Float64(A + A))))) / t_0); elseif (t_4 <= -5e-212) tmp = Float64(1.0 / Float64(t_2 / Float64(-sqrt(Float64(2.0 * Float64(Float64(A + Float64(C - t_1)) * t_3)))))); elseif (t_4 <= 1e+183) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_5) * Float64(2.0 * Float64(A + Float64(A - Float64(-0.5 * Float64(Float64(Float64((Float64(-A) ^ 2.0) - (B_m ^ 2.0)) - (A ^ 2.0)) / C)))))))) / t_5); elseif (t_4 <= Inf) tmp = Float64(Float64(-(sqrt(sqrt(Float64(t_5 * Float64(F * Float64(2.0 * Float64(Float64(A + C) - t_1)))))) ^ 2.0)) / t_5); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * F), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * t$95$3), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision]}, Block[{t$95$5 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$4, -5e-212], N[(1.0 / N[(t$95$2 / (-N[Sqrt[N[(2.0 * N[(N[(A + N[(C - t$95$1), $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 1e+183], N[((-N[Sqrt[N[(N[(F * t$95$5), $MachinePrecision] * N[(2.0 * N[(A + N[(A - N[(-0.5 * N[(N[(N[(N[Power[(-A), 2.0], $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - N[Power[A, 2.0], $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$5), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[((-N[Power[N[Sqrt[N[Sqrt[N[(t$95$5 * N[(F * N[(2.0 * N[(N[(A + C), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]) / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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(A, C \cdot -4, {B_m}^{2}\right)\\
t_1 := \mathsf{hypot}\left(B_m, A - C\right)\\
t_2 := {B_m}^{2} - C \cdot \left(4 \cdot A\right)\\
t_3 := t_2 \cdot F\\
t_4 := \frac{-\sqrt{\left(2 \cdot t_3\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_2}\\
t_5 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;t_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot t_0} \cdot \left(-\sqrt{F \cdot \left(A + A\right)}\right)}{t_0}\\
\mathbf{elif}\;t_4 \leq -5 \cdot 10^{-212}:\\
\;\;\;\;\frac{1}{\frac{t_2}{-\sqrt{2 \cdot \left(\left(A + \left(C - t_1\right)\right) \cdot t_3\right)}}}\\
\mathbf{elif}\;t_4 \leq 10^{+183}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_5\right) \cdot \left(2 \cdot \left(A + \left(A - -0.5 \cdot \frac{\left({\left(-A\right)}^{2} - {B_m}^{2}\right) - {A}^{2}}{C}\right)\right)\right)}}{t_5}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\frac{-{\left(\sqrt{\sqrt{t_5 \cdot \left(F \cdot \left(2 \cdot \left(\left(A + C\right) - t_1\right)\right)\right)}}\right)}^{2}}{t_5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.3%
Simplified10.2%
pow1/210.2%
associate-*r*18.8%
unpow-prod-down51.2%
associate-+r-48.9%
pow1/248.9%
Applied egg-rr48.9%
unpow1/248.9%
+-commutative48.9%
associate-+r-49.7%
Simplified49.7%
Taylor expanded in C around inf 24.6%
mul-1-neg24.6%
Simplified24.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -5.00000000000000043e-212Initial program 99.3%
clear-num99.4%
inv-pow99.4%
Applied egg-rr99.4%
unpow-199.4%
*-commutative99.4%
+-commutative99.4%
associate-+r-99.4%
Simplified99.4%
if -5.00000000000000043e-212 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 9.99999999999999947e182Initial program 21.0%
Simplified22.9%
Taylor expanded in C around inf 34.2%
associate--l+34.2%
mul-1-neg34.2%
Simplified34.2%
if 9.99999999999999947e182 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 3.4%
Simplified56.9%
add-sqr-sqrt57.0%
pow257.0%
associate-*l*57.0%
*-commutative57.0%
associate-+r-57.0%
+-commutative57.0%
Applied egg-rr57.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified0.7%
Taylor expanded in C around 0 3.1%
mul-1-neg3.1%
*-commutative3.1%
distribute-rgt-neg-in3.1%
+-commutative3.1%
unpow23.1%
unpow23.1%
hypot-def12.8%
Simplified12.8%
Final simplification33.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 B_m B_m (* A (* C -4.0))))
(t_1 (fma A (* C -4.0) (pow B_m 2.0)))
(t_2 (- (pow B_m 2.0) (* C (* 4.0 A))))
(t_3 (* 2.0 (* t_2 F)))
(t_4
(/
(-
(sqrt
(* t_3 (- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_2)))
(if (<= t_4 -5e-212)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (- (sqrt (* 2.0 t_1))))
t_1)
(if (<= t_4 4e-13)
(*
(sqrt
(*
t_0
(*
F
(*
2.0
(+
A
(-
A
(*
-0.5
(/ (- (- (pow (- A) 2.0) (pow B_m 2.0)) (pow A 2.0)) C))))))))
(/ -1.0 t_0))
(if (<= t_4 INFINITY)
(/ (- (sqrt (* t_3 (+ A (+ A C))))) t_2)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (- (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(B_m, B_m, (A * (C * -4.0)));
double t_1 = fma(A, (C * -4.0), pow(B_m, 2.0));
double t_2 = pow(B_m, 2.0) - (C * (4.0 * A));
double t_3 = 2.0 * (t_2 * F);
double t_4 = -sqrt((t_3 * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_4 <= -5e-212) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * -sqrt((2.0 * t_1))) / t_1;
} else if (t_4 <= 4e-13) {
tmp = sqrt((t_0 * (F * (2.0 * (A + (A - (-0.5 * (((pow(-A, 2.0) - pow(B_m, 2.0)) - pow(A, 2.0)) / C)))))))) * (-1.0 / t_0);
} else if (t_4 <= ((double) INFINITY)) {
tmp = -sqrt((t_3 * (A + (A + C)))) / t_2;
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-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(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = fma(A, Float64(C * -4.0), (B_m ^ 2.0)) t_2 = Float64((B_m ^ 2.0) - Float64(C * Float64(4.0 * A))) t_3 = Float64(2.0 * Float64(t_2 * F)) t_4 = Float64(Float64(-sqrt(Float64(t_3 * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_2) tmp = 0.0 if (t_4 <= -5e-212) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))) * Float64(-sqrt(Float64(2.0 * t_1)))) / t_1); elseif (t_4 <= 4e-13) tmp = Float64(sqrt(Float64(t_0 * Float64(F * Float64(2.0 * Float64(A + Float64(A - Float64(-0.5 * Float64(Float64(Float64((Float64(-A) ^ 2.0) - (B_m ^ 2.0)) - (A ^ 2.0)) / C)))))))) * Float64(-1.0 / t_0)); elseif (t_4 <= Inf) tmp = Float64(Float64(-sqrt(Float64(t_3 * Float64(A + Float64(A + C))))) / t_2); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(t$95$3 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$4, -5e-212], N[(N[(N[Sqrt[N[(F * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$4, 4e-13], N[(N[Sqrt[N[(t$95$0 * N[(F * N[(2.0 * N[(A + N[(A - N[(-0.5 * N[(N[(N[(N[Power[(-A), 2.0], $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - N[Power[A, 2.0], $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[((-N[Sqrt[N[(t$95$3 * N[(A + N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)\\
t_2 := {B_m}^{2} - C \cdot \left(4 \cdot A\right)\\
t_3 := 2 \cdot \left(t_2 \cdot F\right)\\
t_4 := \frac{-\sqrt{t_3 \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_2}\\
\mathbf{if}\;t_4 \leq -5 \cdot 10^{-212}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)} \cdot \left(-\sqrt{2 \cdot t_1}\right)}{t_1}\\
\mathbf{elif}\;t_4 \leq 4 \cdot 10^{-13}:\\
\;\;\;\;\sqrt{t_0 \cdot \left(F \cdot \left(2 \cdot \left(A + \left(A - -0.5 \cdot \frac{\left({\left(-A\right)}^{2} - {B_m}^{2}\right) - {A}^{2}}{C}\right)\right)\right)\right)} \cdot \frac{-1}{t_0}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\frac{-\sqrt{t_3 \cdot \left(A + \left(A + C\right)\right)}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -5.00000000000000043e-212Initial program 38.0%
Simplified39.3%
pow1/239.3%
associate-*r*46.9%
unpow-prod-down67.6%
associate-+r-66.1%
pow1/266.1%
Applied egg-rr66.1%
unpow1/266.1%
+-commutative66.1%
associate-+r-66.6%
Simplified66.6%
if -5.00000000000000043e-212 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < 4.0000000000000001e-13Initial program 8.6%
Simplified10.9%
div-inv10.8%
associate-*l*11.5%
*-commutative11.5%
associate-+r-9.3%
+-commutative9.3%
Applied egg-rr9.3%
Taylor expanded in C around inf 34.5%
associate--l+34.5%
associate--l+34.5%
mul-1-neg34.5%
mul-1-neg34.5%
Simplified34.5%
if 4.0000000000000001e-13 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 27.4%
Taylor expanded in A around -inf 31.4%
mul-1-neg31.4%
Simplified31.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified0.7%
Taylor expanded in C around 0 3.1%
mul-1-neg3.1%
*-commutative3.1%
distribute-rgt-neg-in3.1%
+-commutative3.1%
unpow23.1%
unpow23.1%
hypot-def12.8%
Simplified12.8%
Final simplification37.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 A (* C -4.0) (pow B_m 2.0)))
(t_1 (* F (+ A A)))
(t_2 (- (pow B_m 2.0) (* C (* 4.0 A))))
(t_3 (* t_2 F))
(t_4
(/
(-
(sqrt
(*
(* 2.0 t_3)
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_2)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* 2.0 t_0)) (- (sqrt t_1))) t_0)
(if (<= t_4 -5e-212)
(/
1.0
(/ t_2 (- (sqrt (* 2.0 (* (+ A (- C (hypot B_m (- A C)))) t_3))))))
(if (<= t_4 INFINITY)
(- (/ (sqrt (* -8.0 (* (* A C) t_1))) t_0))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (- (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(A, (C * -4.0), pow(B_m, 2.0));
double t_1 = F * (A + A);
double t_2 = pow(B_m, 2.0) - (C * (4.0 * A));
double t_3 = t_2 * F;
double t_4 = -sqrt(((2.0 * t_3) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt((2.0 * t_0)) * -sqrt(t_1)) / t_0;
} else if (t_4 <= -5e-212) {
tmp = 1.0 / (t_2 / -sqrt((2.0 * ((A + (C - hypot(B_m, (A - C)))) * t_3))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = -(sqrt((-8.0 * ((A * C) * t_1))) / t_0);
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-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(A, Float64(C * -4.0), (B_m ^ 2.0)) t_1 = Float64(F * Float64(A + A)) t_2 = Float64((B_m ^ 2.0) - Float64(C * Float64(4.0 * A))) t_3 = Float64(t_2 * F) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * t_3) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_2) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(2.0 * t_0)) * Float64(-sqrt(t_1))) / t_0); elseif (t_4 <= -5e-212) tmp = Float64(1.0 / Float64(t_2 / Float64(-sqrt(Float64(2.0 * Float64(Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) * t_3)))))); elseif (t_4 <= Inf) tmp = Float64(-Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * t_1))) / t_0)); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * F), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * t$95$3), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[t$95$1], $MachinePrecision])), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$4, -5e-212], N[(1.0 / N[(t$95$2 / (-N[Sqrt[N[(2.0 * N[(N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], (-N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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(A, C \cdot -4, {B_m}^{2}\right)\\
t_1 := F \cdot \left(A + A\right)\\
t_2 := {B_m}^{2} - C \cdot \left(4 \cdot A\right)\\
t_3 := t_2 \cdot F\\
t_4 := \frac{-\sqrt{\left(2 \cdot t_3\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_2}\\
\mathbf{if}\;t_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot t_0} \cdot \left(-\sqrt{t_1}\right)}{t_0}\\
\mathbf{elif}\;t_4 \leq -5 \cdot 10^{-212}:\\
\;\;\;\;\frac{1}{\frac{t_2}{-\sqrt{2 \cdot \left(\left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right) \cdot t_3\right)}}}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;-\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot t_1\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -inf.0Initial program 3.3%
Simplified10.2%
pow1/210.2%
associate-*r*18.8%
unpow-prod-down51.2%
associate-+r-48.9%
pow1/248.9%
Applied egg-rr48.9%
unpow1/248.9%
+-commutative48.9%
associate-+r-49.7%
Simplified49.7%
Taylor expanded in C around inf 24.6%
mul-1-neg24.6%
Simplified24.6%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < -5.00000000000000043e-212Initial program 99.3%
clear-num99.4%
inv-pow99.4%
Applied egg-rr99.4%
unpow-199.4%
*-commutative99.4%
+-commutative99.4%
associate-+r-99.4%
Simplified99.4%
if -5.00000000000000043e-212 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) < +inf.0Initial program 15.9%
Simplified26.8%
Taylor expanded in C around inf 19.7%
associate-*r*19.8%
sub-neg19.8%
mul-1-neg19.8%
remove-double-neg19.8%
Simplified19.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 2 (*.f64 (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) 2) (pow.f64 B 2))))))) (-.f64 (pow.f64 B 2) (*.f64 (*.f64 4 A) C))) Initial program 0.0%
Simplified0.7%
Taylor expanded in C around 0 3.1%
mul-1-neg3.1%
*-commutative3.1%
distribute-rgt-neg-in3.1%
+-commutative3.1%
unpow23.1%
unpow23.1%
hypot-def12.8%
Simplified12.8%
Final simplification28.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (- (sqrt 2.0)) B_m)))
(if (<= (pow B_m 2.0) 1e-17)
(-
(/
(sqrt (* -8.0 (* (* A C) (* F (+ A A)))))
(fma A (* C -4.0) (pow B_m 2.0))))
(if (or (<= (pow B_m 2.0) 5e+119)
(and (not (<= (pow B_m 2.0) 4e+145))
(or (<= (pow B_m 2.0) 2e+187)
(not (<= (pow B_m 2.0) 2e+239)))))
(* (sqrt (* F (- A (hypot B_m A)))) t_0)
(* t_0 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0) / B_m;
double tmp;
if (pow(B_m, 2.0) <= 1e-17) {
tmp = -(sqrt((-8.0 * ((A * C) * (F * (A + A))))) / fma(A, (C * -4.0), pow(B_m, 2.0)));
} else if ((pow(B_m, 2.0) <= 5e+119) || (!(pow(B_m, 2.0) <= 4e+145) && ((pow(B_m, 2.0) <= 2e+187) || !(pow(B_m, 2.0) <= 2e+239)))) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * t_0;
} else {
tmp = t_0 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(-sqrt(2.0)) / B_m) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-17) tmp = Float64(-Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / fma(A, Float64(C * -4.0), (B_m ^ 2.0)))); elseif (((B_m ^ 2.0) <= 5e+119) || (!((B_m ^ 2.0) <= 4e+145) && (((B_m ^ 2.0) <= 2e+187) || !((B_m ^ 2.0) <= 2e+239)))) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * t_0); else tmp = Float64(t_0 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); 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[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-17], (-N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+119], And[N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+145]], $MachinePrecision], Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+187], N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+239]], $MachinePrecision]]]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $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 := \frac{-\sqrt{2}}{B_m}\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-17}:\\
\;\;\;\;-\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{\mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+119} \lor \neg \left({B_m}^{2} \leq 4 \cdot 10^{+145}\right) \land \left({B_m}^{2} \leq 2 \cdot 10^{+187} \lor \neg \left({B_m}^{2} \leq 2 \cdot 10^{+239}\right)\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot t_0\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000007e-17Initial program 21.1%
Simplified27.5%
Taylor expanded in C around inf 16.9%
associate-*r*17.6%
sub-neg17.6%
mul-1-neg17.6%
remove-double-neg17.6%
Simplified17.6%
if 1.00000000000000007e-17 < (pow.f64 B 2) < 4.9999999999999999e119 or 4e145 < (pow.f64 B 2) < 1.99999999999999981e187 or 1.99999999999999998e239 < (pow.f64 B 2) Initial program 15.8%
Simplified15.8%
Taylor expanded in C around 0 14.9%
mul-1-neg14.9%
*-commutative14.9%
distribute-rgt-neg-in14.9%
+-commutative14.9%
unpow214.9%
unpow214.9%
hypot-def23.8%
Simplified23.8%
if 4.9999999999999999e119 < (pow.f64 B 2) < 4e145 or 1.99999999999999981e187 < (pow.f64 B 2) < 1.99999999999999998e239Initial program 7.1%
Simplified8.8%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
*-commutative10.4%
distribute-rgt-neg-in10.4%
unpow210.4%
unpow210.4%
hypot-def11.1%
Simplified11.1%
Taylor expanded in C around inf 31.9%
Final simplification21.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
(let* ((t_0 (/ (- (sqrt 2.0)) B_m)) (t_1 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-17)
(* (sqrt (* t_1 (* F (* 2.0 (* 2.0 A))))) (/ -1.0 t_1))
(if (or (<= (pow B_m 2.0) 5e+119)
(and (not (<= (pow B_m 2.0) 4e+145))
(or (<= (pow B_m 2.0) 2e+187)
(not (<= (pow B_m 2.0) 2e+239)))))
(* (sqrt (* F (- A (hypot B_m A)))) t_0)
(* t_0 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0) / B_m;
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-17) {
tmp = sqrt((t_1 * (F * (2.0 * (2.0 * A))))) * (-1.0 / t_1);
} else if ((pow(B_m, 2.0) <= 5e+119) || (!(pow(B_m, 2.0) <= 4e+145) && ((pow(B_m, 2.0) <= 2e+187) || !(pow(B_m, 2.0) <= 2e+239)))) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * t_0;
} else {
tmp = t_0 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(-sqrt(2.0)) / B_m) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-17) tmp = Float64(sqrt(Float64(t_1 * Float64(F * Float64(2.0 * Float64(2.0 * A))))) * Float64(-1.0 / t_1)); elseif (((B_m ^ 2.0) <= 5e+119) || (!((B_m ^ 2.0) <= 4e+145) && (((B_m ^ 2.0) <= 2e+187) || !((B_m ^ 2.0) <= 2e+239)))) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * t_0); else tmp = Float64(t_0 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); 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[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-17], N[(N[Sqrt[N[(t$95$1 * N[(F * N[(2.0 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+119], And[N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+145]], $MachinePrecision], Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+187], N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+239]], $MachinePrecision]]]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $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 := \frac{-\sqrt{2}}{B_m}\\
t_1 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-17}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(F \cdot \left(2 \cdot \left(2 \cdot A\right)\right)\right)} \cdot \frac{-1}{t_1}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+119} \lor \neg \left({B_m}^{2} \leq 4 \cdot 10^{+145}\right) \land \left({B_m}^{2} \leq 2 \cdot 10^{+187} \lor \neg \left({B_m}^{2} \leq 2 \cdot 10^{+239}\right)\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot t_0\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000007e-17Initial program 21.1%
Simplified31.4%
div-inv31.3%
associate-*l*30.3%
*-commutative30.3%
associate-+r-29.2%
+-commutative29.2%
Applied egg-rr29.2%
Taylor expanded in A around -inf 19.8%
if 1.00000000000000007e-17 < (pow.f64 B 2) < 4.9999999999999999e119 or 4e145 < (pow.f64 B 2) < 1.99999999999999981e187 or 1.99999999999999998e239 < (pow.f64 B 2) Initial program 15.8%
Simplified15.8%
Taylor expanded in C around 0 14.9%
mul-1-neg14.9%
*-commutative14.9%
distribute-rgt-neg-in14.9%
+-commutative14.9%
unpow214.9%
unpow214.9%
hypot-def23.8%
Simplified23.8%
if 4.9999999999999999e119 < (pow.f64 B 2) < 4e145 or 1.99999999999999981e187 < (pow.f64 B 2) < 1.99999999999999998e239Initial program 7.1%
Simplified8.8%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
*-commutative10.4%
distribute-rgt-neg-in10.4%
unpow210.4%
unpow210.4%
hypot-def11.1%
Simplified11.1%
Taylor expanded in C around inf 31.9%
Final simplification22.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 (sqrt (* F (- A (hypot B_m A)))))
(t_1 (/ (- (sqrt 2.0)) B_m))
(t_2 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-17)
(* (sqrt (* t_2 (* F (* 2.0 (* 2.0 A))))) (/ -1.0 t_2))
(if (<= (pow B_m 2.0) 5e+119)
(/ (* (sqrt 2.0) (* t_0 (- B_m))) (- (pow B_m 2.0) (* C (* 4.0 A))))
(if (or (<= (pow B_m 2.0) 4e+145)
(and (not (<= (pow B_m 2.0) 2e+187)) (<= (pow B_m 2.0) 2e+239)))
(* t_1 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))
(* t_0 t_1))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((F * (A - hypot(B_m, A))));
double t_1 = -sqrt(2.0) / B_m;
double t_2 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-17) {
tmp = sqrt((t_2 * (F * (2.0 * (2.0 * A))))) * (-1.0 / t_2);
} else if (pow(B_m, 2.0) <= 5e+119) {
tmp = (sqrt(2.0) * (t_0 * -B_m)) / (pow(B_m, 2.0) - (C * (4.0 * A)));
} else if ((pow(B_m, 2.0) <= 4e+145) || (!(pow(B_m, 2.0) <= 2e+187) && (pow(B_m, 2.0) <= 2e+239))) {
tmp = t_1 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = t_0 * t_1;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(F * Float64(A - hypot(B_m, A)))) t_1 = Float64(Float64(-sqrt(2.0)) / B_m) t_2 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-17) tmp = Float64(sqrt(Float64(t_2 * Float64(F * Float64(2.0 * Float64(2.0 * A))))) * Float64(-1.0 / t_2)); elseif ((B_m ^ 2.0) <= 5e+119) tmp = Float64(Float64(sqrt(2.0) * Float64(t_0 * Float64(-B_m))) / Float64((B_m ^ 2.0) - Float64(C * Float64(4.0 * A)))); elseif (((B_m ^ 2.0) <= 4e+145) || (!((B_m ^ 2.0) <= 2e+187) && ((B_m ^ 2.0) <= 2e+239))) tmp = Float64(t_1 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); else tmp = Float64(t_0 * t_1); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]}, Block[{t$95$2 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-17], N[(N[Sqrt[N[(t$95$2 * N[(F * N[(2.0 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+119], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$0 * (-B$95$m)), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+145], And[N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+187]], $MachinePrecision], LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+239]]], N[(t$95$1 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * t$95$1), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)}\\
t_1 := \frac{-\sqrt{2}}{B_m}\\
t_2 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-17}:\\
\;\;\;\;\sqrt{t_2 \cdot \left(F \cdot \left(2 \cdot \left(2 \cdot A\right)\right)\right)} \cdot \frac{-1}{t_2}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+119}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \left(t_0 \cdot \left(-B_m\right)\right)}{{B_m}^{2} - C \cdot \left(4 \cdot A\right)}\\
\mathbf{elif}\;{B_m}^{2} \leq 4 \cdot 10^{+145} \lor \neg \left({B_m}^{2} \leq 2 \cdot 10^{+187}\right) \land {B_m}^{2} \leq 2 \cdot 10^{+239}:\\
\;\;\;\;t_1 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot t_1\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.00000000000000007e-17Initial program 21.1%
Simplified31.4%
div-inv31.3%
associate-*l*30.3%
*-commutative30.3%
associate-+r-29.2%
+-commutative29.2%
Applied egg-rr29.2%
Taylor expanded in A around -inf 19.8%
if 1.00000000000000007e-17 < (pow.f64 B 2) < 4.9999999999999999e119Initial program 36.8%
pow1/236.8%
associate-*l*36.8%
unpow-prod-down36.8%
Applied egg-rr48.3%
unpow1/248.3%
unpow1/248.3%
*-commutative48.3%
+-commutative48.3%
associate-+r-49.3%
Simplified49.3%
Taylor expanded in C around 0 31.2%
+-commutative31.2%
unpow231.2%
unpow231.2%
hypot-def34.3%
Simplified34.3%
if 4.9999999999999999e119 < (pow.f64 B 2) < 4e145 or 1.99999999999999981e187 < (pow.f64 B 2) < 1.99999999999999998e239Initial program 7.1%
Simplified8.8%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
*-commutative10.4%
distribute-rgt-neg-in10.4%
unpow210.4%
unpow210.4%
hypot-def11.1%
Simplified11.1%
Taylor expanded in C around inf 31.9%
if 4e145 < (pow.f64 B 2) < 1.99999999999999981e187 or 1.99999999999999998e239 < (pow.f64 B 2) Initial program 6.1%
Simplified4.8%
Taylor expanded in C around 0 7.4%
mul-1-neg7.4%
*-commutative7.4%
distribute-rgt-neg-in7.4%
+-commutative7.4%
unpow27.4%
unpow27.4%
hypot-def18.9%
Simplified18.9%
Final simplification22.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 (/ (- (sqrt 2.0)) B_m)) (t_1 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-97)
(* (sqrt (* t_1 (* F (* 2.0 (* 2.0 A))))) (/ -1.0 t_1))
(if (<= (pow B_m 2.0) 5e+119)
(/ (- (sqrt (* (* F t_1) (* 2.0 (+ A (- C (hypot B_m (- A C)))))))) t_1)
(if (or (<= (pow B_m 2.0) 4e+145)
(and (not (<= (pow B_m 2.0) 2e+187)) (<= (pow B_m 2.0) 2e+239)))
(* t_0 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))
(* (sqrt (* F (- A (hypot B_m A)))) t_0))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0) / B_m;
double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 5e-97) {
tmp = sqrt((t_1 * (F * (2.0 * (2.0 * A))))) * (-1.0 / t_1);
} else if (pow(B_m, 2.0) <= 5e+119) {
tmp = -sqrt(((F * t_1) * (2.0 * (A + (C - hypot(B_m, (A - C))))))) / t_1;
} else if ((pow(B_m, 2.0) <= 4e+145) || (!(pow(B_m, 2.0) <= 2e+187) && (pow(B_m, 2.0) <= 2e+239))) {
tmp = t_0 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * t_0;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(-sqrt(2.0)) / B_m) t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-97) tmp = Float64(sqrt(Float64(t_1 * Float64(F * Float64(2.0 * Float64(2.0 * A))))) * Float64(-1.0 / t_1)); elseif ((B_m ^ 2.0) <= 5e+119) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_1) * Float64(2.0 * Float64(A + Float64(C - hypot(B_m, Float64(A - C)))))))) / t_1); elseif (((B_m ^ 2.0) <= 4e+145) || (!((B_m ^ 2.0) <= 2e+187) && ((B_m ^ 2.0) <= 2e+239))) tmp = Float64(t_0 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * t_0); 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[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-97], N[(N[Sqrt[N[(t$95$1 * N[(F * N[(2.0 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+119], N[((-N[Sqrt[N[(N[(F * t$95$1), $MachinePrecision] * N[(2.0 * N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+145], And[N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+187]], $MachinePrecision], LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+239]]], N[(t$95$0 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{-\sqrt{2}}{B_m}\\
t_1 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B_m}^{2} \leq 5 \cdot 10^{-97}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(F \cdot \left(2 \cdot \left(2 \cdot A\right)\right)\right)} \cdot \frac{-1}{t_1}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+119}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_1\right) \cdot \left(2 \cdot \left(A + \left(C - \mathsf{hypot}\left(B_m, A - C\right)\right)\right)\right)}}{t_1}\\
\mathbf{elif}\;{B_m}^{2} \leq 4 \cdot 10^{+145} \lor \neg \left({B_m}^{2} \leq 2 \cdot 10^{+187}\right) \land {B_m}^{2} \leq 2 \cdot 10^{+239}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot t_0\\
\end{array}
\end{array}
if (pow.f64 B 2) < 4.9999999999999995e-97Initial program 19.5%
Simplified26.3%
div-inv26.2%
associate-*l*24.9%
*-commutative24.9%
associate-+r-23.8%
+-commutative23.8%
Applied egg-rr23.8%
Taylor expanded in A around -inf 18.0%
if 4.9999999999999995e-97 < (pow.f64 B 2) < 4.9999999999999999e119Initial program 33.6%
Simplified52.0%
if 4.9999999999999999e119 < (pow.f64 B 2) < 4e145 or 1.99999999999999981e187 < (pow.f64 B 2) < 1.99999999999999998e239Initial program 7.1%
Simplified8.8%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
*-commutative10.4%
distribute-rgt-neg-in10.4%
unpow210.4%
unpow210.4%
hypot-def11.1%
Simplified11.1%
Taylor expanded in C around inf 31.9%
if 4e145 < (pow.f64 B 2) < 1.99999999999999981e187 or 1.99999999999999998e239 < (pow.f64 B 2) Initial program 6.1%
Simplified4.8%
Taylor expanded in C around 0 7.4%
mul-1-neg7.4%
*-commutative7.4%
distribute-rgt-neg-in7.4%
+-commutative7.4%
unpow27.4%
unpow27.4%
hypot-def18.9%
Simplified18.9%
Final simplification26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- A (hypot B_m A)))
(t_1 (- (pow B_m 2.0) (* C (* 4.0 A))))
(t_2 (- (sqrt 2.0)))
(t_3 (/ t_2 B_m))
(t_4 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 5e-203)
(* (sqrt (* t_4 (* F (* 2.0 (* 2.0 A))))) (/ -1.0 t_4))
(if (<= (pow B_m 2.0) 5e+119)
(/ (* (sqrt (* t_0 (* t_1 F))) t_2) t_1)
(if (or (<= (pow B_m 2.0) 4e+145)
(and (not (<= (pow B_m 2.0) 2e+187)) (<= (pow B_m 2.0) 2e+239)))
(* t_3 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))
(* (sqrt (* F t_0)) t_3))))))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 = A - hypot(B_m, A);
double t_1 = pow(B_m, 2.0) - (C * (4.0 * A));
double t_2 = -sqrt(2.0);
double t_3 = t_2 / B_m;
double t_4 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 5e-203) {
tmp = sqrt((t_4 * (F * (2.0 * (2.0 * A))))) * (-1.0 / t_4);
} else if (pow(B_m, 2.0) <= 5e+119) {
tmp = (sqrt((t_0 * (t_1 * F))) * t_2) / t_1;
} else if ((pow(B_m, 2.0) <= 4e+145) || (!(pow(B_m, 2.0) <= 2e+187) && (pow(B_m, 2.0) <= 2e+239))) {
tmp = t_3 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
} else {
tmp = sqrt((F * t_0)) * t_3;
}
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(A - hypot(B_m, A)) t_1 = Float64((B_m ^ 2.0) - Float64(C * Float64(4.0 * A))) t_2 = Float64(-sqrt(2.0)) t_3 = Float64(t_2 / B_m) t_4 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-203) tmp = Float64(sqrt(Float64(t_4 * Float64(F * Float64(2.0 * Float64(2.0 * A))))) * Float64(-1.0 / t_4)); elseif ((B_m ^ 2.0) <= 5e+119) tmp = Float64(Float64(sqrt(Float64(t_0 * Float64(t_1 * F))) * t_2) / t_1); elseif (((B_m ^ 2.0) <= 4e+145) || (!((B_m ^ 2.0) <= 2e+187) && ((B_m ^ 2.0) <= 2e+239))) tmp = Float64(t_3 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); else tmp = Float64(sqrt(Float64(F * t_0)) * t_3); 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[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$3 = N[(t$95$2 / B$95$m), $MachinePrecision]}, Block[{t$95$4 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-203], N[(N[Sqrt[N[(t$95$4 * N[(F * N[(2.0 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+119], N[(N[(N[Sqrt[N[(t$95$0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision] / t$95$1), $MachinePrecision], If[Or[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e+145], And[N[Not[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+187]], $MachinePrecision], LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+239]]], N[(t$95$3 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$3), $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 := A - \mathsf{hypot}\left(B_m, A\right)\\
t_1 := {B_m}^{2} - C \cdot \left(4 \cdot A\right)\\
t_2 := -\sqrt{2}\\
t_3 := \frac{t_2}{B_m}\\
t_4 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B_m}^{2} \leq 5 \cdot 10^{-203}:\\
\;\;\;\;\sqrt{t_4 \cdot \left(F \cdot \left(2 \cdot \left(2 \cdot A\right)\right)\right)} \cdot \frac{-1}{t_4}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+119}:\\
\;\;\;\;\frac{\sqrt{t_0 \cdot \left(t_1 \cdot F\right)} \cdot t_2}{t_1}\\
\mathbf{elif}\;{B_m}^{2} \leq 4 \cdot 10^{+145} \lor \neg \left({B_m}^{2} \leq 2 \cdot 10^{+187}\right) \land {B_m}^{2} \leq 2 \cdot 10^{+239}:\\
\;\;\;\;t_3 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot t_0} \cdot t_3\\
\end{array}
\end{array}
if (pow.f64 B 2) < 5.0000000000000002e-203Initial program 12.0%
Simplified20.3%
div-inv20.3%
associate-*l*18.6%
*-commutative18.6%
associate-+r-17.8%
+-commutative17.8%
Applied egg-rr17.8%
Taylor expanded in A around -inf 13.7%
if 5.0000000000000002e-203 < (pow.f64 B 2) < 4.9999999999999999e119Initial program 36.0%
pow1/236.1%
associate-*l*36.1%
unpow-prod-down36.0%
Applied egg-rr47.7%
unpow1/247.7%
unpow1/247.7%
*-commutative47.7%
+-commutative47.7%
associate-+r-49.0%
Simplified49.0%
Taylor expanded in C around 0 33.4%
mul-1-neg33.4%
+-commutative33.4%
unpow233.4%
unpow233.4%
hypot-def38.0%
Simplified38.0%
if 4.9999999999999999e119 < (pow.f64 B 2) < 4e145 or 1.99999999999999981e187 < (pow.f64 B 2) < 1.99999999999999998e239Initial program 7.1%
Simplified8.8%
Taylor expanded in A around 0 10.4%
mul-1-neg10.4%
*-commutative10.4%
distribute-rgt-neg-in10.4%
unpow210.4%
unpow210.4%
hypot-def11.1%
Simplified11.1%
Taylor expanded in C around inf 31.9%
if 4e145 < (pow.f64 B 2) < 1.99999999999999981e187 or 1.99999999999999998e239 < (pow.f64 B 2) Initial program 6.1%
Simplified4.8%
Taylor expanded in C around 0 7.4%
mul-1-neg7.4%
*-commutative7.4%
distribute-rgt-neg-in7.4%
+-commutative7.4%
unpow27.4%
unpow27.4%
hypot-def18.9%
Simplified18.9%
Final simplification24.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (- (sqrt 2.0)) B_m)))
(if (<= B_m 7.6e-9)
(*
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(/ -1.0 (fma B_m B_m (* A (* C -4.0)))))
(if (or (<= B_m 1.45e+60)
(and (not (<= B_m 2e+73))
(or (<= B_m 4.8e+93) (not (<= B_m 4.3e+119)))))
(* (sqrt (* F (- A (hypot B_m A)))) t_0)
(* t_0 (sqrt (* F (* -0.5 (/ (pow B_m 2.0) C)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0) / B_m;
double tmp;
if (B_m <= 7.6e-9) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) * (-1.0 / fma(B_m, B_m, (A * (C * -4.0))));
} else if ((B_m <= 1.45e+60) || (!(B_m <= 2e+73) && ((B_m <= 4.8e+93) || !(B_m <= 4.3e+119)))) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * t_0;
} else {
tmp = t_0 * sqrt((F * (-0.5 * (pow(B_m, 2.0) / C))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(-sqrt(2.0)) / B_m) tmp = 0.0 if (B_m <= 7.6e-9) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) * Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif ((B_m <= 1.45e+60) || (!(B_m <= 2e+73) && ((B_m <= 4.8e+93) || !(B_m <= 4.3e+119)))) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * t_0); else tmp = Float64(t_0 * sqrt(Float64(F * Float64(-0.5 * Float64((B_m ^ 2.0) / C))))); 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[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]}, If[LessEqual[B$95$m, 7.6e-9], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[B$95$m, 1.45e+60], And[N[Not[LessEqual[B$95$m, 2e+73]], $MachinePrecision], Or[LessEqual[B$95$m, 4.8e+93], N[Not[LessEqual[B$95$m, 4.3e+119]], $MachinePrecision]]]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(F * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $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 := \frac{-\sqrt{2}}{B_m}\\
\mathbf{if}\;B_m \leq 7.6 \cdot 10^{-9}:\\
\;\;\;\;\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B_m \leq 1.45 \cdot 10^{+60} \lor \neg \left(B_m \leq 2 \cdot 10^{+73}\right) \land \left(B_m \leq 4.8 \cdot 10^{+93} \lor \neg \left(B_m \leq 4.3 \cdot 10^{+119}\right)\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot t_0\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \sqrt{F \cdot \left(-0.5 \cdot \frac{{B_m}^{2}}{C}\right)}\\
\end{array}
\end{array}
if B < 7.60000000000000023e-9Initial program 17.4%
Simplified25.8%
div-inv25.8%
associate-*l*25.0%
*-commutative25.0%
associate-+r-24.1%
+-commutative24.1%
Applied egg-rr24.1%
Taylor expanded in C around inf 13.3%
if 7.60000000000000023e-9 < B < 1.45e60 or 1.99999999999999997e73 < B < 4.80000000000000021e93 or 4.30000000000000032e119 < B Initial program 21.9%
Simplified21.9%
Taylor expanded in C around 0 27.0%
mul-1-neg27.0%
*-commutative27.0%
distribute-rgt-neg-in27.0%
+-commutative27.0%
unpow227.0%
unpow227.0%
hypot-def42.7%
Simplified42.7%
if 1.45e60 < B < 1.99999999999999997e73 or 4.80000000000000021e93 < B < 4.30000000000000032e119Initial program 1.9%
Simplified2.9%
Taylor expanded in A around 0 17.6%
mul-1-neg17.6%
*-commutative17.6%
distribute-rgt-neg-in17.6%
unpow217.6%
unpow217.6%
hypot-def18.2%
Simplified18.2%
Taylor expanded in C around inf 49.7%
Final simplification21.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 (<= B_m 1.6e-8)
(*
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(/ -1.0 (fma B_m B_m (* A (* C -4.0)))))
(if (or (<= B_m 4.8e+93) (not (<= B_m 9e+117)))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (- (sqrt 2.0)) B_m))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* -0.5 (/ (* (pow B_m 2.0) F) C))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.6e-8) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) * (-1.0 / fma(B_m, B_m, (A * (C * -4.0))));
} else if ((B_m <= 4.8e+93) || !(B_m <= 9e+117)) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((-0.5 * ((pow(B_m, 2.0) * F) / C)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.6e-8) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) * Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif ((B_m <= 4.8e+93) || !(B_m <= 9e+117)) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(-0.5 * Float64(Float64((B_m ^ 2.0) * F) / C))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.6e-8], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[B$95$m, 4.8e+93], N[Not[LessEqual[B$95$m, 9e+117]], $MachinePrecision]], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * F), $MachinePrecision] / C), $MachinePrecision]), $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 \leq 1.6 \cdot 10^{-8}:\\
\;\;\;\;\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B_m \leq 4.8 \cdot 10^{+93} \lor \neg \left(B_m \leq 9 \cdot 10^{+117}\right):\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{-0.5 \cdot \frac{{B_m}^{2} \cdot F}{C}}\right)\\
\end{array}
\end{array}
if B < 1.6000000000000001e-8Initial program 17.4%
Simplified25.8%
div-inv25.8%
associate-*l*25.0%
*-commutative25.0%
associate-+r-24.1%
+-commutative24.1%
Applied egg-rr24.1%
Taylor expanded in C around inf 13.3%
if 1.6000000000000001e-8 < B < 4.80000000000000021e93 or 9e117 < B Initial program 20.9%
Simplified20.9%
Taylor expanded in C around 0 26.0%
mul-1-neg26.0%
*-commutative26.0%
distribute-rgt-neg-in26.0%
+-commutative26.0%
unpow226.0%
unpow226.0%
hypot-def40.9%
Simplified40.9%
if 4.80000000000000021e93 < B < 9e117Initial program 1.7%
Simplified3.1%
Taylor expanded in A around 0 23.4%
mul-1-neg23.4%
*-commutative23.4%
distribute-rgt-neg-in23.4%
unpow223.4%
unpow223.4%
hypot-def24.2%
Simplified24.2%
Taylor expanded in C around inf 42.6%
Final simplification20.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 7.3e-9)
(*
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(/ -1.0 (fma B_m B_m (* A (* C -4.0)))))
(* (sqrt (* F (- A (hypot B_m A)))) (/ (- (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 tmp;
if (B_m <= 7.3e-9) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) * (-1.0 / fma(B_m, B_m, (A * (C * -4.0))));
} else {
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-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) tmp = 0.0 if (B_m <= 7.3e-9) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) * Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7.3e-9], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $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}
\mathbf{if}\;B_m \leq 7.3 \cdot 10^{-9}:\\
\;\;\;\;\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}\\
\end{array}
\end{array}
if B < 7.30000000000000002e-9Initial program 17.4%
Simplified25.8%
div-inv25.8%
associate-*l*25.0%
*-commutative25.0%
associate-+r-24.1%
+-commutative24.1%
Applied egg-rr24.1%
Taylor expanded in C around inf 13.3%
if 7.30000000000000002e-9 < B Initial program 18.9%
Simplified19.0%
Taylor expanded in C around 0 25.1%
mul-1-neg25.1%
*-commutative25.1%
distribute-rgt-neg-in25.1%
+-commutative25.1%
unpow225.1%
unpow225.1%
hypot-def38.6%
Simplified38.6%
Final simplification19.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1.2e-14)
(*
(sqrt (* -8.0 (* A (* (+ A A) (* C F)))))
(/ -1.0 (fma B_m B_m (* A (* C -4.0)))))
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* B_m (- F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.2e-14) {
tmp = sqrt((-8.0 * (A * ((A + A) * (C * F))))) * (-1.0 / fma(B_m, B_m, (A * (C * -4.0))));
} else {
tmp = (-sqrt(2.0) / B_m) * sqrt((B_m * -F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.2e-14) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(Float64(A + A) * Float64(C * F))))) * Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m * Float64(-F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.2e-14], N[(N[Sqrt[N[(-8.0 * N[(A * N[(N[(A + A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B_m \leq 1.2 \cdot 10^{-14}:\\
\;\;\;\;\sqrt{-8 \cdot \left(A \cdot \left(\left(A + A\right) \cdot \left(C \cdot F\right)\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B_m} \cdot \sqrt{B_m \cdot \left(-F\right)}\\
\end{array}
\end{array}
if B < 1.2e-14Initial program 17.6%
Simplified25.5%
div-inv25.5%
associate-*l*24.7%
*-commutative24.7%
associate-+r-23.8%
+-commutative23.8%
Applied egg-rr23.8%
Taylor expanded in C around inf 13.4%
associate-*r*13.4%
*-commutative13.4%
mul-1-neg13.4%
Simplified13.4%
if 1.2e-14 < B Initial program 18.4%
Simplified18.8%
Taylor expanded in A around 0 23.3%
mul-1-neg23.3%
*-commutative23.3%
distribute-rgt-neg-in23.3%
unpow223.3%
unpow223.3%
hypot-def40.6%
Simplified40.6%
Taylor expanded in C around 0 35.3%
associate-*r*35.3%
mul-1-neg35.3%
Simplified35.3%
Final simplification19.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 (<= B_m 9e-9)
(*
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(/ -1.0 (fma B_m B_m (* A (* C -4.0)))))
(* (/ (- (sqrt 2.0)) B_m) (sqrt (* B_m (- F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 9e-9) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) * (-1.0 / fma(B_m, B_m, (A * (C * -4.0))));
} else {
tmp = (-sqrt(2.0) / B_m) * sqrt((B_m * -F));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 9e-9) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) * Float64(-1.0 / fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m * Float64(-F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 9e-9], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B_m \leq 9 \cdot 10^{-9}:\\
\;\;\;\;\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)} \cdot \frac{-1}{\mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{2}}{B_m} \cdot \sqrt{B_m \cdot \left(-F\right)}\\
\end{array}
\end{array}
if B < 8.99999999999999953e-9Initial program 17.4%
Simplified25.8%
div-inv25.8%
associate-*l*25.0%
*-commutative25.0%
associate-+r-24.1%
+-commutative24.1%
Applied egg-rr24.1%
Taylor expanded in C around inf 13.3%
if 8.99999999999999953e-9 < B Initial program 18.9%
Simplified19.0%
Taylor expanded in A around 0 23.9%
mul-1-neg23.9%
*-commutative23.9%
distribute-rgt-neg-in23.9%
unpow223.9%
unpow223.9%
hypot-def41.7%
Simplified41.7%
Taylor expanded in C around 0 36.2%
associate-*r*36.2%
mul-1-neg36.2%
Simplified36.2%
Final simplification19.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 (* (/ (- (sqrt 2.0)) B_m) (sqrt (* 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) * sqrt((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) * sqrt((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) * Math.sqrt((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) * math.sqrt((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(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m * Float64(-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) * sqrt((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[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[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])\\
\\
\frac{-\sqrt{2}}{B_m} \cdot \sqrt{B_m \cdot \left(-F\right)}
\end{array}
Initial program 17.8%
Simplified21.2%
Taylor expanded in A around 0 10.2%
mul-1-neg10.2%
*-commutative10.2%
distribute-rgt-neg-in10.2%
unpow210.2%
unpow210.2%
hypot-def15.8%
Simplified15.8%
Taylor expanded in C around 0 14.1%
associate-*r*14.1%
mul-1-neg14.1%
Simplified14.1%
Final simplification14.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) (- (sqrt (* 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) * -sqrt((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) * -sqrt((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) * -Math.sqrt((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) * -math.sqrt((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(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(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) * -sqrt((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[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[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])\\
\\
\frac{\sqrt{2}}{B_m} \cdot \left(-\sqrt{B_m \cdot F}\right)
\end{array}
Initial program 17.8%
Simplified21.2%
Taylor expanded in A around 0 10.2%
mul-1-neg10.2%
*-commutative10.2%
distribute-rgt-neg-in10.2%
unpow210.2%
unpow210.2%
hypot-def15.8%
Simplified15.8%
Taylor expanded in B around -inf 1.5%
Final simplification1.5%
herbie shell --seed 2024023
(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))))