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

Percentage Accurate: 99.9% → 99.9%

Time: 4.0s

Alternatives: 5

Speedup: N/A×

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}{\frac{2}{y}}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
4. Add Preprocessing

5. Final simplification 100.0%

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

Alternative 2: 86.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-9}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-104}:\\ \;\;\;\;x - y\\ \mathbf{elif}\;x \leq 9.5 \cdot 10^{-68}:\\ \;\;\;\;\frac{-2}{x}\\ \mathbf{elif}\;x \leq 0.092:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.4e-9)
   x
   (if (<= x 3.8e-104)
     (- x y)
     (if (<= x 9.5e-68) (/ -2.0 x) (if (<= x 0.092) (- x y) x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.4e-9) {
		tmp = x;
	} else if (x <= 3.8e-104) {
		tmp = x - y;
	} else if (x <= 9.5e-68) {
		tmp = -2.0 / x;
	} else if (x <= 0.092) {
		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 <= (-4.4d-9)) then
        tmp = x
    else if (x <= 3.8d-104) then
        tmp = x - y
    else if (x <= 9.5d-68) then
        tmp = (-2.0d0) / x
    else if (x <= 0.092d0) 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 <= -4.4e-9) {
		tmp = x;
	} else if (x <= 3.8e-104) {
		tmp = x - y;
	} else if (x <= 9.5e-68) {
		tmp = -2.0 / x;
	} else if (x <= 0.092) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.4e-9:
		tmp = x
	elif x <= 3.8e-104:
		tmp = x - y
	elif x <= 9.5e-68:
		tmp = -2.0 / x
	elif x <= 0.092:
		tmp = x - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.4e-9)
		tmp = x;
	elseif (x <= 3.8e-104)
		tmp = Float64(x - y);
	elseif (x <= 9.5e-68)
		tmp = Float64(-2.0 / x);
	elseif (x <= 0.092)
		tmp = Float64(x - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.4e-9)
		tmp = x;
	elseif (x <= 3.8e-104)
		tmp = x - y;
	elseif (x <= 9.5e-68)
		tmp = -2.0 / x;
	elseif (x <= 0.092)
		tmp = x - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.4e-9], x, If[LessEqual[x, 3.8e-104], N[(x - y), $MachinePrecision], If[LessEqual[x, 9.5e-68], N[(-2.0 / x), $MachinePrecision], If[LessEqual[x, 0.092], N[(x - y), $MachinePrecision], x]]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.3999999999999997e-9 or 0.091999999999999998 < x

   1. Initial program 100.0%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 98.7%

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

   6. Taylor expanded in x around inf 98.8%

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

   if -4.3999999999999997e-9 < x < 3.8000000000000001e-104 or 9.4999999999999997e-68 < x < 0.091999999999999998

   1. Initial program 99.9%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 73.3%

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

   if 3.8000000000000001e-104 < x < 9.4999999999999997e-68

   1. Initial program 99.8%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 78.7%

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

   6. Taylor expanded in x around 0 78.7%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-9}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-104}:\\ \;\;\;\;x - y\\ \mathbf{elif}\;x \leq 9.5 \cdot 10^{-68}:\\ \;\;\;\;\frac{-2}{x}\\ \mathbf{elif}\;x \leq 0.092:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 90.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.8 \cdot 10^{+159} \lor \neg \left(y \leq 7.5 \cdot 10^{+30}\right):\\ \;\;\;\;x - \frac{2}{x}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3.8e+159) (not (<= y 7.5e+30))) (- x (/ 2.0 x)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3.8e+159) || !(y <= 7.5e+30)) {
		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 <= (-3.8d+159)) .or. (.not. (y <= 7.5d+30))) 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 <= -3.8e+159) || !(y <= 7.5e+30)) {
		tmp = x - (2.0 / x);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -3.8e+159) or not (y <= 7.5e+30):
		tmp = x - (2.0 / x)
	else:
		tmp = x - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3.8e+159) || !(y <= 7.5e+30))
		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 <= -3.8e+159) || ~((y <= 7.5e+30)))
		tmp = x - (2.0 / x);
	else
		tmp = x - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -3.8e+159], N[Not[LessEqual[y, 7.5e+30]], $MachinePrecision]], N[(x - N[(2.0 / x), $MachinePrecision]), $MachinePrecision], N[(x - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.79999999999999965e159 or 7.49999999999999973e30 < y

   1. Initial program 99.9%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 85.4%

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

   if -3.79999999999999965e159 < y < 7.49999999999999973e30

   1. Initial program 100.0%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 96.7%

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

4. Final simplification 92.2%

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

Alternative 4: 87.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-9}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.4:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.4e-9) x (if (<= x 1.4) (- x y) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.4e-9) {
		tmp = x;
	} else if (x <= 1.4) {
		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 <= (-4.4d-9)) then
        tmp = x
    else if (x <= 1.4d0) 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 <= -4.4e-9) {
		tmp = x;
	} else if (x <= 1.4) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.4e-9:
		tmp = x
	elif x <= 1.4:
		tmp = x - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.4e-9)
		tmp = x;
	elseif (x <= 1.4)
		tmp = Float64(x - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.4e-9)
		tmp = x;
	elseif (x <= 1.4)
		tmp = x - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.4e-9], x, If[LessEqual[x, 1.4], N[(x - y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -4.3999999999999997e-9 or 1.3999999999999999 < x

   1. Initial program 100.0%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 98.7%

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

   6. Taylor expanded in x around inf 98.8%

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

   if -4.3999999999999997e-9 < x < 1.3999999999999999

   1. Initial program 99.9%

      \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 69.1%

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

4. Final simplification 86.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-9}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.4:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.9% 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 99.9%

   \[x - \frac{y}{1 + \frac{x \cdot y}{2}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{x}{\frac{2}{y}}}} \]
4. Add Preprocessing

5. Taylor expanded in y around inf 70.4%

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

6. Taylor expanded in x around inf 67.5%

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

7. Final simplification 67.5%

   \[\leadsto x \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024020 
(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)))))