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

Percentage Accurate: 99.9% → 100.0%

Time: 2.8s

Alternatives: 4

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, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \mathsf{fma}\left(y, z \cdot -4, x\right) \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (fma y (* z -4.0) x))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return fma(y, (z * -4.0), x);
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return fma(y, Float64(z * -4.0), x)
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(y * N[(z * -4.0), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

   1. sub-neg 100.0%

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

   2. distribute-rgt-neg-out 100.0%

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

   3. +-commutative 100.0%

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

   4. associate-*l* 99.6%

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

   5. distribute-rgt-neg-in 99.6%

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

   6. *-commutative 99.6%

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

   7. fma-define 99.6%

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

   8. distribute-rgt-neg-in 99.6%

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

   9. metadata-eval 99.6%

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

3. Simplified 99.6%

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

Alternative 2: 68.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{+133}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.22 \cdot 10^{+53}:\\ \;\;\;\;y \cdot \left(z \cdot -4\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= x -9.5e+133) x (if (<= x 1.22e+53) (* y (* z -4.0)) x)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.5e+133) {
		tmp = x;
	} else if (x <= 1.22e+53) {
		tmp = y * (z * -4.0);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= (-9.5d+133)) then
        tmp = x
    else if (x <= 1.22d+53) then
        tmp = y * (z * (-4.0d0))
    else
        tmp = x
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.5e+133) {
		tmp = x;
	} else if (x <= 1.22e+53) {
		tmp = y * (z * -4.0);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if x <= -9.5e+133:
		tmp = x
	elif x <= 1.22e+53:
		tmp = y * (z * -4.0)
	else:
		tmp = x
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (x <= -9.5e+133)
		tmp = x;
	elseif (x <= 1.22e+53)
		tmp = Float64(y * Float64(z * -4.0));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -9.5e+133)
		tmp = x;
	elseif (x <= 1.22e+53)
		tmp = y * (z * -4.0);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[x, -9.5e+133], x, If[LessEqual[x, 1.22e+53], N[(y * N[(z * -4.0), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -9.49999999999999996e133 or 1.21999999999999999e53 < x

   1. Initial program 100.0%

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

      1. associate-*l* 98.9%

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

   3. Simplified 98.9%

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

   5. Taylor expanded in x around inf 84.2%

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

   if -9.49999999999999996e133 < x < 1.21999999999999999e53

   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)} \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 73.0%

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

      1. *-commutative 73.0%

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

      2. associate-*r* 73.0%

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

   7. Simplified 73.0%

      \[\leadsto \color{blue}{y \cdot \left(z \cdot -4\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 100.0% accurate, 1.0× speedup

Math

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

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (- x (* y (* z 4.0))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return x - (y * (z * 4.0));
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 * (z * 4.0d0))
end function

Java

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

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return x - (y * (z * 4.0))

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(x - Float64(y * Float64(z * 4.0)))
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = x - (y * (z * 4.0));
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(x - N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

   1. associate-*l* 99.6%

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

3. Simplified 99.6%

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

5. Final simplification 99.6%

   \[\leadsto x - y \cdot \left(z \cdot 4\right) \]
6. Add Preprocessing

Alternative 4: 50.8% accurate, 7.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ x \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 x)

C

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

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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

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

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return x

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return x
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = x;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

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

   1. associate-*l* 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around inf 48.4%

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

Reproduce

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