\[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}
\]
↓
\[\begin{array}{l}
t_1 := \frac{2 \cdot t}{1 + t}\\
t_2 := t_1 \cdot t_1\\
\frac{1 + t_2}{2 + t_2}
\end{array}
\]
(FPCore (t)
:precision binary64
(/
(+ 1.0 (* (/ (* 2.0 t) (+ 1.0 t)) (/ (* 2.0 t) (+ 1.0 t))))
(+ 2.0 (* (/ (* 2.0 t) (+ 1.0 t)) (/ (* 2.0 t) (+ 1.0 t))))))
↓
(FPCore (t)
:precision binary64
(let* ((t_1 (/ (* 2.0 t) (+ 1.0 t))) (t_2 (* t_1 t_1)))
(/ (+ 1.0 t_2) (+ 2.0 t_2))))
double code(double t) {
return (1.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t)))) / (2.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t))));
}
↓
double code(double t) {
double t_1 = (2.0 * t) / (1.0 + t);
double t_2 = t_1 * t_1;
return (1.0 + t_2) / (2.0 + t_2);
}
real(8) function code(t)
real(8), intent (in) :: t
code = (1.0d0 + (((2.0d0 * t) / (1.0d0 + t)) * ((2.0d0 * t) / (1.0d0 + t)))) / (2.0d0 + (((2.0d0 * t) / (1.0d0 + t)) * ((2.0d0 * t) / (1.0d0 + t))))
end function
↓
real(8) function code(t)
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
t_1 = (2.0d0 * t) / (1.0d0 + t)
t_2 = t_1 * t_1
code = (1.0d0 + t_2) / (2.0d0 + t_2)
end function
public static double code(double t) {
return (1.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t)))) / (2.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t))));
}
↓
public static double code(double t) {
double t_1 = (2.0 * t) / (1.0 + t);
double t_2 = t_1 * t_1;
return (1.0 + t_2) / (2.0 + t_2);
}
def code(t):
return (1.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t)))) / (2.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t))))
↓
def code(t):
t_1 = (2.0 * t) / (1.0 + t)
t_2 = t_1 * t_1
return (1.0 + t_2) / (2.0 + t_2)
function code(t)
return Float64(Float64(1.0 + Float64(Float64(Float64(2.0 * t) / Float64(1.0 + t)) * Float64(Float64(2.0 * t) / Float64(1.0 + t)))) / Float64(2.0 + Float64(Float64(Float64(2.0 * t) / Float64(1.0 + t)) * Float64(Float64(2.0 * t) / Float64(1.0 + t)))))
end
↓
function code(t)
t_1 = Float64(Float64(2.0 * t) / Float64(1.0 + t))
t_2 = Float64(t_1 * t_1)
return Float64(Float64(1.0 + t_2) / Float64(2.0 + t_2))
end
function tmp = code(t)
tmp = (1.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t)))) / (2.0 + (((2.0 * t) / (1.0 + t)) * ((2.0 * t) / (1.0 + t))));
end
↓
function tmp = code(t)
t_1 = (2.0 * t) / (1.0 + t);
t_2 = t_1 * t_1;
tmp = (1.0 + t_2) / (2.0 + t_2);
end
code[t_] := N[(N[(1.0 + N[(N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
↓
code[t_] := Block[{t$95$1 = N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(1.0 + t$95$2), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]]]
\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}
↓
\begin{array}{l}
t_1 := \frac{2 \cdot t}{1 + t}\\
t_2 := t_1 \cdot t_1\\
\frac{1 + t_2}{2 + t_2}
\end{array}
Alternatives
| Alternative 1 |
|---|
| Accuracy | 99.6% |
|---|
| Cost | 2248 |
|---|
\[\begin{array}{l}
t_1 := \frac{\frac{t \cdot \left(t \cdot 4\right)}{1 + t}}{1 + t}\\
\mathbf{if}\;t \leq -1 \cdot 10^{+160}:\\
\;\;\;\;0.8333333333333334\\
\mathbf{elif}\;t \leq 20000000:\\
\;\;\;\;\frac{1 + t_1}{2 + t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{5 + \frac{-8}{t}}{6 + \frac{-8}{t}}\\
\end{array}
\]
| Alternative 2 |
|---|
| Accuracy | 99.9% |
|---|
| Cost | 2248 |
|---|
\[\begin{array}{l}
t_1 := \frac{\frac{t \cdot \left(t \cdot 4\right)}{1 + t}}{1 + t}\\
t_2 := \frac{2 \cdot t}{1 + t}\\
\mathbf{if}\;t \leq -20000000000000:\\
\;\;\;\;\frac{1 + t_2 \cdot t_2}{2 + t_2 \cdot \left(2 - \frac{2}{t}\right)}\\
\mathbf{elif}\;t \leq 20000000:\\
\;\;\;\;\frac{1 + t_1}{2 + t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{5 + \frac{-8}{t}}{6 + \frac{-8}{t}}\\
\end{array}
\]
| Alternative 3 |
|---|
| Accuracy | 99.4% |
|---|
| Cost | 1480 |
|---|
\[\begin{array}{l}
t_1 := 4 \cdot \left(t \cdot t\right)\\
\mathbf{if}\;t \leq -0.58:\\
\;\;\;\;0.8333333333333334 + \frac{-0.2222222222222222}{t}\\
\mathbf{elif}\;t \leq 1.8:\\
\;\;\;\;\frac{1 + \frac{t_1}{1 + t}}{2 + t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{5 + \frac{-8}{t}}{6 + \frac{-8}{t}}\\
\end{array}
\]
| Alternative 4 |
|---|
| Accuracy | 99.3% |
|---|
| Cost | 968 |
|---|
\[\begin{array}{l}
\mathbf{if}\;t \leq -0.8:\\
\;\;\;\;0.8333333333333334 + \frac{-0.2222222222222222}{t}\\
\mathbf{elif}\;t \leq 1.65:\\
\;\;\;\;t \cdot t + 0.5\\
\mathbf{else}:\\
\;\;\;\;\frac{5 + \frac{-8}{t}}{6 + \frac{-8}{t}}\\
\end{array}
\]
| Alternative 5 |
|---|
| Accuracy | 99.3% |
|---|
| Cost | 585 |
|---|
\[\begin{array}{l}
\mathbf{if}\;t \leq -0.8 \lor \neg \left(t \leq 0.56\right):\\
\;\;\;\;0.8333333333333334 + \frac{-0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;t \cdot t + 0.5\\
\end{array}
\]
| Alternative 6 |
|---|
| Accuracy | 98.8% |
|---|
| Cost | 584 |
|---|
\[\begin{array}{l}
\mathbf{if}\;t \leq -0.9:\\
\;\;\;\;0.8333333333333334\\
\mathbf{elif}\;t \leq 0.58:\\
\;\;\;\;t \cdot t + 0.5\\
\mathbf{else}:\\
\;\;\;\;0.8333333333333334\\
\end{array}
\]
| Alternative 7 |
|---|
| Accuracy | 98.7% |
|---|
| Cost | 328 |
|---|
\[\begin{array}{l}
\mathbf{if}\;t \leq -0.34:\\
\;\;\;\;0.8333333333333334\\
\mathbf{elif}\;t \leq 1:\\
\;\;\;\;0.5\\
\mathbf{else}:\\
\;\;\;\;0.8333333333333334\\
\end{array}
\]
| Alternative 8 |
|---|
| Accuracy | 58.9% |
|---|
| Cost | 64 |
|---|
\[0.5
\]