Linear.V2:$cdot from linear-1.19.1.3, A

Percentage Accurate: 99.2% → 99.6%
Time: 2.6s
Alternatives: 5
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ x \cdot y + z \cdot t \end{array} \]
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}

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

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

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

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

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

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

\begin{array}{l}

\\
x \cdot y + z \cdot t
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 5 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.2% accurate, 1.0× speedup?

\[\begin{array}{l} \\ x \cdot y + z \cdot t \end{array} \]
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}

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

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

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

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

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

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

\begin{array}{l}

\\
x \cdot y + z \cdot t
\end{array}

Alternative 1: 99.6% accurate, 0.1× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(z, t, x \cdot y\right) \end{array} \]
(FPCore (x y z t) :precision binary64 (fma z t (* x y)))
double code(double x, double y, double z, double t) {
	return fma(z, t, (x * y));
}

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

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

\begin{array}{l}

\\
\mathsf{fma}\left(z, t, x \cdot y\right)
\end{array}
Derivation

  1. Initial program 99.2%

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

    1. +-commutative99.2%

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

    2. fma-def100.0%

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

  3. Applied egg-rr100.0%

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

  4. Final simplification100.0%

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

Alternative 2: 99.6% accurate, 0.1× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(x, y, z \cdot t\right) \end{array} \]
(FPCore (x y z t) :precision binary64 (fma x y (* z t)))
double code(double x, double y, double z, double t) {
	return fma(x, y, (z * t));
}

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

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

\begin{array}{l}

\\
\mathsf{fma}\left(x, y, z \cdot t\right)
\end{array}
Derivation

  1. Initial program 99.2%

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

    1. fma-def99.2%

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

  3. Simplified99.2%

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

  4. Final simplification99.2%

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

Alternative 3: 67.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7.5 \cdot 10^{+56} \lor \neg \left(z \leq 2.4 \cdot 10^{-37}\right):\\ \;\;\;\;z \cdot t\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]
(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -7.5e+56) (not (<= z 2.4e-37))) (* z t) (* x y)))
double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -7.5e+56) || !(z <= 2.4e-37)) {
		tmp = z * t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

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 ((z <= (-7.5d+56)) .or. (.not. (z <= 2.4d-37))) then
        tmp = z * t
    else
        tmp = x * y
    end if
    code = tmp
end function

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -7.5e+56) || !(z <= 2.4e-37)) {
		tmp = z * t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

def code(x, y, z, t):
	tmp = 0
	if (z <= -7.5e+56) or not (z <= 2.4e-37):
		tmp = z * t
	else:
		tmp = x * y
	return tmp

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -7.5e+56) || !(z <= 2.4e-37))
		tmp = Float64(z * t);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -7.5e+56) || ~((z <= 2.4e-37)))
		tmp = z * t;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -7.5e+56], N[Not[LessEqual[z, 2.4e-37]], $MachinePrecision]], N[(z * t), $MachinePrecision], N[(x * y), $MachinePrecision]]

\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;z \leq -7.5 \cdot 10^{+56} \lor \neg \left(z \leq 2.4 \cdot 10^{-37}\right):\\
\;\;\;\;z \cdot t\\

\mathbf{else}:\\
\;\;\;\;x \cdot y\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes

  2. if z < -7.4999999999999999e56 or 2.39999999999999991e-37 < z

    1. Initial program 98.4%

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

    2. Taylor expanded in x around 0 72.6%

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

    if -7.4999999999999999e56 < z < 2.39999999999999991e-37

    1. Initial program 100.0%

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

    2. Taylor expanded in x around inf 76.7%

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

  4. Final simplification74.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7.5 \cdot 10^{+56} \lor \neg \left(z \leq 2.4 \cdot 10^{-37}\right):\\ \;\;\;\;z \cdot t\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 4: 99.2% accurate, 1.0× speedup?

\[\begin{array}{l} \\ x \cdot y + z \cdot t \end{array} \]
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}

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

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

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

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

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

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

\begin{array}{l}

\\
x \cdot y + z \cdot t
\end{array}
Derivation

  1. Initial program 99.2%

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

  2. Final simplification99.2%

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

Alternative 5: 52.7% accurate, 2.3× speedup?

\[\begin{array}{l} \\ z \cdot t \end{array} \]
(FPCore (x y z t) :precision binary64 (* z t))
double code(double x, double y, double z, double t) {
	return z * t;
}

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 = z * t
end function

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

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

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

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

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

\begin{array}{l}

\\
z \cdot t
\end{array}
Derivation

  1. Initial program 99.2%

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

  2. Taylor expanded in x around 0 49.8%

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

  3. Final simplification49.8%

    \[\leadsto z \cdot t \]

Reproduce

?
herbie shell --seed 2023318 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))