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

Percentage Accurate: 99.9% → 99.8%

Time: 7.4s

Alternatives: 6

Speedup: 1.0×

• 24.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ 1 - x \cdot \left(0.253 + x \cdot 0.12\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- 1.0 (* x (+ 0.253 (* x 0.12)))))

C

double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}

Python

def code(x):
	return 1.0 - (x * (0.253 + (x * 0.12)))

Julia

function code(x)
	return Float64(1.0 - Float64(x * Float64(0.253 + Float64(x * 0.12))))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 - (x * (0.253 + (x * 0.12)));
end

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 - x \cdot \left(0.253 + x \cdot 0.12\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- 1.0 (* x (+ 0.253 (* x 0.12)))))

C

double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}

Python

def code(x):
	return 1.0 - (x * (0.253 + (x * 0.12)))

Julia

function code(x)
	return Float64(1.0 - Float64(x * Float64(0.253 + Float64(x * 0.12))))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 - (x * (0.253 + (x * 0.12)));
end

Wolfram

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

Alternative 1: 99.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ 1 + \frac{x}{0.253 + x \cdot -0.12} \cdot \left({x}^{2} \cdot 0.0144 - 0.064009\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (+ 1.0 (* (/ x (+ 0.253 (* x -0.12))) (- (* (pow x 2.0) 0.0144) 0.064009))))

C

double code(double x) {
	return 1.0 + ((x / (0.253 + (x * -0.12))) * ((pow(x, 2.0) * 0.0144) - 0.064009));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 + ((x / (0.253d0 + (x * (-0.12d0)))) * (((x ** 2.0d0) * 0.0144d0) - 0.064009d0))
end function

Java

public static double code(double x) {
	return 1.0 + ((x / (0.253 + (x * -0.12))) * ((Math.pow(x, 2.0) * 0.0144) - 0.064009));
}

Python

def code(x):
	return 1.0 + ((x / (0.253 + (x * -0.12))) * ((math.pow(x, 2.0) * 0.0144) - 0.064009))

Julia

function code(x)
	return Float64(1.0 + Float64(Float64(x / Float64(0.253 + Float64(x * -0.12))) * Float64(Float64((x ^ 2.0) * 0.0144) - 0.064009)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 + ((x / (0.253 + (x * -0.12))) * (((x ^ 2.0) * 0.0144) - 0.064009));
end

Wolfram

code[x_] := N[(1.0 + N[(N[(x / N[(0.253 + N[(x * -0.12), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[Power[x, 2.0], $MachinePrecision] * 0.0144), $MachinePrecision] - 0.064009), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. flip-+ 99.8%

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

   2. associate-*r/ 92.7%

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

   3. metadata-eval 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(\color{blue}{0.064009} - \left(x \cdot 0.12\right) \cdot \left(x \cdot 0.12\right)\right)}{0.253 - x \cdot 0.12} \]

   4. swap-sqr 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(0.064009 - \color{blue}{\left(x \cdot x\right) \cdot \left(0.12 \cdot 0.12\right)}\right)}{0.253 - x \cdot 0.12} \]

   5. pow2 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(0.064009 - \color{blue}{{x}^{2}} \cdot \left(0.12 \cdot 0.12\right)\right)}{0.253 - x \cdot 0.12} \]

   6. metadata-eval 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(0.064009 - {x}^{2} \cdot \color{blue}{0.0144}\right)}{0.253 - x \cdot 0.12} \]

   7. *-commutative 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(0.064009 - {x}^{2} \cdot 0.0144\right)}{0.253 - \color{blue}{0.12 \cdot x}} \]

   8. cancel-sign-sub-inv 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(0.064009 - {x}^{2} \cdot 0.0144\right)}{\color{blue}{0.253 + \left(-0.12\right) \cdot x}} \]

   9. metadata-eval 92.7%

      \[\leadsto 1 - \frac{x \cdot \left(0.064009 - {x}^{2} \cdot 0.0144\right)}{0.253 + \color{blue}{-0.12} \cdot x} \]

4. Applied egg-rr 92.7%

   \[\leadsto 1 - \color{blue}{\frac{x \cdot \left(0.064009 - {x}^{2} \cdot 0.0144\right)}{0.253 + -0.12 \cdot x}} \]
5. Step-by-step derivation

   1. *-commutative 92.7%

      \[\leadsto 1 - \frac{\color{blue}{\left(0.064009 - {x}^{2} \cdot 0.0144\right) \cdot x}}{0.253 + -0.12 \cdot x} \]

   2. associate-/l* 99.8%

      \[\leadsto 1 - \color{blue}{\left(0.064009 - {x}^{2} \cdot 0.0144\right) \cdot \frac{x}{0.253 + -0.12 \cdot x}} \]

   3. *-commutative 99.8%

      \[\leadsto 1 - \left(0.064009 - {x}^{2} \cdot 0.0144\right) \cdot \frac{x}{0.253 + \color{blue}{x \cdot -0.12}} \]

6. Simplified 99.8%

   \[\leadsto 1 - \color{blue}{\left(0.064009 - {x}^{2} \cdot 0.0144\right) \cdot \frac{x}{0.253 + x \cdot -0.12}} \]

7. Final simplification 99.8%

   \[\leadsto 1 + \frac{x}{0.253 + x \cdot -0.12} \cdot \left({x}^{2} \cdot 0.0144 - 0.064009\right) \]
8. Add Preprocessing

Alternative 2: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 - x \cdot \left(0.253 + x \cdot 0.12\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- 1.0 (* x (+ 0.253 (* x 0.12)))))

C

double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}

Python

def code(x):
	return 1.0 - (x * (0.253 + (x * 0.12)))

Julia

function code(x)
	return Float64(1.0 - Float64(x * Float64(0.253 + Float64(x * 0.12))))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 - (x * (0.253 + (x * 0.12)));
end

Wolfram

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

Derivation

1. Initial program 99.8%

   \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
2. Add Preprocessing

3. Final simplification 99.8%

   \[\leadsto 1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
4. Add Preprocessing

Alternative 3: 51.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x \cdot -0.253\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 2.0) 1.0 (* x -0.253)))

C

double code(double x) {
	double tmp;
	if (x <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = x * -0.253;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = x * (-0.253d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = x * -0.253;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 2.0:
		tmp = 1.0
	else:
		tmp = x * -0.253
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(x * -0.253);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 2.0)
		tmp = 1.0;
	else
		tmp = x * -0.253;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 2.0], 1.0, N[(x * -0.253), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2

   1. Initial program 99.9%

      \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 63.3%

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

   if 2 < x

   1. Initial program 99.7%

      \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 7.2%

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

      1. *-commutative 7.2%

         \[\leadsto 1 - \color{blue}{x \cdot 0.253} \]

   5. Simplified 7.2%

      \[\leadsto 1 - \color{blue}{x \cdot 0.253} \]

   6. Taylor expanded in x around inf 7.2%

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

      1. *-commutative 7.2%

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

   8. Simplified 7.2%

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

4. Final simplification 48.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x \cdot -0.253\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ 1 - x \cdot \left(x \cdot 0.12\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- 1.0 (* x (* x 0.12))))

C

double code(double x) {
	return 1.0 - (x * (x * 0.12));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 - (x * (x * 0.12));
}

Python

def code(x):
	return 1.0 - (x * (x * 0.12))

Julia

function code(x)
	return Float64(1.0 - Float64(x * Float64(x * 0.12)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 - (x * (x * 0.12));
end

Wolfram

code[x_] := N[(1.0 - N[(x * N[(x * 0.12), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf 99.8%

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

4. Taylor expanded in x around inf 97.1%

   \[\leadsto 1 - x \cdot \color{blue}{\left(0.12 \cdot x\right)} \]
5. Step-by-step derivation

   1. *-commutative 97.1%

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

6. Simplified 97.1%

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

7. Final simplification 97.1%

   \[\leadsto 1 - x \cdot \left(x \cdot 0.12\right) \]
8. Add Preprocessing

Alternative 5: 51.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ 1 - x \cdot 0.253 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- 1.0 (* x 0.253)))

C

double code(double x) {
	return 1.0 - (x * 0.253);
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 - (x * 0.253);
}

Python

def code(x):
	return 1.0 - (x * 0.253)

Julia

function code(x)
	return Float64(1.0 - Float64(x * 0.253))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 - (x * 0.253);
end

Wolfram

code[x_] := N[(1.0 - N[(x * 0.253), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0 48.4%

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

   1. *-commutative 48.4%

      \[\leadsto 1 - \color{blue}{x \cdot 0.253} \]

5. Simplified 48.4%

   \[\leadsto 1 - \color{blue}{x \cdot 0.253} \]

6. Final simplification 48.4%

   \[\leadsto 1 - x \cdot 0.253 \]
7. Add Preprocessing

Alternative 6: 49.7% accurate, 9.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 1.0)

C

double code(double x) {
	return 1.0;
}

Fortran

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

Java

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

Python

def code(x):
	return 1.0

Julia

function code(x)
	return 1.0
end

MATLAB

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

Wolfram

code[x_] := 1.0

Derivation

1. Initial program 99.8%

   \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0 46.3%

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

4. Final simplification 46.3%

   \[\leadsto 1 \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024084 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1.0 (* x (+ 0.253 (* x 0.12)))))