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

Percentage Accurate: 99.9% → 99.9%

Time: 6.1s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ (- 1.0 x) (* y (sqrt x))))

C

double code(double x, double y) {
	return (1.0 - x) + (y * sqrt(x));
}

Fortran

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

Java

public static double code(double x, double y) {
	return (1.0 - x) + (y * Math.sqrt(x));
}

Python

def code(x, y):
	return (1.0 - x) + (y * math.sqrt(x))

Julia

function code(x, y)
	return Float64(Float64(1.0 - x) + Float64(y * sqrt(x)))
end

MATLAB

function tmp = code(x, y)
	tmp = (1.0 - x) + (y * sqrt(x));
end

Wolfram

code[x_, y_] := N[(N[(1.0 - x), $MachinePrecision] + N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ (- 1.0 x) (* y (sqrt x))))

C

double code(double x, double y) {
	return (1.0 - x) + (y * sqrt(x));
}

Fortran

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

Java

public static double code(double x, double y) {
	return (1.0 - x) + (y * Math.sqrt(x));
}

Python

def code(x, y):
	return (1.0 - x) + (y * math.sqrt(x))

Julia

function code(x, y)
	return Float64(Float64(1.0 - x) + Float64(y * sqrt(x)))
end

MATLAB

function tmp = code(x, y)
	tmp = (1.0 - x) + (y * sqrt(x));
end

Wolfram

code[x_, y_] := N[(N[(1.0 - x), $MachinePrecision] + N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ (- 1.0 x) (* y (sqrt x))))

C

double code(double x, double y) {
	return (1.0 - x) + (y * sqrt(x));
}

Fortran

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

Java

public static double code(double x, double y) {
	return (1.0 - x) + (y * Math.sqrt(x));
}

Python

def code(x, y):
	return (1.0 - x) + (y * math.sqrt(x))

Julia

function code(x, y)
	return Float64(Float64(1.0 - x) + Float64(y * sqrt(x)))
end

MATLAB

function tmp = code(x, y)
	tmp = (1.0 - x) + (y * sqrt(x));
end

Wolfram

code[x_, y_] := N[(N[(1.0 - x), $MachinePrecision] + N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 95.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.5 \cdot 10^{+54} \lor \neg \left(y \leq 3.6 \cdot 10^{+74}\right):\\ \;\;\;\;1 + y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6.5e+54) (not (<= y 3.6e+74)))
   (+ 1.0 (* y (sqrt x)))
   (- 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6.5e+54) || !(y <= 3.6e+74)) {
		tmp = 1.0 + (y * sqrt(x));
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-6.5d+54)) .or. (.not. (y <= 3.6d+74))) then
        tmp = 1.0d0 + (y * sqrt(x))
    else
        tmp = 1.0d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -6.5e+54) || !(y <= 3.6e+74)) {
		tmp = 1.0 + (y * Math.sqrt(x));
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -6.5e+54) or not (y <= 3.6e+74):
		tmp = 1.0 + (y * math.sqrt(x))
	else:
		tmp = 1.0 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6.5e+54) || !(y <= 3.6e+74))
		tmp = Float64(1.0 + Float64(y * sqrt(x)));
	else
		tmp = Float64(1.0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -6.5e+54) || ~((y <= 3.6e+74)))
		tmp = 1.0 + (y * sqrt(x));
	else
		tmp = 1.0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6.5e+54], N[Not[LessEqual[y, 3.6e+74]], $MachinePrecision]], N[(1.0 + N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.5e54 or 3.59999999999999988e74 < y

   1. Initial program 99.8%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 94.5%

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

   if -6.5e54 < y < 3.59999999999999988e74

   1. Initial program 100.0%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 97.4%

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

4. Final simplification 96.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.5 \cdot 10^{+54} \lor \neg \left(y \leq 3.6 \cdot 10^{+74}\right):\\ \;\;\;\;1 + y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 92.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.9 \cdot 10^{+94} \lor \neg \left(y \leq 4.1 \cdot 10^{+74}\right):\\ \;\;\;\;y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3.9e+94) (not (<= y 4.1e+74))) (* y (sqrt x)) (- 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3.9e+94) || !(y <= 4.1e+74)) {
		tmp = y * sqrt(x);
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-3.9d+94)) .or. (.not. (y <= 4.1d+74))) then
        tmp = y * sqrt(x)
    else
        tmp = 1.0d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -3.9e+94) || !(y <= 4.1e+74)) {
		tmp = y * Math.sqrt(x);
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -3.9e+94) or not (y <= 4.1e+74):
		tmp = y * math.sqrt(x)
	else:
		tmp = 1.0 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3.9e+94) || !(y <= 4.1e+74))
		tmp = Float64(y * sqrt(x));
	else
		tmp = Float64(1.0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -3.9e+94) || ~((y <= 4.1e+74)))
		tmp = y * sqrt(x);
	else
		tmp = 1.0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -3.9e+94], N[Not[LessEqual[y, 4.1e+74]], $MachinePrecision]], N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(1.0 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.89999999999999986e94 or 4.1e74 < y

   1. Initial program 99.8%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 89.4%

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

   4. Taylor expanded in x around 0 95.5%

      \[\leadsto \color{blue}{\sqrt{x} \cdot y} \]

   if -3.89999999999999986e94 < y < 4.1e74

   1. Initial program 100.0%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 94.6%

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

4. Final simplification 94.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.9 \cdot 10^{+94} \lor \neg \left(y \leq 4.1 \cdot 10^{+74}\right):\\ \;\;\;\;y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \sqrt{x}\\ \mathbf{if}\;x \leq 0.00049:\\ \;\;\;\;1 + t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_0 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (sqrt x)))) (if (<= x 0.00049) (+ 1.0 t_0) (- t_0 x))))

C

double code(double x, double y) {
	double t_0 = y * sqrt(x);
	double tmp;
	if (x <= 0.00049) {
		tmp = 1.0 + t_0;
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y * sqrt(x)
    if (x <= 0.00049d0) then
        tmp = 1.0d0 + t_0
    else
        tmp = t_0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * Math.sqrt(x);
	double tmp;
	if (x <= 0.00049) {
		tmp = 1.0 + t_0;
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * math.sqrt(x)
	tmp = 0
	if x <= 0.00049:
		tmp = 1.0 + t_0
	else:
		tmp = t_0 - x
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * sqrt(x))
	tmp = 0.0
	if (x <= 0.00049)
		tmp = Float64(1.0 + t_0);
	else
		tmp = Float64(t_0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * sqrt(x);
	tmp = 0.0;
	if (x <= 0.00049)
		tmp = 1.0 + t_0;
	else
		tmp = t_0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 0.00049], N[(1.0 + t$95$0), $MachinePrecision], N[(t$95$0 - x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < 4.8999999999999998e-4

   1. Initial program 99.9%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.4%

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

   if 4.8999999999999998e-4 < x

   1. Initial program 99.9%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.7%

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

   4. Taylor expanded in x around 0 98.8%

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

      1. neg-mul-1 98.8%

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

      2. +-commutative 98.8%

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

      3. fma-define 98.8%

         \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{x}, y, -x\right)} \]

      4. fma-neg 98.8%

         \[\leadsto \color{blue}{\sqrt{x} \cdot y - x} \]

   6. Simplified 98.8%

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

4. Final simplification 98.6%

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

Alternative 5: 61.9% accurate, 35.7× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 1.0 x))

C

double code(double x, double y) {
	return 1.0 - x;
}

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0 - x

Julia

function code(x, y)
	return Float64(1.0 - x)
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0 - x;
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in y around 0 61.9%

   \[\leadsto \color{blue}{1 - x} \]
4. Add Preprocessing

Alternative 6: 30.8% accurate, 53.5× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	return -x;
}

Fortran

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

Java

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

Python

def code(x, y):
	return -x

Julia

function code(x, y)
	return Float64(-x)
end

MATLAB

function tmp = code(x, y)
	tmp = -x;
end

Wolfram

code[x_, y_] := (-x)

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 64.9%

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

4. Taylor expanded in y around 0 30.3%

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

   1. neg-mul-1 30.3%

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

6. Simplified 30.3%

   \[\leadsto \color{blue}{-x} \]
7. Add Preprocessing

Alternative 7: 3.1% accurate, 107.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

double code(double x, double y) {
	return x;
}

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 64.9%

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

4. Taylor expanded in y around 0 30.3%

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

   1. neg-mul-1 30.3%

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

6. Simplified 30.3%

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

   1. neg-sub0 30.3%

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

   2. sub-neg 30.3%

      \[\leadsto \color{blue}{0 + \left(-x\right)} \]

   3. add-sqr-sqrt 0.0%

      \[\leadsto 0 + \color{blue}{\sqrt{-x} \cdot \sqrt{-x}} \]

   4. sqrt-unprod 5.8%

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

   5. sqr-neg 5.8%

      \[\leadsto 0 + \sqrt{\color{blue}{x \cdot x}} \]

   6. sqrt-unprod 3.1%

      \[\leadsto 0 + \color{blue}{\sqrt{x} \cdot \sqrt{x}} \]

   7. add-sqr-sqrt 3.1%

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

8. Applied egg-rr 3.1%

   \[\leadsto \color{blue}{0 + x} \]
9. Step-by-step derivation

   1. +-lft-identity 3.1%

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

10. Simplified 3.1%

    \[\leadsto \color{blue}{x} \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024111 
(FPCore (x y)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, E"
  :precision binary64
  (+ (- 1.0 x) (* y (sqrt x))))