Diagrams.ThreeD.Transform:aboutX from diagrams-lib-1.3.0.3, B

Percentage Accurate: 99.8% → 99.8%

Time: 8.4s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

Alternative 2: 86.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8 \cdot 10^{+112} \lor \neg \left(z \leq 8.2 \cdot 10^{+36}\right):\\ \;\;\;\;z \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sin y + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -8e+112) (not (<= z 8.2e+36)))
   (* z (cos y))
   (+ (* x (sin y)) z)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8e+112) || !(z <= 8.2e+36)) {
		tmp = z * Math.cos(y);
	} else {
		tmp = (x * Math.sin(y)) + z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -8e+112) or not (z <= 8.2e+36):
		tmp = z * math.cos(y)
	else:
		tmp = (x * math.sin(y)) + z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -8e+112) || !(z <= 8.2e+36))
		tmp = Float64(z * cos(y));
	else
		tmp = Float64(Float64(x * sin(y)) + z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -8e+112) || ~((z <= 8.2e+36)))
		tmp = z * cos(y);
	else
		tmp = (x * sin(y)) + z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -8e+112], N[Not[LessEqual[z, 8.2e+36]], $MachinePrecision]], N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -7.9999999999999994e112 or 8.20000000000000026e36 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 90.8%

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

   if -7.9999999999999994e112 < z < 8.20000000000000026e36

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 92.7%

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

4. Final simplification 92.0%

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

Alternative 3: 75.1% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.019) (not (<= y 0.026)))
   (* x (sin y))
   (+ z (* y (+ x (* y (+ (* z -0.5) (* -0.16666666666666666 (* x y)))))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.0189999999999999995 or 0.0259999999999999988 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf 60.9%

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

   if -0.0189999999999999995 < y < 0.0259999999999999988

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.9%

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

4. Final simplification 82.0%

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

Alternative 4: 51.5% accurate, 12.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in y around 0 55.7%

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

4. Final simplification 55.7%

   \[\leadsto z + y \cdot \left(x + y \cdot \left(z \cdot -0.5 + -0.16666666666666666 \cdot \left(x \cdot y\right)\right)\right) \]
5. Add Preprocessing

Alternative 5: 40.5% accurate, 25.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 5.6 \cdot 10^{+211}:\\ \;\;\;\;z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= x 5.6e+211) z (* x y)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= 5.6e+211) {
		tmp = z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 5.6e+211:
		tmp = z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 5.6e+211)
		tmp = z;
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= 5.6e+211)
		tmp = z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 5.6e+211], z, N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 5.5999999999999999e211

   1. Initial program 99.8%

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

      1. add-cube-cbrt 99.2%

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

      2. pow3 99.2%

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

   4. Applied egg-rr 99.2%

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

   5. Taylor expanded in y around 0 48.4%

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

   if 5.5999999999999999e211 < x

   1. Initial program 99.6%

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

   3. Taylor expanded in y around 0 54.3%

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

      1. +-commutative 54.3%

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

   5. Simplified 54.3%

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

   6. Taylor expanded in x around inf 40.3%

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

      1. *-commutative 40.3%

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

   8. Simplified 40.3%

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

4. Final simplification 47.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 5.6 \cdot 10^{+211}:\\ \;\;\;\;z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 52.6% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in y around 0 55.7%

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

   1. +-commutative 55.7%

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

5. Simplified 55.7%

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

6. Final simplification 55.7%

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

Alternative 7: 39.3% accurate, 207.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 99.8%

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

   1. add-cube-cbrt 99.1%

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

   2. pow3 99.2%

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

4. Applied egg-rr 99.2%

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

5. Taylor expanded in y around 0 45.9%

   \[\leadsto \color{blue}{z} \]
6. Add Preprocessing

Reproduce

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