
(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 9 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 (fma 2.0 (* t_m t_m) (* l l))) (t_3 (* t_m (sqrt 2.0))))
(*
t_s
(if (<= t_m 5.9e-159)
(/ t_3 (fma 0.5 (/ (* l (+ l l)) (* (sqrt 2.0) (* t_m x))) t_3))
(if (<= t_m 1.22e+19)
(/
t_3
(sqrt
(+
(* 2.0 (* t_m t_m))
(/
(-
(fma 2.0 (/ (* t_m t_m) x) (/ (* l l) x))
(fma t_2 -2.0 (/ t_2 (- x))))
x))))
(sqrt (/ (+ 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 t_2 = fma(2.0, (t_m * t_m), (l * l));
double t_3 = t_m * sqrt(2.0);
double tmp;
if (t_m <= 5.9e-159) {
tmp = t_3 / fma(0.5, ((l * (l + l)) / (sqrt(2.0) * (t_m * x))), t_3);
} else if (t_m <= 1.22e+19) {
tmp = t_3 / sqrt(((2.0 * (t_m * t_m)) + ((fma(2.0, ((t_m * t_m) / x), ((l * l) / x)) - fma(t_2, -2.0, (t_2 / -x))) / x)));
} else {
tmp = sqrt(((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) t_2 = fma(2.0, Float64(t_m * t_m), Float64(l * l)) t_3 = Float64(t_m * sqrt(2.0)) tmp = 0.0 if (t_m <= 5.9e-159) tmp = Float64(t_3 / fma(0.5, Float64(Float64(l * Float64(l + l)) / Float64(sqrt(2.0) * Float64(t_m * x))), t_3)); elseif (t_m <= 1.22e+19) tmp = Float64(t_3 / sqrt(Float64(Float64(2.0 * Float64(t_m * t_m)) + Float64(Float64(fma(2.0, Float64(Float64(t_m * t_m) / x), Float64(Float64(l * l) / x)) - fma(t_2, -2.0, Float64(t_2 / Float64(-x)))) / x)))); else tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0))); end return Float64(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[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + N[(l * l), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 5.9e-159], N[(t$95$3 / N[(0.5 * N[(N[(l * N[(l + l), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.22e+19], N[(t$95$3 / N[Sqrt[N[(N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(2.0 * N[(N[(t$95$m * t$95$m), $MachinePrecision] / x), $MachinePrecision] + N[(N[(l * l), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] - N[(t$95$2 * -2.0 + N[(t$95$2 / (-x)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $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 := \mathsf{fma}\left(2, t\_m \cdot t\_m, \ell \cdot \ell\right)\\
t_3 := t\_m \cdot \sqrt{2}\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 5.9 \cdot 10^{-159}:\\
\;\;\;\;\frac{t\_3}{\mathsf{fma}\left(0.5, \frac{\ell \cdot \left(\ell + \ell\right)}{\sqrt{2} \cdot \left(t\_m \cdot x\right)}, t\_3\right)}\\
\mathbf{elif}\;t\_m \leq 1.22 \cdot 10^{+19}:\\
\;\;\;\;\frac{t\_3}{\sqrt{2 \cdot \left(t\_m \cdot t\_m\right) + \frac{\mathsf{fma}\left(2, \frac{t\_m \cdot t\_m}{x}, \frac{\ell \cdot \ell}{x}\right) - \mathsf{fma}\left(t\_2, -2, \frac{t\_2}{-x}\right)}{x}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\end{array}
\end{array}
\end{array}
if t < 5.9e-159Initial program 32.5%
Taylor expanded in x around inf
lower-fma.f64N/A
Simplified14.8%
Taylor expanded in t around 0
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6414.9
Simplified14.9%
Taylor expanded in l around 0
associate-*r/N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt1-inN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6414.9
Simplified14.9%
if 5.9e-159 < t < 1.22e19Initial program 48.4%
Taylor expanded in x around -inf
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
Simplified78.2%
if 1.22e19 < t Initial program 35.1%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6493.8
Simplified93.8%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval95.3
Applied egg-rr95.3%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity95.3
Applied egg-rr95.3%
Final simplification46.5%
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 (* t_m (sqrt 2.0))))
(*
t_s
(if (<= t_m 1.8e-158)
(/ t_2 (fma 0.5 (/ (* l (+ l l)) (* (sqrt 2.0) (* t_m x))) t_2))
(if (<= t_m 1.22e+19)
(*
t_m
(sqrt
(/
2.0
(+
(fma 2.0 (/ (* t_m t_m) x) (fma 2.0 (* t_m t_m) (/ (* l l) x)))
(/ (fma 2.0 (* t_m t_m) (* l l)) x)))))
(sqrt (/ (+ 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 t_2 = t_m * sqrt(2.0);
double tmp;
if (t_m <= 1.8e-158) {
tmp = t_2 / fma(0.5, ((l * (l + l)) / (sqrt(2.0) * (t_m * x))), t_2);
} else if (t_m <= 1.22e+19) {
tmp = t_m * sqrt((2.0 / (fma(2.0, ((t_m * t_m) / x), fma(2.0, (t_m * t_m), ((l * l) / x))) + (fma(2.0, (t_m * t_m), (l * l)) / x))));
} else {
tmp = sqrt(((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) t_2 = Float64(t_m * sqrt(2.0)) tmp = 0.0 if (t_m <= 1.8e-158) tmp = Float64(t_2 / fma(0.5, Float64(Float64(l * Float64(l + l)) / Float64(sqrt(2.0) * Float64(t_m * x))), t_2)); elseif (t_m <= 1.22e+19) tmp = Float64(t_m * sqrt(Float64(2.0 / Float64(fma(2.0, Float64(Float64(t_m * t_m) / x), fma(2.0, Float64(t_m * t_m), Float64(Float64(l * l) / x))) + Float64(fma(2.0, Float64(t_m * t_m), Float64(l * l)) / x))))); else tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0))); end return Float64(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[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.8e-158], N[(t$95$2 / N[(0.5 * N[(N[(l * N[(l + l), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.22e+19], N[(t$95$m * N[Sqrt[N[(2.0 / N[(N[(2.0 * N[(N[(t$95$m * t$95$m), $MachinePrecision] / x), $MachinePrecision] + N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + N[(N[(l * l), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + N[(l * l), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $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 := t\_m \cdot \sqrt{2}\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 1.8 \cdot 10^{-158}:\\
\;\;\;\;\frac{t\_2}{\mathsf{fma}\left(0.5, \frac{\ell \cdot \left(\ell + \ell\right)}{\sqrt{2} \cdot \left(t\_m \cdot x\right)}, t\_2\right)}\\
\mathbf{elif}\;t\_m \leq 1.22 \cdot 10^{+19}:\\
\;\;\;\;t\_m \cdot \sqrt{\frac{2}{\mathsf{fma}\left(2, \frac{t\_m \cdot t\_m}{x}, \mathsf{fma}\left(2, t\_m \cdot t\_m, \frac{\ell \cdot \ell}{x}\right)\right) + \frac{\mathsf{fma}\left(2, t\_m \cdot t\_m, \ell \cdot \ell\right)}{x}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\end{array}
\end{array}
\end{array}
if t < 1.79999999999999995e-158Initial program 32.5%
Taylor expanded in x around inf
lower-fma.f64N/A
Simplified14.8%
Taylor expanded in t around 0
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6414.9
Simplified14.9%
Taylor expanded in l around 0
associate-*r/N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt1-inN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6414.9
Simplified14.9%
if 1.79999999999999995e-158 < t < 1.22e19Initial program 48.4%
lift-sqrt.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-sqrt.f64N/A
Applied egg-rr48.7%
Taylor expanded in x around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
Simplified77.8%
if 1.22e19 < t Initial program 35.1%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6493.8
Simplified93.8%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval95.3
Applied egg-rr95.3%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity95.3
Applied egg-rr95.3%
Final simplification46.5%
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 3.8e+126)
(sqrt (/ (+ x -1.0) (+ x 1.0)))
(/ (* t_m (sqrt 2.0)) (* (* (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 <= 3.8e+126) {
tmp = sqrt(((x + -1.0) / (x + 1.0)));
} else {
tmp = (t_m * sqrt(2.0)) / ((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 <= 3.8d+126) then
tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
else
tmp = (t_m * sqrt(2.0d0)) / ((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 <= 3.8e+126) {
tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
} else {
tmp = (t_m * Math.sqrt(2.0)) / ((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 <= 3.8e+126: tmp = math.sqrt(((x + -1.0) / (x + 1.0))) else: tmp = (t_m * math.sqrt(2.0)) / ((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 <= 3.8e+126) tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0))); else tmp = Float64(Float64(t_m * sqrt(2.0)) / 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 <= 3.8e+126) tmp = sqrt(((x + -1.0) / (x + 1.0))); else tmp = (t_m * sqrt(2.0)) / ((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, 3.8e+126], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $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 3.8 \cdot 10^{+126}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_m \cdot \sqrt{2}}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}}}\\
\end{array}
\end{array}
if l < 3.80000000000000017e126Initial program 39.5%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6441.8
Simplified41.8%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval42.4
Applied egg-rr42.4%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity42.4
Applied egg-rr42.4%
if 3.80000000000000017e126 < l Initial program 0.6%
lift-+.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6422.0
Applied egg-rr22.0%
Taylor expanded in t around 0
lower-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-outN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f640.7
Simplified0.7%
Taylor expanded in x around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6467.9
Simplified67.9%
Final simplification45.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
(if (<= l 1.2e+131)
(sqrt (/ (+ x -1.0) (+ x 1.0)))
(* t_m (* (sqrt 0.5) (* (/ (sqrt 2.0) l) (sqrt 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 <= 1.2e+131) {
tmp = sqrt(((x + -1.0) / (x + 1.0)));
} else {
tmp = t_m * (sqrt(0.5) * ((sqrt(2.0) / l) * sqrt(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 <= 1.2d+131) then
tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
else
tmp = t_m * (sqrt(0.5d0) * ((sqrt(2.0d0) / l) * sqrt(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 <= 1.2e+131) {
tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
} else {
tmp = t_m * (Math.sqrt(0.5) * ((Math.sqrt(2.0) / l) * Math.sqrt(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 <= 1.2e+131: tmp = math.sqrt(((x + -1.0) / (x + 1.0))) else: tmp = t_m * (math.sqrt(0.5) * ((math.sqrt(2.0) / l) * math.sqrt(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 <= 1.2e+131) tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0))); else tmp = Float64(t_m * Float64(sqrt(0.5) * Float64(Float64(sqrt(2.0) / l) * sqrt(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 <= 1.2e+131) tmp = sqrt(((x + -1.0) / (x + 1.0))); else tmp = t_m * (sqrt(0.5) * ((sqrt(2.0) / l) * sqrt(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, 1.2e+131], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(t$95$m * N[(N[Sqrt[0.5], $MachinePrecision] * N[(N[(N[Sqrt[2.0], $MachinePrecision] / l), $MachinePrecision] * N[Sqrt[x], $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 1.2 \cdot 10^{+131}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\mathbf{else}:\\
\;\;\;\;t\_m \cdot \left(\sqrt{0.5} \cdot \left(\frac{\sqrt{2}}{\ell} \cdot \sqrt{x}\right)\right)\\
\end{array}
\end{array}
if l < 1.2e131Initial program 39.5%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6441.8
Simplified41.8%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval42.4
Applied egg-rr42.4%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity42.4
Applied egg-rr42.4%
if 1.2e131 < l Initial program 0.6%
lift-sqrt.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-sqrt.f64N/A
Applied egg-rr0.6%
Taylor expanded in l around inf
*-commutativeN/A
lower-*.f64N/A
associate--l+N/A
lower-+.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6425.7
Simplified25.7%
Taylor expanded in x around inf
associate-/l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6467.4
Simplified67.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 (<= t_m 1.2e-213)
(* t_m (sqrt (/ 2.0 (* l (/ (+ l l) x)))))
(sqrt (/ (+ 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 (t_m <= 1.2e-213) {
tmp = t_m * sqrt((2.0 / (l * ((l + l) / x))));
} else {
tmp = sqrt(((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 (t_m <= 1.2d-213) then
tmp = t_m * sqrt((2.0d0 / (l * ((l + l) / x))))
else
tmp = sqrt(((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 (t_m <= 1.2e-213) {
tmp = t_m * Math.sqrt((2.0 / (l * ((l + l) / x))));
} else {
tmp = Math.sqrt(((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 t_m <= 1.2e-213: tmp = t_m * math.sqrt((2.0 / (l * ((l + l) / x)))) else: tmp = math.sqrt(((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 (t_m <= 1.2e-213) tmp = Float64(t_m * sqrt(Float64(2.0 / Float64(l * Float64(Float64(l + l) / x))))); else tmp = sqrt(Float64(Float64(x + -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 (t_m <= 1.2e-213) tmp = t_m * sqrt((2.0 / (l * ((l + l) / x)))); else tmp = sqrt(((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[t$95$m, 1.2e-213], N[(t$95$m * N[Sqrt[N[(2.0 / N[(l * N[(N[(l + l), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $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}\;t\_m \leq 1.2 \cdot 10^{-213}:\\
\;\;\;\;t\_m \cdot \sqrt{\frac{2}{\ell \cdot \frac{\ell + \ell}{x}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\end{array}
\end{array}
if t < 1.19999999999999998e-213Initial program 34.2%
lift-+.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6439.7
Applied egg-rr39.7%
Taylor expanded in t around 0
lower-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-outN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f642.7
Simplified2.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
Applied egg-rr1.8%
Taylor expanded in x around inf
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.2
Simplified21.2%
if 1.19999999999999998e-213 < t Initial program 36.8%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6480.3
Simplified80.3%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval81.5
Applied egg-rr81.5%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity81.5
Applied egg-rr81.5%
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 (<= t_m 3e-214)
(* t_m (sqrt (/ (* 2.0 x) (* l (+ l l)))))
(sqrt (/ (+ 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 (t_m <= 3e-214) {
tmp = t_m * sqrt(((2.0 * x) / (l * (l + l))));
} else {
tmp = sqrt(((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 (t_m <= 3d-214) then
tmp = t_m * sqrt(((2.0d0 * x) / (l * (l + l))))
else
tmp = sqrt(((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 (t_m <= 3e-214) {
tmp = t_m * Math.sqrt(((2.0 * x) / (l * (l + l))));
} else {
tmp = Math.sqrt(((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 t_m <= 3e-214: tmp = t_m * math.sqrt(((2.0 * x) / (l * (l + l)))) else: tmp = math.sqrt(((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 (t_m <= 3e-214) tmp = Float64(t_m * sqrt(Float64(Float64(2.0 * x) / Float64(l * Float64(l + l))))); else tmp = sqrt(Float64(Float64(x + -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 (t_m <= 3e-214) tmp = t_m * sqrt(((2.0 * x) / (l * (l + l)))); else tmp = sqrt(((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[t$95$m, 3e-214], N[(t$95$m * N[Sqrt[N[(N[(2.0 * x), $MachinePrecision] / N[(l * N[(l + l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $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}\;t\_m \leq 3 \cdot 10^{-214}:\\
\;\;\;\;t\_m \cdot \sqrt{\frac{2 \cdot x}{\ell \cdot \left(\ell + \ell\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\
\end{array}
\end{array}
if t < 2.99999999999999994e-214Initial program 34.2%
lift-+.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6439.7
Applied egg-rr39.7%
Taylor expanded in t around 0
lower-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-outN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f642.7
Simplified2.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
Applied egg-rr1.8%
Taylor expanded in x around inf
*-commutativeN/A
*-commutativeN/A
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-rgt1-inN/A
metadata-evalN/A
associate-*r*N/A
unpow2N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt1-inN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6418.5
Simplified18.5%
if 2.99999999999999994e-214 < t Initial program 36.8%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6480.3
Simplified80.3%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval81.5
Applied egg-rr81.5%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity81.5
Applied egg-rr81.5%
Final simplification47.3%
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 (sqrt (/ (+ 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) {
return t_s * sqrt(((x + -1.0) / (x + 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 * sqrt(((x + (-1.0d0)) / (x + 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 * Math.sqrt(((x + -1.0) / (x + 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 * math.sqrt(((x + -1.0) / (x + 1.0)))
t\_m = abs(t) t\_s = copysign(1.0, t) function code(t_s, x, l, t_m) return Float64(t_s * sqrt(Float64(Float64(x + -1.0) / Float64(x + 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 * sqrt(((x + -1.0) / (x + 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 * N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
t\_m = \left|t\right|
\\
t\_s = \mathsf{copysign}\left(1, t\right)
\\
t\_s \cdot \sqrt{\frac{x + -1}{x + 1}}
\end{array}
Initial program 35.4%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6439.6
Simplified39.6%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval40.2
Applied egg-rr40.2%
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
*-rgt-identity40.2
Applied egg-rr40.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 35.4%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6439.6
Simplified39.6%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval40.2
Applied egg-rr40.2%
Taylor expanded in x around inf
sub-negN/A
lower-+.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f6439.5
Simplified39.5%
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 35.4%
Taylor expanded in x around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6438.6
Simplified38.6%
sqrt-unprodN/A
metadata-evalN/A
metadata-eval39.2
Applied egg-rr39.2%
herbie shell --seed 2024215
(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)))))