Linear.V3:cross from linear-1.19.1.3

Percentage Accurate: 99.4% → 99.7%

Time: 2.4s

Alternatives: 5

Speedup: 1.0×

• 23.0% 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.4% 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.7% 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 98.4%

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

   1. sub-neg 98.4%

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

   2. distribute-rgt-neg-out 98.4%

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

   3. +-commutative 98.4%

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

   4. distribute-rgt-neg-out 98.4%

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

   5. distribute-lft-neg-in 98.4%

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

   6. fma-def 99.6%

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

3. Applied egg-rr 99.6%

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

4. Final simplification 99.6%

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

Alternative 2: 99.7% 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 98.4%

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

   1. fma-neg 98.8%

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

   2. distribute-rgt-neg-in 98.8%

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

3. Simplified 98.8%

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

4. Final simplification 98.8%

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

Alternative 3: 67.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-89} \lor \neg \left(y \leq 255000000000\right) \land \left(y \leq 2.1 \cdot 10^{+48} \lor \neg \left(y \leq 3.6 \cdot 10^{+114}\right)\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -2.8e-89)
         (and (not (<= y 255000000000.0))
              (or (<= y 2.1e+48) (not (<= y 3.6e+114)))))
   (* x y)
   (* z (- t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2.8e-89) || (!(y <= 255000000000.0) && ((y <= 2.1e+48) || !(y <= 3.6e+114)))) {
		tmp = x * y;
	} else {
		tmp = z * -t;
	}
	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 ((y <= (-2.8d-89)) .or. (.not. (y <= 255000000000.0d0)) .and. (y <= 2.1d+48) .or. (.not. (y <= 3.6d+114))) then
        tmp = x * y
    else
        tmp = z * -t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2.8e-89) || (!(y <= 255000000000.0) && ((y <= 2.1e+48) || !(y <= 3.6e+114)))) {
		tmp = x * y;
	} else {
		tmp = z * -t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -2.8e-89) or (not (y <= 255000000000.0) and ((y <= 2.1e+48) or not (y <= 3.6e+114))):
		tmp = x * y
	else:
		tmp = z * -t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -2.8e-89) || (!(y <= 255000000000.0) && ((y <= 2.1e+48) || !(y <= 3.6e+114))))
		tmp = Float64(x * y);
	else
		tmp = Float64(z * Float64(-t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -2.8e-89) || (~((y <= 255000000000.0)) && ((y <= 2.1e+48) || ~((y <= 3.6e+114)))))
		tmp = x * y;
	else
		tmp = z * -t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -2.8e-89], And[N[Not[LessEqual[y, 255000000000.0]], $MachinePrecision], Or[LessEqual[y, 2.1e+48], N[Not[LessEqual[y, 3.6e+114]], $MachinePrecision]]]], N[(x * y), $MachinePrecision], N[(z * (-t)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.7999999999999999e-89 or 2.55e11 < y < 2.0999999999999998e48 or 3.6000000000000001e114 < y

   1. Initial program 96.8%

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

   2. Taylor expanded in x around inf 68.7%

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

   if -2.7999999999999999e-89 < y < 2.55e11 or 2.0999999999999998e48 < y < 3.6000000000000001e114

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 70.8%

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

      1. mul-1-neg 70.8%

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

      2. distribute-rgt-neg-in 70.8%

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

   4. Simplified 70.8%

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

4. Final simplification 69.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-89} \lor \neg \left(y \leq 255000000000\right) \land \left(y \leq 2.1 \cdot 10^{+48} \lor \neg \left(y \leq 3.6 \cdot 10^{+114}\right)\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-t\right)\\ \end{array} \]

Alternative 4: 99.4% 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 98.4%

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

2. Final simplification 98.4%

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

Alternative 5: 51.4% 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 98.4%

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

2. Taylor expanded in x around inf 50.4%

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

3. Final simplification 50.4%

   \[\leadsto x \cdot y \]

Reproduce

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