
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e+74)
(/
(sqrt (* (* (* F 2.0) t_0) (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
(- t_0))
(/ (sqrt (* (* (- A (hypot B_m 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+74) {
tmp = sqrt((((F * 2.0) * t_0) * (fma(-0.5, ((B_m * B_m) / C), A) + A))) / -t_0;
} else {
tmp = sqrt((((A - hypot(B_m, 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(Float64(-4.0 * A), C, Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+74) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(B_m, A)) * F) * 2.0)) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+74], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+74}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999963e74Initial program 25.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.0
Applied rewrites23.0%
Applied rewrites23.0%
if 4.99999999999999963e74 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.8%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6425.9
Applied rewrites25.9%
Applied rewrites26.0%
Final simplification24.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 (* (* F 2.0) (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma C (* -4.0 A) (* B_m B_m)))
(t_4 (fma (* -4.0 A) C (* B_m B_m)))
(t_5 (- t_4)))
(if (<= t_2 -5e+37)
(/ (* (sqrt t_0) (sqrt t_3)) t_5)
(if (<= t_2 -2e-217)
(/ (sqrt (* (- B_m) (* (* t_4 F) 2.0))) t_5)
(/ (sqrt (* t_0 t_3)) t_5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (F * 2.0) * (fma(-0.5, ((B_m * B_m) / C), A) + A);
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma(C, (-4.0 * A), (B_m * B_m));
double t_4 = fma((-4.0 * A), C, (B_m * B_m));
double t_5 = -t_4;
double tmp;
if (t_2 <= -5e+37) {
tmp = (sqrt(t_0) * sqrt(t_3)) / t_5;
} else if (t_2 <= -2e-217) {
tmp = sqrt((-B_m * ((t_4 * F) * 2.0))) / t_5;
} else {
tmp = sqrt((t_0 * t_3)) / t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(F * 2.0) * Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(C, Float64(-4.0 * A), Float64(B_m * B_m)) t_4 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_5 = Float64(-t_4) tmp = 0.0 if (t_2 <= -5e+37) tmp = Float64(Float64(sqrt(t_0) * sqrt(t_3)) / t_5); elseif (t_2 <= -2e-217) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(t_4 * F) * 2.0))) / t_5); else tmp = Float64(sqrt(Float64(t_0 * t_3)) / t_5); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(F * 2.0), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(-4.0 * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$2, -5e+37], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$2, -2e-217], N[(N[Sqrt[N[((-B$95$m) * N[(N[(t$95$4 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$5), $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(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(C, -4 \cdot A, B\_m \cdot B\_m\right)\\
t_4 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+37}:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{t\_3}}{t\_5}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(t\_4 \cdot F\right) \cdot 2\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot t\_3}}{t\_5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999989e37Initial program 26.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6420.1
Applied rewrites20.1%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites20.7%
Applied rewrites20.1%
lift-sqrt.f64N/A
pow1/2N/A
Applied rewrites26.7%
if -4.99999999999999989e37 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000016e-217Initial program 95.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Applied rewrites13.8%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.4%
Applied rewrites13.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6429.0
Applied rewrites29.0%
if -2.00000000000000016e-217 < (/.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 9.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.2
Applied rewrites14.2%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.2%
Applied rewrites14.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
Applied rewrites14.4%
Final simplification18.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 (* (* F 2.0) (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma (* -4.0 A) C (* B_m B_m)))
(t_4 (fma C (* -4.0 A) (* B_m B_m)))
(t_5 (- t_3)))
(if (<= t_2 (- INFINITY))
(/ (* (sqrt t_0) (sqrt t_4)) (- (* (* C A) -4.0)))
(if (<= t_2 -2e-217)
(/ (sqrt (* (- B_m) (* (* t_3 F) 2.0))) t_5)
(/ (sqrt (* t_0 t_4)) t_5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (F * 2.0) * (fma(-0.5, ((B_m * B_m) / C), A) + A);
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma((-4.0 * A), C, (B_m * B_m));
double t_4 = fma(C, (-4.0 * A), (B_m * B_m));
double t_5 = -t_3;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(t_0) * sqrt(t_4)) / -((C * A) * -4.0);
} else if (t_2 <= -2e-217) {
tmp = sqrt((-B_m * ((t_3 * F) * 2.0))) / t_5;
} else {
tmp = sqrt((t_0 * t_4)) / t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(F * 2.0) * Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_4 = fma(C, Float64(-4.0 * A), Float64(B_m * B_m)) t_5 = Float64(-t_3) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_0) * sqrt(t_4)) / Float64(-Float64(Float64(C * A) * -4.0))); elseif (t_2 <= -2e-217) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(t_3 * F) * 2.0))) / t_5); else tmp = Float64(sqrt(Float64(t_0 * t_4)) / t_5); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(F * 2.0), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(C * N[(-4.0 * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$3)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$4], $MachinePrecision]), $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -2e-217], N[(N[Sqrt[N[((-B$95$m) * N[(N[(t$95$3 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * t$95$4), $MachinePrecision]], $MachinePrecision] / t$95$5), $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(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_4 := \mathsf{fma}\left(C, -4 \cdot A, B\_m \cdot B\_m\right)\\
t_5 := -t\_3\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_0} \cdot \sqrt{t\_4}}{-\left(C \cdot A\right) \cdot -4}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(t\_3 \cdot F\right) \cdot 2\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot t\_4}}{t\_5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6416.9
Applied rewrites16.9%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites17.6%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6410.7
Applied rewrites10.7%
lift-pow.f64N/A
lift-pow.f64N/A
pow-powN/A
Applied rewrites19.0%
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))) < -2.00000000000000016e-217Initial program 97.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.7
Applied rewrites19.7%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites20.2%
Applied rewrites19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6424.2
Applied rewrites24.2%
if -2.00000000000000016e-217 < (/.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 9.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.2
Applied rewrites14.2%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.2%
Applied rewrites14.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
Applied rewrites14.4%
Final simplification16.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 C (* -4.0 A) (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (fma (* -4.0 A) C (* B_m B_m)))
(t_4 (+ (fma -0.5 (/ (* B_m B_m) C) A) A))
(t_5 (- t_3)))
(if (<= t_2 (- INFINITY))
(/ (* (- (sqrt (* t_0 2.0))) (sqrt (* F t_4))) (* (* C A) -4.0))
(if (<= t_2 -2e-217)
(/ (sqrt (* (- B_m) (* (* t_3 F) 2.0))) t_5)
(/ (sqrt (* (* (* F 2.0) t_4) t_0)) t_5)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(C, (-4.0 * A), (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = fma((-4.0 * A), C, (B_m * B_m));
double t_4 = fma(-0.5, ((B_m * B_m) / C), A) + A;
double t_5 = -t_3;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (-sqrt((t_0 * 2.0)) * sqrt((F * t_4))) / ((C * A) * -4.0);
} else if (t_2 <= -2e-217) {
tmp = sqrt((-B_m * ((t_3 * F) * 2.0))) / t_5;
} else {
tmp = sqrt((((F * 2.0) * t_4) * t_0)) / t_5;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(C, Float64(-4.0 * A), Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_4 = Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) t_5 = Float64(-t_3) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * 2.0))) * sqrt(Float64(F * t_4))) / Float64(Float64(C * A) * -4.0)); elseif (t_2 <= -2e-217) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(t_3 * F) * 2.0))) / t_5); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_4) * t_0)) / t_5); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(C * N[(-4.0 * A), $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[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]}, Block[{t$95$5 = (-t$95$3)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[((-N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(F * t$95$4), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -2e-217], N[(N[Sqrt[N[((-B$95$m) * N[(N[(t$95$3 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$4), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, -4 \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_4 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\\
t_5 := -t\_3\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{F \cdot t\_4}}{\left(C \cdot A\right) \cdot -4}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(t\_3 \cdot F\right) \cdot 2\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_4\right) \cdot t\_0}}{t\_5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6416.9
Applied rewrites16.9%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites17.6%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6410.7
Applied rewrites10.7%
lift-pow.f64N/A
lift-pow.f64N/A
pow-powN/A
metadata-evalN/A
pow1/2N/A
lift-*.f64N/A
Applied rewrites18.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))) < -2.00000000000000016e-217Initial program 97.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6419.7
Applied rewrites19.7%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites20.2%
Applied rewrites19.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6424.2
Applied rewrites24.2%
if -2.00000000000000016e-217 < (/.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 9.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.2
Applied rewrites14.2%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.2%
Applied rewrites14.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
Applied rewrites14.4%
Final simplification16.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 (* -4.0 A) C (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_0))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_4 (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
(if (<= t_3 -5e+37)
(/ (sqrt (* (* (* F 2.0) t_0) t_4)) t_2)
(if (<= t_3 -2e-217)
(/ (sqrt (* (- B_m) (* (* t_0 F) 2.0))) t_2)
(/ (sqrt (* (* (* F 2.0) t_4) (fma C (* -4.0 A) (* B_m B_m)))) t_2)))))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 = -t_0;
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_4 = fma(-0.5, ((B_m * B_m) / C), A) + A;
double tmp;
if (t_3 <= -5e+37) {
tmp = sqrt((((F * 2.0) * t_0) * t_4)) / t_2;
} else if (t_3 <= -2e-217) {
tmp = sqrt((-B_m * ((t_0 * F) * 2.0))) / t_2;
} else {
tmp = sqrt((((F * 2.0) * t_4) * fma(C, (-4.0 * A), (B_m * B_m)))) / t_2;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(-t_0) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_4 = Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A) tmp = 0.0 if (t_3 <= -5e+37) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * t_4)) / t_2); elseif (t_3 <= -2e-217) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(t_0 * F) * 2.0))) / t_2); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_4) * fma(C, Float64(-4.0 * A), Float64(B_m * B_m)))) / t_2); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]}, If[LessEqual[t$95$3, -5e+37], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -2e-217], N[(N[Sqrt[N[((-B$95$m) * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$4), $MachinePrecision] * N[(C * N[(-4.0 * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := -t\_0\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_4 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{+37}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot t\_4}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_4\right) \cdot \mathsf{fma}\left(C, -4 \cdot A, B\_m \cdot B\_m\right)}}{t\_2}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999989e37Initial program 26.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6420.1
Applied rewrites20.1%
Applied rewrites20.1%
if -4.99999999999999989e37 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000016e-217Initial program 95.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Applied rewrites13.8%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.4%
Applied rewrites13.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6429.0
Applied rewrites29.0%
if -2.00000000000000016e-217 < (/.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 9.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.2
Applied rewrites14.2%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.2%
Applied rewrites14.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
Applied rewrites14.4%
Final simplification17.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
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
(* (* (- (pow B_m 2.0) t_1) F) 2.0)))
(- t_1 (pow B_m 2.0))))
(t_3 (- t_0))
(t_4
(/
(sqrt (* (* (* F 2.0) t_0) (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
t_3)))
(if (<= t_2 -5e+37)
t_4
(if (<= t_2 -2e-217) (/ (sqrt (* (- B_m) (* (* t_0 F) 2.0))) 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 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * (((pow(B_m, 2.0) - t_1) * F) * 2.0))) / (t_1 - pow(B_m, 2.0));
double t_3 = -t_0;
double t_4 = sqrt((((F * 2.0) * t_0) * (fma(-0.5, ((B_m * B_m) / C), A) + A))) / t_3;
double tmp;
if (t_2 <= -5e+37) {
tmp = t_4;
} else if (t_2 <= -2e-217) {
tmp = sqrt((-B_m * ((t_0 * F) * 2.0))) / 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 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(Float64((B_m ^ 2.0) - t_1) * F) * 2.0))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = Float64(-t_0) t_4 = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A))) / t_3) tmp = 0.0 if (t_2 <= -5e+37) tmp = t_4; elseif (t_2 <= -2e-217) tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(t_0 * F) * 2.0))) / 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 + 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[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+37], t$95$4, If[LessEqual[t$95$2, -2e-217], N[(N[Sqrt[N[((-B$95$m) * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $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 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_1\right) \cdot F\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := -t\_0\\
t_4 := \frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right)}}{t\_3}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+37}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-217}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{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))) < -4.99999999999999989e37 or -2.00000000000000016e-217 < (/.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 13.4%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.6
Applied rewrites15.6%
Applied rewrites15.6%
if -4.99999999999999989e37 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000016e-217Initial program 95.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6413.8
Applied rewrites13.8%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites14.4%
Applied rewrites13.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6429.0
Applied rewrites29.0%
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
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m)))
(t_1 (- t_0))
(t_2 (* (* t_0 F) 2.0)))
(if (<= (pow B_m 2.0) 5e-17)
(/ (sqrt (* (+ A A) t_2)) t_1)
(/ (sqrt (* (- B_m) t_2)) t_1))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = -t_0;
double t_2 = (t_0 * F) * 2.0;
double tmp;
if (pow(B_m, 2.0) <= 5e-17) {
tmp = sqrt(((A + A) * t_2)) / t_1;
} else {
tmp = sqrt((-B_m * t_2)) / t_1;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(-t_0) t_2 = Float64(Float64(t_0 * F) * 2.0) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-17) tmp = Float64(sqrt(Float64(Float64(A + A) * t_2)) / t_1); else tmp = Float64(sqrt(Float64(Float64(-B_m) * t_2)) / t_1); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-17], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[((-B$95$m) * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
t_2 := \left(t\_0 \cdot F\right) \cdot 2\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-17}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_2}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_2}}{t\_1}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-17Initial program 24.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.0
Applied rewrites23.0%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites23.0%
Applied rewrites23.0%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6422.8
Applied rewrites22.8%
if 4.9999999999999999e-17 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f646.1
Applied rewrites6.1%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites6.6%
Applied rewrites6.1%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f644.1
Applied rewrites4.1%
Final simplification14.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 (- t_0)))
(if (<= (pow B_m 2.0) 5e-17)
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) t_1)
(/ (sqrt (* (- B_m) (* (* t_0 F) 2.0))) t_1))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((-4.0 * A), C, (B_m * B_m));
double t_1 = -t_0;
double tmp;
if (pow(B_m, 2.0) <= 5e-17) {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / t_1;
} else {
tmp = sqrt((-B_m * ((t_0 * F) * 2.0))) / t_1;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(-t_0) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-17) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / t_1); else tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(t_0 * F) * 2.0))) / t_1); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-17], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[((-B$95$m) * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-17}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{t\_1}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-17Initial program 24.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.0
Applied rewrites23.0%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites23.0%
Applied rewrites23.0%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6422.1
Applied rewrites22.1%
if 4.9999999999999999e-17 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f646.1
Applied rewrites6.1%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites6.6%
Applied rewrites6.1%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f644.1
Applied rewrites4.1%
Final simplification14.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma C (* -4.0 A) (* B_m B_m)))
(t_1 (fma (* -4.0 A) C (* B_m B_m)))
(t_2 (- t_1))
(t_3 (* (* t_1 F) 2.0)))
(if (<= A -1e-136)
(/ (sqrt (* (+ A A) t_3)) t_2)
(if (<= A 5.6e-303)
(/ (sqrt (* (- B_m) t_3)) t_2)
(* (sqrt (* (* t_0 F) 2.0)) (/ (sqrt (* A 2.0)) (- 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(C, (-4.0 * A), (B_m * B_m));
double t_1 = fma((-4.0 * A), C, (B_m * B_m));
double t_2 = -t_1;
double t_3 = (t_1 * F) * 2.0;
double tmp;
if (A <= -1e-136) {
tmp = sqrt(((A + A) * t_3)) / t_2;
} else if (A <= 5.6e-303) {
tmp = sqrt((-B_m * t_3)) / t_2;
} else {
tmp = sqrt(((t_0 * F) * 2.0)) * (sqrt((A * 2.0)) / -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(C, Float64(-4.0 * A), Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_2 = Float64(-t_1) t_3 = Float64(Float64(t_1 * F) * 2.0) tmp = 0.0 if (A <= -1e-136) tmp = Float64(sqrt(Float64(Float64(A + A) * t_3)) / t_2); elseif (A <= 5.6e-303) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_3)) / t_2); else tmp = Float64(sqrt(Float64(Float64(t_0 * F) * 2.0)) * Float64(sqrt(Float64(A * 2.0)) / Float64(-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[(C * N[(-4.0 * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(N[(t$95$1 * F), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[A, -1e-136], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[A, 5.6e-303], N[(N[Sqrt[N[((-B$95$m) * t$95$3), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(A * 2.0), $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(C, -4 \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_2 := -t\_1\\
t_3 := \left(t\_1 \cdot F\right) \cdot 2\\
\mathbf{if}\;A \leq -1 \cdot 10^{-136}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_3}}{t\_2}\\
\mathbf{elif}\;A \leq 5.6 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_3}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(t\_0 \cdot F\right) \cdot 2} \cdot \frac{\sqrt{A \cdot 2}}{-t\_0}\\
\end{array}
\end{array}
if A < -1e-136Initial program 22.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.3
Applied rewrites26.3%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites26.3%
Applied rewrites26.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.5%
if -1e-136 < A < 5.6e-303Initial program 32.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f646.8
Applied rewrites6.8%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites7.1%
Applied rewrites6.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6412.0
Applied rewrites12.0%
if 5.6e-303 < A Initial program 17.6%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.5
Applied rewrites28.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites10.1%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6411.0
Applied rewrites11.0%
Applied rewrites11.0%
Final simplification17.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m)))
(t_1 (- t_0))
(t_2 (* (* t_0 F) 2.0)))
(if (<= A -1e-136)
(/ (sqrt (* (+ A A) t_2)) t_1)
(if (<= A 5.6e-303)
(/ (sqrt (* (- B_m) t_2)) t_1)
(/ (* (sqrt (+ A A)) (sqrt (* (* F 2.0) t_0))) (- (* (* C A) -4.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 = -t_0;
double t_2 = (t_0 * F) * 2.0;
double tmp;
if (A <= -1e-136) {
tmp = sqrt(((A + A) * t_2)) / t_1;
} else if (A <= 5.6e-303) {
tmp = sqrt((-B_m * t_2)) / t_1;
} else {
tmp = (sqrt((A + A)) * sqrt(((F * 2.0) * t_0))) / -((C * A) * -4.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(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(-t_0) t_2 = Float64(Float64(t_0 * F) * 2.0) tmp = 0.0 if (A <= -1e-136) tmp = Float64(sqrt(Float64(Float64(A + A) * t_2)) / t_1); elseif (A <= 5.6e-303) tmp = Float64(sqrt(Float64(Float64(-B_m) * t_2)) / t_1); else tmp = Float64(Float64(sqrt(Float64(A + A)) * sqrt(Float64(Float64(F * 2.0) * t_0))) / Float64(-Float64(Float64(C * A) * -4.0))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[A, -1e-136], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[A, 5.6e-303], N[(N[Sqrt[N[((-B$95$m) * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(A + A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.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 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
t_2 := \left(t\_0 \cdot F\right) \cdot 2\\
\mathbf{if}\;A \leq -1 \cdot 10^{-136}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot t\_2}}{t\_1}\\
\mathbf{elif}\;A \leq 5.6 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot t\_2}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A + A} \cdot \sqrt{\left(F \cdot 2\right) \cdot t\_0}}{-\left(C \cdot A\right) \cdot -4}\\
\end{array}
\end{array}
if A < -1e-136Initial program 22.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.3
Applied rewrites26.3%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites26.3%
Applied rewrites26.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.5%
if -1e-136 < A < 5.6e-303Initial program 32.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f646.8
Applied rewrites6.8%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites7.1%
Applied rewrites6.8%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f6412.0
Applied rewrites12.0%
if 5.6e-303 < A Initial program 17.6%
Taylor expanded in A around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.5
Applied rewrites28.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites10.1%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6411.0
Applied rewrites11.0%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6410.9
Applied rewrites10.9%
Final simplification17.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) (- (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 sqrt((((((A + A) * F) * C) * A) * -8.0)) / -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(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(-fma(Float64(-4.0 * 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[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{-\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}
\end{array}
Initial program 21.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.5
Applied rewrites15.5%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites15.7%
Applied rewrites15.5%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6414.6
Applied rewrites14.6%
Final simplification14.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 (/ (sqrt (* (* (* (* A A) C) F) -16.0)) (- (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 sqrt(((((A * A) * C) * F) * -16.0)) / -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(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / Float64(-fma(Float64(-4.0 * 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[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{-\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}
\end{array}
Initial program 21.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.5
Applied rewrites15.5%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites15.7%
Applied rewrites15.5%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6410.6
Applied rewrites10.6%
Final simplification10.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 (/ (sqrt (* (* (* (* C C) F) A) -16.0)) (- (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 sqrt(((((C * C) * F) * A) * -16.0)) / -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(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) / Float64(-fma(Float64(-4.0 * 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[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -16}}{-\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}
\end{array}
Initial program 21.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.5
Applied rewrites15.5%
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
Applied rewrites15.7%
Applied rewrites15.5%
Taylor expanded in C around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6412.9
Applied rewrites12.9%
Final simplification12.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt 2.0) (sqrt (/ 1.0 (/ B_m F)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(2.0) * sqrt((1.0 / (B_m / F)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(2.0d0) * sqrt((1.0d0 / (b_m / f)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(2.0) * Math.sqrt((1.0 / (B_m / F)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(2.0) * math.sqrt((1.0 / (B_m / F)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(2.0) * sqrt(Float64(1.0 / Float64(B_m / F)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(2.0) * sqrt((1.0 / (B_m / F)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(B$95$m / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{2} \cdot \sqrt{\frac{1}{\frac{B\_m}{F}}}
\end{array}
Initial program 21.5%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.2%
Final simplification2.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ 2.0 (/ B_m F))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 / (B_m / F)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 / (b_m / f)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 / (B_m / F)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 / (B_m / F)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(2.0 / Float64(B_m / F))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 / (B_m / F)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(2.0 / N[(B$95$m / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2}{\frac{B\_m}{F}}}
\end{array}
Initial program 21.5%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* (/ 2.0 B_m) F)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((2.0 / B_m) * F));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((2.0d0 / b_m) * f))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(((2.0 / B_m) * F));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(((2.0 / B_m) * F))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(Float64(2.0 / B_m) * F)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((2.0 / B_m) * F));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2}{B\_m} \cdot F}
\end{array}
Initial program 21.5%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Final simplification2.1%
herbie shell --seed 2024276
(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))))