Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, D

Percentage Accurate: 100.0% → 100.0%

Time: 12.3s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. expm1-log1p-u 78.5%

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

   2. expm1-udef 78.5%

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

4. Applied egg-rr 78.5%

   \[\leadsto x - \frac{2.30753 + x \cdot 0.27061}{1 + \left(0.99229 + \color{blue}{\left(e^{\mathsf{log1p}\left(x \cdot 0.04481\right)} - 1\right)}\right) \cdot x} \]
5. Step-by-step derivation

   1. log1p-udef 78.5%

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

   2. rem-exp-log 100.0%

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

   3. +-commutative 100.0%

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

6. Applied egg-rr 100.0%

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

7. Final simplification 100.0%

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

Alternative 2: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_] := N[(x - 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]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 3: 98.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ x - \frac{2.30753 + x \cdot 0.27061}{1 + x \cdot 0.99229} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around 0 97.7%

   \[\leadsto x - \frac{2.30753 + x \cdot 0.27061}{1 + \color{blue}{0.99229 \cdot x}} \]
4. Step-by-step derivation

   1. *-commutative 97.7%

      \[\leadsto x - \frac{2.30753 + x \cdot 0.27061}{1 + \color{blue}{x \cdot 0.99229}} \]

5. Simplified 97.7%

   \[\leadsto x - \frac{2.30753 + x \cdot 0.27061}{1 + \color{blue}{x \cdot 0.99229}} \]

6. Final simplification 97.7%

   \[\leadsto x - \frac{2.30753 + x \cdot 0.27061}{1 + x \cdot 0.99229} \]
7. Add Preprocessing

Alternative 4: 98.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.06:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.2:\\ \;\;\;\;-2.30753\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x -1.06) x (if (<= x 1.2) -2.30753 x)))

C

double code(double x) {
	double tmp;
	if (x <= -1.06) {
		tmp = x;
	} else if (x <= 1.2) {
		tmp = -2.30753;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.06d0)) then
        tmp = x
    else if (x <= 1.2d0) then
        tmp = -2.30753d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.06) {
		tmp = x;
	} else if (x <= 1.2) {
		tmp = -2.30753;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.06:
		tmp = x
	elif x <= 1.2:
		tmp = -2.30753
	else:
		tmp = x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.06)
		tmp = x;
	elseif (x <= 1.2)
		tmp = -2.30753;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.06)
		tmp = x;
	elseif (x <= 1.2)
		tmp = -2.30753;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.06], x, If[LessEqual[x, 1.2], -2.30753, x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.0600000000000001 or 1.19999999999999996 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 95.9%

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

   4. Taylor expanded in x around inf 98.0%

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

   if -1.0600000000000001 < x < 1.19999999999999996

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 97.9%

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

   4. Taylor expanded in x around 0 97.8%

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

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.06:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.2:\\ \;\;\;\;-2.30753\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.8% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (- x 2.30753))

C

double code(double x) {
	return x - 2.30753;
}

Fortran

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

Java

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

Python

def code(x):
	return x - 2.30753

Julia

function code(x)
	return Float64(x - 2.30753)
end

MATLAB

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

Wolfram

code[x_] := N[(x - 2.30753), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around 0 96.9%

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

4. Final simplification 96.9%

   \[\leadsto x - 2.30753 \]
5. Add Preprocessing

Alternative 6: 51.1% 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%

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

3. Taylor expanded in x around 0 96.9%

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

4. Taylor expanded in x around 0 50.2%

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

5. Final simplification 50.2%

   \[\leadsto -2.30753 \]
6. Add Preprocessing

Reproduce

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