Kahan p13 Example 1

Percentage Accurate: 99.9% → 100.0%

Time: 9.6s

Alternatives: 6

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \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} \end{array} \]

FPCore

(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))))

C

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);
}

Fortran

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

Java

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);
}

Python

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)

Julia

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

MATLAB

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

Wolfram

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]]]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \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} \end{array} \]

FPCore

(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))))

C

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);
}

Fortran

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

Java

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);
}

Python

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)

Julia

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

MATLAB

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

Wolfram

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]]]

Alternative 1: 100.0% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\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}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

   2. associate-/l* 100.0%

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

   3. swap-sqr 100.0%

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

   4. metadata-eval 100.0%

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

   5. associate-/l* 100.0%

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

   6. associate-/l* 100.0%

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

   7. swap-sqr 100.0%

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

   8. metadata-eval 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
4. Add Preprocessing

5. Final simplification 100.0%

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

Alternative 2: 99.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.58 \lor \neg \left(t \leq 0.76\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{4 \cdot \left(t \cdot \frac{t}{t + 1}\right) + 1}{2 + 4 \cdot \left(t \cdot t\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.58) (not (<= t 0.76)))
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   (/ (+ (* 4.0 (* t (/ t (+ t 1.0)))) 1.0) (+ 2.0 (* 4.0 (* t t))))))

C

double code(double t) {
	double tmp;
	if ((t <= -0.58) || !(t <= 0.76)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = ((4.0 * (t * (t / (t + 1.0)))) + 1.0) / (2.0 + (4.0 * (t * t)));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.58d0)) .or. (.not. (t <= 0.76d0))) then
        tmp = 0.8333333333333334d0 - (0.2222222222222222d0 / t)
    else
        tmp = ((4.0d0 * (t * (t / (t + 1.0d0)))) + 1.0d0) / (2.0d0 + (4.0d0 * (t * t)))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.58) || !(t <= 0.76)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = ((4.0 * (t * (t / (t + 1.0)))) + 1.0) / (2.0 + (4.0 * (t * t)));
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.58) or not (t <= 0.76):
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	else:
		tmp = ((4.0 * (t * (t / (t + 1.0)))) + 1.0) / (2.0 + (4.0 * (t * t)))
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.58) || !(t <= 0.76))
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = Float64(Float64(Float64(4.0 * Float64(t * Float64(t / Float64(t + 1.0)))) + 1.0) / Float64(2.0 + Float64(4.0 * Float64(t * t))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.58) || ~((t <= 0.76)))
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	else
		tmp = ((4.0 * (t * (t / (t + 1.0)))) + 1.0) / (2.0 + (4.0 * (t * t)));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.58], N[Not[LessEqual[t, 0.76]], $MachinePrecision]], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(4.0 * N[(t * N[(t / N[(t + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(2.0 + N[(4.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.57999999999999996 or 0.76000000000000001 < t

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 99.2%

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

      1. associate-*r/ 99.2%

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

      2. metadata-eval 99.2%

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

   7. Simplified 99.2%

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

   if -0.57999999999999996 < t < 0.76000000000000001

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 100.0%

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

   6. Taylor expanded in t around 0 100.0%

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

   7. Taylor expanded in t around 0 100.0%

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

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.58 \lor \neg \left(t \leq 0.76\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{4 \cdot \left(t \cdot \frac{t}{t + 1}\right) + 1}{2 + 4 \cdot \left(t \cdot t\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 4 \cdot \left(t \cdot t\right)\\ \mathbf{if}\;t \leq -0.59 \lor \neg \left(t \leq 0.68\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_1 + 1}{2 + t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (* 4.0 (* t t))))
   (if (or (<= t -0.59) (not (<= t 0.68)))
     (- 0.8333333333333334 (/ 0.2222222222222222 t))
     (/ (+ t_1 1.0) (+ 2.0 t_1)))))

C

double code(double t) {
	double t_1 = 4.0 * (t * t);
	double tmp;
	if ((t <= -0.59) || !(t <= 0.68)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = (t_1 + 1.0) / (2.0 + t_1);
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 4.0d0 * (t * t)
    if ((t <= (-0.59d0)) .or. (.not. (t <= 0.68d0))) then
        tmp = 0.8333333333333334d0 - (0.2222222222222222d0 / t)
    else
        tmp = (t_1 + 1.0d0) / (2.0d0 + t_1)
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double t_1 = 4.0 * (t * t);
	double tmp;
	if ((t <= -0.59) || !(t <= 0.68)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = (t_1 + 1.0) / (2.0 + t_1);
	}
	return tmp;
}

Python

def code(t):
	t_1 = 4.0 * (t * t)
	tmp = 0
	if (t <= -0.59) or not (t <= 0.68):
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	else:
		tmp = (t_1 + 1.0) / (2.0 + t_1)
	return tmp

Julia

function code(t)
	t_1 = Float64(4.0 * Float64(t * t))
	tmp = 0.0
	if ((t <= -0.59) || !(t <= 0.68))
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = Float64(Float64(t_1 + 1.0) / Float64(2.0 + t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	t_1 = 4.0 * (t * t);
	tmp = 0.0;
	if ((t <= -0.59) || ~((t <= 0.68)))
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	else
		tmp = (t_1 + 1.0) / (2.0 + t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := Block[{t$95$1 = N[(4.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t, -0.59], N[Not[LessEqual[t, 0.68]], $MachinePrecision]], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 + 1.0), $MachinePrecision] / N[(2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if t < -0.589999999999999969 or 0.680000000000000049 < t

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 99.2%

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

      1. associate-*r/ 99.2%

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

      2. metadata-eval 99.2%

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

   7. Simplified 99.2%

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

   if -0.589999999999999969 < t < 0.680000000000000049

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 100.0%

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

   6. Taylor expanded in t around 0 100.0%

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

   7. Taylor expanded in t around 0 100.0%

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

   8. Taylor expanded in t around 0 99.9%

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

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.59 \lor \neg \left(t \leq 0.68\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{4 \cdot \left(t \cdot t\right) + 1}{2 + 4 \cdot \left(t \cdot t\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.0% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.49 \lor \neg \left(t \leq 0.68\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.49) (not (<= t 0.68)))
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   0.5))

C

double code(double t) {
	double tmp;
	if ((t <= -0.49) || !(t <= 0.68)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.49) || !(t <= 0.68)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.49) or not (t <= 0.68):
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	else:
		tmp = 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.49) || !(t <= 0.68))
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = 0.5;
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.49) || ~((t <= 0.68)))
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.49], N[Not[LessEqual[t, 0.68]], $MachinePrecision]], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], 0.5]

Derivation

1. Split input into 2 regimes

2. if t < -0.48999999999999999 or 0.680000000000000049 < t

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 99.2%

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

      1. associate-*r/ 99.2%

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

      2. metadata-eval 99.2%

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

   7. Simplified 99.2%

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

   if -0.48999999999999999 < t < 0.680000000000000049

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.5%

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

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.49 \lor \neg \left(t \leq 0.68\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.5% accurate, 3.2× 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%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 98.1%

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

   if -0.330000000000000016 < t < 1

   1. Initial program 100.0%

      \[\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}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

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

      5. associate-/l* 100.0%

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

      6. associate-/l* 100.0%

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

      7. swap-sqr 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.5%

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

4. Final simplification 98.8%

   \[\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} \]
5. Add Preprocessing

Alternative 6: 58.7% accurate, 35.0× speedup

Math

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

FPCore

(FPCore (t) :precision binary64 0.5)

C

double code(double t) {
	return 0.5;
}

Fortran

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

Java

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

Python

def code(t):
	return 0.5

Julia

function code(t)
	return 0.5
end

MATLAB

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

Wolfram

code[t_] := 0.5

Derivation

1. Initial program 100.0%

   \[\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}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

   2. associate-/l* 100.0%

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

   3. swap-sqr 100.0%

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

   4. metadata-eval 100.0%

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

   5. associate-/l* 100.0%

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

   6. associate-/l* 100.0%

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

   7. swap-sqr 100.0%

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

   8. metadata-eval 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
4. Add Preprocessing

5. Taylor expanded in t around 0 58.7%

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

6. Final simplification 58.7%

   \[\leadsto 0.5 \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024046 
(FPCore (t)
  :name "Kahan p13 Example 1"
  :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))))))