Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1

Percentage Accurate: 98.4% → 99.0%

Time: 6.0s

Alternatives: 6

Speedup: 0.4×

• 34.2% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot 4 \leq -4 \cdot 10^{+209}:\\ \;\;\;\;y \cdot \left(\frac{{x}^{2}}{y} - 4 \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, x, y \cdot \left(z \cdot -4\right)\right)\\ \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 (<= (* y 4.0) -4e+209)
   (* y (- (/ (pow x 2.0) y) (* 4.0 z)))
   (fma x x (* y (* z -4.0)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * 4.0) <= -4e+209) {
		tmp = y * ((pow(x, 2.0) / y) - (4.0 * z));
	} else {
		tmp = fma(x, x, (y * (z * -4.0)));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(y * 4.0) <= -4e+209)
		tmp = Float64(y * Float64(Float64((x ^ 2.0) / y) - Float64(4.0 * z)));
	else
		tmp = fma(x, x, Float64(y * Float64(z * -4.0)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y #s(literal 4 binary64)) < -4.0000000000000003e209

   1. Initial program 94.1%

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

   3. Taylor expanded in y around inf 100.0%

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

   if -4.0000000000000003e209 < (*.f64 y #s(literal 4 binary64))

   1. Initial program 98.3%

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

      1. fmm-def 98.7%

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

      2. associate-*l* 98.7%

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

      3. *-commutative 98.7%

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

      4. distribute-rgt-neg-in 98.7%

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

      5. distribute-rgt-neg-in 98.7%

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

      6. metadata-eval 98.7%

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

   3. Simplified 98.7%

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

Alternative 2: 98.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \mathsf{fma}\left(x, x, y \cdot \left(z \cdot -4\right)\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 x x (* y (* z -4.0))))

C

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return fma(x, x, Float64(y * Float64(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 * x + N[(y * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.0%

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

   1. fmm-def 98.4%

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

   2. associate-*l* 98.4%

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

   3. *-commutative 98.4%

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

   4. distribute-rgt-neg-in 98.4%

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

   5. distribute-rgt-neg-in 98.4%

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

   6. metadata-eval 98.4%

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

3. Simplified 98.4%

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

Alternative 3: 99.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := x \cdot x - \left(y \cdot 4\right) \cdot z\\ \mathbf{if}\;t\_0 \leq \infty:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \left(y \cdot z\right)\\ \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
 (let* ((t_0 (- (* x x) (* (* y 4.0) z))))
   (if (<= t_0 INFINITY) t_0 (* 4.0 (* y z)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = (x * x) - ((y * 4.0) * z);
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0;
	} else {
		tmp = 4.0 * (y * z);
	}
	return tmp;
}

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double t_0 = (x * x) - ((y * 4.0) * z);
	double tmp;
	if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = t_0;
	} else {
		tmp = 4.0 * (y * z);
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	t_0 = (x * x) - ((y * 4.0) * z)
	tmp = 0
	if t_0 <= math.inf:
		tmp = t_0
	else:
		tmp = 4.0 * (y * z)
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(Float64(x * x) - Float64(Float64(y * 4.0) * z))
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = t_0;
	else
		tmp = Float64(4.0 * Float64(y * z));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	t_0 = (x * x) - ((y * 4.0) * z);
	tmp = 0.0;
	if (t_0 <= Inf)
		tmp = t_0;
	else
		tmp = 4.0 * (y * z);
	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_] := Block[{t$95$0 = N[(N[(x * x), $MachinePrecision] - N[(N[(y * 4.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, Infinity], t$95$0, N[(4.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) z)) < +inf.0

   1. Initial program 100.0%

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

   if +inf.0 < (-.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) z))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around 0 0.0%

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

      1. rem-square-sqrt 0.0%

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

      2. fabs-sqr 0.0%

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

      3. rem-square-sqrt 0.0%

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

      4. fabs-neg 0.0%

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

      5. distribute-lft-neg-in 0.0%

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

      6. metadata-eval 0.0%

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

      7. *-commutative 0.0%

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

      8. *-commutative 0.0%

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

      9. associate-*r* 0.0%

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

      10. rem-square-sqrt 0.0%

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

      11. fabs-sqr 0.0%

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

      12. rem-square-sqrt 80.0%

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

      13. associate-*r* 80.0%

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

      14. *-commutative 80.0%

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

      15. associate-*r* 80.0%

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

   5. Simplified 80.0%

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

   6. Taylor expanded in x around 0 80.0%

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

Alternative 4: 99.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := \left(y \cdot 4\right) \cdot z\\ \mathbf{if}\;t\_0 \leq 2 \cdot 10^{+125}:\\ \;\;\;\;x \cdot x - t\_0\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x \cdot \frac{x}{y} - 4 \cdot z\right)\\ \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
 (let* ((t_0 (* (* y 4.0) z)))
   (if (<= t_0 2e+125) (- (* x x) t_0) (* y (- (* x (/ x y)) (* 4.0 z))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = (y * 4.0) * z;
	double tmp;
	if (t_0 <= 2e+125) {
		tmp = (x * x) - t_0;
	} else {
		tmp = y * ((x * (x / y)) - (4.0 * z));
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (y * 4.0d0) * z
    if (t_0 <= 2d+125) then
        tmp = (x * x) - t_0
    else
        tmp = y * ((x * (x / y)) - (4.0d0 * z))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double t_0 = (y * 4.0) * z;
	double tmp;
	if (t_0 <= 2e+125) {
		tmp = (x * x) - t_0;
	} else {
		tmp = y * ((x * (x / y)) - (4.0 * z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	t_0 = (y * 4.0) * z
	tmp = 0
	if t_0 <= 2e+125:
		tmp = (x * x) - t_0
	else:
		tmp = y * ((x * (x / y)) - (4.0 * z))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(Float64(y * 4.0) * z)
	tmp = 0.0
	if (t_0 <= 2e+125)
		tmp = Float64(Float64(x * x) - t_0);
	else
		tmp = Float64(y * Float64(Float64(x * Float64(x / y)) - Float64(4.0 * z)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	t_0 = (y * 4.0) * z;
	tmp = 0.0;
	if (t_0 <= 2e+125)
		tmp = (x * x) - t_0;
	else
		tmp = y * ((x * (x / y)) - (4.0 * z));
	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_] := Block[{t$95$0 = N[(N[(y * 4.0), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$0, 2e+125], N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision], N[(y * N[(N[(x * N[(x / y), $MachinePrecision]), $MachinePrecision] - N[(4.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 y #s(literal 4 binary64)) z) < 1.9999999999999998e125

   1. Initial program 100.0%

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

   if 1.9999999999999998e125 < (*.f64 (*.f64 y #s(literal 4 binary64)) z)

   1. Initial program 89.1%

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

   3. Taylor expanded in y around inf 97.8%

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

      1. pow2 97.8%

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

      2. associate-/l* 100.0%

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

   5. Applied egg-rr 100.0%

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

Alternative 5: 83.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 6.5 \cdot 10^{-11}:\\ \;\;\;\;-4 \cdot \left(y \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x - y \cdot \left(z \cdot -4\right)\\ \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 x) 6.5e-11) (* -4.0 (* y z)) (- (* x x) (* y (* z -4.0)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((x * x) <= 6.5e-11) {
		tmp = -4.0 * (y * z);
	} else {
		tmp = (x * x) - (y * (z * -4.0));
	}
	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 * x) <= 6.5d-11) then
        tmp = (-4.0d0) * (y * z)
    else
        tmp = (x * x) - (y * (z * (-4.0d0)))
    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 * x) <= 6.5e-11) {
		tmp = -4.0 * (y * z);
	} else {
		tmp = (x * x) - (y * (z * -4.0));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (x * x) <= 6.5e-11:
		tmp = -4.0 * (y * z)
	else:
		tmp = (x * x) - (y * (z * -4.0))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(x * x) <= 6.5e-11)
		tmp = Float64(-4.0 * Float64(y * z));
	else
		tmp = Float64(Float64(x * x) - Float64(y * Float64(z * -4.0)));
	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 * x) <= 6.5e-11)
		tmp = -4.0 * (y * z);
	else
		tmp = (x * x) - (y * (z * -4.0));
	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[N[(x * x), $MachinePrecision], 6.5e-11], N[(-4.0 * N[(y * z), $MachinePrecision]), $MachinePrecision], N[(N[(x * x), $MachinePrecision] - N[(y * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 6.49999999999999953e-11

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 81.3%

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

   if 6.49999999999999953e-11 < (*.f64 x x)

   1. Initial program 96.0%

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

   3. Taylor expanded in y around 0 96.0%

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

      1. rem-square-sqrt 52.8%

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

      2. fabs-sqr 52.8%

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

      3. rem-square-sqrt 85.6%

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

      4. fabs-neg 85.6%

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

      5. distribute-lft-neg-in 85.6%

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

      6. metadata-eval 85.6%

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

      7. *-commutative 85.6%

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

      8. *-commutative 85.6%

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

      9. associate-*r* 85.6%

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

      10. rem-square-sqrt 42.4%

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

      11. fabs-sqr 42.4%

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

      12. rem-square-sqrt 80.7%

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

      13. associate-*r* 80.7%

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

      14. *-commutative 80.7%

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

      15. associate-*r* 80.7%

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

   5. Simplified 80.7%

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

Alternative 6: 52.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ -4 \cdot \left(y \cdot z\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 (* -4.0 (* y z)))

C

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

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 = (-4.0d0) * (y * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.0%

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

3. Taylor expanded in x around 0 51.4%

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

Reproduce

herbie shell --seed 2024165 
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4.0) z)))