
(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}
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
(let* ((t_2 (/ (+ x 1.0) (+ -1.0 x))))
(*
t_s
(if (<= t_m 2.5e-200)
(* t_m (/ (sqrt x) l_m))
(if (<= t_m 2.4e-182)
(* (sqrt 2.0) (/ 1.0 (* t_m (/ (sqrt (* 2.0 t_2)) t_m))))
(if (<= t_m 2e+121)
(/
(* t_m (sqrt 2.0))
(sqrt (fma 2.0 (* (pow t_m 2.0) t_2) (* 2.0 (/ l_m (/ x l_m))))))
(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 t_2 = (x + 1.0) / (-1.0 + x);
double tmp;
if (t_m <= 2.5e-200) {
tmp = t_m * (sqrt(x) / l_m);
} else if (t_m <= 2.4e-182) {
tmp = sqrt(2.0) * (1.0 / (t_m * (sqrt((2.0 * t_2)) / t_m)));
} else if (t_m <= 2e+121) {
tmp = (t_m * sqrt(2.0)) / sqrt(fma(2.0, (pow(t_m, 2.0) * t_2), (2.0 * (l_m / (x / l_m)))));
} 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) t_2 = Float64(Float64(x + 1.0) / Float64(-1.0 + x)) tmp = 0.0 if (t_m <= 2.5e-200) tmp = Float64(t_m * Float64(sqrt(x) / l_m)); elseif (t_m <= 2.4e-182) tmp = Float64(sqrt(2.0) * Float64(1.0 / Float64(t_m * Float64(sqrt(Float64(2.0 * t_2)) / t_m)))); elseif (t_m <= 2e+121) tmp = Float64(Float64(t_m * sqrt(2.0)) / sqrt(fma(2.0, Float64((t_m ^ 2.0) * t_2), Float64(2.0 * Float64(l_m / Float64(x / l_m)))))); 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_] := Block[{t$95$2 = N[(N[(x + 1.0), $MachinePrecision] / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.5e-200], N[(t$95$m * N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2.4e-182], N[(N[Sqrt[2.0], $MachinePrecision] * N[(1.0 / N[(t$95$m * N[(N[Sqrt[N[(2.0 * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2e+121], N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] * t$95$2), $MachinePrecision] + N[(2.0 * N[(l$95$m / N[(x / l$95$m), $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)
\\
\begin{array}{l}
t_2 := \frac{x + 1}{-1 + x}\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 2.5 \cdot 10^{-200}:\\
\;\;\;\;t\_m \cdot \frac{\sqrt{x}}{l\_m}\\
\mathbf{elif}\;t\_m \leq 2.4 \cdot 10^{-182}:\\
\;\;\;\;\sqrt{2} \cdot \frac{1}{t\_m \cdot \frac{\sqrt{2 \cdot t\_2}}{t\_m}}\\
\mathbf{elif}\;t\_m \leq 2 \cdot 10^{+121}:\\
\;\;\;\;\frac{t\_m \cdot \sqrt{2}}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot t\_2, 2 \cdot \frac{l\_m}{\frac{x}{l\_m}}\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\end{array}
\end{array}
\end{array}
if t < 2.49999999999999996e-200Initial program 28.9%
Simplified28.9%
Taylor expanded in l around inf 1.7%
*-commutative1.7%
associate--l+8.5%
sub-neg8.5%
metadata-eval8.5%
+-commutative8.5%
sub-neg8.5%
metadata-eval8.5%
+-commutative8.5%
Simplified8.5%
Taylor expanded in x around inf 14.0%
*-commutative14.0%
Simplified14.0%
add-exp-log6.7%
associate-*r*6.7%
sqrt-unprod6.7%
Applied egg-rr6.7%
Taylor expanded in x around 0 14.0%
associate-*l/16.2%
associate-/l*16.2%
Simplified16.2%
if 2.49999999999999996e-200 < t < 2.3999999999999998e-182Initial program 2.3%
Simplified2.3%
Taylor expanded in l around 0 70.9%
clear-num70.9%
inv-pow70.9%
associate-*l*70.9%
pow1/270.9%
pow1/270.9%
+-commutative70.9%
sub-neg70.9%
metadata-eval70.9%
+-commutative70.9%
pow-prod-down70.9%
+-commutative70.9%
+-commutative70.9%
Applied egg-rr70.9%
unpow-170.9%
associate-/l*70.9%
unpow1/270.9%
+-commutative70.9%
Simplified70.9%
if 2.3999999999999998e-182 < t < 2.00000000000000007e121Initial program 59.3%
Simplified59.1%
Taylor expanded in l around 0 55.3%
fma-define55.3%
+-commutative55.3%
associate-*r/70.2%
sub-neg70.2%
metadata-eval70.2%
+-commutative70.2%
associate--l+73.4%
sub-neg73.4%
metadata-eval73.4%
+-commutative73.4%
sub-neg73.4%
metadata-eval73.4%
+-commutative73.4%
Simplified73.4%
Taylor expanded in x around inf 81.7%
associate-*r/81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
Applied egg-rr81.9%
unpow281.9%
*-un-lft-identity81.9%
times-frac90.7%
Applied egg-rr90.7%
/-rgt-identity90.7%
clear-num90.7%
un-div-inv90.7%
Applied egg-rr90.7%
if 2.00000000000000007e121 < t Initial program 16.8%
Simplified16.8%
Taylor expanded in l around 0 98.1%
Taylor expanded in t around 0 98.3%
Final simplification52.6%
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
(let* ((t_2 (* t_m (sqrt 2.0))))
(*
t_s
(if (<= t_m 5.5e-179)
(*
(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_2)))
(if (<= t_m 2e+117)
(/
t_2
(sqrt
(fma
2.0
(* (pow t_m 2.0) (/ (+ x 1.0) (+ -1.0 x)))
(* 2.0 (/ l_m (/ x l_m))))))
(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 t_2 = t_m * sqrt(2.0);
double tmp;
if (t_m <= 5.5e-179) {
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_2));
} else if (t_m <= 2e+117) {
tmp = t_2 / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (-1.0 + x))), (2.0 * (l_m / (x / l_m)))));
} 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) t_2 = Float64(t_m * sqrt(2.0)) tmp = 0.0 if (t_m <= 5.5e-179) 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)))) + t_2))); elseif (t_m <= 2e+117) tmp = Float64(t_2 / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(-1.0 + x))), Float64(2.0 * Float64(l_m / Float64(x / l_m)))))); 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_] := Block[{t$95$2 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 5.5e-179], 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] + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2e+117], N[(t$95$2 / 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[(2.0 * N[(l$95$m / N[(x / l$95$m), $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)
\\
\begin{array}{l}
t_2 := t\_m \cdot \sqrt{2}\\
t\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_m \leq 5.5 \cdot 10^{-179}:\\
\;\;\;\;\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\_2}\\
\mathbf{elif}\;t\_m \leq 2 \cdot 10^{+117}:\\
\;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{-1 + x}, 2 \cdot \frac{l\_m}{\frac{x}{l\_m}}\right)}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\
\end{array}
\end{array}
\end{array}
if t < 5.5000000000000003e-179Initial program 28.2%
Simplified28.1%
Taylor expanded in l around 0 23.3%
fma-define23.3%
+-commutative23.3%
associate-*r/33.7%
sub-neg33.7%
metadata-eval33.7%
+-commutative33.7%
associate--l+40.9%
sub-neg40.9%
metadata-eval40.9%
+-commutative40.9%
sub-neg40.9%
metadata-eval40.9%
+-commutative40.9%
Simplified40.9%
Taylor expanded in x around inf 12.2%
if 5.5000000000000003e-179 < t < 2.0000000000000001e117Initial program 59.6%
Simplified59.4%
Taylor expanded in l around 0 57.0%
fma-define57.0%
+-commutative57.0%
associate-*r/70.8%
sub-neg70.8%
metadata-eval70.8%
+-commutative70.8%
associate--l+74.1%
sub-neg74.1%
metadata-eval74.1%
+-commutative74.1%
sub-neg74.1%
metadata-eval74.1%
+-commutative74.1%
Simplified74.1%
Taylor expanded in x around inf 82.6%
associate-*r/82.9%
*-commutative82.9%
+-commutative82.9%
+-commutative82.9%
Applied egg-rr82.9%
unpow282.9%
*-un-lft-identity82.9%
times-frac90.4%
Applied egg-rr90.4%
/-rgt-identity90.4%
clear-num90.4%
un-div-inv90.4%
Applied egg-rr90.4%
if 2.0000000000000001e117 < t Initial program 18.0%
Simplified18.0%
Taylor expanded in l around 0 96.5%
Taylor expanded in t around 0 96.7%
Final simplification49.3%
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 3.2e+247)
(+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))
(if (or (<= l_m 1.85e+288) (not (<= l_m 2.05e+296)))
(* t_m (/ (sqrt x) l_m))
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 (l_m <= 3.2e+247) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else if ((l_m <= 1.85e+288) || !(l_m <= 2.05e+296)) {
tmp = t_m * (sqrt(x) / l_m);
} else {
tmp = 1.0;
}
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 <= 3.2d+247) then
tmp = 1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x)
else if ((l_m <= 1.85d+288) .or. (.not. (l_m <= 2.05d+296))) then
tmp = t_m * (sqrt(x) / l_m)
else
tmp = 1.0d0
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 <= 3.2e+247) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else if ((l_m <= 1.85e+288) || !(l_m <= 2.05e+296)) {
tmp = t_m * (Math.sqrt(x) / l_m);
} else {
tmp = 1.0;
}
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 <= 3.2e+247: tmp = 1.0 + ((-1.0 + (0.5 / x)) / x) elif (l_m <= 1.85e+288) or not (l_m <= 2.05e+296): tmp = t_m * (math.sqrt(x) / l_m) else: tmp = 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 (l_m <= 3.2e+247) tmp = Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x)); elseif ((l_m <= 1.85e+288) || !(l_m <= 2.05e+296)) tmp = Float64(t_m * Float64(sqrt(x) / l_m)); else tmp = 1.0; 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 <= 3.2e+247) tmp = 1.0 + ((-1.0 + (0.5 / x)) / x); elseif ((l_m <= 1.85e+288) || ~((l_m <= 2.05e+296))) tmp = t_m * (sqrt(x) / l_m); else tmp = 1.0; 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, 3.2e+247], N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[l$95$m, 1.85e+288], N[Not[LessEqual[l$95$m, 2.05e+296]], $MachinePrecision]], N[(t$95$m * N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], 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 \begin{array}{l}
\mathbf{if}\;l\_m \leq 3.2 \cdot 10^{+247}:\\
\;\;\;\;1 + \frac{-1 + \frac{0.5}{x}}{x}\\
\mathbf{elif}\;l\_m \leq 1.85 \cdot 10^{+288} \lor \neg \left(l\_m \leq 2.05 \cdot 10^{+296}\right):\\
\;\;\;\;t\_m \cdot \frac{\sqrt{x}}{l\_m}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if l < 3.20000000000000022e247Initial program 34.7%
Simplified34.6%
Taylor expanded in l around 0 43.3%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified43.2%
Taylor expanded in x around inf 43.2%
associate-*r/43.2%
metadata-eval43.2%
Simplified43.2%
if 3.20000000000000022e247 < l < 1.8499999999999999e288 or 2.05000000000000001e296 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 0.7%
*-commutative0.7%
associate--l+58.1%
sub-neg58.1%
metadata-eval58.1%
+-commutative58.1%
sub-neg58.1%
metadata-eval58.1%
+-commutative58.1%
Simplified58.1%
Taylor expanded in x around inf 78.0%
*-commutative78.0%
Simplified78.0%
add-exp-log53.0%
associate-*r*53.0%
sqrt-unprod53.0%
Applied egg-rr53.0%
Taylor expanded in x around 0 77.6%
associate-*l/100.0%
associate-/l*99.6%
Simplified99.6%
if 1.8499999999999999e288 < l < 2.05000000000000001e296Initial program 0.0%
Simplified0.0%
Taylor expanded in l around 0 67.5%
Taylor expanded in x around inf 67.5%
Final simplification44.4%
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 6e+250)
(+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))
(if (<= l_m 1.8e+288)
(/ (* t_m (sqrt x)) l_m)
(if (<= l_m 2.05e+296) 1.0 (/ t_m (/ l_m (sqrt 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 <= 6e+250) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else if (l_m <= 1.8e+288) {
tmp = (t_m * sqrt(x)) / l_m;
} else if (l_m <= 2.05e+296) {
tmp = 1.0;
} else {
tmp = t_m / (l_m / sqrt(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 <= 6d+250) then
tmp = 1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x)
else if (l_m <= 1.8d+288) then
tmp = (t_m * sqrt(x)) / l_m
else if (l_m <= 2.05d+296) then
tmp = 1.0d0
else
tmp = t_m / (l_m / sqrt(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 <= 6e+250) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else if (l_m <= 1.8e+288) {
tmp = (t_m * Math.sqrt(x)) / l_m;
} else if (l_m <= 2.05e+296) {
tmp = 1.0;
} else {
tmp = t_m / (l_m / Math.sqrt(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 <= 6e+250: tmp = 1.0 + ((-1.0 + (0.5 / x)) / x) elif l_m <= 1.8e+288: tmp = (t_m * math.sqrt(x)) / l_m elif l_m <= 2.05e+296: tmp = 1.0 else: tmp = t_m / (l_m / math.sqrt(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 <= 6e+250) tmp = Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x)); elseif (l_m <= 1.8e+288) tmp = Float64(Float64(t_m * sqrt(x)) / l_m); elseif (l_m <= 2.05e+296) tmp = 1.0; else tmp = Float64(t_m / Float64(l_m / sqrt(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 <= 6e+250) tmp = 1.0 + ((-1.0 + (0.5 / x)) / x); elseif (l_m <= 1.8e+288) tmp = (t_m * sqrt(x)) / l_m; elseif (l_m <= 2.05e+296) tmp = 1.0; else tmp = t_m / (l_m / sqrt(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, 6e+250], N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.8e+288], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], If[LessEqual[l$95$m, 2.05e+296], 1.0, N[(t$95$m / N[(l$95$m / N[Sqrt[x], $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 6 \cdot 10^{+250}:\\
\;\;\;\;1 + \frac{-1 + \frac{0.5}{x}}{x}\\
\mathbf{elif}\;l\_m \leq 1.8 \cdot 10^{+288}:\\
\;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\
\mathbf{elif}\;l\_m \leq 2.05 \cdot 10^{+296}:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_m}{\frac{l\_m}{\sqrt{x}}}\\
\end{array}
\end{array}
if l < 5.99999999999999953e250Initial program 34.7%
Simplified34.6%
Taylor expanded in l around 0 43.3%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified43.2%
Taylor expanded in x around inf 43.2%
associate-*r/43.2%
metadata-eval43.2%
Simplified43.2%
if 5.99999999999999953e250 < l < 1.8000000000000001e288Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 1.5%
*-commutative1.5%
associate--l+60.2%
sub-neg60.2%
metadata-eval60.2%
+-commutative60.2%
sub-neg60.2%
metadata-eval60.2%
+-commutative60.2%
Simplified60.2%
Taylor expanded in x around inf 100.0%
*-commutative100.0%
Simplified100.0%
add-exp-log50.0%
associate-*r*50.0%
sqrt-unprod50.0%
Applied egg-rr50.0%
Taylor expanded in x around 0 99.2%
associate-*l/100.0%
associate-/l*99.2%
Simplified99.2%
associate-*r/100.0%
Applied egg-rr100.0%
if 1.8000000000000001e288 < l < 2.05000000000000001e296Initial program 0.0%
Simplified0.0%
Taylor expanded in l around 0 67.5%
Taylor expanded in x around inf 67.5%
if 2.05000000000000001e296 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 0.0%
*-commutative0.0%
associate--l+56.1%
sub-neg56.1%
metadata-eval56.1%
+-commutative56.1%
sub-neg56.1%
metadata-eval56.1%
+-commutative56.1%
Simplified56.1%
Taylor expanded in x around inf 56.1%
*-commutative56.1%
Simplified56.1%
add-exp-log56.1%
associate-*r*56.1%
sqrt-unprod56.1%
Applied egg-rr56.1%
Taylor expanded in x around 0 56.1%
associate-*l/100.0%
associate-/l*100.0%
Simplified100.0%
clear-num100.0%
add-sqr-sqrt99.2%
sqrt-unprod56.1%
sqrt-div56.1%
associate-*r/56.1%
/-rgt-identity56.1%
un-div-inv56.1%
/-rgt-identity56.1%
associate-*r/56.1%
sqrt-div56.1%
sqrt-unprod100.0%
add-sqr-sqrt100.0%
Applied egg-rr100.0%
Final simplification44.4%
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 3.4e+249)
(+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))
(if (<= l_m 1.6e+288)
(* t_m (/ (sqrt x) l_m))
(if (<= l_m 2.05e+296) 1.0 (/ t_m (/ l_m (sqrt 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 <= 3.4e+249) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else if (l_m <= 1.6e+288) {
tmp = t_m * (sqrt(x) / l_m);
} else if (l_m <= 2.05e+296) {
tmp = 1.0;
} else {
tmp = t_m / (l_m / sqrt(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 <= 3.4d+249) then
tmp = 1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x)
else if (l_m <= 1.6d+288) then
tmp = t_m * (sqrt(x) / l_m)
else if (l_m <= 2.05d+296) then
tmp = 1.0d0
else
tmp = t_m / (l_m / sqrt(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 <= 3.4e+249) {
tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
} else if (l_m <= 1.6e+288) {
tmp = t_m * (Math.sqrt(x) / l_m);
} else if (l_m <= 2.05e+296) {
tmp = 1.0;
} else {
tmp = t_m / (l_m / Math.sqrt(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 <= 3.4e+249: tmp = 1.0 + ((-1.0 + (0.5 / x)) / x) elif l_m <= 1.6e+288: tmp = t_m * (math.sqrt(x) / l_m) elif l_m <= 2.05e+296: tmp = 1.0 else: tmp = t_m / (l_m / math.sqrt(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 <= 3.4e+249) tmp = Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x)); elseif (l_m <= 1.6e+288) tmp = Float64(t_m * Float64(sqrt(x) / l_m)); elseif (l_m <= 2.05e+296) tmp = 1.0; else tmp = Float64(t_m / Float64(l_m / sqrt(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 <= 3.4e+249) tmp = 1.0 + ((-1.0 + (0.5 / x)) / x); elseif (l_m <= 1.6e+288) tmp = t_m * (sqrt(x) / l_m); elseif (l_m <= 2.05e+296) tmp = 1.0; else tmp = t_m / (l_m / sqrt(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, 3.4e+249], N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.6e+288], N[(t$95$m * N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 2.05e+296], 1.0, N[(t$95$m / N[(l$95$m / N[Sqrt[x], $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 3.4 \cdot 10^{+249}:\\
\;\;\;\;1 + \frac{-1 + \frac{0.5}{x}}{x}\\
\mathbf{elif}\;l\_m \leq 1.6 \cdot 10^{+288}:\\
\;\;\;\;t\_m \cdot \frac{\sqrt{x}}{l\_m}\\
\mathbf{elif}\;l\_m \leq 2.05 \cdot 10^{+296}:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_m}{\frac{l\_m}{\sqrt{x}}}\\
\end{array}
\end{array}
if l < 3.40000000000000013e249Initial program 34.7%
Simplified34.6%
Taylor expanded in l around 0 43.3%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified43.2%
Taylor expanded in x around inf 43.2%
associate-*r/43.2%
metadata-eval43.2%
Simplified43.2%
if 3.40000000000000013e249 < l < 1.6000000000000001e288Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 1.5%
*-commutative1.5%
associate--l+60.2%
sub-neg60.2%
metadata-eval60.2%
+-commutative60.2%
sub-neg60.2%
metadata-eval60.2%
+-commutative60.2%
Simplified60.2%
Taylor expanded in x around inf 100.0%
*-commutative100.0%
Simplified100.0%
add-exp-log50.0%
associate-*r*50.0%
sqrt-unprod50.0%
Applied egg-rr50.0%
Taylor expanded in x around 0 99.2%
associate-*l/100.0%
associate-/l*99.2%
Simplified99.2%
if 1.6000000000000001e288 < l < 2.05000000000000001e296Initial program 0.0%
Simplified0.0%
Taylor expanded in l around 0 67.5%
Taylor expanded in x around inf 67.5%
if 2.05000000000000001e296 < l Initial program 0.0%
Simplified0.0%
Taylor expanded in l around inf 0.0%
*-commutative0.0%
associate--l+56.1%
sub-neg56.1%
metadata-eval56.1%
+-commutative56.1%
sub-neg56.1%
metadata-eval56.1%
+-commutative56.1%
Simplified56.1%
Taylor expanded in x around inf 56.1%
*-commutative56.1%
Simplified56.1%
add-exp-log56.1%
associate-*r*56.1%
sqrt-unprod56.1%
Applied egg-rr56.1%
Taylor expanded in x around 0 56.1%
associate-*l/100.0%
associate-/l*100.0%
Simplified100.0%
clear-num100.0%
add-sqr-sqrt99.2%
sqrt-unprod56.1%
sqrt-div56.1%
associate-*r/56.1%
/-rgt-identity56.1%
un-div-inv56.1%
/-rgt-identity56.1%
associate-*r/56.1%
sqrt-div56.1%
sqrt-unprod100.0%
add-sqr-sqrt100.0%
Applied egg-rr100.0%
Final simplification44.4%
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 33.8%
Simplified33.7%
Taylor expanded in l around 0 42.9%
Taylor expanded in t around 0 43.0%
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 (+ 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 33.8%
Simplified33.7%
Taylor expanded in l around 0 42.9%
Taylor expanded in x around -inf 0.0%
mul-1-neg0.0%
unsub-neg0.0%
Simplified42.9%
Taylor expanded in x around inf 42.9%
associate-*r/42.9%
metadata-eval42.9%
Simplified42.9%
Final simplification42.9%
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 33.8%
Simplified33.7%
Taylor expanded in l around 0 42.9%
Taylor expanded in x around inf 42.8%
Final simplification42.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 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 33.8%
Simplified33.7%
Taylor expanded in l around 0 42.9%
Taylor expanded in x around inf 42.5%
herbie shell --seed 2024105
(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)))))