Kahan p13 Example 1

Average Accuracy: 100.0% → 100.0%

Time: 10.7s

Precision: binary64

Cost: 1984

Math

\[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

↓

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

FPCore

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

↓

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

C

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

↓

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

Fortran

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

↓

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

Java

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

↓

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

Python

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

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

code[t_] := N[(N[(1.0 + N[(N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[t_] := Block[{t$95$1 = N[(t * N[(N[(N[(t * 4.0), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 + t$95$1), $MachinePrecision] / N[(t$95$1 + 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. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1 + \frac{\frac{t \cdot 4}{1 + t}}{1 + t} \cdot t}{2 + \frac{\frac{t \cdot 4}{1 + t}}{1 + t} \cdot t}} \]
   Proof

   [Start] 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}} \]
   associate-/l* [=>] 100.0	\[ \frac{1 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\frac{2}{\frac{1 + t}{t}}}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-*r/ [=>] 100.0	\[ \frac{1 + \color{blue}{\frac{\frac{2 \cdot t}{1 + t} \cdot 2}{\frac{1 + t}{t}}}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-/r/ [=>] 100.0	\[ \frac{1 + \color{blue}{\frac{\frac{2 \cdot t}{1 + t} \cdot 2}{1 + t} \cdot t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-*l/ [<=] 100.0	\[ \frac{1 + \color{blue}{\left(\frac{\frac{2 \cdot t}{1 + t}}{1 + t} \cdot 2\right)} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   *-commutative [=>] 100.0	\[ \frac{1 + \color{blue}{\left(2 \cdot \frac{\frac{2 \cdot t}{1 + t}}{1 + t}\right)} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-*r/ [=>] 100.0	\[ \frac{1 + \color{blue}{\frac{2 \cdot \frac{2 \cdot t}{1 + t}}{1 + t}} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   *-commutative [=>] 100.0	\[ \frac{1 + \frac{\color{blue}{\frac{2 \cdot t}{1 + t} \cdot 2}}{1 + t} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-*l/ [=>] 99.9	\[ \frac{1 + \frac{\color{blue}{\frac{\left(2 \cdot t\right) \cdot 2}{1 + t}}}{1 + t} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   *-commutative [=>] 99.9	\[ \frac{1 + \frac{\frac{\color{blue}{\left(t \cdot 2\right)} \cdot 2}{1 + t}}{1 + t} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-*l* [=>] 99.9	\[ \frac{1 + \frac{\frac{\color{blue}{t \cdot \left(2 \cdot 2\right)}}{1 + t}}{1 + t} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   metadata-eval [=>] 99.9	\[ \frac{1 + \frac{\frac{t \cdot \color{blue}{4}}{1 + t}}{1 + t} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   associate-/l* [=>] 99.9	\[ \frac{1 + \frac{\frac{t \cdot 4}{1 + t}}{1 + t} \cdot t}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\frac{2}{\frac{1 + t}{t}}}} \]

3. Final simplification 100.0%

   \[\leadsto \frac{1 + t \cdot \frac{\frac{t \cdot 4}{1 + t}}{1 + t}}{t \cdot \frac{\frac{t \cdot 4}{1 + t}}{1 + t} + 2} \]

Alternatives

Alternative 1
Accuracy	99.2%
Cost	1480

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

Alternative 2
Accuracy	99.1%
Cost	968

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

Alternative 3
Accuracy	98.8%
Cost	584

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

Alternative 4
Accuracy	99.0%
Cost	584

\[\begin{array}{l} \mathbf{if}\;t \leq -0.9:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 0.56:\\ \;\;\;\;t \cdot t + 0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \end{array} \]

Alternative 5
Accuracy	98.6%
Cost	328

\[\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 6
Accuracy	59.3%
Cost	64

\[0.5 \]

Reproduce

herbie shell --seed 2023151 
(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))))))