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

Percentage Accurate: 99.1% → 99.6%

Time: 2.5s

Alternatives: 4

Speedup: 0.5×

• 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.1% 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.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot t + x \cdot y\\ \mathbf{if}\;t_1 \leq \infty:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* z t) (* x y)))) (if (<= t_1 INFINITY) t_1 (* x y))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * t) + (x * y);
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z * t) + (x * y);
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * t) + (x * y)
	tmp = 0
	if t_1 <= math.inf:
		tmp = t_1
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * t) + Float64(x * y))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * t) + (x * y);
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * t), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x y) (*.f64 z t)) < +inf.0

   1. Initial program 100.0%

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

   if +inf.0 < (+.f64 (*.f64 x y) (*.f64 z t))

   1. Initial program 0.0%

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

   2. Taylor expanded in x around inf 80.0%

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

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot t + x \cdot y \leq \infty:\\ \;\;\;\;z \cdot t + x \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 2: 99.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, y, z \cdot t\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 * t))
end

Wolfram

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

Derivation

1. Initial program 98.0%

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

   1. fma-def 98.4%

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

3. Simplified 98.4%

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

4. Final simplification 98.4%

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

Alternative 3: 69.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.1:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 1.65 \cdot 10^{-6} \lor \neg \left(y \leq 5.2 \cdot 10^{+40}\right) \land y \leq 2.2 \cdot 10^{+84}:\\ \;\;\;\;z \cdot t\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.1)
   (* x y)
   (if (or (<= y 1.65e-6) (and (not (<= y 5.2e+40)) (<= y 2.2e+84)))
     (* z t)
     (* x y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.1) {
		tmp = x * y;
	} else if ((y <= 1.65e-6) || (!(y <= 5.2e+40) && (y <= 2.2e+84))) {
		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 (y <= (-2.1d0)) then
        tmp = x * y
    else if ((y <= 1.65d-6) .or. (.not. (y <= 5.2d+40)) .and. (y <= 2.2d+84)) 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 (y <= -2.1) {
		tmp = x * y;
	} else if ((y <= 1.65e-6) || (!(y <= 5.2e+40) && (y <= 2.2e+84))) {
		tmp = z * t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -2.1:
		tmp = x * y
	elif (y <= 1.65e-6) or (not (y <= 5.2e+40) and (y <= 2.2e+84)):
		tmp = z * t
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.1)
		tmp = Float64(x * y);
	elseif ((y <= 1.65e-6) || (!(y <= 5.2e+40) && (y <= 2.2e+84)))
		tmp = Float64(z * t);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= -2.1)
		tmp = x * y;
	elseif ((y <= 1.65e-6) || (~((y <= 5.2e+40)) && (y <= 2.2e+84)))
		tmp = z * t;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.1], N[(x * y), $MachinePrecision], If[Or[LessEqual[y, 1.65e-6], And[N[Not[LessEqual[y, 5.2e+40]], $MachinePrecision], LessEqual[y, 2.2e+84]]], N[(z * t), $MachinePrecision], N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.10000000000000009 or 1.65000000000000008e-6 < y < 5.2000000000000001e40 or 2.1999999999999998e84 < y

   1. Initial program 96.9%

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

   2. Taylor expanded in x around inf 72.2%

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

   if -2.10000000000000009 < y < 1.65000000000000008e-6 or 5.2000000000000001e40 < y < 2.1999999999999998e84

   1. Initial program 99.2%

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

   2. Taylor expanded in x around 0 76.3%

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

4. Final simplification 74.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.1:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 1.65 \cdot 10^{-6} \lor \neg \left(y \leq 5.2 \cdot 10^{+40}\right) \land y \leq 2.2 \cdot 10^{+84}:\\ \;\;\;\;z \cdot t\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 4: 51.9% accurate, 2.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return 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 = z * t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.0%

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

2. Taylor expanded in x around 0 52.5%

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

3. Final simplification 52.5%

   \[\leadsto z \cdot t \]

Reproduce

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