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

Percentage Accurate: 99.8% → 99.8%

Time: 8.1s

Alternatives: 5

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.9%

   \[x \cdot \sin y + z \cdot \cos y \]

2. Final simplification 99.9%

   \[\leadsto x \cdot \sin y + z \cdot \cos y \]

Alternative 2: 82.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{+161} \lor \neg \left(z \leq 7 \cdot 10^{+43}\right):\\ \;\;\;\;z \cdot \cos y + x \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sin y + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3e+161) (not (<= z 7e+43)))
   (+ (* z (cos y)) (* x y))
   (+ (* x (sin y)) z)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3e+161) or not (z <= 7e+43):
		tmp = (z * math.cos(y)) + (x * y)
	else:
		tmp = (x * math.sin(y)) + z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3e+161) || !(z <= 7e+43))
		tmp = Float64(Float64(z * cos(y)) + Float64(x * 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 <= -3e+161) || ~((z <= 7e+43)))
		tmp = (z * cos(y)) + (x * y);
	else
		tmp = (x * sin(y)) + z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3e+161], N[Not[LessEqual[z, 7e+43]], $MachinePrecision]], N[(N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.00000000000000011e161 or 7.0000000000000002e43 < z

   1. Initial program 99.9%

      \[x \cdot \sin y + z \cdot \cos y \]

   2. Taylor expanded in y around 0 86.8%

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

   if -3.00000000000000011e161 < z < 7.0000000000000002e43

   1. Initial program 99.9%

      \[x \cdot \sin y + z \cdot \cos y \]

   2. Taylor expanded in y around 0 91.3%

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

4. Final simplification 89.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{+161} \lor \neg \left(z \leq 7 \cdot 10^{+43}\right):\\ \;\;\;\;z \cdot \cos y + x \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sin y + z\\ \end{array} \]

Alternative 3: 77.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \sin y + z \cdot \cos y \]

2. Taylor expanded in y around 0 82.2%

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

3. Final simplification 82.2%

   \[\leadsto x \cdot \sin y + z \]

Alternative 4: 52.5% 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.9%

   \[x \cdot \sin y + z \cdot \cos y \]

2. Taylor expanded in y around 0 82.2%

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

3. Taylor expanded in y around 0 56.4%

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

4. Final simplification 56.4%

   \[\leadsto z + x \cdot y \]

Alternative 5: 16.6% accurate, 69.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \sin y + z \cdot \cos y \]

2. Taylor expanded in y around 0 63.5%

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

   1. *-commutative 63.5%

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

   2. unpow2 63.5%

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

4. Simplified 63.5%

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

5. Taylor expanded in y around 0 54.7%

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

6. Taylor expanded in x around inf 17.8%

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

   1. *-commutative 17.8%

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

8. Simplified 17.8%

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

9. Final simplification 17.8%

   \[\leadsto x \cdot y \]

Reproduce

herbie shell --seed 2023283 
(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))))