Kahan p13 Example 3

Percentage Accurate: 100.0% → 100.0%

Time: 10.9s

Alternatives: 10

Speedup: 1.7×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ 1 - \frac{1}{2 + t_1 \cdot t_1} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))
   (- 1.0 (/ 1.0 (+ 2.0 (* t_1 t_1))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
    code = 1.0d0 - (1.0d0 / (2.0d0 + (t_1 * t_1)))
end function

Java

public static double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Python

def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)))

Julia

function code(t)
	t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))))
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))))
end

MATLAB

function tmp = code(t)
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	tmp = 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 - N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ 1 - \frac{1}{2 + t_1 \cdot t_1} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))
   (- 1.0 (/ 1.0 (+ 2.0 (* t_1 t_1))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
    code = 1.0d0 - (1.0d0 / (2.0d0 + (t_1 * t_1)))
end function

Java

public static double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Python

def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)))

Julia

function code(t)
	t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))))
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))))
end

MATLAB

function tmp = code(t)
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	tmp = 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 - N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 100.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{2}{1 + t}\\ 1 + \frac{-1}{6 + t_1 \cdot \left(t_1 + -4\right)} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (/ 2.0 (+ 1.0 t))))
   (+ 1.0 (/ -1.0 (+ 6.0 (* t_1 (+ t_1 -4.0)))))))

C

double code(double t) {
	double t_1 = 2.0 / (1.0 + t);
	return 1.0 + (-1.0 / (6.0 + (t_1 * (t_1 + -4.0))));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 / (1.0d0 + t)
    code = 1.0d0 + ((-1.0d0) / (6.0d0 + (t_1 * (t_1 + (-4.0d0)))))
end function

Java

public static double code(double t) {
	double t_1 = 2.0 / (1.0 + t);
	return 1.0 + (-1.0 / (6.0 + (t_1 * (t_1 + -4.0))));
}

Python

def code(t):
	t_1 = 2.0 / (1.0 + t)
	return 1.0 + (-1.0 / (6.0 + (t_1 * (t_1 + -4.0))))

Julia

function code(t)
	t_1 = Float64(2.0 / Float64(1.0 + t))
	return Float64(1.0 + Float64(-1.0 / Float64(6.0 + Float64(t_1 * Float64(t_1 + -4.0)))))
end

MATLAB

function tmp = code(t)
	t_1 = 2.0 / (1.0 + t);
	tmp = 1.0 + (-1.0 / (6.0 + (t_1 * (t_1 + -4.0))));
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]}, N[(1.0 + N[(-1.0 / N[(6.0 + N[(t$95$1 * N[(t$95$1 + -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 100.0%

   \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

4. Final simplification 100.0%

   \[\leadsto 1 + \frac{-1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)} \]

Alternative 2: 99.4% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.72:\\ \;\;\;\;1 + \frac{-1}{6 + \frac{-8 + \frac{4}{t}}{1 + t}}\\ \mathbf{elif}\;t \leq 0.24:\\ \;\;\;\;1 + \left(t \cdot t - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{t} - 0.16666666666666666\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= t -0.72)
   (+ 1.0 (/ -1.0 (+ 6.0 (/ (+ -8.0 (/ 4.0 t)) (+ 1.0 t)))))
   (if (<= t 0.24)
     (+ 1.0 (- (* t t) 0.5))
     (+
      1.0
      (-
       (/ (- (/ 0.037037037037037035 t) 0.2222222222222222) t)
       0.16666666666666666)))))

C

double code(double t) {
	double tmp;
	if (t <= -0.72) {
		tmp = 1.0 + (-1.0 / (6.0 + ((-8.0 + (4.0 / t)) / (1.0 + t))));
	} else if (t <= 0.24) {
		tmp = 1.0 + ((t * t) - 0.5);
	} else {
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666);
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.72d0)) then
        tmp = 1.0d0 + ((-1.0d0) / (6.0d0 + (((-8.0d0) + (4.0d0 / t)) / (1.0d0 + t))))
    else if (t <= 0.24d0) then
        tmp = 1.0d0 + ((t * t) - 0.5d0)
    else
        tmp = 1.0d0 + ((((0.037037037037037035d0 / t) - 0.2222222222222222d0) / t) - 0.16666666666666666d0)
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (t <= -0.72) {
		tmp = 1.0 + (-1.0 / (6.0 + ((-8.0 + (4.0 / t)) / (1.0 + t))));
	} else if (t <= 0.24) {
		tmp = 1.0 + ((t * t) - 0.5);
	} else {
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666);
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if t <= -0.72:
		tmp = 1.0 + (-1.0 / (6.0 + ((-8.0 + (4.0 / t)) / (1.0 + t))))
	elif t <= 0.24:
		tmp = 1.0 + ((t * t) - 0.5)
	else:
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666)
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (t <= -0.72)
		tmp = Float64(1.0 + Float64(-1.0 / Float64(6.0 + Float64(Float64(-8.0 + Float64(4.0 / t)) / Float64(1.0 + t)))));
	elseif (t <= 0.24)
		tmp = Float64(1.0 + Float64(Float64(t * t) - 0.5));
	else
		tmp = Float64(1.0 + Float64(Float64(Float64(Float64(0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.72)
		tmp = 1.0 + (-1.0 / (6.0 + ((-8.0 + (4.0 / t)) / (1.0 + t))));
	elseif (t <= 0.24)
		tmp = 1.0 + ((t * t) - 0.5);
	else
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666);
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[t, -0.72], N[(1.0 + N[(-1.0 / N[(6.0 + N[(N[(-8.0 + N[(4.0 / t), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 0.24], N[(1.0 + N[(N[(t * t), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -0.71999999999999997

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
   4. Step-by-step derivation

      1. add-log-exp 98.5%

         \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      2. *-un-lft-identity 98.5%

         \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      3. log-prod 98.5%

         \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

      4. metadata-eval 98.5%

         \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

      5. add-log-exp 100.0%

         \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      6. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

      7. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      8. +-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

      9. *-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

   5. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
   6. Step-by-step derivation

      1. +-lft-identity 100.0%

         \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

      2. fma-udef 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

      3. associate-*r/ 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

      4. metadata-eval 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

      5. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

      6. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

   7. Simplified 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

   8. Taylor expanded in t around inf 98.1%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{4}{t}} + -8}{t + 1} + 6} \]

   if -0.71999999999999997 < t < 0.23999999999999999

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 + -1 \cdot {t}^{2}\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 99.6%

         \[\leadsto 1 - \left(0.5 + \color{blue}{\left(-{t}^{2}\right)}\right) \]

      2. unsub-neg 99.6%

         \[\leadsto 1 - \color{blue}{\left(0.5 - {t}^{2}\right)} \]

      3. unpow2 99.6%

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   6. Simplified 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 - t \cdot t\right)} \]

   if 0.23999999999999999 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around inf 99.9%

      \[\leadsto 1 - \color{blue}{\left(\left(0.16666666666666666 + 0.2222222222222222 \cdot \frac{1}{t}\right) - 0.037037037037037035 \cdot \frac{1}{{t}^{2}}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 99.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}}\right) - 0.037037037037037035 \cdot \frac{1}{{t}^{2}}\right) \]

      2. metadata-eval 99.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{\color{blue}{0.2222222222222222}}{t}\right) - 0.037037037037037035 \cdot \frac{1}{{t}^{2}}\right) \]

      3. associate-*r/ 99.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \color{blue}{\frac{0.037037037037037035 \cdot 1}{{t}^{2}}}\right) \]

      4. metadata-eval 99.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \frac{\color{blue}{0.037037037037037035}}{{t}^{2}}\right) \]

      5. unpow2 99.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \frac{0.037037037037037035}{\color{blue}{t \cdot t}}\right) \]

   6. Simplified 99.9%

      \[\leadsto 1 - \color{blue}{\left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \frac{0.037037037037037035}{t \cdot t}\right)} \]
   7. Step-by-step derivation

      1. associate--l+ 99.9%

         \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + \left(\frac{0.2222222222222222}{t} - \frac{0.037037037037037035}{t \cdot t}\right)\right)} \]

      2. associate-/r* 99.9%

         \[\leadsto 1 - \left(0.16666666666666666 + \left(\frac{0.2222222222222222}{t} - \color{blue}{\frac{\frac{0.037037037037037035}{t}}{t}}\right)\right) \]

      3. sub-div 99.9%

         \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\frac{0.2222222222222222 - \frac{0.037037037037037035}{t}}{t}}\right) \]

   8. Applied egg-rr 99.9%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + \frac{0.2222222222222222 - \frac{0.037037037037037035}{t}}{t}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.72:\\ \;\;\;\;1 + \frac{-1}{6 + \frac{-8 + \frac{4}{t}}{1 + t}}\\ \mathbf{elif}\;t \leq 0.24:\\ \;\;\;\;1 + \left(t \cdot t - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{t} - 0.16666666666666666\right)\\ \end{array} \]

Alternative 3: 100.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ 1 + \frac{-1}{6 + \frac{\frac{4}{1 + t} + -8}{1 + t}} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (+ 1.0 (/ -1.0 (+ 6.0 (/ (+ (/ 4.0 (+ 1.0 t)) -8.0) (+ 1.0 t))))))

C

double code(double t) {
	return 1.0 + (-1.0 / (6.0 + (((4.0 / (1.0 + t)) + -8.0) / (1.0 + t))));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    code = 1.0d0 + ((-1.0d0) / (6.0d0 + (((4.0d0 / (1.0d0 + t)) + (-8.0d0)) / (1.0d0 + t))))
end function

Java

public static double code(double t) {
	return 1.0 + (-1.0 / (6.0 + (((4.0 / (1.0 + t)) + -8.0) / (1.0 + t))));
}

Python

def code(t):
	return 1.0 + (-1.0 / (6.0 + (((4.0 / (1.0 + t)) + -8.0) / (1.0 + t))))

Julia

function code(t)
	return Float64(1.0 + Float64(-1.0 / Float64(6.0 + Float64(Float64(Float64(4.0 / Float64(1.0 + t)) + -8.0) / Float64(1.0 + t)))))
end

MATLAB

function tmp = code(t)
	tmp = 1.0 + (-1.0 / (6.0 + (((4.0 / (1.0 + t)) + -8.0) / (1.0 + t))));
end

Wolfram

code[t_] := N[(1.0 + N[(-1.0 / N[(6.0 + N[(N[(N[(4.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] + -8.0), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
4. Step-by-step derivation

   1. add-log-exp 99.3%

      \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

   2. *-un-lft-identity 99.3%

      \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

   3. log-prod 99.3%

      \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

   4. metadata-eval 99.3%

      \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

   5. add-log-exp 100.0%

      \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

   6. *-un-lft-identity 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

   7. *-un-lft-identity 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

   8. +-commutative 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

   9. *-commutative 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

5. Applied egg-rr 100.0%

   \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
6. Step-by-step derivation

   1. +-lft-identity 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

   2. fma-udef 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

   3. associate-*r/ 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

   4. metadata-eval 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

   5. +-commutative 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

   6. +-commutative 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

7. Simplified 100.0%

   \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

8. Final simplification 100.0%

   \[\leadsto 1 + \frac{-1}{6 + \frac{\frac{4}{1 + t} + -8}{1 + t}} \]

Alternative 4: 99.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.82 \lor \neg \left(t \leq 0.24\right):\\ \;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{t} - 0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \left(t \cdot t - 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.82) (not (<= t 0.24)))
   (+
    1.0
    (-
     (/ (- (/ 0.037037037037037035 t) 0.2222222222222222) t)
     0.16666666666666666))
   (+ 1.0 (- (* t t) 0.5))))

C

double code(double t) {
	double tmp;
	if ((t <= -0.82) || !(t <= 0.24)) {
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666);
	} else {
		tmp = 1.0 + ((t * t) - 0.5);
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.82d0)) .or. (.not. (t <= 0.24d0))) then
        tmp = 1.0d0 + ((((0.037037037037037035d0 / t) - 0.2222222222222222d0) / t) - 0.16666666666666666d0)
    else
        tmp = 1.0d0 + ((t * t) - 0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.82) || !(t <= 0.24)) {
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666);
	} else {
		tmp = 1.0 + ((t * t) - 0.5);
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.82) or not (t <= 0.24):
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666)
	else:
		tmp = 1.0 + ((t * t) - 0.5)
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.82) || !(t <= 0.24))
		tmp = Float64(1.0 + Float64(Float64(Float64(Float64(0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666));
	else
		tmp = Float64(1.0 + Float64(Float64(t * t) - 0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.82) || ~((t <= 0.24)))
		tmp = 1.0 + ((((0.037037037037037035 / t) - 0.2222222222222222) / t) - 0.16666666666666666);
	else
		tmp = 1.0 + ((t * t) - 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.82], N[Not[LessEqual[t, 0.24]], $MachinePrecision]], N[(1.0 + N[(N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(N[(t * t), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.819999999999999951 or 0.23999999999999999 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around inf 98.9%

      \[\leadsto 1 - \color{blue}{\left(\left(0.16666666666666666 + 0.2222222222222222 \cdot \frac{1}{t}\right) - 0.037037037037037035 \cdot \frac{1}{{t}^{2}}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 98.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}}\right) - 0.037037037037037035 \cdot \frac{1}{{t}^{2}}\right) \]

      2. metadata-eval 98.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{\color{blue}{0.2222222222222222}}{t}\right) - 0.037037037037037035 \cdot \frac{1}{{t}^{2}}\right) \]

      3. associate-*r/ 98.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \color{blue}{\frac{0.037037037037037035 \cdot 1}{{t}^{2}}}\right) \]

      4. metadata-eval 98.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \frac{\color{blue}{0.037037037037037035}}{{t}^{2}}\right) \]

      5. unpow2 98.9%

         \[\leadsto 1 - \left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \frac{0.037037037037037035}{\color{blue}{t \cdot t}}\right) \]

   6. Simplified 98.9%

      \[\leadsto 1 - \color{blue}{\left(\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right) - \frac{0.037037037037037035}{t \cdot t}\right)} \]
   7. Step-by-step derivation

      1. associate--l+ 98.9%

         \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + \left(\frac{0.2222222222222222}{t} - \frac{0.037037037037037035}{t \cdot t}\right)\right)} \]

      2. associate-/r* 98.9%

         \[\leadsto 1 - \left(0.16666666666666666 + \left(\frac{0.2222222222222222}{t} - \color{blue}{\frac{\frac{0.037037037037037035}{t}}{t}}\right)\right) \]

      3. sub-div 98.9%

         \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\frac{0.2222222222222222 - \frac{0.037037037037037035}{t}}{t}}\right) \]

   8. Applied egg-rr 98.9%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + \frac{0.2222222222222222 - \frac{0.037037037037037035}{t}}{t}\right)} \]

   if -0.819999999999999951 < t < 0.23999999999999999

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 + -1 \cdot {t}^{2}\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 99.6%

         \[\leadsto 1 - \left(0.5 + \color{blue}{\left(-{t}^{2}\right)}\right) \]

      2. unsub-neg 99.6%

         \[\leadsto 1 - \color{blue}{\left(0.5 - {t}^{2}\right)} \]

      3. unpow2 99.6%

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   6. Simplified 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 - t \cdot t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.82 \lor \neg \left(t \leq 0.24\right):\\ \;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{t} - 0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \left(t \cdot t - 0.5\right)\\ \end{array} \]

Alternative 5: 99.3% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.8:\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{elif}\;t \leq 0.56:\\ \;\;\;\;0.5 + t \cdot t\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= t -0.8)
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   (if (<= t 0.56)
     (+ 0.5 (* t t))
     (- 1.0 (+ 0.16666666666666666 (/ 0.2222222222222222 t))))))

C

double code(double t) {
	double tmp;
	if (t <= -0.8) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else if (t <= 0.56) {
		tmp = 0.5 + (t * t);
	} else {
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.8d0)) then
        tmp = 0.8333333333333334d0 - (0.2222222222222222d0 / t)
    else if (t <= 0.56d0) then
        tmp = 0.5d0 + (t * t)
    else
        tmp = 1.0d0 - (0.16666666666666666d0 + (0.2222222222222222d0 / t))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (t <= -0.8) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else if (t <= 0.56) {
		tmp = 0.5 + (t * t);
	} else {
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if t <= -0.8:
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	elif t <= 0.56:
		tmp = 0.5 + (t * t)
	else:
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t))
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (t <= -0.8)
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	elseif (t <= 0.56)
		tmp = Float64(0.5 + Float64(t * t));
	else
		tmp = Float64(1.0 - Float64(0.16666666666666666 + Float64(0.2222222222222222 / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.8)
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	elseif (t <= 0.56)
		tmp = 0.5 + (t * t);
	else
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[t, -0.8], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 0.56], N[(0.5 + N[(t * t), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(0.16666666666666666 + N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -0.80000000000000004

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
   4. Step-by-step derivation

      1. add-log-exp 98.5%

         \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      2. *-un-lft-identity 98.5%

         \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      3. log-prod 98.5%

         \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

      4. metadata-eval 98.5%

         \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

      5. add-log-exp 100.0%

         \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      6. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

      7. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      8. +-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

      9. *-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

   5. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
   6. Step-by-step derivation

      1. +-lft-identity 100.0%

         \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

      2. fma-udef 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

      3. associate-*r/ 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

      4. metadata-eval 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

      5. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

      6. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

   7. Simplified 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

   8. Taylor expanded in t around inf 98.0%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{-8}}{t + 1} + 6} \]

   9. Taylor expanded in t around inf 98.0%

      \[\leadsto \color{blue}{0.8333333333333334 - 0.2222222222222222 \cdot \frac{1}{t}} \]
   10. Step-by-step derivation

       1. associate-*r/ 98.0%

          \[\leadsto 0.8333333333333334 - \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}} \]

       2. metadata-eval 98.0%

          \[\leadsto 0.8333333333333334 - \frac{\color{blue}{0.2222222222222222}}{t} \]

   11. Simplified 98.0%

       \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222}{t}} \]

   if -0.80000000000000004 < t < 0.56000000000000005

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 + -1 \cdot {t}^{2}\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 99.6%

         \[\leadsto 1 - \left(0.5 + \color{blue}{\left(-{t}^{2}\right)}\right) \]

      2. unsub-neg 99.6%

         \[\leadsto 1 - \color{blue}{\left(0.5 - {t}^{2}\right)} \]

      3. unpow2 99.6%

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   6. Simplified 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 - t \cdot t\right)} \]
   7. Step-by-step derivation

      1. associate--r- 99.6%

         \[\leadsto \color{blue}{\left(1 - 0.5\right) + t \cdot t} \]

      2. metadata-eval 99.6%

         \[\leadsto \color{blue}{0.5} + t \cdot t \]

      3. +-commutative 99.6%

         \[\leadsto \color{blue}{t \cdot t + 0.5} \]

   8. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{t \cdot t + 0.5} \]

   if 0.56000000000000005 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around inf 99.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + 0.2222222222222222 \cdot \frac{1}{t}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 99.5%

         \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}}\right) \]

      2. metadata-eval 99.5%

         \[\leadsto 1 - \left(0.16666666666666666 + \frac{\color{blue}{0.2222222222222222}}{t}\right) \]

   6. Simplified 99.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.8:\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{elif}\;t \leq 0.56:\\ \;\;\;\;0.5 + t \cdot t\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \end{array} \]

Alternative 6: 99.3% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.8:\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{elif}\;t \leq 0.56:\\ \;\;\;\;1 + \left(t \cdot t - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= t -0.8)
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   (if (<= t 0.56)
     (+ 1.0 (- (* t t) 0.5))
     (- 1.0 (+ 0.16666666666666666 (/ 0.2222222222222222 t))))))

C

double code(double t) {
	double tmp;
	if (t <= -0.8) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else if (t <= 0.56) {
		tmp = 1.0 + ((t * t) - 0.5);
	} else {
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.8d0)) then
        tmp = 0.8333333333333334d0 - (0.2222222222222222d0 / t)
    else if (t <= 0.56d0) then
        tmp = 1.0d0 + ((t * t) - 0.5d0)
    else
        tmp = 1.0d0 - (0.16666666666666666d0 + (0.2222222222222222d0 / t))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (t <= -0.8) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else if (t <= 0.56) {
		tmp = 1.0 + ((t * t) - 0.5);
	} else {
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if t <= -0.8:
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	elif t <= 0.56:
		tmp = 1.0 + ((t * t) - 0.5)
	else:
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t))
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (t <= -0.8)
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	elseif (t <= 0.56)
		tmp = Float64(1.0 + Float64(Float64(t * t) - 0.5));
	else
		tmp = Float64(1.0 - Float64(0.16666666666666666 + Float64(0.2222222222222222 / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.8)
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	elseif (t <= 0.56)
		tmp = 1.0 + ((t * t) - 0.5);
	else
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[t, -0.8], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 0.56], N[(1.0 + N[(N[(t * t), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(0.16666666666666666 + N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -0.80000000000000004

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
   4. Step-by-step derivation

      1. add-log-exp 98.5%

         \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      2. *-un-lft-identity 98.5%

         \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      3. log-prod 98.5%

         \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

      4. metadata-eval 98.5%

         \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

      5. add-log-exp 100.0%

         \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      6. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

      7. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      8. +-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

      9. *-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

   5. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
   6. Step-by-step derivation

      1. +-lft-identity 100.0%

         \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

      2. fma-udef 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

      3. associate-*r/ 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

      4. metadata-eval 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

      5. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

      6. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

   7. Simplified 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

   8. Taylor expanded in t around inf 98.0%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{-8}}{t + 1} + 6} \]

   9. Taylor expanded in t around inf 98.0%

      \[\leadsto \color{blue}{0.8333333333333334 - 0.2222222222222222 \cdot \frac{1}{t}} \]
   10. Step-by-step derivation

       1. associate-*r/ 98.0%

          \[\leadsto 0.8333333333333334 - \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}} \]

       2. metadata-eval 98.0%

          \[\leadsto 0.8333333333333334 - \frac{\color{blue}{0.2222222222222222}}{t} \]

   11. Simplified 98.0%

       \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222}{t}} \]

   if -0.80000000000000004 < t < 0.56000000000000005

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 + -1 \cdot {t}^{2}\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 99.6%

         \[\leadsto 1 - \left(0.5 + \color{blue}{\left(-{t}^{2}\right)}\right) \]

      2. unsub-neg 99.6%

         \[\leadsto 1 - \color{blue}{\left(0.5 - {t}^{2}\right)} \]

      3. unpow2 99.6%

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   6. Simplified 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 - t \cdot t\right)} \]

   if 0.56000000000000005 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around inf 99.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + 0.2222222222222222 \cdot \frac{1}{t}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 99.5%

         \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}}\right) \]

      2. metadata-eval 99.5%

         \[\leadsto 1 - \left(0.16666666666666666 + \frac{\color{blue}{0.2222222222222222}}{t}\right) \]

   6. Simplified 99.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.8:\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{elif}\;t \leq 0.56:\\ \;\;\;\;1 + \left(t \cdot t - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \end{array} \]

Alternative 7: 99.3% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \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}:\\ \;\;\;\;0.5 + t \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.8) (not (<= t 0.56)))
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   (+ 0.5 (* t t))))

C

double code(double t) {
	double tmp;
	if ((t <= -0.8) || !(t <= 0.56)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = 0.5 + (t * t);
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.8d0)) .or. (.not. (t <= 0.56d0))) then
        tmp = 0.8333333333333334d0 - (0.2222222222222222d0 / t)
    else
        tmp = 0.5d0 + (t * t)
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.8) || !(t <= 0.56)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = 0.5 + (t * t);
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.8) or not (t <= 0.56):
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	else:
		tmp = 0.5 + (t * t)
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.8) || !(t <= 0.56))
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = Float64(0.5 + Float64(t * t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.8) || ~((t <= 0.56)))
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	else
		tmp = 0.5 + (t * t);
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.8], N[Not[LessEqual[t, 0.56]], $MachinePrecision]], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(t * t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.80000000000000004 or 0.56000000000000005 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
   4. Step-by-step derivation

      1. add-log-exp 98.5%

         \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      2. *-un-lft-identity 98.5%

         \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      3. log-prod 98.5%

         \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

      4. metadata-eval 98.5%

         \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

      5. add-log-exp 100.0%

         \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      6. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

      7. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      8. +-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

      9. *-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

   5. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
   6. Step-by-step derivation

      1. +-lft-identity 100.0%

         \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

      2. fma-udef 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

      3. associate-*r/ 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

      4. metadata-eval 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

      5. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

      6. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

   7. Simplified 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

   8. Taylor expanded in t around inf 98.7%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{-8}}{t + 1} + 6} \]

   9. Taylor expanded in t around inf 98.7%

      \[\leadsto \color{blue}{0.8333333333333334 - 0.2222222222222222 \cdot \frac{1}{t}} \]
   10. Step-by-step derivation

       1. associate-*r/ 98.7%

          \[\leadsto 0.8333333333333334 - \color{blue}{\frac{0.2222222222222222 \cdot 1}{t}} \]

       2. metadata-eval 98.7%

          \[\leadsto 0.8333333333333334 - \frac{\color{blue}{0.2222222222222222}}{t} \]

   11. Simplified 98.7%

       \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222}{t}} \]

   if -0.80000000000000004 < t < 0.56000000000000005

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 + -1 \cdot {t}^{2}\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 99.6%

         \[\leadsto 1 - \left(0.5 + \color{blue}{\left(-{t}^{2}\right)}\right) \]

      2. unsub-neg 99.6%

         \[\leadsto 1 - \color{blue}{\left(0.5 - {t}^{2}\right)} \]

      3. unpow2 99.6%

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   6. Simplified 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 - t \cdot t\right)} \]
   7. Step-by-step derivation

      1. associate--r- 99.6%

         \[\leadsto \color{blue}{\left(1 - 0.5\right) + t \cdot t} \]

      2. metadata-eval 99.6%

         \[\leadsto \color{blue}{0.5} + t \cdot t \]

      3. +-commutative 99.6%

         \[\leadsto \color{blue}{t \cdot t + 0.5} \]

   8. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{t \cdot t + 0.5} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \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}:\\ \;\;\;\;0.5 + t \cdot t\\ \end{array} \]

Alternative 8: 98.7% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.41:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 0.58:\\ \;\;\;\;0.5 + t \cdot t\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= t -0.41)
   0.8333333333333334
   (if (<= t 0.58) (+ 0.5 (* t t)) 0.8333333333333334)))

C

double code(double t) {
	double tmp;
	if (t <= -0.41) {
		tmp = 0.8333333333333334;
	} else if (t <= 0.58) {
		tmp = 0.5 + (t * t);
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.41d0)) then
        tmp = 0.8333333333333334d0
    else if (t <= 0.58d0) then
        tmp = 0.5d0 + (t * t)
    else
        tmp = 0.8333333333333334d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (t <= -0.41) {
		tmp = 0.8333333333333334;
	} else if (t <= 0.58) {
		tmp = 0.5 + (t * t);
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if t <= -0.41:
		tmp = 0.8333333333333334
	elif t <= 0.58:
		tmp = 0.5 + (t * t)
	else:
		tmp = 0.8333333333333334
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (t <= -0.41)
		tmp = 0.8333333333333334;
	elseif (t <= 0.58)
		tmp = Float64(0.5 + Float64(t * t));
	else
		tmp = 0.8333333333333334;
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.41)
		tmp = 0.8333333333333334;
	elseif (t <= 0.58)
		tmp = 0.5 + (t * t);
	else
		tmp = 0.8333333333333334;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[t, -0.41], 0.8333333333333334, If[LessEqual[t, 0.58], N[(0.5 + N[(t * t), $MachinePrecision]), $MachinePrecision], 0.8333333333333334]]

Derivation

1. Split input into 2 regimes

2. if t < -0.409999999999999976 or 0.57999999999999996 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
   4. Step-by-step derivation

      1. add-log-exp 98.5%

         \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      2. *-un-lft-identity 98.5%

         \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      3. log-prod 98.5%

         \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

      4. metadata-eval 98.5%

         \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

      5. add-log-exp 100.0%

         \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      6. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

      7. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      8. +-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

      9. *-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

   5. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
   6. Step-by-step derivation

      1. +-lft-identity 100.0%

         \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

      2. fma-udef 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

      3. associate-*r/ 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

      4. metadata-eval 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

      5. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

      6. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

   7. Simplified 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

   8. Taylor expanded in t around inf 98.7%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{-8}}{t + 1} + 6} \]

   9. Taylor expanded in t around inf 98.0%

      \[\leadsto \color{blue}{0.8333333333333334} \]

   if -0.409999999999999976 < t < 0.57999999999999996

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 + -1 \cdot {t}^{2}\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 99.6%

         \[\leadsto 1 - \left(0.5 + \color{blue}{\left(-{t}^{2}\right)}\right) \]

      2. unsub-neg 99.6%

         \[\leadsto 1 - \color{blue}{\left(0.5 - {t}^{2}\right)} \]

      3. unpow2 99.6%

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   6. Simplified 99.6%

      \[\leadsto 1 - \color{blue}{\left(0.5 - t \cdot t\right)} \]
   7. Step-by-step derivation

      1. associate--r- 99.6%

         \[\leadsto \color{blue}{\left(1 - 0.5\right) + t \cdot t} \]

      2. metadata-eval 99.6%

         \[\leadsto \color{blue}{0.5} + t \cdot t \]

      3. +-commutative 99.6%

         \[\leadsto \color{blue}{t \cdot t + 0.5} \]

   8. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{t \cdot t + 0.5} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.41:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 0.58:\\ \;\;\;\;0.5 + t \cdot t\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \]

Alternative 9: 98.6% accurate, 5.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.33:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= t -0.33) 0.8333333333333334 (if (<= t 1.0) 0.5 0.8333333333333334)))

C

double code(double t) {
	double tmp;
	if (t <= -0.33) {
		tmp = 0.8333333333333334;
	} else if (t <= 1.0) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.33d0)) then
        tmp = 0.8333333333333334d0
    else if (t <= 1.0d0) then
        tmp = 0.5d0
    else
        tmp = 0.8333333333333334d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (t <= -0.33) {
		tmp = 0.8333333333333334;
	} else if (t <= 1.0) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if t <= -0.33:
		tmp = 0.8333333333333334
	elif t <= 1.0:
		tmp = 0.5
	else:
		tmp = 0.8333333333333334
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (t <= -0.33)
		tmp = 0.8333333333333334;
	elseif (t <= 1.0)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.33)
		tmp = 0.8333333333333334;
	elseif (t <= 1.0)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[t, -0.33], 0.8333333333333334, If[LessEqual[t, 1.0], 0.5, 0.8333333333333334]]

Derivation

1. Split input into 2 regimes

2. if t < -0.330000000000000016 or 1 < t

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
   4. Step-by-step derivation

      1. add-log-exp 98.5%

         \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      2. *-un-lft-identity 98.5%

         \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

      3. log-prod 98.5%

         \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

      4. metadata-eval 98.5%

         \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

      5. add-log-exp 100.0%

         \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      6. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

      7. *-un-lft-identity 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

      8. +-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

      9. *-commutative 100.0%

         \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

   5. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
   6. Step-by-step derivation

      1. +-lft-identity 100.0%

         \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

      2. fma-udef 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

      3. associate-*r/ 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

      4. metadata-eval 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

      5. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

      6. +-commutative 100.0%

         \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

   7. Simplified 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

   8. Taylor expanded in t around inf 98.7%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{-8}}{t + 1} + 6} \]

   9. Taylor expanded in t around inf 98.0%

      \[\leadsto \color{blue}{0.8333333333333334} \]

   if -0.330000000000000016 < t < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]

   4. Taylor expanded in t around 0 99.3%

      \[\leadsto 1 - \color{blue}{0.5} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.33:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \]

Alternative 10: 58.6% accurate, 29.0× speedup

Math

\[\begin{array}{l} \\ 0.8333333333333334 \end{array} \]

FPCore

(FPCore (t) :precision binary64 0.8333333333333334)

C

double code(double t) {
	return 0.8333333333333334;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    code = 0.8333333333333334d0
end function

Java

public static double code(double t) {
	return 0.8333333333333334;
}

Python

def code(t):
	return 0.8333333333333334

Julia

function code(t)
	return 0.8333333333333334
end

MATLAB

function tmp = code(t)
	tmp = 0.8333333333333334;
end

Wolfram

code[t_] := 0.8333333333333334

Derivation

1. Initial program 100.0%

   \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{1 - \frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}} \]
4. Step-by-step derivation

   1. add-log-exp 99.3%

      \[\leadsto 1 - \color{blue}{\log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

   2. *-un-lft-identity 99.3%

      \[\leadsto 1 - \log \color{blue}{\left(1 \cdot e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)} \]

   3. log-prod 99.3%

      \[\leadsto 1 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right)} \]

   4. metadata-eval 99.3%

      \[\leadsto 1 - \left(\color{blue}{0} + \log \left(e^{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right)\right) \]

   5. add-log-exp 100.0%

      \[\leadsto 1 - \left(0 + \color{blue}{\frac{1}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

   6. *-un-lft-identity 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{1 \cdot \left(6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)\right)}}\right) \]

   7. *-un-lft-identity 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{6 + \frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right)}}\right) \]

   8. +-commutative 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\frac{2}{1 + t} \cdot \left(\frac{2}{1 + t} + -4\right) + 6}}\right) \]

   9. *-commutative 100.0%

      \[\leadsto 1 - \left(0 + \frac{1}{\color{blue}{\left(\frac{2}{1 + t} + -4\right) \cdot \frac{2}{1 + t}} + 6}\right) \]

5. Applied egg-rr 100.0%

   \[\leadsto 1 - \color{blue}{\left(0 + \frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}\right)} \]
6. Step-by-step derivation

   1. +-lft-identity 100.0%

      \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(2, \frac{2}{1 + t}, -8\right)}{1 + t} + 6}} \]

   2. fma-udef 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{2 \cdot \frac{2}{1 + t} + -8}}{1 + t} + 6} \]

   3. associate-*r/ 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\color{blue}{\frac{2 \cdot 2}{1 + t}} + -8}{1 + t} + 6} \]

   4. metadata-eval 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\frac{\color{blue}{4}}{1 + t} + -8}{1 + t} + 6} \]

   5. +-commutative 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\frac{4}{\color{blue}{t + 1}} + -8}{1 + t} + 6} \]

   6. +-commutative 100.0%

      \[\leadsto 1 - \frac{1}{\frac{\frac{4}{t + 1} + -8}{\color{blue}{t + 1}} + 6} \]

7. Simplified 100.0%

   \[\leadsto 1 - \color{blue}{\frac{1}{\frac{\frac{4}{t + 1} + -8}{t + 1} + 6}} \]

8. Taylor expanded in t around inf 58.3%

   \[\leadsto 1 - \frac{1}{\frac{\color{blue}{-8}}{t + 1} + 6} \]

9. Taylor expanded in t around inf 58.8%

   \[\leadsto \color{blue}{0.8333333333333334} \]

10. Final simplification 58.8%

    \[\leadsto 0.8333333333333334 \]

Reproduce

herbie shell --seed 2023283 
(FPCore (t)
  :name "Kahan p13 Example 3"
  :precision binary64
  (- 1.0 (/ 1.0 (+ 2.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))))))))