Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A

Percentage Accurate: 99.9% → 100.0%

Time: 2.0s

Alternatives: 3

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.2%

   \[x - \left(y \cdot 4\right) \cdot z \]
2. Step-by-step derivation

   1. associate-*l* 100.0%

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

   2. *-commutative 100.0%

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

   3. associate-*l* 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto x - 4 \cdot \left(z \cdot y\right) \]

Alternative 2: 67.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.18 \cdot 10^{-48} \lor \neg \left(y \leq 1.4 \cdot 10^{-160}\right):\\ \;\;\;\;-4 \cdot \left(z \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.18e-48) (not (<= y 1.4e-160))) (* -4.0 (* z y)) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.18e-48) || !(y <= 1.4e-160)) {
		tmp = -4.0 * (z * y);
	} else {
		tmp = x;
	}
	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 <= (-1.18d-48)) .or. (.not. (y <= 1.4d-160))) then
        tmp = (-4.0d0) * (z * y)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.18e-48) || !(y <= 1.4e-160)) {
		tmp = -4.0 * (z * y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1.18e-48) or not (y <= 1.4e-160):
		tmp = -4.0 * (z * y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.18e-48) || !(y <= 1.4e-160))
		tmp = Float64(-4.0 * Float64(z * y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1.18e-48) || ~((y <= 1.4e-160)))
		tmp = -4.0 * (z * y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.18e-48], N[Not[LessEqual[y, 1.4e-160]], $MachinePrecision]], N[(-4.0 * N[(z * y), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -1.18000000000000007e-48 or 1.40000000000000008e-160 < y

   1. Initial program 98.9%

      \[x - \left(y \cdot 4\right) \cdot z \]
   2. Step-by-step derivation

      1. associate-*l* 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-*l* 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 68.5%

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

   if -1.18000000000000007e-48 < y < 1.40000000000000008e-160

   1. Initial program 100.0%

      \[x - \left(y \cdot 4\right) \cdot z \]
   2. Step-by-step derivation

      1. associate-*l* 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-*l* 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 78.0%

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

4. Final simplification 71.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.18 \cdot 10^{-48} \lor \neg \left(y \leq 1.4 \cdot 10^{-160}\right):\\ \;\;\;\;-4 \cdot \left(z \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3: 50.4% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.2%

   \[x - \left(y \cdot 4\right) \cdot z \]
2. Step-by-step derivation

   1. associate-*l* 100.0%

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

   2. *-commutative 100.0%

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

   3. associate-*l* 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around inf 45.4%

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

5. Final simplification 45.4%

   \[\leadsto x \]

Reproduce

herbie shell --seed 2023290 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4.0) z)))