Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2

Percentage Accurate: 100.0% → 100.0%

Time: 2.6s

Alternatives: 3

Speedup: N/A×

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

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot x + y\right) + y \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(Float64(Float64(x * x) + y) + y)
end

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot x + y\right) + y \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(Float64(Float64(x * x) + y) + y)
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x \cdot x + y\right) + y \]
2. Step-by-step derivation

   1. associate-+l+ 100.0%

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

   2. +-commutative 100.0%

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

   3. count-2 100.0%

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

   4. *-commutative 100.0%

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

   5. fma-def 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, 2, x \cdot x\right)} \]
4. Step-by-step derivation

   1. fma-udef 100.0%

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

   2. *-commutative 100.0%

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

   3. count-2 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 2: 86.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 1.5 \cdot 10^{-63}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* x x) 1.5e-63) (+ y y) (* x x)))

C

double code(double x, double y) {
	double tmp;
	if ((x * x) <= 1.5e-63) {
		tmp = y + y;
	} else {
		tmp = x * 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 * x) <= 1.5d-63) then
        tmp = y + y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x * x) <= 1.5e-63) {
		tmp = y + y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x * x) <= 1.5e-63:
		tmp = y + y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(x * x) <= 1.5e-63)
		tmp = Float64(y + y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x * x) <= 1.5e-63)
		tmp = y + y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(x * x), $MachinePrecision], 1.5e-63], N[(y + y), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 1.4999999999999999e-63

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 94.4%

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

      1. count-2 94.4%

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

   4. Simplified 94.4%

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

   if 1.4999999999999999e-63 < (*.f64 x x)

   1. Initial program 100.0%

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

   2. Taylor expanded in x around inf 86.3%

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

      1. unpow2 86.3%

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

   4. Simplified 86.3%

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

4. Final simplification 89.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 1.5 \cdot 10^{-63}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 3: 51.0% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in x around inf 52.3%

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

   1. unpow2 52.3%

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

4. Simplified 52.3%

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

5. Final simplification 52.3%

   \[\leadsto x \cdot x \]

Developer target: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023279 
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2"
  :precision binary64

  :herbie-target
  (+ (+ y y) (* x x))

  (+ (+ (* x x) y) y))