Octave 3.8, jcobi/4, as called

Percentage Accurate: 27.3% → 75.1%

Time: 5.0s

Alternatives: 5

Speedup: 25.0×

Specification

\[i > 0\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(2 \cdot i\right) \cdot \left(2 \cdot i\right)\\ \frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{t\_0}}{t\_0 - 1} \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (let* ((t_0 (* (* 2.0 i) (* 2.0 i))))
   (/ (/ (* (* i i) (* i i)) t_0) (- t_0 1.0))))

C

double code(double i) {
	double t_0 = (2.0 * i) * (2.0 * i);
	return (((i * i) * (i * i)) / t_0) / (t_0 - 1.0);
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: t_0
    t_0 = (2.0d0 * i) * (2.0d0 * i)
    code = (((i * i) * (i * i)) / t_0) / (t_0 - 1.0d0)
end function

Java

public static double code(double i) {
	double t_0 = (2.0 * i) * (2.0 * i);
	return (((i * i) * (i * i)) / t_0) / (t_0 - 1.0);
}

Python

def code(i):
	t_0 = (2.0 * i) * (2.0 * i)
	return (((i * i) * (i * i)) / t_0) / (t_0 - 1.0)

Julia

function code(i)
	t_0 = Float64(Float64(2.0 * i) * Float64(2.0 * i))
	return Float64(Float64(Float64(Float64(i * i) * Float64(i * i)) / t_0) / Float64(t_0 - 1.0))
end

MATLAB

function tmp = code(i)
	t_0 = (2.0 * i) * (2.0 * i);
	tmp = (((i * i) * (i * i)) / t_0) / (t_0 - 1.0);
end

Wolfram

code[i_] := Block[{t$95$0 = N[(N[(2.0 * i), $MachinePrecision] * N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(i * i), $MachinePrecision] * N[(i * i), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]]

Initial Program: 27.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(2 \cdot i\right) \cdot \left(2 \cdot i\right)\\ \frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{t\_0}}{t\_0 - 1} \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (let* ((t_0 (* (* 2.0 i) (* 2.0 i))))
   (/ (/ (* (* i i) (* i i)) t_0) (- t_0 1.0))))

C

double code(double i) {
	double t_0 = (2.0 * i) * (2.0 * i);
	return (((i * i) * (i * i)) / t_0) / (t_0 - 1.0);
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: t_0
    t_0 = (2.0d0 * i) * (2.0d0 * i)
    code = (((i * i) * (i * i)) / t_0) / (t_0 - 1.0d0)
end function

Java

public static double code(double i) {
	double t_0 = (2.0 * i) * (2.0 * i);
	return (((i * i) * (i * i)) / t_0) / (t_0 - 1.0);
}

Python

def code(i):
	t_0 = (2.0 * i) * (2.0 * i)
	return (((i * i) * (i * i)) / t_0) / (t_0 - 1.0)

Julia

function code(i)
	t_0 = Float64(Float64(2.0 * i) * Float64(2.0 * i))
	return Float64(Float64(Float64(Float64(i * i) * Float64(i * i)) / t_0) / Float64(t_0 - 1.0))
end

MATLAB

function tmp = code(i)
	t_0 = (2.0 * i) * (2.0 * i);
	tmp = (((i * i) * (i * i)) / t_0) / (t_0 - 1.0);
end

Wolfram

code[i_] := Block[{t$95$0 = N[(N[(2.0 * i), $MachinePrecision] * N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(i * i), $MachinePrecision] * N[(i * i), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 75.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ 0.25 \cdot \left(i \cdot \frac{i}{\mathsf{fma}\left(i, i \cdot 4, -1\right)}\right) \end{array} \]

FPCore

(FPCore (i) :precision binary64 (* 0.25 (* i (/ i (fma i (* i 4.0) -1.0)))))

C

double code(double i) {
	return 0.25 * (i * (i / fma(i, (i * 4.0), -1.0)));
}

Julia

function code(i)
	return Float64(0.25 * Float64(i * Float64(i / fma(i, Float64(i * 4.0), -1.0))))
end

Wolfram

code[i_] := N[(0.25 * N[(i * N[(i / N[(i * N[(i * 4.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 29.6%

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

3. Simplified 75.0%

   \[\leadsto \color{blue}{0.25 \cdot \left(i \cdot \frac{i}{\mathsf{fma}\left(i, i \cdot 4, -1\right)}\right)} \]
4. Add Preprocessing

5. Final simplification 75.0%

   \[\leadsto 0.25 \cdot \left(i \cdot \frac{i}{\mathsf{fma}\left(i, i \cdot 4, -1\right)}\right) \]
6. Add Preprocessing

Alternative 2: 61.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(i \cdot 2\right) \cdot \left(i \cdot 2\right)\\ \mathbf{if}\;i \leq 2 \cdot 10^{-52}:\\ \;\;\;\;0.25 \cdot \left(i \cdot \left(-i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{t\_0}}{-1 + t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (let* ((t_0 (* (* i 2.0) (* i 2.0))))
   (if (<= i 2e-52)
     (* 0.25 (* i (- i)))
     (/ (/ (* (* i i) (* i i)) t_0) (+ -1.0 t_0)))))

C

double code(double i) {
	double t_0 = (i * 2.0) * (i * 2.0);
	double tmp;
	if (i <= 2e-52) {
		tmp = 0.25 * (i * -i);
	} else {
		tmp = (((i * i) * (i * i)) / t_0) / (-1.0 + t_0);
	}
	return tmp;
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (i * 2.0d0) * (i * 2.0d0)
    if (i <= 2d-52) then
        tmp = 0.25d0 * (i * -i)
    else
        tmp = (((i * i) * (i * i)) / t_0) / ((-1.0d0) + t_0)
    end if
    code = tmp
end function

Java

public static double code(double i) {
	double t_0 = (i * 2.0) * (i * 2.0);
	double tmp;
	if (i <= 2e-52) {
		tmp = 0.25 * (i * -i);
	} else {
		tmp = (((i * i) * (i * i)) / t_0) / (-1.0 + t_0);
	}
	return tmp;
}

Python

def code(i):
	t_0 = (i * 2.0) * (i * 2.0)
	tmp = 0
	if i <= 2e-52:
		tmp = 0.25 * (i * -i)
	else:
		tmp = (((i * i) * (i * i)) / t_0) / (-1.0 + t_0)
	return tmp

Julia

function code(i)
	t_0 = Float64(Float64(i * 2.0) * Float64(i * 2.0))
	tmp = 0.0
	if (i <= 2e-52)
		tmp = Float64(0.25 * Float64(i * Float64(-i)));
	else
		tmp = Float64(Float64(Float64(Float64(i * i) * Float64(i * i)) / t_0) / Float64(-1.0 + t_0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(i)
	t_0 = (i * 2.0) * (i * 2.0);
	tmp = 0.0;
	if (i <= 2e-52)
		tmp = 0.25 * (i * -i);
	else
		tmp = (((i * i) * (i * i)) / t_0) / (-1.0 + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

code[i_] := Block[{t$95$0 = N[(N[(i * 2.0), $MachinePrecision] * N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 2e-52], N[(0.25 * N[(i * (-i)), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * i), $MachinePrecision] * N[(i * i), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if i < 2e-52

   1. Initial program 20.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{0.25 \cdot \left(i \cdot \frac{i}{\mathsf{fma}\left(i, i \cdot 4, -1\right)}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in i around 0 100.0%

      \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-1 \cdot i\right)}\right) \]
   6. Step-by-step derivation

      1. neg-mul-1 100.0%

         \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-i\right)}\right) \]

   7. Simplified 100.0%

      \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-i\right)}\right) \]

   if 2e-52 < i

   1. Initial program 36.8%

      \[\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right)}}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right) - 1} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 64.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 2 \cdot 10^{-52}:\\ \;\;\;\;0.25 \cdot \left(i \cdot \left(-i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(i \cdot 2\right) \cdot \left(i \cdot 2\right)}}{-1 + \left(i \cdot 2\right) \cdot \left(i \cdot 2\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 61.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 4 \cdot \left(i \cdot i\right)\\ \mathbf{if}\;i \leq 2 \cdot 10^{-52}:\\ \;\;\;\;0.25 \cdot \left(i \cdot \left(-i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{t\_0 \cdot \left(-1 + t\_0\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (let* ((t_0 (* 4.0 (* i i))))
   (if (<= i 2e-52)
     (* 0.25 (* i (- i)))
     (/ (* (* i i) (* i i)) (* t_0 (+ -1.0 t_0))))))

C

double code(double i) {
	double t_0 = 4.0 * (i * i);
	double tmp;
	if (i <= 2e-52) {
		tmp = 0.25 * (i * -i);
	} else {
		tmp = ((i * i) * (i * i)) / (t_0 * (-1.0 + t_0));
	}
	return tmp;
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 4.0d0 * (i * i)
    if (i <= 2d-52) then
        tmp = 0.25d0 * (i * -i)
    else
        tmp = ((i * i) * (i * i)) / (t_0 * ((-1.0d0) + t_0))
    end if
    code = tmp
end function

Java

public static double code(double i) {
	double t_0 = 4.0 * (i * i);
	double tmp;
	if (i <= 2e-52) {
		tmp = 0.25 * (i * -i);
	} else {
		tmp = ((i * i) * (i * i)) / (t_0 * (-1.0 + t_0));
	}
	return tmp;
}

Python

def code(i):
	t_0 = 4.0 * (i * i)
	tmp = 0
	if i <= 2e-52:
		tmp = 0.25 * (i * -i)
	else:
		tmp = ((i * i) * (i * i)) / (t_0 * (-1.0 + t_0))
	return tmp

Julia

function code(i)
	t_0 = Float64(4.0 * Float64(i * i))
	tmp = 0.0
	if (i <= 2e-52)
		tmp = Float64(0.25 * Float64(i * Float64(-i)));
	else
		tmp = Float64(Float64(Float64(i * i) * Float64(i * i)) / Float64(t_0 * Float64(-1.0 + t_0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(i)
	t_0 = 4.0 * (i * i);
	tmp = 0.0;
	if (i <= 2e-52)
		tmp = 0.25 * (i * -i);
	else
		tmp = ((i * i) * (i * i)) / (t_0 * (-1.0 + t_0));
	end
	tmp_2 = tmp;
end

Wolfram

code[i_] := Block[{t$95$0 = N[(4.0 * N[(i * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 2e-52], N[(0.25 * N[(i * (-i)), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i * i), $MachinePrecision] * N[(i * i), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if i < 2e-52

   1. Initial program 20.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{0.25 \cdot \left(i \cdot \frac{i}{\mathsf{fma}\left(i, i \cdot 4, -1\right)}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in i around 0 100.0%

      \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-1 \cdot i\right)}\right) \]
   6. Step-by-step derivation

      1. neg-mul-1 100.0%

         \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-i\right)}\right) \]

   7. Simplified 100.0%

      \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-i\right)}\right) \]

   if 2e-52 < i

   1. Initial program 36.8%

      \[\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right)}}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right) - 1} \]
   2. Step-by-step derivation

      1. associate-/l/ 36.3%

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

      2. sub-neg 36.3%

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

      3. swap-sqr 36.3%

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

      4. metadata-eval 36.3%

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

      5. metadata-eval 36.3%

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

      6. swap-sqr 36.3%

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

      7. metadata-eval 36.3%

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

   3. Simplified 36.3%

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

4. Final simplification 63.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 2 \cdot 10^{-52}:\\ \;\;\;\;0.25 \cdot \left(i \cdot \left(-i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(4 \cdot \left(i \cdot i\right)\right) \cdot \left(-1 + 4 \cdot \left(i \cdot i\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 49.2% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ 0.25 \cdot \left(i \cdot \left(-i\right)\right) \end{array} \]

FPCore

(FPCore (i) :precision binary64 (* 0.25 (* i (- i))))

C

double code(double i) {
	return 0.25 * (i * -i);
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    code = 0.25d0 * (i * -i)
end function

Java

public static double code(double i) {
	return 0.25 * (i * -i);
}

Python

def code(i):
	return 0.25 * (i * -i)

Julia

function code(i)
	return Float64(0.25 * Float64(i * Float64(-i)))
end

MATLAB

function tmp = code(i)
	tmp = 0.25 * (i * -i);
end

Wolfram

code[i_] := N[(0.25 * N[(i * (-i)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 29.6%

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

3. Simplified 75.0%

   \[\leadsto \color{blue}{0.25 \cdot \left(i \cdot \frac{i}{\mathsf{fma}\left(i, i \cdot 4, -1\right)}\right)} \]
4. Add Preprocessing

5. Taylor expanded in i around 0 51.6%

   \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-1 \cdot i\right)}\right) \]
6. Step-by-step derivation

   1. neg-mul-1 51.6%

      \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-i\right)}\right) \]

7. Simplified 51.6%

   \[\leadsto 0.25 \cdot \left(i \cdot \color{blue}{\left(-i\right)}\right) \]

8. Final simplification 51.6%

   \[\leadsto 0.25 \cdot \left(i \cdot \left(-i\right)\right) \]
9. Add Preprocessing

Alternative 5: 51.6% accurate, 25.0× speedup

Math

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

FPCore

(FPCore (i) :precision binary64 0.0625)

C

double code(double i) {
	return 0.0625;
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    code = 0.0625d0
end function

Java

public static double code(double i) {
	return 0.0625;
}

Python

def code(i):
	return 0.0625

Julia

function code(i)
	return 0.0625
end

MATLAB

function tmp = code(i)
	tmp = 0.0625;
end

Wolfram

code[i_] := 0.0625

Derivation

1. Initial program 29.6%

   \[\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right)}}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right) - 1} \]
2. Step-by-step derivation

   1. associate-/l/ 29.3%

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

   2. sub-neg 29.3%

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

   3. swap-sqr 29.3%

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

   4. metadata-eval 29.3%

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

   5. metadata-eval 29.3%

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

   6. swap-sqr 29.3%

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

   7. metadata-eval 29.3%

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

3. Simplified 29.3%

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

5. Taylor expanded in i around inf 49.4%

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

6. Final simplification 49.4%

   \[\leadsto 0.0625 \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024066 
(FPCore (i)
  :name "Octave 3.8, jcobi/4, as called"
  :precision binary64
  :pre (> i 0.0)
  (/ (/ (* (* i i) (* i i)) (* (* 2.0 i) (* 2.0 i))) (- (* (* 2.0 i) (* 2.0 i)) 1.0)))