Linear.V3:cross from linear-1.19.1.3

Percentage Accurate: 99.0% → 99.5%

Time: 2.2s

Alternatives: 5

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ x \cdot y - z \cdot t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (x * y) - (z * t)

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot y - z \cdot t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (x * y) - (z * t)

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(-z, t, x \cdot y\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (fma (- z) t (* x y)))

C

double code(double x, double y, double z, double t) {
	return fma(-z, t, (x * y));
}

Julia

function code(x, y, z, t)
	return fma(Float64(-z), t, Float64(x * y))
end

Wolfram

code[x_, y_, z_, t_] := N[((-z) * t + N[(x * y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x \cdot y - z \cdot t \]
2. Step-by-step derivation

   1. sub-neg 100.0%

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

   2. distribute-rgt-neg-out 100.0%

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

   3. +-commutative 100.0%

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

   4. distribute-rgt-neg-out 100.0%

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

   5. distribute-lft-neg-in 100.0%

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

   6. fma-def 100.0%

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

3. Applied egg-rr 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(-z, t, x \cdot y\right) \]

Alternative 2: 99.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, y, z \cdot \left(-t\right)\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (fma x y (* z (- t))))

C

double code(double x, double y, double z, double t) {
	return fma(x, y, (z * -t));
}

Julia

function code(x, y, z, t)
	return fma(x, y, Float64(z * Float64(-t)))
end

Wolfram

code[x_, y_, z_, t_] := N[(x * y + N[(z * (-t)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x \cdot y - z \cdot t \]
2. Step-by-step derivation

   1. fma-neg 100.0%

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

   2. distribute-rgt-neg-in 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(x, y, z \cdot \left(-t\right)\right) \]

Alternative 3: 69.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{+32}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1.05:\\ \;\;\;\;z \cdot \left(-t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.4e+32) (* x y) (if (<= x 1.05) (* z (- t)) (* x y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.4e+32) {
		tmp = x * y;
	} else if (x <= 1.05) {
		tmp = z * -t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= (-2.4d+32)) then
        tmp = x * y
    else if (x <= 1.05d0) then
        tmp = z * -t
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.4e+32) {
		tmp = x * y;
	} else if (x <= 1.05) {
		tmp = z * -t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -2.4e+32:
		tmp = x * y
	elif x <= 1.05:
		tmp = z * -t
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.4e+32)
		tmp = Float64(x * y);
	elseif (x <= 1.05)
		tmp = Float64(z * Float64(-t));
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -2.4e+32)
		tmp = x * y;
	elseif (x <= 1.05)
		tmp = z * -t;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.4e+32], N[(x * y), $MachinePrecision], If[LessEqual[x, 1.05], N[(z * (-t)), $MachinePrecision], N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.39999999999999991e32 or 1.05000000000000004 < x

   1. Initial program 100.0%

      \[x \cdot y - z \cdot t \]

   2. Taylor expanded in x around inf 67.3%

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

   if -2.39999999999999991e32 < x < 1.05000000000000004

   1. Initial program 100.0%

      \[x \cdot y - z \cdot t \]

   2. Taylor expanded in x around 0 70.9%

      \[\leadsto \color{blue}{-1 \cdot \left(t \cdot z\right)} \]
   3. Step-by-step derivation

      1. mul-1-neg 70.9%

         \[\leadsto \color{blue}{-t \cdot z} \]

      2. distribute-rgt-neg-in 70.9%

         \[\leadsto \color{blue}{t \cdot \left(-z\right)} \]

   4. Simplified 70.9%

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

4. Final simplification 69.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{+32}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1.05:\\ \;\;\;\;z \cdot \left(-t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 4: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot y - z \cdot t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (x * y) - (z * t)

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x \cdot y - z \cdot t \]

2. Final simplification 100.0%

   \[\leadsto x \cdot y - z \cdot t \]

Alternative 5: 53.1% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x \cdot y - z \cdot t \]

2. Taylor expanded in x around inf 53.0%

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

3. Final simplification 53.0%

   \[\leadsto x \cdot y \]

Reproduce

herbie shell --seed 2023185 
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  :precision binary64
  (- (* x y) (* z t)))