Data.Number.Erf:$dmerfcx from erf-2.0.0.0

Percentage Accurate: 100.0% → 100.0%

Time: 3.6s

Alternatives: 5

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ x \cdot e^{y \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (exp (* y y))))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x * Math.exp((y * y));
}

Python

def code(x, y):
	return x * math.exp((y * y))

Julia

function code(x, y)
	return Float64(x * exp(Float64(y * y)))
end

MATLAB

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

Wolfram

code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot e^{y \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (exp (* y y))))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x * Math.exp((y * y));
}

Python

def code(x, y):
	return x * math.exp((y * y))

Julia

function code(x, y)
	return Float64(x * exp(Float64(y * y)))
end

MATLAB

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

Wolfram

code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot e^{y \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (exp (* y y))))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x * Math.exp((y * y));
}

Python

def code(x, y):
	return x * math.exp((y * y))

Julia

function code(x, y)
	return Float64(x * exp(Float64(y * y)))
end

MATLAB

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

Wolfram

code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x \cdot e^{y \cdot y} \]

2. Final simplification 100.0%

   \[\leadsto x \cdot e^{y \cdot y} \]

Alternative 2: 81.9% accurate, 11.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 0.2:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* y y) 0.2) x (* x (* y y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 0.2) {
		tmp = x;
	} else {
		tmp = x * (y * 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 * y) <= 0.2d0) then
        tmp = x
    else
        tmp = x * (y * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 0.2) {
		tmp = x;
	} else {
		tmp = x * (y * y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 0.2:
		tmp = x
	else:
		tmp = x * (y * y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 0.2)
		tmp = x;
	else
		tmp = Float64(x * Float64(y * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 0.2)
		tmp = x;
	else
		tmp = x * (y * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 0.2], x, N[(x * N[(y * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 0.20000000000000001

   1. Initial program 100.0%

      \[x \cdot e^{y \cdot y} \]

   2. Taylor expanded in y around 0 98.0%

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

   if 0.20000000000000001 < (*.f64 y y)

   1. Initial program 100.0%

      \[x \cdot e^{y \cdot y} \]

   2. Taylor expanded in y around 0 71.6%

      \[\leadsto x \cdot \color{blue}{\left(1 + {y}^{2}\right)} \]
   3. Step-by-step derivation

      1. unpow2 71.6%

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

   4. Simplified 71.6%

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

   5. Taylor expanded in y around inf 71.6%

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

      1. unpow2 71.6%

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

      2. *-commutative 71.6%

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

   7. Simplified 71.6%

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

4. Final simplification 84.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 0.2:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot y\right)\\ \end{array} \]

Alternative 3: 82.2% accurate, 15.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x \cdot e^{y \cdot y} \]

2. Taylor expanded in y around 0 84.8%

   \[\leadsto x \cdot \color{blue}{\left(1 + {y}^{2}\right)} \]
3. Step-by-step derivation

   1. unpow2 84.8%

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

4. Simplified 84.8%

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

5. Final simplification 84.8%

   \[\leadsto x \cdot \left(y \cdot y + 1\right) \]

Alternative 4: 82.2% accurate, 15.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ x (* x (* y y))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x + (x * (y * y))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x \cdot e^{y \cdot y} \]

2. Taylor expanded in y around 0 84.8%

   \[\leadsto x \cdot \color{blue}{\left(1 + {y}^{2}\right)} \]
3. Step-by-step derivation

   1. unpow2 84.8%

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

4. Simplified 84.8%

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

   1. +-commutative 84.8%

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

   2. distribute-lft-in 84.8%

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

   3. *-rgt-identity 84.8%

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

6. Applied egg-rr 84.8%

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

7. Final simplification 84.8%

   \[\leadsto x + x \cdot \left(y \cdot y\right) \]

Alternative 5: 50.5% accurate, 105.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 \cdot e^{y \cdot y} \]

2. Taylor expanded in y around 0 49.8%

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

3. Final simplification 49.8%

   \[\leadsto x \]

Developer target: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ x \cdot {\left(e^{y}\right)}^{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (pow (exp y) y)))

C

double code(double x, double y) {
	return x * pow(exp(y), y);
}

Fortran

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

Java

public static double code(double x, double y) {
	return x * Math.pow(Math.exp(y), y);
}

Python

def code(x, y):
	return x * math.pow(math.exp(y), y)

Julia

function code(x, y)
	return Float64(x * (exp(y) ^ y))
end

MATLAB

function tmp = code(x, y)
	tmp = x * (exp(y) ^ y);
end

Wolfram

code[x_, y_] := N[(x * N[Power[N[Exp[y], $MachinePrecision], y], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023214 
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"
  :precision binary64

  :herbie-target
  (* x (pow (exp y) y))

  (* x (exp (* y y))))