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

Percentage Accurate: 99.7% → 99.7%

Time: 3.2s

Alternatives: 4

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot x - 3}{6} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (* x x) 3.0) 6.0))

C

double code(double x) {
	return ((x * x) - 3.0) / 6.0;
}

Fortran

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

Java

public static double code(double x) {
	return ((x * x) - 3.0) / 6.0;
}

Python

def code(x):
	return ((x * x) - 3.0) / 6.0

Julia

function code(x)
	return Float64(Float64(Float64(x * x) - 3.0) / 6.0)
end

MATLAB

function tmp = code(x)
	tmp = ((x * x) - 3.0) / 6.0;
end

Wolfram

code[x_] := N[(N[(N[(x * x), $MachinePrecision] - 3.0), $MachinePrecision] / 6.0), $MachinePrecision]

Initial Program: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot x - 3}{6} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (* x x) 3.0) 6.0))

C

double code(double x) {
	return ((x * x) - 3.0) / 6.0;
}

Fortran

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

Java

public static double code(double x) {
	return ((x * x) - 3.0) / 6.0;
}

Python

def code(x):
	return ((x * x) - 3.0) / 6.0

Julia

function code(x)
	return Float64(Float64(Float64(x * x) - 3.0) / 6.0)
end

MATLAB

function tmp = code(x)
	tmp = ((x * x) - 3.0) / 6.0;
end

Wolfram

code[x_] := N[(N[(N[(x * x), $MachinePrecision] - 3.0), $MachinePrecision] / 6.0), $MachinePrecision]

Alternative 1: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot x - 3}{6} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (* x x) 3.0) 6.0))

C

double code(double x) {
	return ((x * x) - 3.0) / 6.0;
}

Fortran

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

Java

public static double code(double x) {
	return ((x * x) - 3.0) / 6.0;
}

Python

def code(x):
	return ((x * x) - 3.0) / 6.0

Julia

function code(x)
	return Float64(Float64(Float64(x * x) - 3.0) / 6.0)
end

MATLAB

function tmp = code(x)
	tmp = ((x * x) - 3.0) / 6.0;
end

Wolfram

code[x_] := N[(N[(N[(x * x), $MachinePrecision] - 3.0), $MachinePrecision] / 6.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\frac{x \cdot x - 3}{6} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 98.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 0.05:\\ \;\;\;\;-0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\frac{6}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= (* x x) 0.05) -0.5 (/ x (/ 6.0 x))))

C

double code(double x) {
	double tmp;
	if ((x * x) <= 0.05) {
		tmp = -0.5;
	} else {
		tmp = x / (6.0 / x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x * x) <= 0.05d0) then
        tmp = -0.5d0
    else
        tmp = x / (6.0d0 / x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x * x) <= 0.05) {
		tmp = -0.5;
	} else {
		tmp = x / (6.0 / x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x * x) <= 0.05:
		tmp = -0.5
	else:
		tmp = x / (6.0 / x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(x * x) <= 0.05)
		tmp = -0.5;
	else
		tmp = Float64(x / Float64(6.0 / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x * x) <= 0.05)
		tmp = -0.5;
	else
		tmp = x / (6.0 / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(x * x), $MachinePrecision], 0.05], -0.5, N[(x / N[(6.0 / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 0.050000000000000003

   1. Initial program 100.0%

      \[\frac{x \cdot x - 3}{6} \]
   2. Step-by-step derivation

      1. sqr-neg 100.0%

         \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \left(-x\right)} - 3}{6} \]

      2. *-rgt-identity 100.0%

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

      3. metadata-eval 100.0%

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

      4. associate-*l/ 100.0%

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

      5. associate-/l* 100.0%

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

      6. sqr-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. metadata-eval 100.0%

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

      9. metadata-eval 100.0%

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

      10. metadata-eval 100.0%

          \[\leadsto \mathsf{fma}\left(x, x, -3\right) \cdot \color{blue}{0.16666666666666666} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -3\right) \cdot 0.16666666666666666} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.1%

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

   if 0.050000000000000003 < (*.f64 x x)

   1. Initial program 99.8%

      \[\frac{x \cdot x - 3}{6} \]
   2. Step-by-step derivation

      1. sqr-neg 99.8%

         \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \left(-x\right)} - 3}{6} \]

      2. *-rgt-identity 99.8%

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

      3. metadata-eval 99.8%

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

      4. associate-*l/ 99.8%

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

      5. associate-/l* 99.7%

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

      6. sqr-neg 99.7%

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

      7. fma-neg 99.7%

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

      8. metadata-eval 99.7%

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

      9. metadata-eval 99.7%

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

      10. metadata-eval 99.7%

          \[\leadsto \mathsf{fma}\left(x, x, -3\right) \cdot \color{blue}{0.16666666666666666} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -3\right) \cdot 0.16666666666666666} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 99.1%

      \[\leadsto \color{blue}{{x}^{2}} \cdot 0.16666666666666666 \]
   6. Step-by-step derivation

      1. unpow2 99.1%

         \[\leadsto \color{blue}{\left(x \cdot x\right)} \cdot 0.16666666666666666 \]

      2. associate-*r* 99.2%

         \[\leadsto \color{blue}{x \cdot \left(x \cdot 0.16666666666666666\right)} \]

      3. metadata-eval 99.2%

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

      4. div-inv 99.3%

         \[\leadsto x \cdot \color{blue}{\frac{x}{6}} \]

      5. clear-num 99.2%

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

      6. un-div-inv 99.3%

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

   7. Applied egg-rr 99.3%

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

Alternative 3: 98.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 3:\\ \;\;\;\;-0.5\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot x\right) \cdot 0.16666666666666666\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (* x x) 3.0) -0.5 (* (* x x) 0.16666666666666666)))

C

double code(double x) {
	double tmp;
	if ((x * x) <= 3.0) {
		tmp = -0.5;
	} else {
		tmp = (x * x) * 0.16666666666666666;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x * x) <= 3.0d0) then
        tmp = -0.5d0
    else
        tmp = (x * x) * 0.16666666666666666d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x * x) <= 3.0) {
		tmp = -0.5;
	} else {
		tmp = (x * x) * 0.16666666666666666;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x * x) <= 3.0:
		tmp = -0.5
	else:
		tmp = (x * x) * 0.16666666666666666
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(x * x) <= 3.0)
		tmp = -0.5;
	else
		tmp = Float64(Float64(x * x) * 0.16666666666666666);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x * x) <= 3.0)
		tmp = -0.5;
	else
		tmp = (x * x) * 0.16666666666666666;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(x * x), $MachinePrecision], 3.0], -0.5, N[(N[(x * x), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 3

   1. Initial program 100.0%

      \[\frac{x \cdot x - 3}{6} \]
   2. Step-by-step derivation

      1. sqr-neg 100.0%

         \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \left(-x\right)} - 3}{6} \]

      2. *-rgt-identity 100.0%

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

      3. metadata-eval 100.0%

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

      4. associate-*l/ 100.0%

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

      5. associate-/l* 100.0%

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

      6. sqr-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. metadata-eval 100.0%

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

      9. metadata-eval 100.0%

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

      10. metadata-eval 100.0%

          \[\leadsto \mathsf{fma}\left(x, x, -3\right) \cdot \color{blue}{0.16666666666666666} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -3\right) \cdot 0.16666666666666666} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.1%

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

   if 3 < (*.f64 x x)

   1. Initial program 99.8%

      \[\frac{x \cdot x - 3}{6} \]
   2. Step-by-step derivation

      1. sqr-neg 99.8%

         \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \left(-x\right)} - 3}{6} \]

      2. *-rgt-identity 99.8%

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

      3. metadata-eval 99.8%

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

      4. associate-*l/ 99.8%

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

      5. associate-/l* 99.7%

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

      6. sqr-neg 99.7%

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

      7. fma-neg 99.7%

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

      8. metadata-eval 99.7%

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

      9. metadata-eval 99.7%

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

      10. metadata-eval 99.7%

          \[\leadsto \mathsf{fma}\left(x, x, -3\right) \cdot \color{blue}{0.16666666666666666} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -3\right) \cdot 0.16666666666666666} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 99.1%

      \[\leadsto \color{blue}{{x}^{2}} \cdot 0.16666666666666666 \]
   6. Step-by-step derivation

      1. unpow2 99.1%

         \[\leadsto \color{blue}{\left(x \cdot x\right)} \cdot 0.16666666666666666 \]

   7. Applied egg-rr 99.1%

      \[\leadsto \color{blue}{\left(x \cdot x\right)} \cdot 0.16666666666666666 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 49.7% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ -0.5 \end{array} \]

FPCore

(FPCore (x) :precision binary64 -0.5)

C

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

Fortran

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

Java

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

Python

def code(x):
	return -0.5

Julia

function code(x)
	return -0.5
end

MATLAB

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

Wolfram

code[x_] := -0.5

Derivation

1. Initial program 99.9%

   \[\frac{x \cdot x - 3}{6} \]
2. Step-by-step derivation

   1. sqr-neg 99.9%

      \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \left(-x\right)} - 3}{6} \]

   2. *-rgt-identity 99.9%

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

   3. metadata-eval 99.9%

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

   4. associate-*l/ 99.9%

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

   5. associate-/l* 99.8%

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

   6. sqr-neg 99.8%

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

   7. fma-neg 99.8%

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

   8. metadata-eval 99.8%

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

   9. metadata-eval 99.8%

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

   10. metadata-eval 99.8%

       \[\leadsto \mathsf{fma}\left(x, x, -3\right) \cdot \color{blue}{0.16666666666666666} \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -3\right) \cdot 0.16666666666666666} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 50.0%

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

Reproduce

herbie shell --seed 2024135 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, H"
  :precision binary64
  (/ (- (* x x) 3.0) 6.0))