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

Percentage Accurate: 62.9% → 100.0%

Time: 6.7s

Alternatives: 3

Speedup: 3.3×

• 20.4% 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 + y \cdot y\right) - y \cdot z\right) - y \cdot y \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 62.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 65.4%

   \[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{x \cdot y - y \cdot z} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. distribute-lft-out-- N/A

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

   3. lower-*.f64 N/A

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

   4. lower--.f64 100.0

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

5. Simplified 100.0%

   \[\leadsto \color{blue}{y \cdot \left(x - z\right)} \]
6. Add Preprocessing

Alternative 2: 77.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-82}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{-17}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.85e-82) (* y x) (if (<= x 1.25e-17) (* y (- z)) (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.85e-82) {
		tmp = y * x;
	} else if (x <= 1.25e-17) {
		tmp = y * -z;
	} else {
		tmp = y * x;
	}
	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 (x <= (-1.85d-82)) then
        tmp = y * x
    else if (x <= 1.25d-17) then
        tmp = y * -z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.85e-82) {
		tmp = y * x;
	} else if (x <= 1.25e-17) {
		tmp = y * -z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.85e-82:
		tmp = y * x
	elif x <= 1.25e-17:
		tmp = y * -z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.85e-82)
		tmp = Float64(y * x);
	elseif (x <= 1.25e-17)
		tmp = Float64(y * Float64(-z));
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.85e-82)
		tmp = y * x;
	elseif (x <= 1.25e-17)
		tmp = y * -z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.85e-82], N[(y * x), $MachinePrecision], If[LessEqual[x, 1.25e-17], N[(y * (-z)), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.85e-82 or 1.25e-17 < x

   1. Initial program 68.7%

      \[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 75.5

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

   5. Simplified 75.5%

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

   if -1.85e-82 < x < 1.25e-17

   1. Initial program 60.3%

      \[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

         \[\leadsto z \cdot \color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \]

      5. lower-neg.f64 89.8

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

   5. Simplified 89.8%

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

4. Final simplification 81.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-82}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{-17}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 53.6% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 65.4%

   \[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{x \cdot y} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 56.5

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

5. Simplified 56.5%

   \[\leadsto \color{blue}{y \cdot x} \]
6. Add Preprocessing

Developer Target 1: 100.0% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (* (- x z) y))

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