System.Random.MWC.Distributions:standard from mwc-random-0.13.3.2

Percentage Accurate: 100.0% → 100.0%

Time: 2.5s

Alternatives: 3

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[0.5 \cdot \left(x \cdot x - y\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \left(x \cdot x - y\right) \cdot 0.5 \]
4. Add Preprocessing

Alternative 2: 87.5% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* x x) 120000000000.0) (* -0.5 y) (* (* x x) 0.5)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 1.2e11

   1. Initial program 100.0%

      \[0.5 \cdot \left(x \cdot x - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 86.9

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

   5. Applied rewrites 86.9%

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

   if 1.2e11 < (*.f64 x x)

   1. Initial program 100.0%

      \[0.5 \cdot \left(x \cdot x - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 86.9

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

   5. Applied rewrites 86.9%

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

Alternative 3: 51.9% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ -0.5 \cdot y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(-0.5 * y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[0.5 \cdot \left(x \cdot x - y\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. lower-*.f64 51.8

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

5. Applied rewrites 51.8%

   \[\leadsto \color{blue}{-0.5 \cdot y} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024295 
(FPCore (x y)
  :name "System.Random.MWC.Distributions:standard from mwc-random-0.13.3.2"
  :precision binary64
  (* 0.5 (- (* x x) y)))