Linear.Quaternion:$c/ from linear-1.19.1.3, A

Percentage Accurate: 98.3% → 99.4%

Time: 4.5s

Alternatives: 8

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.4% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma z z (fma x y (* 2.0 (* z z)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]
2. Step-by-step derivation

   1. +-commutative 97.9%

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

   2. fma-def 98.0%

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

   3. associate-+l+ 98.0%

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

   4. fma-def 99.6%

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

   5. count-2 99.6%

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

3. Simplified 99.6%

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

4. Final simplification 99.6%

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

Alternative 2: 99.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+308}:\\ \;\;\;\;z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;3 \cdot {z}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 1e+308)
   (+ (* z z) (+ (* z z) (+ (* z z) (* x y))))
   (* 3.0 (pow z 2.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+308) {
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	} else {
		tmp = 3.0 * pow(z, 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 1d+308) then
        tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
    else
        tmp = 3.0d0 * (z ** 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+308) {
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	} else {
		tmp = 3.0 * Math.pow(z, 2.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z * z) <= 1e+308:
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
	else:
		tmp = 3.0 * math.pow(z, 2.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e+308)
		tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y))));
	else
		tmp = Float64(3.0 * (z ^ 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 1e+308)
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	else
		tmp = 3.0 * (z ^ 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+308], N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(3.0 * N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1e308

   1. Initial program 99.9%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   if 1e308 < (*.f64 z z)

   1. Initial program 92.4%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 98.5%

      \[\leadsto \color{blue}{2 \cdot {z}^{2} + {z}^{2}} \]

   4. Simplified 98.5%

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

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+308}:\\ \;\;\;\;z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;3 \cdot {z}^{2}\\ \end{array} \]

Alternative 3: 99.3% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma x y (* (* z z) 3.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]
2. Step-by-step derivation

   1. associate-+l+ 98.0%

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

   2. associate-+l+ 98.0%

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

   3. fma-def 99.5%

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

   4. cancel-sign-sub 99.5%

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

   5. neg-mul-1 99.5%

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

   6. associate-*l* 99.5%

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

   7. count-2 99.5%

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

   8. distribute-rgt-out-- 99.5%

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

   9. metadata-eval 99.5%

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

3. Simplified 99.5%

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

4. Final simplification 99.5%

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

Alternative 4: 99.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+308}:\\ \;\;\;\;z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;{z}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 1e+308)
   (+ (* z z) (+ (* z z) (+ (* z z) (* x y))))
   (pow z 2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+308) {
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	} else {
		tmp = pow(z, 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 1d+308) then
        tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
    else
        tmp = z ** 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+308) {
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	} else {
		tmp = Math.pow(z, 2.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z * z) <= 1e+308:
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
	else:
		tmp = math.pow(z, 2.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e+308)
		tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y))));
	else
		tmp = z ^ 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 1e+308)
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	else
		tmp = z ^ 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+308], N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[z, 2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1e308

   1. Initial program 99.9%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   if 1e308 < (*.f64 z z)

   1. Initial program 92.4%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around inf 92.4%

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

   3. Taylor expanded in x around inf 92.4%

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

   4. Taylor expanded in x around 0 98.5%

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

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+308}:\\ \;\;\;\;z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;{z}^{2}\\ \end{array} \]

Alternative 5: 98.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

2. Final simplification 97.9%

   \[\leadsto z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right) \]

Alternative 6: 78.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ z \cdot z + \left(z \cdot z + x \cdot y\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

2. Taylor expanded in x around inf 80.6%

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

3. Final simplification 80.6%

   \[\leadsto z \cdot z + \left(z \cdot z + x \cdot y\right) \]

Alternative 7: 77.5% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

2. Taylor expanded in x around inf 80.6%

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

3. Taylor expanded in x around inf 80.2%

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

4. Final simplification 80.2%

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

Alternative 8: 53.6% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

2. Taylor expanded in x around 0 98.0%

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

4. Simplified 98.0%

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

5. Taylor expanded in z around 0 55.7%

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

6. Final simplification 55.7%

   \[\leadsto x \cdot y \]

Developer target: 98.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \left(3 \cdot z\right) \cdot z + y \cdot x \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023310 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
  :precision binary64

  :herbie-target
  (+ (* (* 3.0 z) z) (* y x))

  (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))