
(FPCore (x l t) :precision binary64 (/ (* (sqrt 2.0) t) (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))
double code(double x, double l, double t) {
return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}
real(8) function code(x, l, t)
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t
code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function
public static double code(double x, double l, double t) {
return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}
def code(x, l, t): return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))
function code(x, l, t) return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l)))) end
function tmp = code(x, l, t) tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l))); end
code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x l t) :precision binary64 (/ (* (sqrt 2.0) t) (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))
double code(double x, double l, double t) {
return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}
real(8) function code(x, l, t)
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t
code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function
public static double code(double x, double l, double t) {
return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}
def code(x, l, t): return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))
function code(x, l, t) return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l)))) end
function tmp = code(x, l, t) tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l))); end
code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}}
\end{array}
l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
:precision binary64
(*
t_s
(if (<= t_m 5.5e-289)
(* (sqrt 2.0) (/ t_m (* l_m (* (sqrt 2.0) (sqrt (/ 1.0 x))))))
(if (<= t_m 4.2e-218)
(+ 1.0 (/ -1.0 x))
(if (<= t_m 2e+48)
(*
(sqrt 2.0)
(/
t_m
(sqrt
(fma
2.0
(* (pow t_m 2.0) (/ (+ x 1.0) (+ -1.0 x)))
(* (pow l_m 2.0) (/ (+ 2.0 (/ 2.0 x)) x))))))
(sqrt (/ (+ -1.0 x) (+ x 1.0))))))))l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (t_m <= 5.5e-289) {
tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * sqrt((1.0 / x)))));
} else if (t_m <= 4.2e-218) {
tmp = 1.0 + (-1.0 / x);
} else if (t_m <= 2e+48) {
tmp = sqrt(2.0) * (t_m / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (-1.0 + x))), (pow(l_m, 2.0) * ((2.0 + (2.0 / x)) / x)))));
} else {
tmp = sqrt(((-1.0 + x) / (x + 1.0)));
}
return t_s * tmp;
}
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) tmp = 0.0 if (t_m <= 5.5e-289) tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * Float64(sqrt(2.0) * sqrt(Float64(1.0 / x)))))); elseif (t_m <= 4.2e-218) tmp = Float64(1.0 + Float64(-1.0 / x)); elseif (t_m <= 2e+48) tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(-1.0 + x))), Float64((l_m ^ 2.0) * Float64(Float64(2.0 + Float64(2.0 / x)) / x)))))); else tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))); end return Float64(t_s * tmp) end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 5.5e-289], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 4.2e-218], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2e+48], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] * N[(N[(x + 1.0), $MachinePrecision] / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] * N[(N[(2.0 + N[(2.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 5.5 \cdot 10^{-289}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \left(\sqrt{2} \cdot \sqrt{\frac{1}{x}}\right)}\\
\mathbf{elif}\;t\_m \leq 4.2 \cdot 10^{-218}:\\
\;\;\;\;1 + \frac{-1}{x}\\
\mathbf{elif}\;t\_m \leq 2 \cdot 10^{+48}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{-1 + x}, {l\_m}^{2} \cdot \frac{2 + \frac{2}{x}}{x}\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\end{array}
\end{array}
if t < 5.5000000000000004e-289Initial program 38.6%
Simplified38.5%
Taylor expanded in l around inf 3.6%
associate--l+8.1%
sub-neg8.1%
metadata-eval8.1%
+-commutative8.1%
sub-neg8.1%
metadata-eval8.1%
+-commutative8.1%
Simplified8.1%
Taylor expanded in x around inf 12.0%
associate-*l*12.0%
Simplified12.0%
if 5.5000000000000004e-289 < t < 4.19999999999999988e-218Initial program 2.9%
Simplified2.8%
Taylor expanded in t around inf 68.6%
Taylor expanded in x around inf 68.6%
if 4.19999999999999988e-218 < t < 2.00000000000000009e48Initial program 48.5%
Simplified48.4%
Taylor expanded in l around 0 53.0%
fma-define53.0%
sub-neg53.0%
metadata-eval53.0%
associate-/l*55.2%
+-commutative55.2%
+-commutative55.2%
associate--l+67.0%
sub-neg67.0%
metadata-eval67.0%
+-commutative67.0%
sub-neg67.0%
metadata-eval67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in x around inf 76.1%
associate-*r/76.1%
metadata-eval76.1%
Simplified76.1%
if 2.00000000000000009e48 < t Initial program 35.1%
Simplified35.0%
Taylor expanded in t around inf 97.2%
Taylor expanded in t around 0 97.4%
Final simplification48.8%
l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
:precision binary64
(*
t_s
(if (<= t_m 1.95e-162)
(*
(sqrt 2.0)
(/
t_m
(+
(*
0.5
(/
(+ (* 2.0 (+ (pow t_m 2.0) (pow t_m 2.0))) (* 2.0 (pow l_m 2.0)))
(* t_m (* (sqrt 2.0) x))))
(* t_m (sqrt 2.0)))))
(if (<= t_m 1.9e+48)
(*
(sqrt 2.0)
(/
t_m
(sqrt
(fma
2.0
(* (pow t_m 2.0) (/ (+ x 1.0) (+ -1.0 x)))
(* (pow l_m 2.0) (/ (+ 2.0 (/ 2.0 x)) x))))))
(sqrt (/ (+ -1.0 x) (+ x 1.0)))))))l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (t_m <= 1.95e-162) {
tmp = sqrt(2.0) * (t_m / ((0.5 * (((2.0 * (pow(t_m, 2.0) + pow(t_m, 2.0))) + (2.0 * pow(l_m, 2.0))) / (t_m * (sqrt(2.0) * x)))) + (t_m * sqrt(2.0))));
} else if (t_m <= 1.9e+48) {
tmp = sqrt(2.0) * (t_m / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (-1.0 + x))), (pow(l_m, 2.0) * ((2.0 + (2.0 / x)) / x)))));
} else {
tmp = sqrt(((-1.0 + x) / (x + 1.0)));
}
return t_s * tmp;
}
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) tmp = 0.0 if (t_m <= 1.95e-162) tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(0.5 * Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) + (t_m ^ 2.0))) + Float64(2.0 * (l_m ^ 2.0))) / Float64(t_m * Float64(sqrt(2.0) * x)))) + Float64(t_m * sqrt(2.0))))); elseif (t_m <= 1.9e+48) tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(-1.0 + x))), Float64((l_m ^ 2.0) * Float64(Float64(2.0 + Float64(2.0 / x)) / x)))))); else tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))); end return Float64(t_s * tmp) end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 1.95e-162], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(0.5 * N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] + N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.9e+48], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] * N[(N[(x + 1.0), $MachinePrecision] / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] * N[(N[(2.0 + N[(2.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 1.95 \cdot 10^{-162}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{0.5 \cdot \frac{2 \cdot \left({t\_m}^{2} + {t\_m}^{2}\right) + 2 \cdot {l\_m}^{2}}{t\_m \cdot \left(\sqrt{2} \cdot x\right)} + t\_m \cdot \sqrt{2}}\\
\mathbf{elif}\;t\_m \leq 1.9 \cdot 10^{+48}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{-1 + x}, {l\_m}^{2} \cdot \frac{2 + \frac{2}{x}}{x}\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\end{array}
\end{array}
if t < 1.95e-162Initial program 34.3%
Simplified34.2%
Taylor expanded in l around 0 25.1%
fma-define25.1%
sub-neg25.1%
metadata-eval25.1%
associate-/l*37.2%
+-commutative37.2%
+-commutative37.2%
associate--l+43.4%
sub-neg43.4%
metadata-eval43.4%
+-commutative43.4%
sub-neg43.4%
metadata-eval43.4%
+-commutative43.4%
Simplified43.4%
Taylor expanded in x around inf 11.6%
if 1.95e-162 < t < 1.9e48Initial program 66.5%
Simplified66.4%
Taylor expanded in l around 0 72.7%
fma-define72.7%
sub-neg72.7%
metadata-eval72.7%
associate-/l*75.8%
+-commutative75.8%
+-commutative75.8%
associate--l+83.6%
sub-neg83.6%
metadata-eval83.6%
+-commutative83.6%
sub-neg83.6%
metadata-eval83.6%
+-commutative83.6%
Simplified83.6%
Taylor expanded in x around inf 88.7%
associate-*r/88.7%
metadata-eval88.7%
Simplified88.7%
if 1.9e48 < t Initial program 35.1%
Simplified35.0%
Taylor expanded in t around inf 97.2%
Taylor expanded in t around 0 97.4%
Final simplification45.8%
l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
:precision binary64
(*
t_s
(if (<= t_m 5.5e-289)
(* (sqrt 2.0) (/ t_m (* l_m (* (sqrt 2.0) (sqrt (/ 1.0 x))))))
(if (<= t_m 3.4e-217)
(+ 1.0 (/ -1.0 x))
(if (<= t_m 2.9e+48)
(*
(sqrt 2.0)
(/
t_m
(sqrt
(fma
2.0
(* (pow t_m 2.0) (/ (+ x 1.0) (+ -1.0 x)))
(* (pow l_m 2.0) (/ 2.0 x))))))
(sqrt (/ (+ -1.0 x) (+ x 1.0))))))))l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (t_m <= 5.5e-289) {
tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * sqrt((1.0 / x)))));
} else if (t_m <= 3.4e-217) {
tmp = 1.0 + (-1.0 / x);
} else if (t_m <= 2.9e+48) {
tmp = sqrt(2.0) * (t_m / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (-1.0 + x))), (pow(l_m, 2.0) * (2.0 / x)))));
} else {
tmp = sqrt(((-1.0 + x) / (x + 1.0)));
}
return t_s * tmp;
}
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) tmp = 0.0 if (t_m <= 5.5e-289) tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * Float64(sqrt(2.0) * sqrt(Float64(1.0 / x)))))); elseif (t_m <= 3.4e-217) tmp = Float64(1.0 + Float64(-1.0 / x)); elseif (t_m <= 2.9e+48) tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(-1.0 + x))), Float64((l_m ^ 2.0) * Float64(2.0 / x)))))); else tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))); end return Float64(t_s * tmp) end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 5.5e-289], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.4e-217], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2.9e+48], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] * N[(N[(x + 1.0), $MachinePrecision] / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] * N[(2.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 5.5 \cdot 10^{-289}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \left(\sqrt{2} \cdot \sqrt{\frac{1}{x}}\right)}\\
\mathbf{elif}\;t\_m \leq 3.4 \cdot 10^{-217}:\\
\;\;\;\;1 + \frac{-1}{x}\\
\mathbf{elif}\;t\_m \leq 2.9 \cdot 10^{+48}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{-1 + x}, {l\_m}^{2} \cdot \frac{2}{x}\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\end{array}
\end{array}
if t < 5.5000000000000004e-289Initial program 38.6%
Simplified38.5%
Taylor expanded in l around inf 3.6%
associate--l+8.1%
sub-neg8.1%
metadata-eval8.1%
+-commutative8.1%
sub-neg8.1%
metadata-eval8.1%
+-commutative8.1%
Simplified8.1%
Taylor expanded in x around inf 12.0%
associate-*l*12.0%
Simplified12.0%
if 5.5000000000000004e-289 < t < 3.40000000000000016e-217Initial program 2.9%
Simplified2.8%
Taylor expanded in t around inf 68.6%
Taylor expanded in x around inf 68.6%
if 3.40000000000000016e-217 < t < 2.8999999999999999e48Initial program 48.5%
Simplified48.4%
Taylor expanded in l around 0 53.0%
fma-define53.0%
sub-neg53.0%
metadata-eval53.0%
associate-/l*55.2%
+-commutative55.2%
+-commutative55.2%
associate--l+67.0%
sub-neg67.0%
metadata-eval67.0%
+-commutative67.0%
sub-neg67.0%
metadata-eval67.0%
+-commutative67.0%
Simplified67.0%
Taylor expanded in x around inf 76.1%
if 2.8999999999999999e48 < t Initial program 35.1%
Simplified35.0%
Taylor expanded in t around inf 97.2%
Taylor expanded in t around 0 97.4%
Final simplification48.8%
l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
:precision binary64
(*
t_s
(if (<= l_m 1.5e+277)
(sqrt (/ (+ -1.0 x) (+ x 1.0)))
(* (sqrt 2.0) (/ t_m (* l_m (* (sqrt 2.0) (sqrt (/ 1.0 x)))))))))l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (l_m <= 1.5e+277) {
tmp = sqrt(((-1.0 + x) / (x + 1.0)));
} else {
tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * sqrt((1.0 / x)))));
}
return t_s * tmp;
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
real(8) :: tmp
if (l_m <= 1.5d+277) then
tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
else
tmp = sqrt(2.0d0) * (t_m / (l_m * (sqrt(2.0d0) * sqrt((1.0d0 / x)))))
end if
code = t_s * tmp
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (l_m <= 1.5e+277) {
tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
} else {
tmp = Math.sqrt(2.0) * (t_m / (l_m * (Math.sqrt(2.0) * Math.sqrt((1.0 / x)))));
}
return t_s * tmp;
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): tmp = 0 if l_m <= 1.5e+277: tmp = math.sqrt(((-1.0 + x) / (x + 1.0))) else: tmp = math.sqrt(2.0) * (t_m / (l_m * (math.sqrt(2.0) * math.sqrt((1.0 / x))))) return t_s * tmp
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) tmp = 0.0 if (l_m <= 1.5e+277) tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))); else tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * Float64(sqrt(2.0) * sqrt(Float64(1.0 / x)))))); end return Float64(t_s * tmp) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l_m, t_m) tmp = 0.0; if (l_m <= 1.5e+277) tmp = sqrt(((-1.0 + x) / (x + 1.0))); else tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * sqrt((1.0 / x))))); end tmp_2 = t_s * tmp; end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[l$95$m, 1.5e+277], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;l\_m \leq 1.5 \cdot 10^{+277}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \left(\sqrt{2} \cdot \sqrt{\frac{1}{x}}\right)}\\
\end{array}
\end{array}
if l < 1.49999999999999991e277Initial program 39.2%
Simplified34.2%
Taylor expanded in t around inf 42.4%
Taylor expanded in t around 0 42.5%
if 1.49999999999999991e277 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 0.0%
associate--l+61.9%
sub-neg61.9%
metadata-eval61.9%
+-commutative61.9%
sub-neg61.9%
metadata-eval61.9%
+-commutative61.9%
Simplified61.9%
Taylor expanded in x around inf 79.7%
associate-*l*80.0%
Simplified80.0%
Final simplification43.2%
l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
:precision binary64
(*
t_s
(if (<= l_m 1.5e+277)
(sqrt (/ (+ -1.0 x) (+ x 1.0)))
(* (sqrt 2.0) (* (* t_m (sqrt x)) (/ (sqrt 0.5) l_m))))))l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (l_m <= 1.5e+277) {
tmp = sqrt(((-1.0 + x) / (x + 1.0)));
} else {
tmp = sqrt(2.0) * ((t_m * sqrt(x)) * (sqrt(0.5) / l_m));
}
return t_s * tmp;
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
real(8) :: tmp
if (l_m <= 1.5d+277) then
tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
else
tmp = sqrt(2.0d0) * ((t_m * sqrt(x)) * (sqrt(0.5d0) / l_m))
end if
code = t_s * tmp
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (l_m <= 1.5e+277) {
tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
} else {
tmp = Math.sqrt(2.0) * ((t_m * Math.sqrt(x)) * (Math.sqrt(0.5) / l_m));
}
return t_s * tmp;
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): tmp = 0 if l_m <= 1.5e+277: tmp = math.sqrt(((-1.0 + x) / (x + 1.0))) else: tmp = math.sqrt(2.0) * ((t_m * math.sqrt(x)) * (math.sqrt(0.5) / l_m)) return t_s * tmp
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) tmp = 0.0 if (l_m <= 1.5e+277) tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))); else tmp = Float64(sqrt(2.0) * Float64(Float64(t_m * sqrt(x)) * Float64(sqrt(0.5) / l_m))); end return Float64(t_s * tmp) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l_m, t_m) tmp = 0.0; if (l_m <= 1.5e+277) tmp = sqrt(((-1.0 + x) / (x + 1.0))); else tmp = sqrt(2.0) * ((t_m * sqrt(x)) * (sqrt(0.5) / l_m)); end tmp_2 = t_s * tmp; end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[l$95$m, 1.5e+277], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[0.5], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;l\_m \leq 1.5 \cdot 10^{+277}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\left(t\_m \cdot \sqrt{x}\right) \cdot \frac{\sqrt{0.5}}{l\_m}\right)\\
\end{array}
\end{array}
if l < 1.49999999999999991e277Initial program 39.2%
Simplified34.2%
Taylor expanded in t around inf 42.4%
Taylor expanded in t around 0 42.5%
if 1.49999999999999991e277 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 0.0%
associate--l+61.9%
sub-neg61.9%
metadata-eval61.9%
+-commutative61.9%
sub-neg61.9%
metadata-eval61.9%
+-commutative61.9%
Simplified61.9%
*-un-lft-identity61.9%
sqrt-prod61.9%
sqrt-pow164.1%
metadata-eval64.1%
pow164.1%
+-commutative64.1%
sub-neg64.1%
+-commutative64.1%
metadata-eval64.1%
Applied egg-rr64.1%
*-lft-identity64.1%
associate-/r*64.1%
associate-+r+1.0%
metadata-eval1.0%
sub-neg1.0%
metadata-eval1.0%
sub-neg1.0%
metadata-eval1.0%
sub-neg1.0%
associate--l+64.1%
sub-neg64.1%
metadata-eval64.1%
+-commutative64.1%
sub-neg64.1%
metadata-eval64.1%
+-commutative64.1%
Simplified64.1%
Taylor expanded in x around inf 69.5%
*-commutative69.5%
associate-/l*69.5%
associate-*r*79.7%
Simplified79.7%
Final simplification43.2%
l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
:precision binary64
(*
t_s
(if (<= l_m 1.5e+277)
(sqrt (/ (+ -1.0 x) (+ x 1.0)))
(* (sqrt 2.0) (/ (/ t_m l_m) (sqrt (/ 2.0 x)))))))l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (l_m <= 1.5e+277) {
tmp = sqrt(((-1.0 + x) / (x + 1.0)));
} else {
tmp = sqrt(2.0) * ((t_m / l_m) / sqrt((2.0 / x)));
}
return t_s * tmp;
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
real(8) :: tmp
if (l_m <= 1.5d+277) then
tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
else
tmp = sqrt(2.0d0) * ((t_m / l_m) / sqrt((2.0d0 / x)))
end if
code = t_s * tmp
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
double tmp;
if (l_m <= 1.5e+277) {
tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
} else {
tmp = Math.sqrt(2.0) * ((t_m / l_m) / Math.sqrt((2.0 / x)));
}
return t_s * tmp;
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): tmp = 0 if l_m <= 1.5e+277: tmp = math.sqrt(((-1.0 + x) / (x + 1.0))) else: tmp = math.sqrt(2.0) * ((t_m / l_m) / math.sqrt((2.0 / x))) return t_s * tmp
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) tmp = 0.0 if (l_m <= 1.5e+277) tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))); else tmp = Float64(sqrt(2.0) * Float64(Float64(t_m / l_m) / sqrt(Float64(2.0 / x)))); end return Float64(t_s * tmp) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l_m, t_m) tmp = 0.0; if (l_m <= 1.5e+277) tmp = sqrt(((-1.0 + x) / (x + 1.0))); else tmp = sqrt(2.0) * ((t_m / l_m) / sqrt((2.0 / x))); end tmp_2 = t_s * tmp; end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[l$95$m, 1.5e+277], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[(t$95$m / l$95$m), $MachinePrecision] / N[Sqrt[N[(2.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;l\_m \leq 1.5 \cdot 10^{+277}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{\frac{t\_m}{l\_m}}{\sqrt{\frac{2}{x}}}\\
\end{array}
\end{array}
if l < 1.49999999999999991e277Initial program 39.2%
Simplified34.2%
Taylor expanded in t around inf 42.4%
Taylor expanded in t around 0 42.5%
if 1.49999999999999991e277 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 0.0%
associate--l+61.9%
sub-neg61.9%
metadata-eval61.9%
+-commutative61.9%
sub-neg61.9%
metadata-eval61.9%
+-commutative61.9%
Simplified61.9%
*-un-lft-identity61.9%
sqrt-prod61.9%
sqrt-pow164.1%
metadata-eval64.1%
pow164.1%
+-commutative64.1%
sub-neg64.1%
+-commutative64.1%
metadata-eval64.1%
Applied egg-rr64.1%
*-lft-identity64.1%
associate-/r*64.1%
associate-+r+1.0%
metadata-eval1.0%
sub-neg1.0%
metadata-eval1.0%
sub-neg1.0%
metadata-eval1.0%
sub-neg1.0%
associate--l+64.1%
sub-neg64.1%
metadata-eval64.1%
+-commutative64.1%
sub-neg64.1%
metadata-eval64.1%
+-commutative64.1%
Simplified64.1%
Taylor expanded in x around inf 69.6%
Final simplification43.0%
l_m = (fabs.f64 l) t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l_m t_m) :precision binary64 (* t_s (sqrt (/ (+ -1.0 x) (+ x 1.0)))))
l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
return t_s * sqrt(((-1.0 + x) / (x + 1.0)));
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
code = t_s * sqrt((((-1.0d0) + x) / (x + 1.0d0)))
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
return t_s * Math.sqrt(((-1.0 + x) / (x + 1.0)));
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): return t_s * math.sqrt(((-1.0 + x) / (x + 1.0)))
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) return Float64(t_s * sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)))) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l_m, t_m) tmp = t_s * sqrt(((-1.0 + x) / (x + 1.0))); end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \sqrt{\frac{-1 + x}{x + 1}}
\end{array}
Initial program 38.4%
Simplified33.5%
Taylor expanded in t around inf 41.6%
Taylor expanded in t around 0 41.7%
Final simplification41.7%
l_m = (fabs.f64 l) t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l_m t_m) :precision binary64 (* t_s (+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))))
l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
return t_s * (1.0 + ((-1.0 + (0.5 / x)) / x));
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
code = t_s * (1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x))
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
return t_s * (1.0 + ((-1.0 + (0.5 / x)) / x));
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): return t_s * (1.0 + ((-1.0 + (0.5 / x)) / x))
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) return Float64(t_s * Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x))) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l_m, t_m) tmp = t_s * (1.0 + ((-1.0 + (0.5 / x)) / x)); end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \left(1 + \frac{-1 + \frac{0.5}{x}}{x}\right)
\end{array}
Initial program 38.4%
Simplified33.5%
Taylor expanded in t around inf 41.6%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified41.7%
Final simplification41.7%
l_m = (fabs.f64 l) t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l_m t_m) :precision binary64 (* t_s (+ 1.0 (/ -1.0 x))))
l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
return t_s * (1.0 + (-1.0 / x));
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
code = t_s * (1.0d0 + ((-1.0d0) / x))
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
return t_s * (1.0 + (-1.0 / x));
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): return t_s * (1.0 + (-1.0 / x))
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) return Float64(t_s * Float64(1.0 + Float64(-1.0 / x))) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l_m, t_m) tmp = t_s * (1.0 + (-1.0 / x)); end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \left(1 + \frac{-1}{x}\right)
\end{array}
Initial program 38.4%
Simplified33.5%
Taylor expanded in t around inf 41.6%
Taylor expanded in x around inf 41.5%
Final simplification41.5%
l_m = (fabs.f64 l) t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l_m t_m) :precision binary64 (* t_s 1.0))
l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
return t_s * 1.0;
}
l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l_m
real(8), intent (in) :: t_m
code = t_s * 1.0d0
end function
l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
return t_s * 1.0;
}
l_m = math.fabs(l) t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l_m, t_m): return t_s * 1.0
l_m = abs(l) t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l_m, t_m) return Float64(t_s * 1.0) end
l_m = abs(l); t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l_m, t_m) tmp = t_s * 1.0; end
l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot 1
\end{array}
Initial program 38.4%
Simplified33.5%
Taylor expanded in t around inf 41.6%
Taylor expanded in x around inf 40.7%
herbie shell --seed 2024169
(FPCore (x l t)
:name "Toniolo and Linder, Equation (7)"
:precision binary64
(/ (* (sqrt 2.0) t) (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))