
(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 12 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 (* (* 4.0 A) C))
(t_1 (* 2.0 (* (- (pow B_m 2.0) t_0) F)))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3
(/
(sqrt (* t_1 (- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2))
(t_4 (/ (sqrt (* t_1 (+ A (fma -0.5 (/ (* B_m B_m) C) A)))) t_2)))
(if (<= t_3 -2e+150)
t_4
(if (<= t_3 -1e-132)
(-
(*
(sqrt
(/
(* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m)))))
(fma B_m B_m (* -4.0 (* A C)))))
(sqrt 2.0)))
(if (<= t_3 -1e-218)
(*
(sqrt (* F (- C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
t_4)))))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 = (4.0 * A) * C;
double t_1 = 2.0 * ((pow(B_m, 2.0) - t_0) * F);
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = sqrt((t_1 * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_4 = sqrt((t_1 * (A + fma(-0.5, ((B_m * B_m) / C), A)))) / t_2;
double tmp;
if (t_3 <= -2e+150) {
tmp = t_4;
} else if (t_3 <= -1e-132) {
tmp = -(sqrt(((F * ((A + C) - sqrt(fma((A - C), (A - C), (B_m * B_m))))) / fma(B_m, B_m, (-4.0 * (A * C))))) * sqrt(2.0));
} else if (t_3 <= -1e-218) {
tmp = sqrt((F * (C - sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else {
tmp = t_4;
}
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(4.0 * A) * C) t_1 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) t_4 = Float64(sqrt(Float64(t_1 * Float64(A + fma(-0.5, Float64(Float64(B_m * B_m) / C), A)))) / t_2) tmp = 0.0 if (t_3 <= -2e+150) tmp = t_4; elseif (t_3 <= -1e-132) tmp = Float64(-Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m))))) / fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))) * sqrt(2.0))); elseif (t_3 <= -1e-218) tmp = Float64(sqrt(Float64(F * Float64(C - sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = t_4; end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t$95$1 * 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$4 = N[(N[Sqrt[N[(t$95$1 * N[(A + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+150], t$95$4, If[LessEqual[t$95$3, -1e-132], (-N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), If[LessEqual[t$95$3, -1e-218], N[(N[Sqrt[N[(F * N[(C - N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], t$95$4]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
t_4 := \frac{\sqrt{t\_1 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right)\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+150}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-132}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \sqrt{2}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\sqrt{F \cdot \left(C - \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_4\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999996e150 or -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 6.2%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.1
Simplified14.1%
if -1.99999999999999996e150 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999999e-133Initial program 97.1%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified99.3%
if -9.9999999999999999e-133 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.0%
Taylor expanded in A around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Simplified40.9%
Final simplification25.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (* 2.0 (* (- (pow B_m 2.0) t_0) F)))
(t_2 (- t_0 (pow B_m 2.0)))
(t_3
(/
(sqrt (* t_1 (- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
t_2))
(t_4 (/ (sqrt (* t_1 (+ A (fma -0.5 (/ (* B_m B_m) C) A)))) t_2)))
(if (<= t_3 (- INFINITY)) t_4 (if (<= t_3 -1e-218) t_3 t_4))))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 = (4.0 * A) * C;
double t_1 = 2.0 * ((pow(B_m, 2.0) - t_0) * F);
double t_2 = t_0 - pow(B_m, 2.0);
double t_3 = sqrt((t_1 * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / t_2;
double t_4 = sqrt((t_1 * (A + fma(-0.5, ((B_m * B_m) / C), A)))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_4;
} else if (t_3 <= -1e-218) {
tmp = t_3;
} else {
tmp = t_4;
}
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(4.0 * A) * C) t_1 = Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) t_2 = Float64(t_0 - (B_m ^ 2.0)) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) t_4 = Float64(sqrt(Float64(t_1 * Float64(A + fma(-0.5, Float64(Float64(B_m * B_m) / C), A)))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_4; elseif (t_3 <= -1e-218) tmp = t_3; else tmp = t_4; end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t$95$1 * 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$4 = N[(N[Sqrt[N[(t$95$1 * N[(A + N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$4, If[LessEqual[t$95$3, -1e-218], t$95$3, t$95$4]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\\
t_2 := t\_0 - {B\_m}^{2}\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
t_4 := \frac{\sqrt{t\_1 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right)\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_4\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0 or -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 4.9%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Simplified13.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 97.6%
Final simplification27.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 -4e+79)
(* -2.0 (sqrt (/ (* A F) t_0)))
(if (<= t_2 -1e-218)
(/
(* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))))
(- B_m))
(* -2.0 (/ (sqrt (* -4.0 (* F (* C (* A 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 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -4e+79) {
tmp = -2.0 * sqrt(((A * F) / t_0));
} else if (t_2 <= -1e-218) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m))))))) / -B_m;
} else {
tmp = -2.0 * (sqrt((-4.0 * (F * (C * (A * 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 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= -4e+79) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_0))); elseif (t_2 <= -1e-218) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(-2.0 * Float64(sqrt(Float64(-4.0 * Float64(F * Float64(C * Float64(A * 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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * 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] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+79], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-218], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(-4.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+79}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_0}}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{-4 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999987e79Initial program 15.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.1
Simplified24.1%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6424.2
Simplified24.2%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified24.1%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6422.9
Simplified22.9%
if -3.99999999999999987e79 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.3%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Simplified41.6%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f649.6
Simplified9.6%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified8.6%
Taylor expanded in A around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f647.8
Simplified7.8%
Final simplification15.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))))
(if (<= t_2 -2e-55)
(* -2.0 (sqrt (/ (* A F) t_0)))
(if (<= t_2 -1e-218)
(*
(sqrt (* F (- C (sqrt (fma B_m B_m (* C C))))))
(/ (sqrt 2.0) (- B_m)))
(* -2.0 (/ (sqrt (* -4.0 (* F (* C (* A 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 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double tmp;
if (t_2 <= -2e-55) {
tmp = -2.0 * sqrt(((A * F) / t_0));
} else if (t_2 <= -1e-218) {
tmp = sqrt((F * (C - sqrt(fma(B_m, B_m, (C * C)))))) * (sqrt(2.0) / -B_m);
} else {
tmp = -2.0 * (sqrt((-4.0 * (F * (C * (A * 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 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) tmp = 0.0 if (t_2 <= -2e-55) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_0))); elseif (t_2 <= -1e-218) tmp = Float64(sqrt(Float64(F * Float64(C - sqrt(fma(B_m, B_m, Float64(C * C)))))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(-4.0 * Float64(F * Float64(C * Float64(A * 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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * 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] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e-55], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-218], N[(N[Sqrt[N[(F * N[(C - N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(-4.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{-55}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_0}}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-218}:\\
\;\;\;\;\sqrt{F \cdot \left(C - \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{-4 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999999e-55Initial program 28.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.2
Simplified25.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6425.3
Simplified25.3%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified25.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6424.2
Simplified24.2%
if -1.99999999999999999e-55 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 99.3%
Taylor expanded in A around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Simplified49.2%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f649.6
Simplified9.6%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified8.6%
Taylor expanded in A around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f647.8
Simplified7.8%
Final simplification16.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 -4.0 (* A C) (* B_m B_m))) (t_1 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0)))
-1e-218)
(* -2.0 (sqrt (/ (* A F) t_0)))
(* -2.0 (/ (sqrt (* -4.0 (* F (* C (* A 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 = fma(-4.0, (A * C), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0))) <= -1e-218) {
tmp = -2.0 * sqrt(((A * F) / t_0));
} else {
tmp = -2.0 * (sqrt((-4.0 * (F * (C * (A * 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 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) <= -1e-218) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_0))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(-4.0 * Float64(F * Float64(C * Float64(A * 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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * 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] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-218], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(-4.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}} \leq -1 \cdot 10^{-218}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_0}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{-4 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-218Initial program 46.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.8
Simplified21.8%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6422.0
Simplified22.0%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified21.8%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6421.2
Simplified21.2%
if -1e-218 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 5.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f648.6
Simplified8.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f649.6
Simplified9.6%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified8.6%
Taylor expanded in A around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f647.8
Simplified7.8%
Final simplification12.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 (* (* 4.0 A) C)) (t_1 (- t_0 (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 5e-60)
(/ (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (+ A A))) t_1)
(if (<= (pow B_m 2.0) 5e+298)
(/
(* (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))) (* B_m (sqrt 2.0)))
t_1)
(/ (* (sqrt (* A F)) -2.0) B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = t_0 - pow(B_m, 2.0);
double tmp;
if (pow(B_m, 2.0) <= 5e-60) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (A + A))) / t_1;
} else if (pow(B_m, 2.0) <= 5e+298) {
tmp = (sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))) * (B_m * sqrt(2.0))) / t_1;
} else {
tmp = (sqrt((A * F)) * -2.0) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(t_0 - (B_m ^ 2.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-60) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(A + A))) / t_1); elseif ((B_m ^ 2.0) <= 5e+298) tmp = Float64(Float64(sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))) * Float64(B_m * sqrt(2.0))) / t_1); else tmp = Float64(Float64(sqrt(Float64(A * F)) * -2.0) / B_m); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-60], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+298], N[(N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := t\_0 - {B\_m}^{2}\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-60}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(A + A\right)}}{t\_1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)} \cdot \left(B\_m \cdot \sqrt{2}\right)}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A \cdot F} \cdot -2}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e-60Initial program 18.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.2
Simplified20.2%
if 5.0000000000000001e-60 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 35.1%
Taylor expanded in C around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6418.9
Simplified18.9%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f641.8
Simplified1.8%
Taylor expanded in B around inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f641.8
Simplified1.8%
Taylor expanded in B around inf
mul-1-negN/A
associate-*r/N/A
distribute-neg-fracN/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
unpow2N/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.6
Simplified5.6%
Final simplification16.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e-60)
(* -2.0 (/ (sqrt (* A (* F t_0))) t_0))
(if (<= (pow B_m 2.0) 5e+298)
(/
(* (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))) (* B_m (sqrt 2.0)))
(- (* (* 4.0 A) C) (pow B_m 2.0)))
(/ (* (sqrt (* A F)) -2.0) B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 5e-60) {
tmp = -2.0 * (sqrt((A * (F * t_0))) / t_0);
} else if (pow(B_m, 2.0) <= 5e+298) {
tmp = (sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))) * (B_m * sqrt(2.0))) / (((4.0 * A) * C) - pow(B_m, 2.0));
} else {
tmp = (sqrt((A * F)) * -2.0) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-60) tmp = Float64(-2.0 * Float64(sqrt(Float64(A * Float64(F * t_0))) / t_0)); elseif ((B_m ^ 2.0) <= 5e+298) tmp = Float64(Float64(sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))) * Float64(B_m * sqrt(2.0))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(Float64(A * F)) * -2.0) / B_m); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-60], N[(-2.0 * N[(N[Sqrt[N[(A * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+298], N[(N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-60}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot \left(F \cdot t\_0\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)} \cdot \left(B\_m \cdot \sqrt{2}\right)}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A \cdot F} \cdot -2}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e-60Initial program 18.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.2
Simplified20.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6421.0
Simplified21.0%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified20.2%
if 5.0000000000000001e-60 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 35.1%
Taylor expanded in C around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6418.9
Simplified18.9%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f641.8
Simplified1.8%
Taylor expanded in B around inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f641.8
Simplified1.8%
Taylor expanded in B around inf
mul-1-negN/A
associate-*r/N/A
distribute-neg-fracN/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
unpow2N/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.6
Simplified5.6%
Final simplification16.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e-60)
(* -2.0 (/ (sqrt (* A (* F t_0))) t_0))
(if (<= (pow B_m 2.0) 5e+298)
(/
(* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))))
(- B_m))
(/ (* (sqrt (* A F)) -2.0) B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 5e-60) {
tmp = -2.0 * (sqrt((A * (F * t_0))) / t_0);
} else if (pow(B_m, 2.0) <= 5e+298) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m))))))) / -B_m;
} else {
tmp = (sqrt((A * F)) * -2.0) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-60) tmp = Float64(-2.0 * Float64(sqrt(Float64(A * Float64(F * t_0))) / t_0)); elseif ((B_m ^ 2.0) <= 5e+298) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m))))))) / Float64(-B_m)); else tmp = Float64(Float64(sqrt(Float64(A * F)) * -2.0) / B_m); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-60], N[(-2.0 * N[(N[Sqrt[N[(A * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+298], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-60}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot \left(F \cdot t\_0\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A \cdot F} \cdot -2}{B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e-60Initial program 18.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.2
Simplified20.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6421.0
Simplified21.0%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified20.2%
if 5.0000000000000001e-60 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e298Initial program 35.1%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Simplified19.0%
if 5.0000000000000003e298 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f641.8
Simplified1.8%
Taylor expanded in B around inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f641.8
Simplified1.8%
Taylor expanded in B around inf
mul-1-negN/A
associate-*r/N/A
distribute-neg-fracN/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
unpow2N/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.6
Simplified5.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 7e-59)
(*
-2.0
(/ (sqrt (* -4.0 (* F (* C (* A A))))) (fma -4.0 (* A C) (* B_m B_m))))
(if (<= B_m 6.5e+149)
(* (sqrt 2.0) (/ (sqrt (* F (- A (sqrt (fma A A (* B_m B_m)))))) (- B_m)))
(/ (* (sqrt (* A F)) -2.0) B_m))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7e-59) {
tmp = -2.0 * (sqrt((-4.0 * (F * (C * (A * A))))) / fma(-4.0, (A * C), (B_m * B_m)));
} else if (B_m <= 6.5e+149) {
tmp = sqrt(2.0) * (sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))) / -B_m);
} else {
tmp = (sqrt((A * F)) * -2.0) / B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7e-59) tmp = Float64(-2.0 * Float64(sqrt(Float64(-4.0 * Float64(F * Float64(C * Float64(A * A))))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m)))); elseif (B_m <= 6.5e+149) tmp = Float64(sqrt(2.0) * Float64(sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))) / Float64(-B_m))); else tmp = Float64(Float64(sqrt(Float64(A * F)) * -2.0) / B_m); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7e-59], N[(-2.0 * N[(N[Sqrt[N[(-4.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6.5e+149], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7 \cdot 10^{-59}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{-4 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 6.5 \cdot 10^{+149}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A \cdot F} \cdot -2}{B\_m}\\
\end{array}
\end{array}
if B < 7.0000000000000002e-59Initial program 17.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6415.5
Simplified15.5%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.1
Simplified16.1%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified15.5%
Taylor expanded in A around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.5
Simplified11.5%
if 7.0000000000000002e-59 < B < 6.50000000000000015e149Initial program 39.1%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified40.2%
Taylor expanded in C around 0
associate-*l/N/A
*-lft-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6436.0
Simplified36.0%
if 6.50000000000000015e149 < B Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f642.9
Simplified2.9%
Taylor expanded in B around inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f642.9
Simplified2.9%
Taylor expanded in B around inf
mul-1-negN/A
associate-*r/N/A
distribute-neg-fracN/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
unpow2N/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f647.4
Simplified7.4%
Final simplification16.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 (* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B_m 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 -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B_m * 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(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B_m * 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[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $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])\\
\\
-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}}
\end{array}
Initial program 20.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6413.3
Simplified13.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.0
Simplified14.0%
Taylor expanded in F around 0
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified13.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6410.5
Simplified10.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 (/ (* (sqrt (* A F)) -2.0) B_m))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return (sqrt((A * F)) * -2.0) / B_m;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = (sqrt((a * f)) * (-2.0d0)) / b_m
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return (Math.sqrt((A * F)) * -2.0) / B_m;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return (math.sqrt((A * F)) * -2.0) / B_m
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(sqrt(Float64(A * F)) * -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((A * F)) * -2.0) / B_m;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{A \cdot F} \cdot -2}{B\_m}
\end{array}
Initial program 20.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6413.3
Simplified13.3%
Taylor expanded in B around inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f647.9
Simplified7.9%
Taylor expanded in B around inf
mul-1-negN/A
associate-*r/N/A
distribute-neg-fracN/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
unpow2N/A
rem-square-sqrtN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f643.5
Simplified3.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 (* (/ 2.0 B_m) (sqrt (* C 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 (2.0 / B_m) * sqrt((C * 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 = (2.0d0 / b_m) * sqrt((c * 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 (2.0 / B_m) * Math.sqrt((C * 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 (2.0 / B_m) * math.sqrt((C * 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(2.0 / B_m) * sqrt(Float64(C * 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 = (2.0 / B_m) * sqrt((C * 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[(2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * 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{2}{B\_m} \cdot \sqrt{C \cdot F}
\end{array}
Initial program 20.1%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Simplified20.1%
Taylor expanded in B around 0
lower--.f649.8
Simplified9.8%
Taylor expanded in B around -inf
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-sqrt.f64N/A
lower-*.f643.0
Simplified3.0%
herbie shell --seed 2024215
(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))))