Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, C

Percentage Accurate: 100.0% → 100.0%

Time: 8.7s

Alternatives: 10

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* x (+ 0.99229 (* x 0.04481))))) x))

C

double code(double x) {
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Fortran

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

Java

public static double code(double x) {
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Python

def code(x):
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x

Julia

function code(x)
	return Float64(Float64(Float64(2.30753 + Float64(x * 0.27061)) / Float64(1.0 + Float64(x * Float64(0.99229 + Float64(x * 0.04481))))) - x)
end

MATLAB

function tmp = code(x)
	tmp = ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
end

Wolfram

code[x_] := N[(N[(N[(2.30753 + N[(x * 0.27061), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(x * N[(0.99229 + N[(x * 0.04481), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* x (+ 0.99229 (* x 0.04481))))) x))

C

double code(double x) {
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Fortran

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

Java

public static double code(double x) {
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Python

def code(x):
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x

Julia

function code(x)
	return Float64(Float64(Float64(2.30753 + Float64(x * 0.27061)) / Float64(1.0 + Float64(x * Float64(0.99229 + Float64(x * 0.04481))))) - x)
end

MATLAB

function tmp = code(x)
	tmp = ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
end

Wolfram

code[x_] := N[(N[(N[(2.30753 + N[(x * 0.27061), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(x * N[(0.99229 + N[(x * 0.04481), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* x (+ 0.99229 (* x 0.04481))))) x))

C

double code(double x) {
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Fortran

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

Java

public static double code(double x) {
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Python

def code(x):
	return ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x

Julia

function code(x)
	return Float64(Float64(Float64(2.30753 + Float64(x * 0.27061)) / Float64(1.0 + Float64(x * Float64(0.99229 + Float64(x * 0.04481))))) - x)
end

MATLAB

function tmp = code(x)
	tmp = ((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
end

Wolfram

code[x_] := N[(N[(N[(2.30753 + N[(x * 0.27061), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(x * N[(0.99229 + N[(x * 0.04481), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 99.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.9:\\ \;\;\;\;\frac{6.039053782637804 - \frac{82.23527511657367}{x}}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;\left(2.30753 + x \cdot \left(x \cdot 1.900161040244073 - 2.0191289437\right)\right) - x\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -4.9)
   (- (/ (- 6.039053782637804 (/ 82.23527511657367 x)) x) x)
   (if (<= x 1.15)
     (- (+ 2.30753 (* x (- (* x 1.900161040244073) 2.0191289437))) x)
     (- x))))

C

double code(double x) {
	double tmp;
	if (x <= -4.9) {
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x;
	} else if (x <= 1.15) {
		tmp = (2.30753 + (x * ((x * 1.900161040244073) - 2.0191289437))) - x;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-4.9d0)) then
        tmp = ((6.039053782637804d0 - (82.23527511657367d0 / x)) / x) - x
    else if (x <= 1.15d0) then
        tmp = (2.30753d0 + (x * ((x * 1.900161040244073d0) - 2.0191289437d0))) - x
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -4.9) {
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x;
	} else if (x <= 1.15) {
		tmp = (2.30753 + (x * ((x * 1.900161040244073) - 2.0191289437))) - x;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -4.9:
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x
	elif x <= 1.15:
		tmp = (2.30753 + (x * ((x * 1.900161040244073) - 2.0191289437))) - x
	else:
		tmp = -x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -4.9)
		tmp = Float64(Float64(Float64(6.039053782637804 - Float64(82.23527511657367 / x)) / x) - x);
	elseif (x <= 1.15)
		tmp = Float64(Float64(2.30753 + Float64(x * Float64(Float64(x * 1.900161040244073) - 2.0191289437))) - x);
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -4.9)
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x;
	elseif (x <= 1.15)
		tmp = (2.30753 + (x * ((x * 1.900161040244073) - 2.0191289437))) - x;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -4.9], N[(N[(N[(6.039053782637804 - N[(82.23527511657367 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] - x), $MachinePrecision], If[LessEqual[x, 1.15], N[(N[(2.30753 + N[(x * N[(N[(x * 1.900161040244073), $MachinePrecision] - 2.0191289437), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision], (-x)]]

Derivation

1. Split input into 3 regimes

2. if x < -4.9000000000000004

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{\frac{6.039053782637804 - 82.23527511657367 \cdot \frac{1}{x}}{x}} - x \]
   4. Step-by-step derivation

      1. associate-*r/ 100.0%

         \[\leadsto \frac{6.039053782637804 - \color{blue}{\frac{82.23527511657367 \cdot 1}{x}}}{x} - x \]

      2. metadata-eval 100.0%

         \[\leadsto \frac{6.039053782637804 - \frac{\color{blue}{82.23527511657367}}{x}}{x} - x \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{6.039053782637804 - \frac{82.23527511657367}{x}}{x}} - x \]

   if -4.9000000000000004 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.9%

      \[\leadsto \color{blue}{\left(2.30753 + x \cdot \left(1.900161040244073 \cdot x - 2.0191289437\right)\right)} - x \]

   if 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.9:\\ \;\;\;\;\frac{6.039053782637804 - \frac{82.23527511657367}{x}}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;\left(2.30753 + x \cdot \left(x \cdot 1.900161040244073 - 2.0191289437\right)\right) - x\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.9:\\ \;\;\;\;\frac{6.039053782637804 - \frac{82.23527511657367}{x}}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;2.30753 + x \cdot \left(x \cdot 1.900161040244073 - 3.0191289437\right)\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -4.9)
   (- (/ (- 6.039053782637804 (/ 82.23527511657367 x)) x) x)
   (if (<= x 1.15)
     (+ 2.30753 (* x (- (* x 1.900161040244073) 3.0191289437)))
     (- x))))

C

double code(double x) {
	double tmp;
	if (x <= -4.9) {
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x;
	} else if (x <= 1.15) {
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437));
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-4.9d0)) then
        tmp = ((6.039053782637804d0 - (82.23527511657367d0 / x)) / x) - x
    else if (x <= 1.15d0) then
        tmp = 2.30753d0 + (x * ((x * 1.900161040244073d0) - 3.0191289437d0))
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -4.9) {
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x;
	} else if (x <= 1.15) {
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437));
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -4.9:
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x
	elif x <= 1.15:
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437))
	else:
		tmp = -x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -4.9)
		tmp = Float64(Float64(Float64(6.039053782637804 - Float64(82.23527511657367 / x)) / x) - x);
	elseif (x <= 1.15)
		tmp = Float64(2.30753 + Float64(x * Float64(Float64(x * 1.900161040244073) - 3.0191289437)));
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -4.9)
		tmp = ((6.039053782637804 - (82.23527511657367 / x)) / x) - x;
	elseif (x <= 1.15)
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437));
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -4.9], N[(N[(N[(6.039053782637804 - N[(82.23527511657367 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] - x), $MachinePrecision], If[LessEqual[x, 1.15], N[(2.30753 + N[(x * N[(N[(x * 1.900161040244073), $MachinePrecision] - 3.0191289437), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-x)]]

Derivation

1. Split input into 3 regimes

2. if x < -4.9000000000000004

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{\frac{6.039053782637804 - 82.23527511657367 \cdot \frac{1}{x}}{x}} - x \]
   4. Step-by-step derivation

      1. associate-*r/ 100.0%

         \[\leadsto \frac{6.039053782637804 - \color{blue}{\frac{82.23527511657367 \cdot 1}{x}}}{x} - x \]

      2. metadata-eval 100.0%

         \[\leadsto \frac{6.039053782637804 - \frac{\color{blue}{82.23527511657367}}{x}}{x} - x \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{6.039053782637804 - \frac{82.23527511657367}{x}}{x}} - x \]

   if -4.9000000000000004 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.9%

      \[\leadsto \color{blue}{\left(2.30753 + x \cdot \left(1.900161040244073 \cdot x - 2.0191289437\right)\right)} - x \]

   4. Taylor expanded in x around 0 99.9%

      \[\leadsto \color{blue}{2.30753 + x \cdot \left(1.900161040244073 \cdot x - 3.0191289437\right)} \]

   if 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.9:\\ \;\;\;\;\frac{6.039053782637804 - \frac{82.23527511657367}{x}}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;2.30753 + x \cdot \left(x \cdot 1.900161040244073 - 3.0191289437\right)\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.05:\\ \;\;\;\;\frac{6.039053782637804}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;2.30753 + x \cdot \left(x \cdot 1.900161040244073 - 3.0191289437\right)\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.05)
   (- (/ 6.039053782637804 x) x)
   (if (<= x 1.15)
     (+ 2.30753 (* x (- (* x 1.900161040244073) 3.0191289437)))
     (- x))))

C

double code(double x) {
	double tmp;
	if (x <= -1.05) {
		tmp = (6.039053782637804 / x) - x;
	} else if (x <= 1.15) {
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437));
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.05d0)) then
        tmp = (6.039053782637804d0 / x) - x
    else if (x <= 1.15d0) then
        tmp = 2.30753d0 + (x * ((x * 1.900161040244073d0) - 3.0191289437d0))
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.05) {
		tmp = (6.039053782637804 / x) - x;
	} else if (x <= 1.15) {
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437));
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.05:
		tmp = (6.039053782637804 / x) - x
	elif x <= 1.15:
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437))
	else:
		tmp = -x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.05)
		tmp = Float64(Float64(6.039053782637804 / x) - x);
	elseif (x <= 1.15)
		tmp = Float64(2.30753 + Float64(x * Float64(Float64(x * 1.900161040244073) - 3.0191289437)));
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.05)
		tmp = (6.039053782637804 / x) - x;
	elseif (x <= 1.15)
		tmp = 2.30753 + (x * ((x * 1.900161040244073) - 3.0191289437));
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.05], N[(N[(6.039053782637804 / x), $MachinePrecision] - x), $MachinePrecision], If[LessEqual[x, 1.15], N[(2.30753 + N[(x * N[(N[(x * 1.900161040244073), $MachinePrecision] - 3.0191289437), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-x)]]

Derivation

1. Split input into 3 regimes

2. if x < -1.05000000000000004

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.8%

      \[\leadsto \color{blue}{\frac{6.039053782637804}{x}} - x \]

   if -1.05000000000000004 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.9%

      \[\leadsto \color{blue}{\left(2.30753 + x \cdot \left(1.900161040244073 \cdot x - 2.0191289437\right)\right)} - x \]

   4. Taylor expanded in x around 0 99.9%

      \[\leadsto \color{blue}{2.30753 + x \cdot \left(1.900161040244073 \cdot x - 3.0191289437\right)} \]

   if 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.05:\\ \;\;\;\;\frac{6.039053782637804}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;2.30753 + x \cdot \left(x \cdot 1.900161040244073 - 3.0191289437\right)\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.05:\\ \;\;\;\;\frac{6.039053782637804}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;\left(2.30753 + x \cdot -2.0191289437\right) - x\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.05)
   (- (/ 6.039053782637804 x) x)
   (if (<= x 1.15) (- (+ 2.30753 (* x -2.0191289437)) x) (- x))))

C

double code(double x) {
	double tmp;
	if (x <= -1.05) {
		tmp = (6.039053782637804 / x) - x;
	} else if (x <= 1.15) {
		tmp = (2.30753 + (x * -2.0191289437)) - x;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.05d0)) then
        tmp = (6.039053782637804d0 / x) - x
    else if (x <= 1.15d0) then
        tmp = (2.30753d0 + (x * (-2.0191289437d0))) - x
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.05) {
		tmp = (6.039053782637804 / x) - x;
	} else if (x <= 1.15) {
		tmp = (2.30753 + (x * -2.0191289437)) - x;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.05:
		tmp = (6.039053782637804 / x) - x
	elif x <= 1.15:
		tmp = (2.30753 + (x * -2.0191289437)) - x
	else:
		tmp = -x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.05)
		tmp = Float64(Float64(6.039053782637804 / x) - x);
	elseif (x <= 1.15)
		tmp = Float64(Float64(2.30753 + Float64(x * -2.0191289437)) - x);
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.05)
		tmp = (6.039053782637804 / x) - x;
	elseif (x <= 1.15)
		tmp = (2.30753 + (x * -2.0191289437)) - x;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.05], N[(N[(6.039053782637804 / x), $MachinePrecision] - x), $MachinePrecision], If[LessEqual[x, 1.15], N[(N[(2.30753 + N[(x * -2.0191289437), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision], (-x)]]

Derivation

1. Split input into 3 regimes

2. if x < -1.05000000000000004

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.8%

      \[\leadsto \color{blue}{\frac{6.039053782637804}{x}} - x \]

   if -1.05000000000000004 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\left(2.30753 + -2.0191289437 \cdot x\right)} - x \]
   4. Step-by-step derivation

      1. *-commutative 99.4%

         \[\leadsto \left(2.30753 + \color{blue}{x \cdot -2.0191289437}\right) - x \]

   5. Simplified 99.4%

      \[\leadsto \color{blue}{\left(2.30753 + x \cdot -2.0191289437\right)} - x \]

   if 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 100.0%

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

   6. Simplified 100.0%

      \[\leadsto \color{blue}{-x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 98.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.05 \lor \neg \left(x \leq 1.15\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;2.30753 + x \cdot -3.0191289437\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.05) (not (<= x 1.15)))
   (- x)
   (+ 2.30753 (* x -3.0191289437))))

C

double code(double x) {
	double tmp;
	if ((x <= -1.05) || !(x <= 1.15)) {
		tmp = -x;
	} else {
		tmp = 2.30753 + (x * -3.0191289437);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.05d0)) .or. (.not. (x <= 1.15d0))) then
        tmp = -x
    else
        tmp = 2.30753d0 + (x * (-3.0191289437d0))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1.05) || !(x <= 1.15)) {
		tmp = -x;
	} else {
		tmp = 2.30753 + (x * -3.0191289437);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1.05) or not (x <= 1.15):
		tmp = -x
	else:
		tmp = 2.30753 + (x * -3.0191289437)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.05) || !(x <= 1.15))
		tmp = Float64(-x);
	else
		tmp = Float64(2.30753 + Float64(x * -3.0191289437));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1.05) || ~((x <= 1.15)))
		tmp = -x;
	else
		tmp = 2.30753 + (x * -3.0191289437);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1.05], N[Not[LessEqual[x, 1.15]], $MachinePrecision]], (-x), N[(2.30753 + N[(x * -3.0191289437), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.05000000000000004 or 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.7%

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

   4. Taylor expanded in x around inf 99.7%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 99.7%

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

   6. Simplified 99.7%

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

   if -1.05000000000000004 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\left(2.30753 + -2.0191289437 \cdot x\right)} - x \]
   4. Step-by-step derivation

      1. *-commutative 99.4%

         \[\leadsto \left(2.30753 + \color{blue}{x \cdot -2.0191289437}\right) - x \]

   5. Simplified 99.4%

      \[\leadsto \color{blue}{\left(2.30753 + x \cdot -2.0191289437\right)} - x \]

   6. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{2.30753 + -3.0191289437 \cdot x} \]
   7. Step-by-step derivation

      1. *-commutative 99.4%

         \[\leadsto 2.30753 + \color{blue}{x \cdot -3.0191289437} \]

   8. Simplified 99.4%

      \[\leadsto \color{blue}{2.30753 + x \cdot -3.0191289437} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.05 \lor \neg \left(x \leq 1.15\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;2.30753 + x \cdot -3.0191289437\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.05:\\ \;\;\;\;\frac{6.039053782637804}{x} - x\\ \mathbf{elif}\;x \leq 1.15:\\ \;\;\;\;2.30753 + x \cdot -3.0191289437\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.05)
   (- (/ 6.039053782637804 x) x)
   (if (<= x 1.15) (+ 2.30753 (* x -3.0191289437)) (- x))))

C

double code(double x) {
	double tmp;
	if (x <= -1.05) {
		tmp = (6.039053782637804 / x) - x;
	} else if (x <= 1.15) {
		tmp = 2.30753 + (x * -3.0191289437);
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.05d0)) then
        tmp = (6.039053782637804d0 / x) - x
    else if (x <= 1.15d0) then
        tmp = 2.30753d0 + (x * (-3.0191289437d0))
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.05) {
		tmp = (6.039053782637804 / x) - x;
	} else if (x <= 1.15) {
		tmp = 2.30753 + (x * -3.0191289437);
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.05:
		tmp = (6.039053782637804 / x) - x
	elif x <= 1.15:
		tmp = 2.30753 + (x * -3.0191289437)
	else:
		tmp = -x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.05)
		tmp = Float64(Float64(6.039053782637804 / x) - x);
	elseif (x <= 1.15)
		tmp = Float64(2.30753 + Float64(x * -3.0191289437));
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.05)
		tmp = (6.039053782637804 / x) - x;
	elseif (x <= 1.15)
		tmp = 2.30753 + (x * -3.0191289437);
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.05], N[(N[(6.039053782637804 / x), $MachinePrecision] - x), $MachinePrecision], If[LessEqual[x, 1.15], N[(2.30753 + N[(x * -3.0191289437), $MachinePrecision]), $MachinePrecision], (-x)]]

Derivation

1. Split input into 3 regimes

2. if x < -1.05000000000000004

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.8%

      \[\leadsto \color{blue}{\frac{6.039053782637804}{x}} - x \]

   if -1.05000000000000004 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\left(2.30753 + -2.0191289437 \cdot x\right)} - x \]
   4. Step-by-step derivation

      1. *-commutative 99.4%

         \[\leadsto \left(2.30753 + \color{blue}{x \cdot -2.0191289437}\right) - x \]

   5. Simplified 99.4%

      \[\leadsto \color{blue}{\left(2.30753 + x \cdot -2.0191289437\right)} - x \]

   6. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{2.30753 + -3.0191289437 \cdot x} \]
   7. Step-by-step derivation

      1. *-commutative 99.4%

         \[\leadsto 2.30753 + \color{blue}{x \cdot -3.0191289437} \]

   8. Simplified 99.4%

      \[\leadsto \color{blue}{2.30753 + x \cdot -3.0191289437} \]

   if 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 100.0%

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

   6. Simplified 100.0%

      \[\leadsto \color{blue}{-x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 98.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \frac{2.30753}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (/ 2.30753 (+ 1.0 (* x (+ 0.99229 (* x 0.04481))))) x))

C

double code(double x) {
	return (2.30753 / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Fortran

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

Java

public static double code(double x) {
	return (2.30753 / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
}

Python

def code(x):
	return (2.30753 / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x

Julia

function code(x)
	return Float64(Float64(2.30753 / Float64(1.0 + Float64(x * Float64(0.99229 + Float64(x * 0.04481))))) - x)
end

MATLAB

function tmp = code(x)
	tmp = (2.30753 / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x;
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
2. Add Preprocessing

3. Taylor expanded in x around 0 98.9%

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

Alternative 9: 98.4% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -3.65) (not (<= x 1.15))) (- x) 2.30753))

C

double code(double x) {
	double tmp;
	if ((x <= -3.65) || !(x <= 1.15)) {
		tmp = -x;
	} else {
		tmp = 2.30753;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if ((x <= -3.65) || !(x <= 1.15)) {
		tmp = -x;
	} else {
		tmp = 2.30753;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -3.65) or not (x <= 1.15):
		tmp = -x
	else:
		tmp = 2.30753
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -3.65) || !(x <= 1.15))
		tmp = Float64(-x);
	else
		tmp = 2.30753;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -3.65) || ~((x <= 1.15)))
		tmp = -x;
	else
		tmp = 2.30753;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -3.65], N[Not[LessEqual[x, 1.15]], $MachinePrecision]], (-x), 2.30753]

Derivation

1. Split input into 2 regimes

2. if x < -3.64999999999999991 or 1.1499999999999999 < x

   1. Initial program 100.0%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.7%

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

   4. Taylor expanded in x around inf 99.7%

      \[\leadsto \color{blue}{-1 \cdot x} \]
   5. Step-by-step derivation

      1. neg-mul-1 99.7%

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

   6. Simplified 99.7%

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

   if -3.64999999999999991 < x < 1.1499999999999999

   1. Initial program 99.9%

      \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 97.9%

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

   4. Taylor expanded in x around 0 97.4%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.65 \lor \neg \left(x \leq 1.15\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;2.30753\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 50.7% accurate, 17.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 2.30753)

C

double code(double x) {
	return 2.30753;
}

Fortran

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

Java

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

Python

def code(x):
	return 2.30753

Julia

function code(x)
	return 2.30753
end

MATLAB

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

Wolfram

code[x_] := 2.30753

Derivation

1. Initial program 100.0%

   \[\frac{2.30753 + x \cdot 0.27061}{1 + x \cdot \left(0.99229 + x \cdot 0.04481\right)} - x \]
2. Add Preprocessing

3. Taylor expanded in x around 0 98.9%

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

4. Taylor expanded in x around 0 44.7%

   \[\leadsto \color{blue}{2.30753} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024181 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, C"
  :precision binary64
  (- (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* x (+ 0.99229 (* x 0.04481))))) x))