
(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)))
(if (<= (pow B_m 2.0) 5e-157)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
(- t_0 (pow B_m 2.0)))
(if (<= (pow B_m 2.0) 1e+302)
(* (sqrt (/ F (- (sqrt (fma A A (* B_m B_m))) A))) (- (sqrt 2.0)))
(- (/ (sqrt (* 2.0 F)) (sqrt 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 tmp;
if (pow(B_m, 2.0) <= 5e-157) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 1e+302) {
tmp = sqrt((F / (sqrt(fma(A, A, (B_m * B_m))) - A))) * -sqrt(2.0);
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(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) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-157) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0))); elseif ((B_m ^ 2.0) <= 1e+302) tmp = Float64(sqrt(Float64(F / Float64(sqrt(fma(A, A, Float64(B_m * B_m))) - A))) * Float64(-sqrt(2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-157], 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[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+302], N[(N[Sqrt[N[(F / N[(N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-157}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+302}:\\
\;\;\;\;\sqrt{\frac{F}{\sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)} - A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-157Initial program 23.7%
Taylor expanded in A around -inf
lower-*.f6424.0
Applied rewrites24.0%
if 5.0000000000000002e-157 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e302Initial program 26.8%
Applied rewrites26.8%
lift--.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
flip-+N/A
lower-/.f64N/A
Applied rewrites20.6%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/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-sqrt.f6444.6
Applied rewrites44.6%
if 1.0000000000000001e302 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.9
Applied rewrites18.9%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.3%
Final simplification32.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_0) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B_m 2.0)))
1e+214)
(* (sqrt (/ F (- (sqrt (fma A A (* B_m B_m))) A))) (- (sqrt 2.0)))
(/ (- (sqrt F)) (sqrt (* B_m 0.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 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B_m, 2.0))) <= 1e+214) {
tmp = sqrt((F / (sqrt(fma(A, A, (B_m * B_m))) - A))) * -sqrt(2.0);
} else {
tmp = -sqrt(F) / sqrt((B_m * 0.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(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B_m ^ 2.0))) <= 1e+214) tmp = Float64(sqrt(Float64(F / Float64(sqrt(fma(A, A, Float64(B_m * B_m))) - A))) * Float64(-sqrt(2.0))); else tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.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[(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$0), $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$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+214], N[(N[Sqrt[N[(F / N[(N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}} \leq 10^{+214}:\\
\;\;\;\;\sqrt{\frac{F}{\sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)} - A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.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))) < 9.9999999999999995e213Initial program 34.3%
Applied rewrites34.4%
lift--.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
flip-+N/A
lower-/.f64N/A
Applied rewrites16.4%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/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-sqrt.f6436.7
Applied rewrites36.7%
if 9.9999999999999995e213 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.3%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6412.0
Applied rewrites12.0%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6417.4
Applied rewrites17.4%
lift-*.f64N/A
sqrt-divN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6417.3
Applied rewrites17.3%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6417.4
Applied rewrites17.4%
Final simplification28.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 B_m B_m (* -4.0 (* A C)))))
(if (<= (pow B_m 2.0) 5e-157)
(/ -1.0 (/ t_0 (sqrt (* (* 2.0 C) (* t_0 (* 2.0 F))))))
(if (<= (pow B_m 2.0) 1e+302)
(* (sqrt (/ F (- (sqrt (fma A A (* B_m B_m))) A))) (- (sqrt 2.0)))
(- (/ (sqrt (* 2.0 F)) (sqrt B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
double tmp;
if (pow(B_m, 2.0) <= 5e-157) {
tmp = -1.0 / (t_0 / sqrt(((2.0 * C) * (t_0 * (2.0 * F)))));
} else if (pow(B_m, 2.0) <= 1e+302) {
tmp = sqrt((F / (sqrt(fma(A, A, (B_m * B_m))) - A))) * -sqrt(2.0);
} else {
tmp = -(sqrt((2.0 * F)) / sqrt(B_m));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-157) tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(2.0 * C) * Float64(t_0 * Float64(2.0 * F)))))); elseif ((B_m ^ 2.0) <= 1e+302) tmp = Float64(sqrt(Float64(F / Float64(sqrt(fma(A, A, Float64(B_m * B_m))) - A))) * Float64(-sqrt(2.0))); else tmp = Float64(-Float64(sqrt(Float64(2.0 * F)) / sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-157], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+302], N[(N[Sqrt[N[(F / N[(N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-157}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(2 \cdot C\right) \cdot \left(t\_0 \cdot \left(2 \cdot F\right)\right)}}}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+302}:\\
\;\;\;\;\sqrt{\frac{F}{\sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)} - A}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-157Initial program 23.7%
Applied rewrites23.7%
Taylor expanded in A around -inf
lower-*.f6424.0
Applied rewrites24.0%
if 5.0000000000000002e-157 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e302Initial program 26.8%
Applied rewrites26.8%
lift--.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
flip-+N/A
lower-/.f64N/A
Applied rewrites20.6%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/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-sqrt.f6444.6
Applied rewrites44.6%
if 1.0000000000000001e302 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.9
Applied rewrites18.9%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.3%
Final simplification32.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 3e+128) (/ (- (sqrt F)) (sqrt (* B_m 0.5))) (* (/ (sqrt C) B_m) (- (/ (sqrt F) 0.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 tmp;
if (C <= 3e+128) {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
} else {
tmp = (sqrt(C) / B_m) * -(sqrt(F) / 0.5);
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 3d+128) then
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
else
tmp = (sqrt(c) / b_m) * -(sqrt(f) / 0.5d0)
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 3e+128) {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
} else {
tmp = (Math.sqrt(C) / B_m) * -(Math.sqrt(F) / 0.5);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 3e+128: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) else: tmp = (math.sqrt(C) / B_m) * -(math.sqrt(F) / 0.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) tmp = 0.0 if (C <= 3e+128) tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); else tmp = Float64(Float64(sqrt(C) / B_m) * Float64(-Float64(sqrt(F) / 0.5))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 3e+128)
tmp = -sqrt(F) / sqrt((B_m * 0.5));
else
tmp = (sqrt(C) / B_m) * -(sqrt(F) / 0.5);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 3e+128], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[C], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[(N[Sqrt[F], $MachinePrecision] / 0.5), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 3 \cdot 10^{+128}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C}}{B\_m} \cdot \left(-\frac{\sqrt{F}}{0.5}\right)\\
\end{array}
\end{array}
if C < 2.9999999999999998e128Initial program 20.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6415.5
Applied rewrites15.5%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6418.9
Applied rewrites18.9%
lift-*.f64N/A
sqrt-divN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.9
Applied rewrites18.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6418.9
Applied rewrites18.9%
if 2.9999999999999998e128 < C Initial program 7.2%
Applied rewrites7.2%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.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-*.f641.4
Applied rewrites1.4%
Taylor expanded in B around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f644.9
Applied rewrites4.9%
rem-square-sqrtN/A
div-invN/A
lift-*.f64N/A
lift-sqrt.f64N/A
div-invN/A
clear-numN/A
metadata-evalN/A
associate-*l/N/A
div-invN/A
metadata-evalN/A
metadata-evalN/A
*-lft-identityN/A
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f6410.8
Applied rewrites10.8%
Final simplification17.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 3e+128) (/ (- (sqrt F)) (sqrt (* B_m 0.5))) (* (sqrt F) (* (sqrt C) (/ -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 (C <= 3e+128) {
tmp = -sqrt(F) / sqrt((B_m * 0.5));
} else {
tmp = sqrt(F) * (sqrt(C) * (-2.0 / B_m));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 3d+128) then
tmp = -sqrt(f) / sqrt((b_m * 0.5d0))
else
tmp = sqrt(f) * (sqrt(c) * ((-2.0d0) / b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 3e+128) {
tmp = -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
} else {
tmp = Math.sqrt(F) * (Math.sqrt(C) * (-2.0 / B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 3e+128: tmp = -math.sqrt(F) / math.sqrt((B_m * 0.5)) else: tmp = math.sqrt(F) * (math.sqrt(C) * (-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 (C <= 3e+128) tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(B_m * 0.5))); else tmp = Float64(sqrt(F) * Float64(sqrt(C) * Float64(-2.0 / B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 3e+128)
tmp = -sqrt(F) / sqrt((B_m * 0.5));
else
tmp = sqrt(F) * (sqrt(C) * (-2.0 / B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 3e+128], N[((-N[Sqrt[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[F], $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] * N[(-2.0 / 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])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 3 \cdot 10^{+128}:\\
\;\;\;\;\frac{-\sqrt{F}}{\sqrt{B\_m \cdot 0.5}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(\sqrt{C} \cdot \frac{-2}{B\_m}\right)\\
\end{array}
\end{array}
if C < 2.9999999999999998e128Initial program 20.9%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6415.5
Applied rewrites15.5%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6418.9
Applied rewrites18.9%
lift-*.f64N/A
sqrt-divN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.9
Applied rewrites18.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6418.9
Applied rewrites18.9%
if 2.9999999999999998e128 < C Initial program 7.2%
Applied rewrites7.2%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.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-*.f641.4
Applied rewrites1.4%
Taylor expanded in B around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f644.9
Applied rewrites4.9%
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites10.8%
Final simplification17.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 2.55e+92) (/ -1.0 (sqrt (/ B_m (* 2.0 F)))) (/ (* -2.0 (sqrt (* C F))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.55e+92) {
tmp = -1.0 / sqrt((B_m / (2.0 * F)));
} else {
tmp = (-2.0 * sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.55d+92) then
tmp = (-1.0d0) / sqrt((b_m / (2.0d0 * f)))
else
tmp = ((-2.0d0) * sqrt((c * f))) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.55e+92) {
tmp = -1.0 / Math.sqrt((B_m / (2.0 * F)));
} else {
tmp = (-2.0 * Math.sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.55e+92: tmp = -1.0 / math.sqrt((B_m / (2.0 * F))) else: tmp = (-2.0 * math.sqrt((C * F))) / B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.55e+92) tmp = Float64(-1.0 / sqrt(Float64(B_m / Float64(2.0 * F)))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(C * F))) / B_m); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.55e+92)
tmp = -1.0 / sqrt((B_m / (2.0 * F)));
else
tmp = (-2.0 * sqrt((C * F))) / B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.55e+92], N[(-1.0 / N[Sqrt[N[(B$95$m / N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.55 \cdot 10^{+92}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{B\_m}{2 \cdot F}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 2.5500000000000001e92Initial program 20.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.0
Applied rewrites16.0%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6419.4
Applied rewrites19.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6416.0
Applied rewrites16.0%
if 2.5500000000000001e92 < C Initial program 13.2%
Applied rewrites13.1%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.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-*.f641.4
Applied rewrites1.4%
Taylor expanded in B around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f644.5
Applied rewrites4.5%
rem-square-sqrtN/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
distribute-neg-fracN/A
lower-/.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-eval4.6
Applied rewrites4.6%
Final simplification14.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (/ (- (sqrt F)) (sqrt (* B_m 0.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) {
return -sqrt(F) / sqrt((B_m * 0.5));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) / sqrt((b_m * 0.5d0))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) / Math.sqrt((B_m * 0.5));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) / math.sqrt((B_m * 0.5))
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(F)) / sqrt(Float64(B_m * 0.5))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) / sqrt((B_m * 0.5));
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[F], $MachinePrecision]) / N[Sqrt[N[(B$95$m * 0.5), $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{F}}{\sqrt{B\_m \cdot 0.5}}
\end{array}
Initial program 19.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6417.0
Applied rewrites17.0%
lift-*.f64N/A
sqrt-divN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6417.0
Applied rewrites17.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
div-invN/A
metadata-evalN/A
lower-*.f6417.0
Applied rewrites17.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 (- (/ (sqrt (* 2.0 F)) (sqrt 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((2.0 * F)) / sqrt(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((2.0d0 * f)) / sqrt(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((2.0 * F)) / Math.sqrt(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((2.0 * F)) / math.sqrt(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(2.0 * F)) / sqrt(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((2.0 * F)) / sqrt(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[(2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\frac{\sqrt{2 \cdot F}}{\sqrt{B\_m}}
\end{array}
Initial program 19.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6417.0
Applied rewrites17.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 (* (- (sqrt F)) (sqrt (/ 2.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(F) * sqrt((2.0 / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(f) * sqrt((2.0d0 / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(F) * Math.sqrt((2.0 / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(F) * math.sqrt((2.0 / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(-sqrt(F)) * sqrt(Float64(2.0 / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(F) * sqrt((2.0 / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[((-N[Sqrt[F], $MachinePrecision]) * N[Sqrt[N[(2.0 / 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])\\
\\
\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B\_m}}
\end{array}
Initial program 19.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6417.0
Applied rewrites17.0%
lift-*.f64N/A
sqrt-divN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6417.0
Applied rewrites17.0%
Final simplification17.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 (if (<= C 2.55e+92) (- (sqrt (* F (/ 2.0 B_m)))) (/ (* -2.0 (sqrt (* C F))) B_m)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.55e+92) {
tmp = -sqrt((F * (2.0 / B_m)));
} else {
tmp = (-2.0 * sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.55d+92) then
tmp = -sqrt((f * (2.0d0 / b_m)))
else
tmp = ((-2.0d0) * sqrt((c * f))) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.55e+92) {
tmp = -Math.sqrt((F * (2.0 / B_m)));
} else {
tmp = (-2.0 * Math.sqrt((C * F))) / B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.55e+92: tmp = -math.sqrt((F * (2.0 / B_m))) else: tmp = (-2.0 * math.sqrt((C * F))) / B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.55e+92) tmp = Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))); else tmp = Float64(Float64(-2.0 * sqrt(Float64(C * F))) / B_m); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.55e+92)
tmp = -sqrt((F * (2.0 / B_m)));
else
tmp = (-2.0 * sqrt((C * F))) / B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.55e+92], (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[(-2.0 * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.55 \cdot 10^{+92}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2 \cdot \sqrt{C \cdot F}}{B\_m}\\
\end{array}
\end{array}
if C < 2.5500000000000001e92Initial program 20.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.0
Applied rewrites16.0%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6416.0
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6416.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6416.0
Applied rewrites16.0%
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6416.0
Applied rewrites16.0%
if 2.5500000000000001e92 < C Initial program 13.2%
Applied rewrites13.1%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.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-*.f641.4
Applied rewrites1.4%
Taylor expanded in B around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f644.5
Applied rewrites4.5%
rem-square-sqrtN/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
distribute-neg-fracN/A
lower-/.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-eval4.6
Applied rewrites4.6%
Final simplification14.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 (if (<= C 2.55e+92) (- (sqrt (* F (/ 2.0 B_m)))) (* (/ -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) {
double tmp;
if (C <= 2.55e+92) {
tmp = -sqrt((F * (2.0 / B_m)));
} else {
tmp = (-2.0 / B_m) * sqrt((C * F));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 2.55d+92) then
tmp = -sqrt((f * (2.0d0 / b_m)))
else
tmp = ((-2.0d0) / b_m) * sqrt((c * f))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 2.55e+92) {
tmp = -Math.sqrt((F * (2.0 / B_m)));
} else {
tmp = (-2.0 / B_m) * Math.sqrt((C * F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 2.55e+92: tmp = -math.sqrt((F * (2.0 / B_m))) else: tmp = (-2.0 / B_m) * math.sqrt((C * F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 2.55e+92) tmp = Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))); else tmp = Float64(Float64(-2.0 / B_m) * sqrt(Float64(C * F))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 2.55e+92)
tmp = -sqrt((F * (2.0 / B_m)));
else
tmp = (-2.0 / B_m) * sqrt((C * F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 2.55e+92], (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), 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])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.55 \cdot 10^{+92}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 2.5500000000000001e92Initial program 20.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6416.0
Applied rewrites16.0%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6416.0
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6416.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6416.0
Applied rewrites16.0%
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6416.0
Applied rewrites16.0%
if 2.5500000000000001e92 < C Initial program 13.2%
Applied rewrites13.1%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.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-*.f641.4
Applied rewrites1.4%
Taylor expanded in B around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f644.5
Applied rewrites4.5%
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
distribute-neg-fracN/A
lower-/.f64N/A
metadata-eval4.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f644.6
Applied rewrites4.6%
Final simplification14.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (/ 2.0 B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (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[Sqrt[N[(F * N[(2.0 / 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])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 19.0%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f6414.2
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6414.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6414.2
Applied rewrites14.2%
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
herbie shell --seed 2024216
(FPCore (A B C F)
:name "ABCF->ab-angle a"
: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))))