Octave 3.8, jcobi/4, as called

Percentage Accurate: 27.7% → 99.5%

Time: 10.2s

Alternatives: 6

Speedup: 71.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.7% 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: 99.5% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{-4}{i \cdot i} + 16} \end{array} \]

FPCore

(FPCore (i) :precision binary64 (/ 1.0 (+ (/ -4.0 (* i i)) 16.0)))

C

double code(double i) {
	return 1.0 / ((-4.0 / (i * i)) + 16.0);
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    code = 1.0d0 / (((-4.0d0) / (i * i)) + 16.0d0)
end function

Java

public static double code(double i) {
	return 1.0 / ((-4.0 / (i * i)) + 16.0);
}

Python

def code(i):
	return 1.0 / ((-4.0 / (i * i)) + 16.0)

Julia

function code(i)
	return Float64(1.0 / Float64(Float64(-4.0 / Float64(i * i)) + 16.0))
end

MATLAB

function tmp = code(i)
	tmp = 1.0 / ((-4.0 / (i * i)) + 16.0);
end

Wolfram

code[i_] := N[(1.0 / N[(N[(-4.0 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 16.0), $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} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. clear-num N/A

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

   2. /-lowering-/.f64 N/A

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

   3. clear-num N/A

      \[\leadsto \frac{1}{\color{blue}{\frac{1}{\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}}}} \]

   4. associate-/r/ N/A

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

   5. clear-num N/A

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

   6. sub-neg N/A

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

   7. +-commutative N/A

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

   8. distribute-rgt-in N/A

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

   9. clear-num N/A

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

   10. div-inv N/A

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

4. Applied egg-rr 99.8%

   \[\leadsto \color{blue}{\frac{1}{\frac{-4}{i \cdot i} + 16}} \]
5. Add Preprocessing

Alternative 2: 99.5% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \mathsf{fma}\left(i \cdot \mathsf{fma}\left(i, i, 0\right), -1, i \cdot -0.25\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (if (<= i 0.5)
   (* i (fma (* i (fma i i 0.0)) -1.0 (* i -0.25)))
   (+ 0.0625 (/ 0.015625 (* i i)))))

C

double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * fma((i * fma(i, i, 0.0)), -1.0, (i * -0.25));
	} else {
		tmp = 0.0625 + (0.015625 / (i * i));
	}
	return tmp;
}

Julia

function code(i)
	tmp = 0.0
	if (i <= 0.5)
		tmp = Float64(i * fma(Float64(i * fma(i, i, 0.0)), -1.0, Float64(i * -0.25)));
	else
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	end
	return tmp
end

Wolfram

code[i_] := If[LessEqual[i, 0.5], N[(i * N[(N[(i * N[(i * i + 0.0), $MachinePrecision]), $MachinePrecision] * -1.0 + N[(i * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if i < 0.5

   1. Initial program 33.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. Add Preprocessing

   3. Taylor expanded in i around 0

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. +-rgt-identity N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. unpow2 N/A

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

      8. *-commutative N/A

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

      9. accelerator-lowering-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({i}^{2}, -1 \cdot {i}^{2} - \frac{1}{4}, 0\right)} \]

      10. +-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. accelerator-lowering-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(i, i, 0\right)}, -1 \cdot {i}^{2} - \frac{1}{4}, 0\right) \]

      13. sub-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{-1 \cdot {i}^{2} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right)}, 0\right) \]

      14. metadata-eval N/A

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

      15. +-commutative N/A

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

      16. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \frac{-1}{4} + \color{blue}{\left(\mathsf{neg}\left({i}^{2}\right)\right)}, 0\right) \]

      17. unsub-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{\frac{-1}{4} - {i}^{2}}, 0\right) \]

      18. --lowering--.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{\frac{-1}{4} - {i}^{2}}, 0\right) \]

      19. +-rgt-identity N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \frac{-1}{4} - \color{blue}{\left({i}^{2} + 0\right)}, 0\right) \]

      20. unpow2 N/A

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

      21. accelerator-lowering-fma.f64 99.1

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), -0.25 - \color{blue}{\mathsf{fma}\left(i, i, 0\right)}, 0\right) \]

   5. Simplified 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), -0.25 - \mathsf{fma}\left(i, i, 0\right), 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-commutative N/A

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

      3. +-rgt-identity N/A

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

      4. associate-*r* N/A

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

      5. *-lowering-*.f64 N/A

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

      6. *-lowering-*.f64 N/A

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

      7. --lowering--.f64 N/A

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

      8. accelerator-lowering-fma.f64 99.1

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

   7. Applied egg-rr 99.1%

      \[\leadsto \color{blue}{\left(\left(-0.25 - \mathsf{fma}\left(i, i, 0\right)\right) \cdot i\right) \cdot i} \]
   8. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 99.1

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

   9. Applied egg-rr 99.1%

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

       1. cancel-sign-sub-inv N/A

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

       2. +-commutative N/A

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

       3. *-commutative N/A

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

       4. distribute-lft-in N/A

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

       5. *-commutative N/A

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

       6. associate-*r* N/A

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

       7. neg-mul-1 N/A

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

       8. *-commutative N/A

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

       9. associate-*r* N/A

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

       10. pow3 N/A

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

       11. accelerator-lowering-fma.f64 N/A

           \[\leadsto \color{blue}{\mathsf{fma}\left({i}^{3}, -1, i \cdot \frac{-1}{4}\right)} \cdot i \]

       12. cube-unmult N/A

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

       13. *-lowering-*.f64 N/A

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

       14. +-lft-identity N/A

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

       15. +-commutative N/A

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

       16. distribute-rgt-out N/A

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

       17. mul0-lft N/A

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

       18. accelerator-lowering-fma.f64 N/A

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

       19. *-lowering-*.f64 99.1

           \[\leadsto \mathsf{fma}\left(i \cdot \mathsf{fma}\left(i, i, 0\right), -1, \color{blue}{i \cdot -0.25}\right) \cdot i \]

   11. Applied egg-rr 99.1%

       \[\leadsto \color{blue}{\mathsf{fma}\left(i \cdot \mathsf{fma}\left(i, i, 0\right), -1, i \cdot -0.25\right)} \cdot i \]

   if 0.5 < i

   1. Initial program 25.9%

      \[\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. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

      2. associate-*r/ N/A

         \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

      3. metadata-eval N/A

         \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

      5. +-rgt-identity N/A

         \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{{i}^{2} + 0}} \]

      6. unpow2 N/A

         \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i} + 0} \]

      7. accelerator-lowering-fma.f64 99.3

         \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{\mathsf{fma}\left(i, i, 0\right)}} \]

   5. Simplified 99.3%

      \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{\mathsf{fma}\left(i, i, 0\right)}} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

         \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

      2. *-lowering-*.f64 99.3

         \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   7. Applied egg-rr 99.3%

      \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \mathsf{fma}\left(i \cdot \mathsf{fma}\left(i, i, 0\right), -1, i \cdot -0.25\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.5% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \left(i \cdot \left(-0.25 - i \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (if (<= i 0.5) (* i (* i (- -0.25 (* i i)))) (+ 0.0625 (/ 0.015625 (* i i)))))

C

double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * (i * (-0.25 - (i * i)));
	} else {
		tmp = 0.0625 + (0.015625 / (i * i));
	}
	return tmp;
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: tmp
    if (i <= 0.5d0) then
        tmp = i * (i * ((-0.25d0) - (i * i)))
    else
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    end if
    code = tmp
end function

Java

public static double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * (i * (-0.25 - (i * i)));
	} else {
		tmp = 0.0625 + (0.015625 / (i * i));
	}
	return tmp;
}

Python

def code(i):
	tmp = 0
	if i <= 0.5:
		tmp = i * (i * (-0.25 - (i * i)))
	else:
		tmp = 0.0625 + (0.015625 / (i * i))
	return tmp

Julia

function code(i)
	tmp = 0.0
	if (i <= 0.5)
		tmp = Float64(i * Float64(i * Float64(-0.25 - Float64(i * i))));
	else
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(i)
	tmp = 0.0;
	if (i <= 0.5)
		tmp = i * (i * (-0.25 - (i * i)));
	else
		tmp = 0.0625 + (0.015625 / (i * i));
	end
	tmp_2 = tmp;
end

Wolfram

code[i_] := If[LessEqual[i, 0.5], N[(i * N[(i * N[(-0.25 - N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if i < 0.5

   1. Initial program 33.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. Add Preprocessing

   3. Taylor expanded in i around 0

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. +-rgt-identity N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. unpow2 N/A

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

      8. *-commutative N/A

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

      9. accelerator-lowering-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({i}^{2}, -1 \cdot {i}^{2} - \frac{1}{4}, 0\right)} \]

      10. +-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. accelerator-lowering-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(i, i, 0\right)}, -1 \cdot {i}^{2} - \frac{1}{4}, 0\right) \]

      13. sub-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{-1 \cdot {i}^{2} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right)}, 0\right) \]

      14. metadata-eval N/A

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

      15. +-commutative N/A

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

      16. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \frac{-1}{4} + \color{blue}{\left(\mathsf{neg}\left({i}^{2}\right)\right)}, 0\right) \]

      17. unsub-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{\frac{-1}{4} - {i}^{2}}, 0\right) \]

      18. --lowering--.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{\frac{-1}{4} - {i}^{2}}, 0\right) \]

      19. +-rgt-identity N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \frac{-1}{4} - \color{blue}{\left({i}^{2} + 0\right)}, 0\right) \]

      20. unpow2 N/A

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

      21. accelerator-lowering-fma.f64 99.1

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), -0.25 - \color{blue}{\mathsf{fma}\left(i, i, 0\right)}, 0\right) \]

   5. Simplified 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), -0.25 - \mathsf{fma}\left(i, i, 0\right), 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-commutative N/A

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

      3. +-rgt-identity N/A

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

      4. associate-*r* N/A

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

      5. *-lowering-*.f64 N/A

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

      6. *-lowering-*.f64 N/A

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

      7. --lowering--.f64 N/A

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

      8. accelerator-lowering-fma.f64 99.1

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

   7. Applied egg-rr 99.1%

      \[\leadsto \color{blue}{\left(\left(-0.25 - \mathsf{fma}\left(i, i, 0\right)\right) \cdot i\right) \cdot i} \]
   8. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 99.1

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

   9. Applied egg-rr 99.1%

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

   if 0.5 < i

   1. Initial program 25.9%

      \[\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. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

      2. associate-*r/ N/A

         \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

      3. metadata-eval N/A

         \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

      5. +-rgt-identity N/A

         \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{{i}^{2} + 0}} \]

      6. unpow2 N/A

         \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i} + 0} \]

      7. accelerator-lowering-fma.f64 99.3

         \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{\mathsf{fma}\left(i, i, 0\right)}} \]

   5. Simplified 99.3%

      \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{\mathsf{fma}\left(i, i, 0\right)}} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

         \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

      2. *-lowering-*.f64 99.3

         \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   7. Applied egg-rr 99.3%

      \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \left(i \cdot \left(-0.25 - i \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.2% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \left(i \cdot \left(-0.25 - i \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \end{array} \]

FPCore

(FPCore (i)
 :precision binary64
 (if (<= i 0.5) (* i (* i (- -0.25 (* i i)))) 0.0625))

C

double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * (i * (-0.25 - (i * i)));
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: tmp
    if (i <= 0.5d0) then
        tmp = i * (i * ((-0.25d0) - (i * i)))
    else
        tmp = 0.0625d0
    end if
    code = tmp
end function

Java

public static double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * (i * (-0.25 - (i * i)));
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Python

def code(i):
	tmp = 0
	if i <= 0.5:
		tmp = i * (i * (-0.25 - (i * i)))
	else:
		tmp = 0.0625
	return tmp

Julia

function code(i)
	tmp = 0.0
	if (i <= 0.5)
		tmp = Float64(i * Float64(i * Float64(-0.25 - Float64(i * i))));
	else
		tmp = 0.0625;
	end
	return tmp
end

MATLAB

function tmp_2 = code(i)
	tmp = 0.0;
	if (i <= 0.5)
		tmp = i * (i * (-0.25 - (i * i)));
	else
		tmp = 0.0625;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if i < 0.5

   1. Initial program 33.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. Add Preprocessing

   3. Taylor expanded in i around 0

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. +-rgt-identity N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. unpow2 N/A

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

      8. *-commutative N/A

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

      9. accelerator-lowering-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({i}^{2}, -1 \cdot {i}^{2} - \frac{1}{4}, 0\right)} \]

      10. +-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. accelerator-lowering-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(i, i, 0\right)}, -1 \cdot {i}^{2} - \frac{1}{4}, 0\right) \]

      13. sub-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{-1 \cdot {i}^{2} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right)}, 0\right) \]

      14. metadata-eval N/A

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

      15. +-commutative N/A

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

      16. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \frac{-1}{4} + \color{blue}{\left(\mathsf{neg}\left({i}^{2}\right)\right)}, 0\right) \]

      17. unsub-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{\frac{-1}{4} - {i}^{2}}, 0\right) \]

      18. --lowering--.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \color{blue}{\frac{-1}{4} - {i}^{2}}, 0\right) \]

      19. +-rgt-identity N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), \frac{-1}{4} - \color{blue}{\left({i}^{2} + 0\right)}, 0\right) \]

      20. unpow2 N/A

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

      21. accelerator-lowering-fma.f64 99.1

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), -0.25 - \color{blue}{\mathsf{fma}\left(i, i, 0\right)}, 0\right) \]

   5. Simplified 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(i, i, 0\right), -0.25 - \mathsf{fma}\left(i, i, 0\right), 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-commutative N/A

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

      3. +-rgt-identity N/A

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

      4. associate-*r* N/A

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

      5. *-lowering-*.f64 N/A

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

      6. *-lowering-*.f64 N/A

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

      7. --lowering--.f64 N/A

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

      8. accelerator-lowering-fma.f64 99.1

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

   7. Applied egg-rr 99.1%

      \[\leadsto \color{blue}{\left(\left(-0.25 - \mathsf{fma}\left(i, i, 0\right)\right) \cdot i\right) \cdot i} \]
   8. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 99.1

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

   9. Applied egg-rr 99.1%

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

   if 0.5 < i

   1. Initial program 25.9%

      \[\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. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Simplified 98.8%

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

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \left(i \cdot \left(-0.25 - i \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.0% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \left(i \cdot -0.25\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \end{array} \]

FPCore

(FPCore (i) :precision binary64 (if (<= i 0.5) (* i (* i -0.25)) 0.0625))

C

double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * (i * -0.25);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Fortran

real(8) function code(i)
    real(8), intent (in) :: i
    real(8) :: tmp
    if (i <= 0.5d0) then
        tmp = i * (i * (-0.25d0))
    else
        tmp = 0.0625d0
    end if
    code = tmp
end function

Java

public static double code(double i) {
	double tmp;
	if (i <= 0.5) {
		tmp = i * (i * -0.25);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Python

def code(i):
	tmp = 0
	if i <= 0.5:
		tmp = i * (i * -0.25)
	else:
		tmp = 0.0625
	return tmp

Julia

function code(i)
	tmp = 0.0
	if (i <= 0.5)
		tmp = Float64(i * Float64(i * -0.25));
	else
		tmp = 0.0625;
	end
	return tmp
end

MATLAB

function tmp_2 = code(i)
	tmp = 0.0;
	if (i <= 0.5)
		tmp = i * (i * -0.25);
	else
		tmp = 0.0625;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if i < 0.5

   1. Initial program 33.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. Add Preprocessing

   3. Taylor expanded in i around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot {i}^{2}} \]
   4. Step-by-step derivation

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{\frac{-1}{4} \cdot {i}^{2} + 0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{{i}^{2} \cdot \frac{-1}{4}} + 0 \]

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. accelerator-lowering-fma.f64 N/A

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

      6. +-rgt-identity N/A

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

      7. accelerator-lowering-fma.f64 98.6

         \[\leadsto \mathsf{fma}\left(i, \color{blue}{\mathsf{fma}\left(i, -0.25, 0\right)}, 0\right) \]

   5. Simplified 98.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(i, \mathsf{fma}\left(i, -0.25, 0\right), 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 98.6

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

   7. Applied egg-rr 98.6%

      \[\leadsto \mathsf{fma}\left(i, \color{blue}{i \cdot -0.25}, 0\right) \]
   8. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. *-lowering-*.f64 98.6

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

   9. Applied egg-rr 98.6%

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

   if 0.5 < i

   1. Initial program 25.9%

      \[\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. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Simplified 98.8%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 0.5:\\ \;\;\;\;i \cdot \left(i \cdot -0.25\right)\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 50.5% accurate, 71.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. Add Preprocessing

3. Taylor expanded in i around inf

   \[\leadsto \color{blue}{\frac{1}{16}} \]
4. Step-by-step derivation

5. Simplified 53.4%

   \[\leadsto \color{blue}{0.0625} \]
6. Add Preprocessing

Reproduce

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