x / (x^2 + 1)

Percentage Accurate: 77.1% → 99.9%

Time: 2.3s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x}{x \cdot x + 1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x (+ (* x x) 1.0)))

C

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

Fortran

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

Java

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

Python

def code(x):
	return x / ((x * x) + 1.0)

Julia

function code(x)
	return Float64(x / Float64(Float64(x * x) + 1.0))
end

MATLAB

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

Wolfram

code[x_] := N[(x / N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 77.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x \cdot x + 1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x (+ (* x x) 1.0)))

C

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

Fortran

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

Java

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

Python

def code(x):
	return x / ((x * x) + 1.0)

Julia

function code(x)
	return Float64(x / Float64(Float64(x * x) + 1.0))
end

MATLAB

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

Wolfram

code[x_] := N[(x / N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+63} \lor \neg \left(x \leq 50000\right):\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1e+63) (not (<= x 50000.0))) (/ 1.0 x) (/ x (+ 1.0 (* x x)))))

C

double code(double x) {
	double tmp;
	if ((x <= -1e+63) || !(x <= 50000.0)) {
		tmp = 1.0 / x;
	} else {
		tmp = x / (1.0 + (x * x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1d+63)) .or. (.not. (x <= 50000.0d0))) then
        tmp = 1.0d0 / x
    else
        tmp = x / (1.0d0 + (x * x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1e+63) || !(x <= 50000.0)) {
		tmp = 1.0 / x;
	} else {
		tmp = x / (1.0 + (x * x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1e+63) or not (x <= 50000.0):
		tmp = 1.0 / x
	else:
		tmp = x / (1.0 + (x * x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1e+63) || !(x <= 50000.0))
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(x / Float64(1.0 + Float64(x * x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1e+63) || ~((x <= 50000.0)))
		tmp = 1.0 / x;
	else
		tmp = x / (1.0 + (x * x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1e+63], N[Not[LessEqual[x, 50000.0]], $MachinePrecision]], N[(1.0 / x), $MachinePrecision], N[(x / N[(1.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.00000000000000006e63 or 5e4 < x

   1. Initial program 50.0%

      \[\frac{x}{x \cdot x + 1} \]

   2. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{\frac{1}{x}} \]

   if -1.00000000000000006e63 < x < 5e4

   1. Initial program 100.0%

      \[\frac{x}{x \cdot x + 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+63} \lor \neg \left(x \leq 50000\right):\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + x \cdot x}\\ \end{array} \]

Alternative 2: 99.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ {\left(x + \frac{1}{x}\right)}^{-1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (pow (+ x (/ 1.0 x)) -1.0))

C

double code(double x) {
	return pow((x + (1.0 / x)), -1.0);
}

Fortran

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

Java

public static double code(double x) {
	return Math.pow((x + (1.0 / x)), -1.0);
}

Python

def code(x):
	return math.pow((x + (1.0 / x)), -1.0)

Julia

function code(x)
	return Float64(x + Float64(1.0 / x)) ^ -1.0
end

MATLAB

function tmp = code(x)
	tmp = (x + (1.0 / x)) ^ -1.0;
end

Wolfram

code[x_] := N[Power[N[(x + N[(1.0 / x), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]

Derivation

1. Initial program 78.5%

   \[\frac{x}{x \cdot x + 1} \]
2. Step-by-step derivation

   1. clear-num 78.4%

      \[\leadsto \color{blue}{\frac{1}{\frac{x \cdot x + 1}{x}}} \]

   2. inv-pow 78.4%

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

   3. fma-def 78.4%

      \[\leadsto {\left(\frac{\color{blue}{\mathsf{fma}\left(x, x, 1\right)}}{x}\right)}^{-1} \]

3. Applied egg-rr 78.4%

   \[\leadsto \color{blue}{{\left(\frac{\mathsf{fma}\left(x, x, 1\right)}{x}\right)}^{-1}} \]

4. Taylor expanded in x around 0 99.8%

   \[\leadsto {\color{blue}{\left(x + \frac{1}{x}\right)}}^{-1} \]

5. Final simplification 99.8%

   \[\leadsto {\left(x + \frac{1}{x}\right)}^{-1} \]

Alternative 3: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.0) (not (<= x 1.0))) (/ 1.0 x) x))

C

double code(double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.0)) {
		tmp = 1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.0d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = 1.0d0 / x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.0)) {
		tmp = 1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1.0) or not (x <= 1.0):
		tmp = 1.0 / x
	else:
		tmp = x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.0) || !(x <= 1.0))
		tmp = Float64(1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1.0) || ~((x <= 1.0)))
		tmp = 1.0 / x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1.0], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(1.0 / x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 54.5%

      \[\frac{x}{x \cdot x + 1} \]

   2. Taylor expanded in x around inf 99.3%

      \[\leadsto \color{blue}{\frac{1}{x}} \]

   if -1 < x < 1

   1. Initial program 100.0%

      \[\frac{x}{x \cdot x + 1} \]

   2. Taylor expanded in x around 0 99.1%

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

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 4: 52.6% accurate, 7.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 x)

C

double code(double x) {
	return x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x
end function

Java

public static double code(double x) {
	return x;
}

Python

def code(x):
	return x

Julia

function code(x)
	return x
end

MATLAB

function tmp = code(x)
	tmp = x;
end

Wolfram

code[x_] := x

Derivation

1. Initial program 78.5%

   \[\frac{x}{x \cdot x + 1} \]

2. Taylor expanded in x around 0 54.0%

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

3. Final simplification 54.0%

   \[\leadsto x \]

Developer target: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{x + \frac{1}{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ x (/ 1.0 x))))

C

double code(double x) {
	return 1.0 / (x + (1.0 / x));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 / (x + (1.0 / x));
}

Python

def code(x):
	return 1.0 / (x + (1.0 / x))

Julia

function code(x)
	return Float64(1.0 / Float64(x + Float64(1.0 / x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (x + (1.0 / x));
end

Wolfram

code[x_] := N[(1.0 / N[(x + N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023305 
(FPCore (x)
  :name "x / (x^2 + 1)"
  :precision binary64

  :herbie-target
  (/ 1.0 (+ x (/ 1.0 x)))

  (/ x (+ (* x x) 1.0)))