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

Percentage Accurate: 99.8% → 99.8%

Time: 10.5s

Alternatives: 6

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} \\ \mathsf{fma}\left(\sin y, z, x \cdot \cos y\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(N[Sin[y], $MachinePrecision] * z + 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. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 99.8

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 99.8

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

4. Applied rewrites 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 73.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \sin y\\ \mathbf{if}\;z \leq -4.8 \cdot 10^{+133}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 205000:\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (sin y))))
   (if (<= z -4.8e+133) t_0 (if (<= z 205000.0) (* x (cos y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * sin(y);
	double tmp;
	if (z <= -4.8e+133) {
		tmp = t_0;
	} else if (z <= 205000.0) {
		tmp = x * cos(y);
	} else {
		tmp = t_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) :: t_0
    real(8) :: tmp
    t_0 = z * sin(y)
    if (z <= (-4.8d+133)) then
        tmp = t_0
    else if (z <= 205000.0d0) then
        tmp = x * cos(y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = z * Math.sin(y);
	double tmp;
	if (z <= -4.8e+133) {
		tmp = t_0;
	} else if (z <= 205000.0) {
		tmp = x * Math.cos(y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * math.sin(y)
	tmp = 0
	if z <= -4.8e+133:
		tmp = t_0
	elif z <= 205000.0:
		tmp = x * math.cos(y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * sin(y))
	tmp = 0.0
	if (z <= -4.8e+133)
		tmp = t_0;
	elseif (z <= 205000.0)
		tmp = Float64(x * cos(y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * sin(y);
	tmp = 0.0;
	if (z <= -4.8e+133)
		tmp = t_0;
	elseif (z <= 205000.0)
		tmp = x * cos(y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.8e+133], t$95$0, If[LessEqual[z, 205000.0], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.7999999999999997e133 or 205000 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sin.f64 75.1

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

   5. Applied rewrites 75.1%

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

   if -4.7999999999999997e133 < z < 205000

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 83.5

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

   5. Applied rewrites 83.5%

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

4. Final simplification 80.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{+133}:\\ \;\;\;\;z \cdot \sin y\\ \mathbf{elif}\;z \leq 205000:\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \sin y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 75.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \cos y\\ \mathbf{if}\;y \leq -1620000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 0.0052:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot y, -0.5, z\right), y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (cos y))))
   (if (<= y -1620000.0)
     t_0
     (if (<= y 0.0052) (fma (fma (* x y) -0.5 z) y x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * cos(y);
	double tmp;
	if (y <= -1620000.0) {
		tmp = t_0;
	} else if (y <= 0.0052) {
		tmp = fma(fma((x * y), -0.5, z), y, x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(x * cos(y))
	tmp = 0.0
	if (y <= -1620000.0)
		tmp = t_0;
	elseif (y <= 0.0052)
		tmp = fma(fma(Float64(x * y), -0.5, z), y, x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1620000.0], t$95$0, If[LessEqual[y, 0.0052], N[(N[(N[(x * y), $MachinePrecision] * -0.5 + z), $MachinePrecision] * y + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.62e6 or 0.0051999999999999998 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 48.8

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

   5. Applied rewrites 48.8%

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

   if -1.62e6 < y < 0.0051999999999999998

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.3

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

   5. Applied rewrites 99.3%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1620000:\\ \;\;\;\;x \cdot \cos y\\ \mathbf{elif}\;y \leq 0.0052:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot y, -0.5, z\right), y, x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 42.4% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.5 \cdot 10^{+138}:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;z \leq 3.5 \cdot 10^{+86}:\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -9.5e+138) (* z y) (if (<= z 3.5e+86) (* 1.0 x) (* z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -9.5e+138) {
		tmp = z * y;
	} else if (z <= 3.5e+86) {
		tmp = 1.0 * x;
	} else {
		tmp = z * 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 <= (-9.5d+138)) then
        tmp = z * y
    else if (z <= 3.5d+86) then
        tmp = 1.0d0 * x
    else
        tmp = z * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -9.5e+138) {
		tmp = z * y;
	} else if (z <= 3.5e+86) {
		tmp = 1.0 * x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -9.5e+138:
		tmp = z * y
	elif z <= 3.5e+86:
		tmp = 1.0 * x
	else:
		tmp = z * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -9.5e+138)
		tmp = Float64(z * y);
	elseif (z <= 3.5e+86)
		tmp = Float64(1.0 * x);
	else
		tmp = Float64(z * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -9.5e+138)
		tmp = z * y;
	elseif (z <= 3.5e+86)
		tmp = 1.0 * x;
	else
		tmp = z * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -9.5e+138], N[(z * y), $MachinePrecision], If[LessEqual[z, 3.5e+86], N[(1.0 * x), $MachinePrecision], N[(z * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -9.49999999999999998e138 or 3.50000000000000019e86 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 54.3

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

   5. Applied rewrites 54.3%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 40.6%

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

   if -9.49999999999999998e138 < z < 3.50000000000000019e86

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 80.1

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

   5. Applied rewrites 80.1%

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

   6. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 54.4%

      \[\leadsto 1 \cdot x \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 53.6% accurate, 30.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(z * y + x), $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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 56.7

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

5. Applied rewrites 56.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, x\right)} \]
6. Add Preprocessing

Alternative 6: 17.1% accurate, 35.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(z * y), $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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 56.7

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

5. Applied rewrites 56.7%

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

6. Taylor expanded in z around inf

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

8. Applied rewrites 18.2%

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

Reproduce

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