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

Percentage Accurate: 99.8% → 99.8%

Time: 8.1s

Alternatives: 7

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, 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]

Derivation

1. Initial program 99.8%

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

Alternative 2: 86.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.7 \cdot 10^{-42} \lor \neg \left(z \leq 7.6 \cdot 10^{-23}\right):\\ \;\;\;\;x + z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3.7e-42) (not (<= z 7.6e-23)))
   (+ x (* z (sin y)))
   (* x (cos y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.7e-42) || !(z <= 7.6e-23)) {
		tmp = x + (z * sin(y));
	} 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 ((z <= (-3.7d-42)) .or. (.not. (z <= 7.6d-23))) then
        tmp = x + (z * sin(y))
    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 ((z <= -3.7e-42) || !(z <= 7.6e-23)) {
		tmp = x + (z * Math.sin(y));
	} else {
		tmp = x * Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3.7e-42) or not (z <= 7.6e-23):
		tmp = x + (z * math.sin(y))
	else:
		tmp = x * math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.7e-42) || !(z <= 7.6e-23))
		tmp = Float64(x + Float64(z * sin(y)));
	else
		tmp = Float64(x * cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3.7e-42) || ~((z <= 7.6e-23)))
		tmp = x + (z * sin(y));
	else
		tmp = x * cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3.7e-42], N[Not[LessEqual[z, 7.6e-23]], $MachinePrecision]], N[(x + N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.7000000000000002e-42 or 7.60000000000000023e-23 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 90.5%

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

   if -3.7000000000000002e-42 < z < 7.60000000000000023e-23

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 88.9%

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

4. Final simplification 89.8%

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

Alternative 3: 75.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.062) (not (<= y 0.032)))
   (* z (sin y))
   (+ x (* y (+ z (* y (* x -0.5)))))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.062) || !(y <= 0.032)) {
		tmp = z * Math.sin(y);
	} else {
		tmp = x + (y * (z + (y * (x * -0.5))));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -0.062) or not (y <= 0.032):
		tmp = z * math.sin(y)
	else:
		tmp = x + (y * (z + (y * (x * -0.5))))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -0.062) || !(y <= 0.032))
		tmp = Float64(z * sin(y));
	else
		tmp = Float64(x + Float64(y * Float64(z + Float64(y * Float64(x * -0.5)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -0.062) || ~((y <= 0.032)))
		tmp = z * sin(y);
	else
		tmp = x + (y * (z + (y * (x * -0.5))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -0.062], N[Not[LessEqual[y, 0.032]], $MachinePrecision]], N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(z + N[(y * N[(x * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -0.062 or 0.032000000000000001 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 56.2%

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

   if -0.062 < y < 0.032000000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.7%

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

      1. associate-*r* 99.7%

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

      2. *-commutative 99.7%

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

   5. Simplified 99.7%

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

4. Final simplification 78.5%

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

Alternative 4: 74.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.0076 \lor \neg \left(y \leq 4.2\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 -0.0076) (not (<= y 4.2)))
   (* 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 <= -0.0076) || !(y <= 4.2)) {
		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 <= (-0.0076d0)) .or. (.not. (y <= 4.2d0))) 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 <= -0.0076) || !(y <= 4.2)) {
		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 <= -0.0076) or not (y <= 4.2):
		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 <= -0.0076) || !(y <= 4.2))
		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 <= -0.0076) || ~((y <= 4.2)))
		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, -0.0076], N[Not[LessEqual[y, 4.2]], $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 < -0.00759999999999999998 or 4.20000000000000018 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf 44.7%

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

   if -0.00759999999999999998 < y < 4.20000000000000018

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.3%

      \[\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 72.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.0076 \lor \neg \left(y \leq 4.2\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: 32.2% accurate, 13.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.8 \cdot 10^{-17} \lor \neg \left(z \leq 8 \cdot 10^{+116}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -2.8e-17) (not (<= z 8e+116))) (* y z) (* y (/ x y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -2.8e-17) || !(z <= 8e+116)) {
		tmp = y * z;
	} else {
		tmp = y * (x / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -2.8e-17) or not (z <= 8e+116):
		tmp = y * z
	else:
		tmp = y * (x / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -2.8e-17) || !(z <= 8e+116))
		tmp = Float64(y * z);
	else
		tmp = Float64(y * Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -2.8e-17) || ~((z <= 8e+116)))
		tmp = y * z;
	else
		tmp = y * (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -2.8e-17], N[Not[LessEqual[z, 8e+116]], $MachinePrecision]], N[(y * z), $MachinePrecision], N[(y * N[(x / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.7999999999999999e-17 or 8.00000000000000012e116 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 72.3%

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

   4. Taylor expanded in y around 0 32.6%

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

   if -2.7999999999999999e-17 < z < 8.00000000000000012e116

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 56.1%

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

   4. Taylor expanded in y around inf 45.1%

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

   5. Taylor expanded in z around 0 40.1%

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

4. Final simplification 36.6%

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

Alternative 6: 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.6%

   \[\leadsto \color{blue}{x + y \cdot z} \]
4. Add Preprocessing

Alternative 7: 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 45.5%

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

4. Taylor expanded in y around 0 19.8%

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

5. Final simplification 19.8%

   \[\leadsto y \cdot z \]
6. Add Preprocessing

Reproduce

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