Diagrams.ThreeD.Transform:aboutY from diagrams-lib-1.3.0.3

Percentage Accurate: 99.8% → 99.8%

Time: 6.6s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z):
	return (x * math.cos(y)) + (z * math.sin(y))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z):
	return (x * math.cos(y)) + (z * math.sin(y))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma x (cos y) (* z (sin y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. fma-define 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, \cos y, z \cdot \sin y\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z):
	return (z * math.sin(y)) + (x * math.cos(y))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[x \cdot \cos y + z \cdot \sin y \]
2. Add Preprocessing

3. Final simplification 99.8%

   \[\leadsto z \cdot \sin y + x \cdot \cos y \]
4. Add Preprocessing

Alternative 3: 85.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.95 \cdot 10^{+26} \lor \neg \left(x \leq 2.5 \cdot 10^{+64}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \sin y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.95e+26) (not (<= x 2.5e+64)))
   (* x (cos y))
   (+ x (* z (sin y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.95e+26) || !(x <= 2.5e+64)) {
		tmp = x * cos(y);
	} else {
		tmp = x + (z * sin(y));
	}
	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 <= (-2.95d+26)) .or. (.not. (x <= 2.5d+64))) then
        tmp = x * cos(y)
    else
        tmp = x + (z * sin(y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.95e+26) || !(x <= 2.5e+64)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = x + (z * Math.sin(y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.95e+26) or not (x <= 2.5e+64):
		tmp = x * math.cos(y)
	else:
		tmp = x + (z * math.sin(y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.95e+26) || !(x <= 2.5e+64))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(x + Float64(z * sin(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.95e+26) || ~((x <= 2.5e+64)))
		tmp = x * cos(y);
	else
		tmp = x + (z * sin(y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.95e+26], N[Not[LessEqual[x, 2.5e+64]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(x + N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.95000000000000015e26 or 2.5e64 < x

   1. Initial program 99.8%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 87.0%

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

   if -2.95000000000000015e26 < x < 2.5e64

   1. Initial program 99.7%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 89.0%

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

4. Final simplification 88.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.95 \cdot 10^{+26} \lor \neg \left(x \leq 2.5 \cdot 10^{+64}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \sin y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -15500000 \lor \neg \left(y \leq 1.8\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(z + y \cdot \left(x \cdot -0.5 + -0.16666666666666666 \cdot \left(y \cdot z\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -15500000.0) (not (<= y 1.8)))
   (* x (cos y))
   (+ x (* y (+ z (* y (+ (* x -0.5) (* -0.16666666666666666 (* y z)))))))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -15500000.0) || !(y <= 1.8)) {
		tmp = x * cos(y);
	} else {
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))));
	}
	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 ((y <= (-15500000.0d0)) .or. (.not. (y <= 1.8d0))) then
        tmp = x * cos(y)
    else
        tmp = x + (y * (z + (y * ((x * (-0.5d0)) + ((-0.16666666666666666d0) * (y * z))))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -15500000.0) || !(y <= 1.8)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -15500000.0) or not (y <= 1.8):
		tmp = x * math.cos(y)
	else:
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -15500000.0) || !(y <= 1.8))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(x + Float64(y * Float64(z + Float64(y * Float64(Float64(x * -0.5) + Float64(-0.16666666666666666 * Float64(y * z)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -15500000.0) || ~((y <= 1.8)))
		tmp = x * cos(y);
	else
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -15500000.0], N[Not[LessEqual[y, 1.8]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(z + N[(y * N[(N[(x * -0.5), $MachinePrecision] + N[(-0.16666666666666666 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.55e7 or 1.80000000000000004 < y

   1. Initial program 99.5%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 46.8%

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

   if -1.55e7 < y < 1.80000000000000004

   1. Initial program 100.0%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 98.5%

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

4. Final simplification 73.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -15500000 \lor \neg \left(y \leq 1.8\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(z + y \cdot \left(x \cdot -0.5 + -0.16666666666666666 \cdot \left(y \cdot z\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.025:\\ \;\;\;\;z \cdot \sin y\\ \mathbf{elif}\;y \leq 1.8:\\ \;\;\;\;x + y \cdot \left(z + y \cdot \left(x \cdot -0.5 + -0.16666666666666666 \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -0.025)
   (* z (sin y))
   (if (<= y 1.8)
     (+ x (* y (+ z (* y (+ (* x -0.5) (* -0.16666666666666666 (* y z)))))))
     (* x (cos y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.025) {
		tmp = z * sin(y);
	} else if (y <= 1.8) {
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))));
	} else {
		tmp = x * cos(y);
	}
	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 (y <= (-0.025d0)) then
        tmp = z * sin(y)
    else if (y <= 1.8d0) then
        tmp = x + (y * (z + (y * ((x * (-0.5d0)) + ((-0.16666666666666666d0) * (y * z))))))
    else
        tmp = x * cos(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.025) {
		tmp = z * Math.sin(y);
	} else if (y <= 1.8) {
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))));
	} else {
		tmp = x * Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -0.025:
		tmp = z * math.sin(y)
	elif y <= 1.8:
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))))
	else:
		tmp = x * math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -0.025)
		tmp = Float64(z * sin(y));
	elseif (y <= 1.8)
		tmp = Float64(x + Float64(y * Float64(z + Float64(y * Float64(Float64(x * -0.5) + Float64(-0.16666666666666666 * Float64(y * z)))))));
	else
		tmp = Float64(x * cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -0.025)
		tmp = z * sin(y);
	elseif (y <= 1.8)
		tmp = x + (y * (z + (y * ((x * -0.5) + (-0.16666666666666666 * (y * z))))));
	else
		tmp = x * cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -0.025], N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.8], N[(x + N[(y * N[(z + N[(y * N[(N[(x * -0.5), $MachinePrecision] + N[(-0.16666666666666666 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -0.025000000000000001

   1. Initial program 99.6%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 60.4%

      \[\leadsto \color{blue}{z \cdot \sin y} \]

   if -0.025000000000000001 < y < 1.80000000000000004

   1. Initial program 100.0%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.2%

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

   if 1.80000000000000004 < y

   1. Initial program 99.5%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 52.4%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.025:\\ \;\;\;\;z \cdot \sin y\\ \mathbf{elif}\;y \leq 1.8:\\ \;\;\;\;x + y \cdot \left(z + y \cdot \left(x \cdot -0.5 + -0.16666666666666666 \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 34.7% accurate, 13.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{+205} \lor \neg \left(z \leq 8.4 \cdot 10^{+198}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.85e+205) (not (<= z 8.4e+198))) (* y z) (* z (/ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.85e+205) || !(z <= 8.4e+198)) {
		tmp = y * z;
	} else {
		tmp = z * (x / z);
	}
	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 <= (-1.85d+205)) .or. (.not. (z <= 8.4d+198))) then
        tmp = y * z
    else
        tmp = z * (x / z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.85e+205) || !(z <= 8.4e+198)) {
		tmp = y * z;
	} else {
		tmp = z * (x / z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.85e+205) or not (z <= 8.4e+198):
		tmp = y * z
	else:
		tmp = z * (x / z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.85e+205) || !(z <= 8.4e+198))
		tmp = Float64(y * z);
	else
		tmp = Float64(z * Float64(x / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.85e+205) || ~((z <= 8.4e+198)))
		tmp = y * z;
	else
		tmp = z * (x / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.85e+205], N[Not[LessEqual[z, 8.4e+198]], $MachinePrecision]], N[(y * z), $MachinePrecision], N[(z * N[(x / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.8499999999999999e205 or 8.40000000000000052e198 < z

   1. Initial program 99.7%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 85.0%

      \[\leadsto \color{blue}{z \cdot \sin y} \]

   4. Taylor expanded in y around 0 39.8%

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

   if -1.8499999999999999e205 < z < 8.40000000000000052e198

   1. Initial program 99.8%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf 87.0%

      \[\leadsto \color{blue}{z \cdot \left(\sin y + \frac{x \cdot \cos y}{z}\right)} \]
   4. Step-by-step derivation

      1. associate-/l* 86.8%

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

   5. Simplified 86.8%

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

   6. Taylor expanded in y around 0 45.8%

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

   7. Taylor expanded in y around 0 39.5%

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

4. Final simplification 39.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{+205} \lor \neg \left(z \leq 8.4 \cdot 10^{+198}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{x}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.2% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[x \cdot \cos y + z \cdot \sin y \]
2. Add Preprocessing

3. Taylor expanded in y around 0 53.1%

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

   1. +-commutative 53.1%

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

5. Simplified 53.1%

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

6. Final simplification 53.1%

   \[\leadsto x + y \cdot z \]
7. Add Preprocessing

Alternative 8: 17.0% accurate, 69.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[x \cdot \cos y + z \cdot \sin y \]
2. Add Preprocessing

3. Taylor expanded in x around 0 40.9%

   \[\leadsto \color{blue}{z \cdot \sin y} \]

4. Taylor expanded in y around 0 15.6%

   \[\leadsto \color{blue}{y \cdot z} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024106 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Transform:aboutY from diagrams-lib-1.3.0.3"
  :precision binary64
  (+ (* x (cos y)) (* z (sin y))))