Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, B

Percentage Accurate: 99.9% → 99.9%

Time: 5.2s

Alternatives: 5

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x - \frac{y}{1 + \frac{x \cdot y}{2}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x - (y / (1.0 + ((x * y) / 2.0)));
}

Python

def code(x, y):
	return x - (y / (1.0 + ((x * y) / 2.0)))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - \frac{y}{1 + \frac{x \cdot y}{2}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x - (y / (1.0 + ((x * y) / 2.0)));
}

Python

def code(x, y):
	return x - (y / (1.0 + ((x * y) / 2.0)))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - \frac{y}{1 + \frac{x \cdot y}{2}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x - (y / (1.0 + ((x * y) / 2.0)));
}

Python

def code(x, y):
	return x - (y / (1.0 + ((x * y) / 2.0)))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 91.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+108} \lor \neg \left(y \leq 2.1 \cdot 10^{+117}\right):\\ \;\;\;\;x - \frac{2}{x}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -5.8e+108) (not (<= y 2.1e+117))) (- x (/ 2.0 x)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -5.8e+108) || !(y <= 2.1e+117)) {
		tmp = x - (2.0 / x);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-5.8d+108)) .or. (.not. (y <= 2.1d+117))) then
        tmp = x - (2.0d0 / x)
    else
        tmp = x - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -5.8e+108) || !(y <= 2.1e+117)) {
		tmp = x - (2.0 / x);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -5.8e+108) or not (y <= 2.1e+117):
		tmp = x - (2.0 / x)
	else:
		tmp = x - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -5.8e+108) || !(y <= 2.1e+117))
		tmp = Float64(x - Float64(2.0 / x));
	else
		tmp = Float64(x - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -5.8e+108) || ~((y <= 2.1e+117)))
		tmp = x - (2.0 / x);
	else
		tmp = x - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -5.8e+108], N[Not[LessEqual[y, 2.1e+117]], $MachinePrecision]], N[(x - N[(2.0 / x), $MachinePrecision]), $MachinePrecision], N[(x - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.80000000000000015e108 or 2.1000000000000001e117 < y

   1. Initial program 99.9%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 90.3%

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

      1. associate-*r/ 90.3%

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

      2. metadata-eval 90.3%

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

   5. Simplified 90.3%

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

   if -5.80000000000000015e108 < y < 2.1000000000000001e117

   1. Initial program 100.0%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 95.8%

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

      1. neg-mul-1 95.8%

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

      2. unsub-neg 95.8%

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

   5. Simplified 95.8%

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

4. Final simplification 94.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+108} \lor \neg \left(y \leq 2.1 \cdot 10^{+117}\right):\\ \;\;\;\;x - \frac{2}{x}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.2 \cdot 10^{-5}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-39}:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -6.2e-5) x (if (<= x 8.5e-39) (- x y) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -6.2e-5) {
		tmp = x;
	} else if (x <= 8.5e-39) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-6.2d-5)) then
        tmp = x
    else if (x <= 8.5d-39) then
        tmp = x - y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -6.2e-5) {
		tmp = x;
	} else if (x <= 8.5e-39) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -6.2e-5:
		tmp = x
	elif x <= 8.5e-39:
		tmp = x - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -6.2e-5)
		tmp = x;
	elseif (x <= 8.5e-39)
		tmp = Float64(x - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -6.2e-5)
		tmp = x;
	elseif (x <= 8.5e-39)
		tmp = x - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -6.2e-5], x, If[LessEqual[x, 8.5e-39], N[(x - y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -6.20000000000000027e-5 or 8.5000000000000005e-39 < x

   1. Initial program 100.0%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 95.2%

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

   if -6.20000000000000027e-5 < x < 8.5000000000000005e-39

   1. Initial program 99.9%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 80.2%

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

      1. neg-mul-1 80.2%

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

      2. unsub-neg 80.2%

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

   5. Simplified 80.2%

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

Alternative 4: 78.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8 \cdot 10^{-87}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.32 \cdot 10^{-80}:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -8e-87) x (if (<= x 1.32e-80) (- y) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -8e-87) {
		tmp = x;
	} else if (x <= 1.32e-80) {
		tmp = -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-8d-87)) then
        tmp = x
    else if (x <= 1.32d-80) then
        tmp = -y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -8e-87) {
		tmp = x;
	} else if (x <= 1.32e-80) {
		tmp = -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -8e-87:
		tmp = x
	elif x <= 1.32e-80:
		tmp = -y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -8e-87)
		tmp = x;
	elseif (x <= 1.32e-80)
		tmp = Float64(-y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -8e-87)
		tmp = x;
	elseif (x <= 1.32e-80)
		tmp = -y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -8e-87], x, If[LessEqual[x, 1.32e-80], (-y), x]]

Derivation

1. Split input into 2 regimes

2. if x < -8.00000000000000014e-87 or 1.31999999999999995e-80 < x

   1. Initial program 100.0%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 89.5%

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

   if -8.00000000000000014e-87 < x < 1.31999999999999995e-80

   1. Initial program 99.9%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 60.0%

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

      1. neg-mul-1 60.0%

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

   5. Simplified 60.0%

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

Alternative 5: 62.7% accurate, 11.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 100.0%

   \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 60.7%

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

Reproduce

herbie shell --seed 2024157 
(FPCore (x y)
  :name "Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, B"
  :precision binary64
  (- x (/ y (+ 1.0 (/ (* x y) 2.0)))))