Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, D

Percentage Accurate: 100.0% → 100.0%

Time: 3.2s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* x y) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

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) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((x * y) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * y) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * y) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* x y) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

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) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((x * y) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * y) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * y) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma y (/ x 2.0) (/ z -8.0)))

C

double code(double x, double y, double z) {
	return fma(y, (x / 2.0), (z / -8.0));
}

Julia

function code(x, y, z)
	return fma(y, Float64(x / 2.0), Float64(z / -8.0))
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]
2. Step-by-step derivation

   1. *-commutative 100.0%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{2} - \frac{z}{8} \]

   2. associate-/l* 100.0%

      \[\leadsto \color{blue}{y \cdot \frac{x}{2}} - \frac{z}{8} \]

   3. fma-neg 100.0%

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

   4. distribute-neg-frac2 100.0%

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

   5. metadata-eval 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{x}{2}, \frac{z}{-8}\right)} \]
4. Add Preprocessing

5. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(y, \frac{x}{2}, \frac{z}{-8}\right) \]
6. Add Preprocessing

Alternative 2: 67.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+137} \lor \neg \left(z \leq -1.6 \cdot 10^{+58}\right) \land \left(z \leq -2.3 \cdot 10^{+16} \lor \neg \left(z \leq 2.3 \cdot 10^{+122}\right)\right):\\ \;\;\;\;z \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3.4e+137)
         (and (not (<= z -1.6e+58))
              (or (<= z -2.3e+16) (not (<= z 2.3e+122)))))
   (* z -0.125)
   (* x (* y 0.5))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.4e+137) || (!(z <= -1.6e+58) && ((z <= -2.3e+16) || !(z <= 2.3e+122)))) {
		tmp = z * -0.125;
	} else {
		tmp = x * (y * 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 ((z <= (-3.4d+137)) .or. (.not. (z <= (-1.6d+58))) .and. (z <= (-2.3d+16)) .or. (.not. (z <= 2.3d+122))) then
        tmp = z * (-0.125d0)
    else
        tmp = x * (y * 0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.4e+137) || (!(z <= -1.6e+58) && ((z <= -2.3e+16) || !(z <= 2.3e+122)))) {
		tmp = z * -0.125;
	} else {
		tmp = x * (y * 0.5);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3.4e+137) or (not (z <= -1.6e+58) and ((z <= -2.3e+16) or not (z <= 2.3e+122))):
		tmp = z * -0.125
	else:
		tmp = x * (y * 0.5)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.4e+137) || (!(z <= -1.6e+58) && ((z <= -2.3e+16) || !(z <= 2.3e+122))))
		tmp = Float64(z * -0.125);
	else
		tmp = Float64(x * Float64(y * 0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3.4e+137) || (~((z <= -1.6e+58)) && ((z <= -2.3e+16) || ~((z <= 2.3e+122)))))
		tmp = z * -0.125;
	else
		tmp = x * (y * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3.4e+137], And[N[Not[LessEqual[z, -1.6e+58]], $MachinePrecision], Or[LessEqual[z, -2.3e+16], N[Not[LessEqual[z, 2.3e+122]], $MachinePrecision]]]], N[(z * -0.125), $MachinePrecision], N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.39999999999999986e137 or -1.60000000000000008e58 < z < -2.3e16 or 2.3000000000000001e122 < z

   1. Initial program 100.0%

      \[\frac{x \cdot y}{2} - \frac{z}{8} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 83.1%

      \[\leadsto \color{blue}{-0.125 \cdot z} \]

   if -3.39999999999999986e137 < z < -1.60000000000000008e58 or -2.3e16 < z < 2.3000000000000001e122

   1. Initial program 100.0%

      \[\frac{x \cdot y}{2} - \frac{z}{8} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 73.7%

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

      1. *-commutative 73.7%

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

      2. associate-*r* 73.7%

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

      3. *-commutative 73.7%

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

   5. Simplified 73.7%

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

4. Final simplification 77.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+137} \lor \neg \left(z \leq -1.6 \cdot 10^{+58}\right) \land \left(z \leq -2.3 \cdot 10^{+16} \lor \neg \left(z \leq 2.3 \cdot 10^{+122}\right)\right):\\ \;\;\;\;z \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{y \cdot x}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* y x) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((y * x) / 2.0) - (z / 8.0);
}

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 * x) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((y * x) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((y * x) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(y * x) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((y * x) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(y * x), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \frac{y \cdot x}{2} - \frac{z}{8} \]
4. Add Preprocessing

Alternative 4: 50.5% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ z \cdot -0.125 \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return z * -0.125;
}

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 * (-0.125d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 47.3%

   \[\leadsto \color{blue}{-0.125 \cdot z} \]

4. Final simplification 47.3%

   \[\leadsto z \cdot -0.125 \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024052 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, D"
  :precision binary64
  (- (/ (* x y) 2.0) (/ z 8.0)))