
(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 8 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 B_m B_m (* A (* C -4.0))))
(t_1 (hypot B_m (- A C)))
(t_2 (fma A (* C -4.0) (pow B_m 2.0)))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(-
(sqrt
(*
(* 2.0 (* t_3 F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0)))))))
t_3))
(t_5 (* 2.0 t_2)))
(if (<= t_4 -1e-206)
(/ (* (sqrt (* F (+ A (- C t_1)))) (- (sqrt t_5))) t_2)
(if (<= t_4 5e+147)
(/
(-
(sqrt
(*
(* F t_0)
(*
2.0
(+
A
(+
A
(*
-0.5
(/ (+ (pow A 2.0) (- (pow B_m 2.0) (pow (- A) 2.0))) C))))))))
t_0)
(if (<= t_4 INFINITY)
(/ (* (sqrt (* t_5 (- (+ A C) t_1))) (- (sqrt F))) 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 = hypot(B_m, (A - C));
double t_2 = fma(A, (C * -4.0), pow(B_m, 2.0));
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_3;
double t_5 = 2.0 * t_2;
double tmp;
if (t_4 <= -1e-206) {
tmp = (sqrt((F * (A + (C - t_1)))) * -sqrt(t_5)) / t_2;
} else if (t_4 <= 5e+147) {
tmp = -sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * ((pow(A, 2.0) + (pow(B_m, 2.0) - pow(-A, 2.0))) / C))))))) / t_0;
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt((t_5 * ((A + C) - t_1))) * -sqrt(F)) / 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 = hypot(B_m, Float64(A - C)) t_2 = fma(A, Float64(C * -4.0), (B_m ^ 2.0)) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))))))) / t_3) t_5 = Float64(2.0 * t_2) tmp = 0.0 if (t_4 <= -1e-206) tmp = Float64(Float64(sqrt(Float64(F * Float64(A + Float64(C - t_1)))) * Float64(-sqrt(t_5))) / t_2); elseif (t_4 <= 5e+147) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64((A ^ 2.0) + Float64((B_m ^ 2.0) - (Float64(-A) ^ 2.0))) / C)))))))) / t_0); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(t_5 * Float64(Float64(A + C) - t_1))) * Float64(-sqrt(F))) / 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[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]}, Block[{t$95$2 = N[(A * N[(C * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(2.0 * t$95$2), $MachinePrecision]}, If[LessEqual[t$95$4, -1e-206], N[(N[(N[Sqrt[N[(F * N[(A + N[(C - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[t$95$5], $MachinePrecision])), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, 5e+147], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[(N[Power[A, 2.0], $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[Power[(-A), 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(t$95$5 * N[(N[(A + C), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $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{hypot}\left(B_m, A - C\right)\\
t_2 := \mathsf{fma}\left(A, C \cdot -4, {B_m}^{2}\right)\\
t_3 := {B_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{-\sqrt{\left(2 \cdot \left(t_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t_3}\\
t_5 := 2 \cdot t_2\\
\mathbf{if}\;t_4 \leq -1 \cdot 10^{-206}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - t_1\right)\right)} \cdot \left(-\sqrt{t_5}\right)}{t_2}\\
\mathbf{elif}\;t_4 \leq 5 \cdot 10^{+147}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{A}^{2} + \left({B_m}^{2} - {\left(-A\right)}^{2}\right)}{C}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;t_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t_5 \cdot \left(\left(A + C\right) - t_1\right)} \cdot \left(-\sqrt{F}\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))) < -1.00000000000000003e-206Initial program 41.1%
Simplified40.1%
pow1/240.1%
associate-*r*46.2%
unpow-prod-down65.9%
associate-+r-64.8%
pow1/264.8%
Applied egg-rr64.8%
unpow1/264.8%
+-commutative64.8%
associate-+r-65.5%
Simplified65.5%
if -1.00000000000000003e-206 < (/.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.0000000000000002e147Initial program 12.8%
Simplified16.1%
Taylor expanded in C around inf 32.8%
associate--l+32.8%
mul-1-neg32.8%
Simplified32.8%
if 5.0000000000000002e147 < (/.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 32.5%
Simplified61.1%
pow1/261.1%
*-commutative61.1%
unpow-prod-down70.6%
pow1/270.6%
associate-+r-70.6%
pow1/270.6%
Applied egg-rr70.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))) Initial program 0.0%
Simplified1.8%
Taylor expanded in C around 0 1.7%
mul-1-neg1.7%
*-commutative1.7%
distribute-rgt-neg-in1.7%
+-commutative1.7%
unpow21.7%
unpow21.7%
hypot-def21.2%
Simplified21.2%
Final simplification43.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 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) (* (* 4.0 A) C)))
(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 -1e-206)
(/
(* (sqrt (* F (+ A (- C (hypot B_m (- A C)))))) (- (sqrt (* 2.0 t_1))))
t_1)
(if (<= t_4 0.0)
(/
(-
(sqrt
(*
(* F t_0)
(*
2.0
(+
A
(+
A
(*
-0.5
(/ (+ (pow A 2.0) (- (pow B_m 2.0) (pow (- A) 2.0))) C))))))))
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) - ((4.0 * A) * C);
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 <= -1e-206) {
tmp = (sqrt((F * (A + (C - hypot(B_m, (A - C)))))) * -sqrt((2.0 * t_1))) / t_1;
} else if (t_4 <= 0.0) {
tmp = -sqrt(((F * t_0) * (2.0 * (A + (A + (-0.5 * ((pow(A, 2.0) + (pow(B_m, 2.0) - pow(-A, 2.0))) / C))))))) / 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(Float64(4.0 * A) * C)) 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 <= -1e-206) 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 <= 0.0) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64((A ^ 2.0) + Float64((B_m ^ 2.0) - (Float64(-A) ^ 2.0))) / C)))))))) / 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[(N[(4.0 * A), $MachinePrecision] * C), $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, -1e-206], 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, 0.0], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[(N[Power[A, 2.0], $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[Power[(-A), 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $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} - \left(4 \cdot A\right) \cdot C\\
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 -1 \cdot 10^{-206}:\\
\;\;\;\;\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 0:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{A}^{2} + \left({B_m}^{2} - {\left(-A\right)}^{2}\right)}{C}\right)\right)\right)}}{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))) < -1.00000000000000003e-206Initial program 41.1%
Simplified40.1%
pow1/240.1%
associate-*r*46.2%
unpow-prod-down65.9%
associate-+r-64.8%
pow1/264.8%
Applied egg-rr64.8%
unpow1/264.8%
+-commutative64.8%
associate-+r-65.5%
Simplified65.5%
if -1.00000000000000003e-206 < (/.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))) < 0.0Initial program 3.5%
Simplified7.1%
Taylor expanded in C around inf 29.0%
associate--l+29.0%
mul-1-neg29.0%
Simplified29.0%
if 0.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))) < +inf.0Initial program 41.3%
Taylor expanded in A around -inf 39.4%
mul-1-neg39.4%
Simplified39.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%
Simplified1.8%
Taylor expanded in C around 0 1.7%
mul-1-neg1.7%
*-commutative1.7%
distribute-rgt-neg-in1.7%
+-commutative1.7%
unpow21.7%
unpow21.7%
hypot-def21.2%
Simplified21.2%
Final simplification40.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (fma A (* C -4.0) (pow B_m 2.0)))
(t_2 (* F t_0)))
(if (<= (pow B_m 2.0) 2e-296)
(/ (- (sqrt (* t_2 (* 2.0 (+ A (+ A (* 0.5 (/ (pow B_m 2.0) A)))))))) t_0)
(if (<= (pow B_m 2.0) 1e-140)
(/
(-
(sqrt
(*
t_2
(*
2.0
(+
A
(+
A
(*
-0.5
(/ (+ (pow A 2.0) (- (pow B_m 2.0) (pow (- A) 2.0))) C))))))))
t_0)
(if (<= (pow B_m 2.0) 5e+55)
(/ (- (sqrt (* F (* (* 2.0 t_1) (+ A A))))) 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(B_m, B_m, (A * (C * -4.0)));
double t_1 = fma(A, (C * -4.0), pow(B_m, 2.0));
double t_2 = F * t_0;
double tmp;
if (pow(B_m, 2.0) <= 2e-296) {
tmp = -sqrt((t_2 * (2.0 * (A + (A + (0.5 * (pow(B_m, 2.0) / A))))))) / t_0;
} else if (pow(B_m, 2.0) <= 1e-140) {
tmp = -sqrt((t_2 * (2.0 * (A + (A + (-0.5 * ((pow(A, 2.0) + (pow(B_m, 2.0) - pow(-A, 2.0))) / C))))))) / t_0;
} else if (pow(B_m, 2.0) <= 5e+55) {
tmp = -sqrt((F * ((2.0 * t_1) * (A + A)))) / 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(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(F * t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-296) tmp = Float64(Float64(-sqrt(Float64(t_2 * Float64(2.0 * Float64(A + Float64(A + Float64(0.5 * Float64((B_m ^ 2.0) / A)))))))) / t_0); elseif ((B_m ^ 2.0) <= 1e-140) tmp = Float64(Float64(-sqrt(Float64(t_2 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64(Float64((A ^ 2.0) + Float64((B_m ^ 2.0) - (Float64(-A) ^ 2.0))) / C)))))))) / t_0); elseif ((B_m ^ 2.0) <= 5e+55) tmp = Float64(Float64(-sqrt(Float64(F * Float64(Float64(2.0 * t_1) * Float64(A + A))))) / 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[(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[(F * t$95$0), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-296], N[((-N[Sqrt[N[(t$95$2 * N[(2.0 * N[(A + N[(A + N[(0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-140], N[((-N[Sqrt[N[(t$95$2 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[(N[Power[A, 2.0], $MachinePrecision] + N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[Power[(-A), 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+55], N[((-N[Sqrt[N[(F * N[(N[(2.0 * t$95$1), $MachinePrecision] * N[(A + A), $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(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 := F \cdot t_0\\
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{-296}:\\
\;\;\;\;\frac{-\sqrt{t_2 \cdot \left(2 \cdot \left(A + \left(A + 0.5 \cdot \frac{{B_m}^{2}}{A}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{-140}:\\
\;\;\;\;\frac{-\sqrt{t_2 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{A}^{2} + \left({B_m}^{2} - {\left(-A\right)}^{2}\right)}{C}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+55}:\\
\;\;\;\;\frac{-\sqrt{F \cdot \left(\left(2 \cdot t_1\right) \cdot \left(A + A\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 (pow.f64 B 2) < 2e-296Initial program 21.8%
Simplified34.7%
Taylor expanded in A around -inf 23.9%
if 2e-296 < (pow.f64 B 2) < 9.9999999999999998e-141Initial program 19.6%
Simplified21.8%
Taylor expanded in C around inf 22.4%
associate--l+22.4%
mul-1-neg22.4%
Simplified22.4%
if 9.9999999999999998e-141 < (pow.f64 B 2) < 5.00000000000000046e55Initial program 28.1%
Simplified33.7%
Taylor expanded in C around inf 10.6%
sub-neg10.6%
mul-1-neg10.6%
remove-double-neg10.6%
Simplified10.6%
if 5.00000000000000046e55 < (pow.f64 B 2) Initial program 16.9%
Simplified14.7%
Taylor expanded in C around 0 13.1%
mul-1-neg13.1%
*-commutative13.1%
distribute-rgt-neg-in13.1%
+-commutative13.1%
unpow213.1%
unpow213.1%
hypot-def29.7%
Simplified29.7%
Final simplification24.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 A (* C -4.0) (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 5e+55)
(/ (- (sqrt (* F (* (* 2.0 t_0) (+ A A))))) 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 tmp;
if (pow(B_m, 2.0) <= 5e+55) {
tmp = -sqrt((F * ((2.0 * t_0) * (A + A)))) / 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)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+55) tmp = Float64(Float64(-sqrt(Float64(F * Float64(Float64(2.0 * t_0) * Float64(A + A))))) / 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+55], N[((-N[Sqrt[N[(F * N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $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)\\
\mathbf{if}\;{B_m}^{2} \leq 5 \cdot 10^{+55}:\\
\;\;\;\;\frac{-\sqrt{F \cdot \left(\left(2 \cdot t_0\right) \cdot \left(A + A\right)\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 (pow.f64 B 2) < 5.00000000000000046e55Initial program 22.8%
Simplified30.1%
Taylor expanded in C around inf 16.3%
sub-neg16.3%
mul-1-neg16.3%
remove-double-neg16.3%
Simplified16.3%
if 5.00000000000000046e55 < (pow.f64 B 2) Initial program 16.9%
Simplified14.7%
Taylor expanded in C around 0 13.1%
mul-1-neg13.1%
*-commutative13.1%
distribute-rgt-neg-in13.1%
+-commutative13.1%
unpow213.1%
unpow213.1%
hypot-def29.7%
Simplified29.7%
Final simplification22.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 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e-307)
(/
(- (sqrt (* (* F t_0) (* 2.0 (+ A (+ A (* 0.5 (/ (pow B_m 2.0) A))))))))
t_0)
(if (<= (pow B_m 2.0) 5e+55)
(/
(- (sqrt (* -8.0 (* (* A C) (* F (+ A A))))))
(fma A (* C -4.0) (pow B_m 2.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(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 1e-307) {
tmp = -sqrt(((F * t_0) * (2.0 * (A + (A + (0.5 * (pow(B_m, 2.0) / A))))))) / t_0;
} else if (pow(B_m, 2.0) <= 5e+55) {
tmp = -sqrt((-8.0 * ((A * C) * (F * (A + A))))) / fma(A, (C * -4.0), pow(B_m, 2.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(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-307) tmp = Float64(Float64(-sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(0.5 * Float64((B_m ^ 2.0) / A)))))))) / t_0); elseif ((B_m ^ 2.0) <= 5e+55) 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))); 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-307], N[((-N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+55], 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], 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)\\
\mathbf{if}\;{B_m}^{2} \leq 10^{-307}:\\
\;\;\;\;\frac{-\sqrt{\left(F \cdot t_0\right) \cdot \left(2 \cdot \left(A + \left(A + 0.5 \cdot \frac{{B_m}^{2}}{A}\right)\right)\right)}}{t_0}\\
\mathbf{elif}\;{B_m}^{2} \leq 5 \cdot 10^{+55}:\\
\;\;\;\;\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{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 (pow.f64 B 2) < 9.99999999999999909e-308Initial program 21.9%
Simplified33.9%
Taylor expanded in A around -inf 24.2%
if 9.99999999999999909e-308 < (pow.f64 B 2) < 5.00000000000000046e55Initial program 23.4%
Simplified28.8%
Taylor expanded in C around inf 15.7%
associate-*r*15.6%
sub-neg15.6%
mul-1-neg15.6%
remove-double-neg15.6%
Simplified15.6%
if 5.00000000000000046e55 < (pow.f64 B 2) Initial program 16.9%
Simplified14.7%
Taylor expanded in C around 0 13.1%
mul-1-neg13.1%
*-commutative13.1%
distribute-rgt-neg-in13.1%
+-commutative13.1%
unpow213.1%
unpow213.1%
hypot-def29.7%
Simplified29.7%
Final simplification24.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 5e+55)
(/
(- (sqrt (* -8.0 (* (* A C) (* F (+ A A))))))
(fma A (* C -4.0) (pow B_m 2.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 (pow(B_m, 2.0) <= 5e+55) {
tmp = -sqrt((-8.0 * ((A * C) * (F * (A + A))))) / fma(A, (C * -4.0), pow(B_m, 2.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 ^ 2.0) <= 5e+55) 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))); 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[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+55], 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], 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}^{2} \leq 5 \cdot 10^{+55}:\\
\;\;\;\;\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{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 (pow.f64 B 2) < 5.00000000000000046e55Initial program 22.8%
Simplified30.1%
Taylor expanded in C around inf 17.7%
associate-*r*17.6%
sub-neg17.6%
mul-1-neg17.6%
remove-double-neg17.6%
Simplified17.6%
if 5.00000000000000046e55 < (pow.f64 B 2) Initial program 16.9%
Simplified14.7%
Taylor expanded in C around 0 13.1%
mul-1-neg13.1%
*-commutative13.1%
distribute-rgt-neg-in13.1%
+-commutative13.1%
unpow213.1%
unpow213.1%
hypot-def29.7%
Simplified29.7%
Final simplification23.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 (* (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) {
return sqrt((F * (A - hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
}
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 * (A - Math.hypot(B_m, A)))) * (-Math.sqrt(2.0) / B_m);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((F * (A - math.hypot(B_m, A)))) * (-math.sqrt(2.0) / B_m)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-sqrt(2.0)) / B_m)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((F * (A - hypot(B_m, A)))) * (-sqrt(2.0) / B_m);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[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])\\
\\
\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B_m, A\right)\right)} \cdot \frac{-\sqrt{2}}{B_m}
\end{array}
Initial program 20.0%
Simplified22.7%
Taylor expanded in C around 0 8.7%
mul-1-neg8.7%
*-commutative8.7%
distribute-rgt-neg-in8.7%
+-commutative8.7%
unpow28.7%
unpow28.7%
hypot-def16.9%
Simplified16.9%
Final simplification16.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 C)) (* (sqrt -0.5) (- (sqrt 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 / C)) * (sqrt(-0.5) * -sqrt(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 / c)) * (sqrt((-0.5d0)) * -sqrt(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 / C)) * (Math.sqrt(-0.5) * -Math.sqrt(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 / C)) * (math.sqrt(-0.5) * -math.sqrt(2.0))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(F / C)) * Float64(sqrt(-0.5) * Float64(-sqrt(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 / C)) * (sqrt(-0.5) * -sqrt(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[(N[Sqrt[N[(F / C), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[-0.5], $MachinePrecision] * (-N[Sqrt[2.0], $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{F}{C}} \cdot \left(\sqrt{-0.5} \cdot \left(-\sqrt{2}\right)\right)
\end{array}
Initial program 20.0%
Simplified22.7%
Taylor expanded in A around -inf 0.0%
mul-1-neg0.0%
distribute-rgt-neg-in0.0%
*-commutative0.0%
Simplified0.0%
Final simplification0.0%
herbie shell --seed 2023334
(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))))