
(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 11 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}
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(let* ((t_2 (/ (+ x 1.0) (+ x -1.0))))
(*
t_s
(if (<= x -1.0)
(pow t_2 -0.5)
(*
(sqrt 2.0)
(/ t_m (* (sqrt 2.0) (hypot (/ l (sqrt x)) (* t_m (sqrt t_2))))))))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double t_2 = (x + 1.0) / (x + -1.0);
double tmp;
if (x <= -1.0) {
tmp = pow(t_2, -0.5);
} else {
tmp = sqrt(2.0) * (t_m / (sqrt(2.0) * hypot((l / sqrt(x)), (t_m * sqrt(t_2)))));
}
return t_s * tmp;
}
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double t_2 = (x + 1.0) / (x + -1.0);
double tmp;
if (x <= -1.0) {
tmp = Math.pow(t_2, -0.5);
} else {
tmp = Math.sqrt(2.0) * (t_m / (Math.sqrt(2.0) * Math.hypot((l / Math.sqrt(x)), (t_m * Math.sqrt(t_2)))));
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): t_2 = (x + 1.0) / (x + -1.0) tmp = 0 if x <= -1.0: tmp = math.pow(t_2, -0.5) else: tmp = math.sqrt(2.0) * (t_m / (math.sqrt(2.0) * math.hypot((l / math.sqrt(x)), (t_m * math.sqrt(t_2))))) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) t_2 = Float64(Float64(x + 1.0) / Float64(x + -1.0)) tmp = 0.0 if (x <= -1.0) tmp = t_2 ^ -0.5; else tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(sqrt(2.0) * hypot(Float64(l / sqrt(x)), Float64(t_m * sqrt(t_2)))))); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) t_2 = (x + 1.0) / (x + -1.0); tmp = 0.0; if (x <= -1.0) tmp = t_2 ^ -0.5; else tmp = sqrt(2.0) * (t_m / (sqrt(2.0) * hypot((l / sqrt(x)), (t_m * sqrt(t_2))))); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := Block[{t$95$2 = N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[x, -1.0], N[Power[t$95$2, -0.5], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(l / N[Sqrt[x], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(t$95$m * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
\begin{array}{l}
t_2 := \frac{x + 1}{x + -1}\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;x \leq -1:\\
\;\;\;\;{t\_2}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{2} \cdot \mathsf{hypot}\left(\frac{\ell}{\sqrt{x}}, t\_m \cdot \sqrt{t\_2}\right)}\\
\end{array}
\end{array}
\end{array}
if x < -1Initial program 41.8%
Simplified36.3%
Taylor expanded in t around inf 45.7%
Taylor expanded in t around 0 45.8%
clear-num45.8%
+-commutative45.8%
sub-neg45.8%
metadata-eval45.8%
+-commutative45.8%
inv-pow45.8%
+-commutative45.8%
Applied egg-rr45.8%
unpow-145.8%
+-commutative45.8%
Simplified45.8%
*-un-lft-identity45.8%
inv-pow45.8%
sqrt-pow145.8%
+-commutative45.8%
+-commutative45.8%
metadata-eval45.8%
Applied egg-rr45.8%
*-lft-identity45.8%
+-commutative45.8%
+-commutative45.8%
Simplified45.8%
if -1 < x Initial program 32.7%
Simplified27.6%
Taylor expanded in l around 0 27.1%
fma-define27.1%
sub-neg27.1%
metadata-eval27.1%
associate-/l*39.7%
+-commutative39.7%
+-commutative39.7%
associate--l+48.1%
sub-neg48.1%
metadata-eval48.1%
+-commutative48.1%
sub-neg48.1%
metadata-eval48.1%
+-commutative48.1%
Simplified48.1%
Taylor expanded in x around inf 57.4%
Taylor expanded in t around 0 44.8%
distribute-lft-out44.8%
sub-neg44.8%
metadata-eval44.8%
associate-/l*57.4%
+-commutative57.4%
+-commutative57.4%
Simplified57.4%
*-commutative57.4%
sqrt-prod57.6%
Applied egg-rr99.7%
Final simplification78.0%
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(let* ((t_2 (/ (+ x 1.0) (+ x -1.0))))
(*
t_s
(if (<= (* l l) 5e+138)
(pow t_2 -0.5)
(if (<= (* l l) 5e+269)
(*
(sqrt 2.0)
(/ t_m (sqrt (* 2.0 (+ (* t_2 (* t_m t_m)) (/ (pow l 2.0) x))))))
(* (sqrt 2.0) (/ t_m (* (* (sqrt 2.0) l) (sqrt (/ 1.0 x))))))))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double t_2 = (x + 1.0) / (x + -1.0);
double tmp;
if ((l * l) <= 5e+138) {
tmp = pow(t_2, -0.5);
} else if ((l * l) <= 5e+269) {
tmp = sqrt(2.0) * (t_m / sqrt((2.0 * ((t_2 * (t_m * t_m)) + (pow(l, 2.0) / x)))));
} else {
tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l) * sqrt((1.0 / x))));
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: t_2
real(8) :: tmp
t_2 = (x + 1.0d0) / (x + (-1.0d0))
if ((l * l) <= 5d+138) then
tmp = t_2 ** (-0.5d0)
else if ((l * l) <= 5d+269) then
tmp = sqrt(2.0d0) * (t_m / sqrt((2.0d0 * ((t_2 * (t_m * t_m)) + ((l ** 2.0d0) / x)))))
else
tmp = sqrt(2.0d0) * (t_m / ((sqrt(2.0d0) * l) * sqrt((1.0d0 / x))))
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double t_2 = (x + 1.0) / (x + -1.0);
double tmp;
if ((l * l) <= 5e+138) {
tmp = Math.pow(t_2, -0.5);
} else if ((l * l) <= 5e+269) {
tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((2.0 * ((t_2 * (t_m * t_m)) + (Math.pow(l, 2.0) / x)))));
} else {
tmp = Math.sqrt(2.0) * (t_m / ((Math.sqrt(2.0) * l) * Math.sqrt((1.0 / x))));
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): t_2 = (x + 1.0) / (x + -1.0) tmp = 0 if (l * l) <= 5e+138: tmp = math.pow(t_2, -0.5) elif (l * l) <= 5e+269: tmp = math.sqrt(2.0) * (t_m / math.sqrt((2.0 * ((t_2 * (t_m * t_m)) + (math.pow(l, 2.0) / x))))) else: tmp = math.sqrt(2.0) * (t_m / ((math.sqrt(2.0) * l) * math.sqrt((1.0 / x)))) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) t_2 = Float64(Float64(x + 1.0) / Float64(x + -1.0)) tmp = 0.0 if (Float64(l * l) <= 5e+138) tmp = t_2 ^ -0.5; elseif (Float64(l * l) <= 5e+269) tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(2.0 * Float64(Float64(t_2 * Float64(t_m * t_m)) + Float64((l ^ 2.0) / x)))))); else tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(sqrt(2.0) * l) * sqrt(Float64(1.0 / x))))); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) t_2 = (x + 1.0) / (x + -1.0); tmp = 0.0; if ((l * l) <= 5e+138) tmp = t_2 ^ -0.5; elseif ((l * l) <= 5e+269) tmp = sqrt(2.0) * (t_m / sqrt((2.0 * ((t_2 * (t_m * t_m)) + ((l ^ 2.0) / x))))); else tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l) * sqrt((1.0 / x)))); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := Block[{t$95$2 = N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[N[(l * l), $MachinePrecision], 5e+138], N[Power[t$95$2, -0.5], $MachinePrecision], If[LessEqual[N[(l * l), $MachinePrecision], 5e+269], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(N[(t$95$2 * N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
\begin{array}{l}
t_2 := \frac{x + 1}{x + -1}\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{+138}:\\
\;\;\;\;{t\_2}^{-0.5}\\
\mathbf{elif}\;\ell \cdot \ell \leq 5 \cdot 10^{+269}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{2 \cdot \left(t\_2 \cdot \left(t\_m \cdot t\_m\right) + \frac{{\ell}^{2}}{x}\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}}}\\
\end{array}
\end{array}
\end{array}
if (*.f64 l l) < 5.00000000000000016e138Initial program 47.8%
Simplified40.1%
Taylor expanded in t around inf 44.5%
Taylor expanded in t around 0 44.6%
clear-num44.6%
+-commutative44.6%
sub-neg44.6%
metadata-eval44.6%
+-commutative44.6%
inv-pow44.6%
+-commutative44.6%
Applied egg-rr44.6%
unpow-144.6%
+-commutative44.6%
Simplified44.6%
*-un-lft-identity44.6%
inv-pow44.6%
sqrt-pow144.6%
+-commutative44.6%
+-commutative44.6%
metadata-eval44.6%
Applied egg-rr44.6%
*-lft-identity44.6%
+-commutative44.6%
+-commutative44.6%
Simplified44.6%
if 5.00000000000000016e138 < (*.f64 l l) < 5.0000000000000002e269Initial program 19.3%
Simplified23.2%
Taylor expanded in l around 0 23.7%
fma-define23.7%
sub-neg23.7%
metadata-eval23.7%
associate-/l*44.5%
+-commutative44.5%
+-commutative44.5%
associate--l+62.6%
sub-neg62.6%
metadata-eval62.6%
+-commutative62.6%
sub-neg62.6%
metadata-eval62.6%
+-commutative62.6%
Simplified62.6%
Taylor expanded in x around inf 86.6%
Taylor expanded in t around 0 65.7%
distribute-lft-out65.7%
sub-neg65.7%
metadata-eval65.7%
associate-/l*86.6%
+-commutative86.6%
+-commutative86.6%
Simplified86.6%
unpow286.6%
Applied egg-rr86.6%
if 5.0000000000000002e269 < (*.f64 l l) Initial program 0.2%
Simplified0.1%
Taylor expanded in l around inf 1.8%
associate--l+19.2%
sub-neg19.2%
metadata-eval19.2%
+-commutative19.2%
sub-neg19.2%
metadata-eval19.2%
+-commutative19.2%
Simplified19.2%
Taylor expanded in x around inf 39.3%
Final simplification47.4%
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(*
t_s
(if (<= l 7.2e+167)
(pow (/ (+ x 1.0) (+ x -1.0)) -0.5)
(* (sqrt 2.0) (/ t_m (* (* (sqrt 2.0) l) (sqrt (/ 1.0 x))))))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 7.2e+167) {
tmp = pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l) * sqrt((1.0 / x))));
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: tmp
if (l <= 7.2d+167) then
tmp = ((x + 1.0d0) / (x + (-1.0d0))) ** (-0.5d0)
else
tmp = sqrt(2.0d0) * (t_m / ((sqrt(2.0d0) * l) * sqrt((1.0d0 / x))))
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 7.2e+167) {
tmp = Math.pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = Math.sqrt(2.0) * (t_m / ((Math.sqrt(2.0) * l) * Math.sqrt((1.0 / x))));
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): tmp = 0 if l <= 7.2e+167: tmp = math.pow(((x + 1.0) / (x + -1.0)), -0.5) else: tmp = math.sqrt(2.0) * (t_m / ((math.sqrt(2.0) * l) * math.sqrt((1.0 / x)))) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) tmp = 0.0 if (l <= 7.2e+167) tmp = Float64(Float64(x + 1.0) / Float64(x + -1.0)) ^ -0.5; else tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(sqrt(2.0) * l) * sqrt(Float64(1.0 / x))))); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) tmp = 0.0; if (l <= 7.2e+167) tmp = ((x + 1.0) / (x + -1.0)) ^ -0.5; else tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l) * sqrt((1.0 / x)))); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := N[(t$95$s * If[LessEqual[l, 7.2e+167], N[Power[N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \leq 7.2 \cdot 10^{+167}:\\
\;\;\;\;{\left(\frac{x + 1}{x + -1}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}}}\\
\end{array}
\end{array}
if l < 7.20000000000000049e167Initial program 39.6%
Simplified33.9%
Taylor expanded in t around inf 41.0%
Taylor expanded in t around 0 41.1%
clear-num41.1%
+-commutative41.1%
sub-neg41.1%
metadata-eval41.1%
+-commutative41.1%
inv-pow41.1%
+-commutative41.1%
Applied egg-rr41.1%
unpow-141.1%
+-commutative41.1%
Simplified41.1%
*-un-lft-identity41.1%
inv-pow41.1%
sqrt-pow141.1%
+-commutative41.1%
+-commutative41.1%
metadata-eval41.1%
Applied egg-rr41.1%
*-lft-identity41.1%
+-commutative41.1%
+-commutative41.1%
Simplified41.1%
if 7.20000000000000049e167 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 2.5%
associate--l+21.7%
sub-neg21.7%
metadata-eval21.7%
+-commutative21.7%
sub-neg21.7%
metadata-eval21.7%
+-commutative21.7%
Simplified21.7%
Taylor expanded in x around inf 63.0%
Final simplification42.9%
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(*
t_s
(if (<= l 5e+167)
(pow (/ (+ x 1.0) (+ x -1.0)) -0.5)
(* (sqrt 2.0) (/ t_m (* l (* (sqrt 2.0) (sqrt (/ 1.0 x)))))))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 5e+167) {
tmp = pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = sqrt(2.0) * (t_m / (l * (sqrt(2.0) * sqrt((1.0 / x)))));
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: tmp
if (l <= 5d+167) then
tmp = ((x + 1.0d0) / (x + (-1.0d0))) ** (-0.5d0)
else
tmp = sqrt(2.0d0) * (t_m / (l * (sqrt(2.0d0) * sqrt((1.0d0 / x)))))
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 5e+167) {
tmp = Math.pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = Math.sqrt(2.0) * (t_m / (l * (Math.sqrt(2.0) * Math.sqrt((1.0 / x)))));
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): tmp = 0 if l <= 5e+167: tmp = math.pow(((x + 1.0) / (x + -1.0)), -0.5) else: tmp = math.sqrt(2.0) * (t_m / (l * (math.sqrt(2.0) * math.sqrt((1.0 / x))))) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) tmp = 0.0 if (l <= 5e+167) tmp = Float64(Float64(x + 1.0) / Float64(x + -1.0)) ^ -0.5; else tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l * Float64(sqrt(2.0) * sqrt(Float64(1.0 / x)))))); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) tmp = 0.0; if (l <= 5e+167) tmp = ((x + 1.0) / (x + -1.0)) ^ -0.5; else tmp = sqrt(2.0) * (t_m / (l * (sqrt(2.0) * sqrt((1.0 / x))))); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := N[(t$95$s * If[LessEqual[l, 5e+167], N[Power[N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \leq 5 \cdot 10^{+167}:\\
\;\;\;\;{\left(\frac{x + 1}{x + -1}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\ell \cdot \left(\sqrt{2} \cdot \sqrt{\frac{1}{x}}\right)}\\
\end{array}
\end{array}
if l < 4.9999999999999997e167Initial program 39.6%
Simplified33.9%
Taylor expanded in t around inf 41.0%
Taylor expanded in t around 0 41.1%
clear-num41.1%
+-commutative41.1%
sub-neg41.1%
metadata-eval41.1%
+-commutative41.1%
inv-pow41.1%
+-commutative41.1%
Applied egg-rr41.1%
unpow-141.1%
+-commutative41.1%
Simplified41.1%
*-un-lft-identity41.1%
inv-pow41.1%
sqrt-pow141.1%
+-commutative41.1%
+-commutative41.1%
metadata-eval41.1%
Applied egg-rr41.1%
*-lft-identity41.1%
+-commutative41.1%
+-commutative41.1%
Simplified41.1%
if 4.9999999999999997e167 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 2.5%
associate--l+21.7%
sub-neg21.7%
metadata-eval21.7%
+-commutative21.7%
sub-neg21.7%
metadata-eval21.7%
+-commutative21.7%
Simplified21.7%
Taylor expanded in x around inf 63.0%
associate-*l*63.0%
*-commutative63.0%
Simplified63.0%
Final simplification42.9%
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(*
t_s
(if (<= l 5e+167)
(pow (/ (+ x 1.0) (+ x -1.0)) -0.5)
(* (sqrt 2.0) (/ t_m (* l (sqrt (+ (/ 1.0 x) (/ 1.0 (+ x -1.0))))))))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 5e+167) {
tmp = pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = sqrt(2.0) * (t_m / (l * sqrt(((1.0 / x) + (1.0 / (x + -1.0))))));
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: tmp
if (l <= 5d+167) then
tmp = ((x + 1.0d0) / (x + (-1.0d0))) ** (-0.5d0)
else
tmp = sqrt(2.0d0) * (t_m / (l * sqrt(((1.0d0 / x) + (1.0d0 / (x + (-1.0d0)))))))
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 5e+167) {
tmp = Math.pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = Math.sqrt(2.0) * (t_m / (l * Math.sqrt(((1.0 / x) + (1.0 / (x + -1.0))))));
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): tmp = 0 if l <= 5e+167: tmp = math.pow(((x + 1.0) / (x + -1.0)), -0.5) else: tmp = math.sqrt(2.0) * (t_m / (l * math.sqrt(((1.0 / x) + (1.0 / (x + -1.0)))))) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) tmp = 0.0 if (l <= 5e+167) tmp = Float64(Float64(x + 1.0) / Float64(x + -1.0)) ^ -0.5; else tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l * sqrt(Float64(Float64(1.0 / x) + Float64(1.0 / Float64(x + -1.0))))))); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) tmp = 0.0; if (l <= 5e+167) tmp = ((x + 1.0) / (x + -1.0)) ^ -0.5; else tmp = sqrt(2.0) * (t_m / (l * sqrt(((1.0 / x) + (1.0 / (x + -1.0)))))); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := N[(t$95$s * If[LessEqual[l, 5e+167], N[Power[N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l * N[Sqrt[N[(N[(1.0 / x), $MachinePrecision] + N[(1.0 / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \leq 5 \cdot 10^{+167}:\\
\;\;\;\;{\left(\frac{x + 1}{x + -1}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\ell \cdot \sqrt{\frac{1}{x} + \frac{1}{x + -1}}}\\
\end{array}
\end{array}
if l < 4.9999999999999997e167Initial program 39.6%
Simplified33.9%
Taylor expanded in t around inf 41.0%
Taylor expanded in t around 0 41.1%
clear-num41.1%
+-commutative41.1%
sub-neg41.1%
metadata-eval41.1%
+-commutative41.1%
inv-pow41.1%
+-commutative41.1%
Applied egg-rr41.1%
unpow-141.1%
+-commutative41.1%
Simplified41.1%
*-un-lft-identity41.1%
inv-pow41.1%
sqrt-pow141.1%
+-commutative41.1%
+-commutative41.1%
metadata-eval41.1%
Applied egg-rr41.1%
*-lft-identity41.1%
+-commutative41.1%
+-commutative41.1%
Simplified41.1%
if 4.9999999999999997e167 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 2.5%
associate--l+21.7%
sub-neg21.7%
metadata-eval21.7%
+-commutative21.7%
sub-neg21.7%
metadata-eval21.7%
+-commutative21.7%
Simplified21.7%
Taylor expanded in x around inf 62.8%
Final simplification42.9%
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(*
t_s
(if (<= l 6.5e+209)
(pow (/ (+ x 1.0) (+ x -1.0)) -0.5)
(* (sqrt x) (/ t_m l)))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 6.5e+209) {
tmp = pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = sqrt(x) * (t_m / l);
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: tmp
if (l <= 6.5d+209) then
tmp = ((x + 1.0d0) / (x + (-1.0d0))) ** (-0.5d0)
else
tmp = sqrt(x) * (t_m / l)
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 6.5e+209) {
tmp = Math.pow(((x + 1.0) / (x + -1.0)), -0.5);
} else {
tmp = Math.sqrt(x) * (t_m / l);
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): tmp = 0 if l <= 6.5e+209: tmp = math.pow(((x + 1.0) / (x + -1.0)), -0.5) else: tmp = math.sqrt(x) * (t_m / l) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) tmp = 0.0 if (l <= 6.5e+209) tmp = Float64(Float64(x + 1.0) / Float64(x + -1.0)) ^ -0.5; else tmp = Float64(sqrt(x) * Float64(t_m / l)); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) tmp = 0.0; if (l <= 6.5e+209) tmp = ((x + 1.0) / (x + -1.0)) ^ -0.5; else tmp = sqrt(x) * (t_m / l); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := N[(t$95$s * If[LessEqual[l, 6.5e+209], N[Power[N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \leq 6.5 \cdot 10^{+209}:\\
\;\;\;\;{\left(\frac{x + 1}{x + -1}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{x} \cdot \frac{t\_m}{\ell}\\
\end{array}
\end{array}
if l < 6.49999999999999975e209Initial program 38.3%
Simplified32.7%
Taylor expanded in t around inf 40.6%
Taylor expanded in t around 0 40.6%
clear-num40.6%
+-commutative40.6%
sub-neg40.6%
metadata-eval40.6%
+-commutative40.6%
inv-pow40.6%
+-commutative40.6%
Applied egg-rr40.6%
unpow-140.6%
+-commutative40.6%
Simplified40.6%
*-un-lft-identity40.6%
inv-pow40.6%
sqrt-pow140.6%
+-commutative40.6%
+-commutative40.6%
metadata-eval40.6%
Applied egg-rr40.6%
*-lft-identity40.6%
+-commutative40.6%
+-commutative40.6%
Simplified40.6%
if 6.49999999999999975e209 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around 0 0.0%
fma-define0.0%
sub-neg0.0%
metadata-eval0.0%
associate-/l*0.0%
+-commutative0.0%
+-commutative0.0%
associate--l+18.7%
sub-neg18.7%
metadata-eval18.7%
+-commutative18.7%
sub-neg18.7%
metadata-eval18.7%
+-commutative18.7%
Simplified18.7%
Taylor expanded in x around inf 18.7%
Taylor expanded in t around 0 18.7%
distribute-lft-out18.7%
sub-neg18.7%
metadata-eval18.7%
associate-/l*18.7%
+-commutative18.7%
+-commutative18.7%
Simplified18.7%
Taylor expanded in t around 0 56.3%
Final simplification41.4%
t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l t_m) :precision binary64 (* t_s (if (<= l 1.1e+210) (sqrt (/ (+ x -1.0) (+ x 1.0))) (* (sqrt x) (/ t_m l)))))
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 1.1e+210) {
tmp = sqrt(((x + -1.0) / (x + 1.0)));
} else {
tmp = sqrt(x) * (t_m / l);
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: tmp
if (l <= 1.1d+210) then
tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
else
tmp = sqrt(x) * (t_m / l)
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 1.1e+210) {
tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
} else {
tmp = Math.sqrt(x) * (t_m / l);
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): tmp = 0 if l <= 1.1e+210: tmp = math.sqrt(((x + -1.0) / (x + 1.0))) else: tmp = math.sqrt(x) * (t_m / l) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) tmp = 0.0 if (l <= 1.1e+210) tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0))); else tmp = Float64(sqrt(x) * Float64(t_m / l)); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) tmp = 0.0; if (l <= 1.1e+210) tmp = sqrt(((x + -1.0) / (x + 1.0))); else tmp = sqrt(x) * (t_m / l); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := N[(t$95$s * If[LessEqual[l, 1.1e+210], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \leq 1.1 \cdot 10^{+210}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{x} \cdot \frac{t\_m}{\ell}\\
\end{array}
\end{array}
if l < 1.09999999999999993e210Initial program 38.3%
Simplified32.7%
Taylor expanded in t around inf 40.6%
Taylor expanded in t around 0 40.6%
if 1.09999999999999993e210 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around 0 0.0%
fma-define0.0%
sub-neg0.0%
metadata-eval0.0%
associate-/l*0.0%
+-commutative0.0%
+-commutative0.0%
associate--l+18.7%
sub-neg18.7%
metadata-eval18.7%
+-commutative18.7%
sub-neg18.7%
metadata-eval18.7%
+-commutative18.7%
Simplified18.7%
Taylor expanded in x around inf 18.7%
Taylor expanded in t around 0 18.7%
distribute-lft-out18.7%
sub-neg18.7%
metadata-eval18.7%
associate-/l*18.7%
+-commutative18.7%
+-commutative18.7%
Simplified18.7%
Taylor expanded in t around 0 56.3%
Final simplification41.4%
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
:precision binary64
(*
t_s
(if (<= l 5.6e+210)
(+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))
(* (sqrt x) (/ t_m l)))))t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 5.6e+210) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else {
tmp = sqrt(x) * (t_m / l);
}
return t_s * tmp;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
real(8) :: tmp
if (l <= 5.6d+210) then
tmp = 1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x)
else
tmp = sqrt(x) * (t_m / l)
end if
code = t_s * tmp
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
double tmp;
if (l <= 5.6e+210) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else {
tmp = Math.sqrt(x) * (t_m / l);
}
return t_s * tmp;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): tmp = 0 if l <= 5.6e+210: tmp = 1.0 + ((-1.0 + (0.5 / x)) / x) else: tmp = math.sqrt(x) * (t_m / l) return t_s * tmp
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) tmp = 0.0 if (l <= 5.6e+210) tmp = Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x)); else tmp = Float64(sqrt(x) * Float64(t_m / l)); end return Float64(t_s * tmp) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp_2 = code(t_s, x, l, t_m) tmp = 0.0; if (l <= 5.6e+210) tmp = 1.0 + ((-1.0 + (0.5 / x)) / x); else tmp = sqrt(x) * (t_m / l); end tmp_2 = t_s * tmp; end
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_, t$95$m_] := N[(t$95$s * If[LessEqual[l, 5.6e+210], N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;\ell \leq 5.6 \cdot 10^{+210}:\\
\;\;\;\;1 + \frac{-1 + \frac{0.5}{x}}{x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{x} \cdot \frac{t\_m}{\ell}\\
\end{array}
\end{array}
if l < 5.6000000000000004e210Initial program 38.3%
Simplified32.7%
Taylor expanded in t around inf 40.6%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified40.3%
if 5.6000000000000004e210 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around 0 0.0%
fma-define0.0%
sub-neg0.0%
metadata-eval0.0%
associate-/l*0.0%
+-commutative0.0%
+-commutative0.0%
associate--l+18.7%
sub-neg18.7%
metadata-eval18.7%
+-commutative18.7%
sub-neg18.7%
metadata-eval18.7%
+-commutative18.7%
Simplified18.7%
Taylor expanded in x around inf 18.7%
Taylor expanded in t around 0 18.7%
distribute-lft-out18.7%
sub-neg18.7%
metadata-eval18.7%
associate-/l*18.7%
+-commutative18.7%
+-commutative18.7%
Simplified18.7%
Taylor expanded in t around 0 56.3%
Final simplification41.1%
t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l t_m) :precision binary64 (* t_s (+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))))
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
return t_s * (1.0 + ((-1.0 + (0.5 / x)) / x));
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
code = t_s * (1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x))
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
return t_s * (1.0 + ((-1.0 + (0.5 / x)) / x));
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): return t_s * (1.0 + ((-1.0 + (0.5 / x)) / x))
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) return Float64(t_s * Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x))) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l, t_m) tmp = t_s * (1.0 + ((-1.0 + (0.5 / x)) / x)); end
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_, 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}
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 36.3%
Simplified31.1%
Taylor expanded in t around inf 39.4%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified39.2%
Final simplification39.2%
t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l t_m) :precision binary64 (* t_s (+ 1.0 (/ -1.0 x))))
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
return t_s * (1.0 + (-1.0 / x));
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
code = t_s * (1.0d0 + ((-1.0d0) / x))
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
return t_s * (1.0 + (-1.0 / x));
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): return t_s * (1.0 + (-1.0 / x))
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) return Float64(t_s * Float64(1.0 + Float64(-1.0 / x))) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l, t_m) tmp = t_s * (1.0 + (-1.0 / x)); end
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_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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 36.3%
Simplified31.1%
Taylor expanded in t around inf 39.4%
Taylor expanded in x around inf 39.2%
Final simplification39.2%
t\_m = (fabs.f64 t) t\_s = (copysign.f64 #s(literal 1 binary64) t) (FPCore (t_s x l t_m) :precision binary64 (* t_s 1.0))
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
return t_s * 1.0;
}
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
real(8), intent (in) :: t_s
real(8), intent (in) :: x
real(8), intent (in) :: l
real(8), intent (in) :: t_m
code = t_s * 1.0d0
end function
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
return t_s * 1.0;
}
t\_m = math.fabs(t) t\_s = math.copysign(1.0, t) def code(t_s, x, l, t_m): return t_s * 1.0
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) return Float64(t_s * 1.0) end
t\_m = abs(t); t\_s = sign(t) * abs(1.0); function tmp = code(t_s, x, l, t_m) tmp = t_s * 1.0; end
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_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot 1
\end{array}
Initial program 36.3%
Simplified31.1%
Taylor expanded in t around inf 39.4%
Taylor expanded in x around inf 39.1%
herbie shell --seed 2024110
(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)))))