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

Percentage Accurate: 99.2% → 99.6%

Time: 1.5s

Alternatives: 4

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.2% 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.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.8%

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

   1. fma-def 99.6%

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

3. Simplified 99.6%

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

4. Final simplification 99.6%

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

Alternative 2: 67.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.3 \cdot 10^{-103}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 310000000000 \lor \neg \left(y \leq 2.1 \cdot 10^{+48}\right) \land y \leq 2.2 \cdot 10^{+114}:\\ \;\;\;\;z \cdot t\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -8.3e-103)
   (* x y)
   (if (or (<= y 310000000000.0) (and (not (<= y 2.1e+48)) (<= y 2.2e+114)))
     (* z t)
     (* x y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -8.3e-103) {
		tmp = x * y;
	} else if ((y <= 310000000000.0) || (!(y <= 2.1e+48) && (y <= 2.2e+114))) {
		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 <= (-8.3d-103)) then
        tmp = x * y
    else if ((y <= 310000000000.0d0) .or. (.not. (y <= 2.1d+48)) .and. (y <= 2.2d+114)) 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 <= -8.3e-103) {
		tmp = x * y;
	} else if ((y <= 310000000000.0) || (!(y <= 2.1e+48) && (y <= 2.2e+114))) {
		tmp = z * t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -8.3e-103:
		tmp = x * y
	elif (y <= 310000000000.0) or (not (y <= 2.1e+48) and (y <= 2.2e+114)):
		tmp = z * t
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -8.3e-103)
		tmp = Float64(x * y);
	elseif ((y <= 310000000000.0) || (!(y <= 2.1e+48) && (y <= 2.2e+114)))
		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 <= -8.3e-103)
		tmp = x * y;
	elseif ((y <= 310000000000.0) || (~((y <= 2.1e+48)) && (y <= 2.2e+114)))
		tmp = z * t;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -8.3e-103], N[(x * y), $MachinePrecision], If[Or[LessEqual[y, 310000000000.0], And[N[Not[LessEqual[y, 2.1e+48]], $MachinePrecision], LessEqual[y, 2.2e+114]]], N[(z * t), $MachinePrecision], N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -8.30000000000000006e-103 or 3.1e11 < y < 2.0999999999999998e48 or 2.2e114 < y

   1. Initial program 98.4%

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

   2. Taylor expanded in x around inf 68.5%

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

   if -8.30000000000000006e-103 < y < 3.1e11 or 2.0999999999999998e48 < y < 2.2e114

   1. Initial program 99.2%

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

   2. Taylor expanded in x around 0 71.3%

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

4. Final simplification 69.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8.3 \cdot 10^{-103}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 310000000000 \lor \neg \left(y \leq 2.1 \cdot 10^{+48}\right) \land y \leq 2.2 \cdot 10^{+114}:\\ \;\;\;\;z \cdot t\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 3: 99.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

2. Final simplification 98.8%

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

Alternative 4: 52.7% 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.8%

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

2. Taylor expanded in x around 0 54.0%

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

3. Final simplification 54.0%

   \[\leadsto z \cdot t \]

Reproduce

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