Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1

Percentage Accurate: 98.1% → 99.3%

Time: 5.6s

Alternatives: 4

Speedup: 1.1×

• 34.6% 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.1% 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.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

   1. lift--.f64 N/A

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

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. associate-*l* N/A

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

   7. *-commutative N/A

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

   8. distribute-lft-neg-in N/A

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

   9. lower-fma.f64 N/A

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

   10. *-commutative N/A

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

   11. distribute-rgt-neg-in N/A

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

   12. lower-*.f64 N/A

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

   13. metadata-eval 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 83.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2.2 \cdot 10^{+79}:\\ \;\;\;\;\left(z \cdot -4\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* x x) 2.2e+79) (* (* z -4.0) y) (* x x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x * x) <= 2.2e+79) {
		tmp = (z * -4.0) * y;
	} else {
		tmp = x * 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 ((x * x) <= 2.2d+79) then
        tmp = (z * (-4.0d0)) * y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x * x) <= 2.2e+79) {
		tmp = (z * -4.0) * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x * x) <= 2.2e+79:
		tmp = (z * -4.0) * y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x * x) <= 2.2e+79)
		tmp = Float64(Float64(z * -4.0) * y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x * x) <= 2.2e+79)
		tmp = (z * -4.0) * y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(x * x), $MachinePrecision], 2.2e+79], N[(N[(z * -4.0), $MachinePrecision] * y), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 2.1999999999999999e79

   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

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 80.2

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

   5. Applied rewrites 80.2%

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

   7. Applied rewrites 80.2%

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

   if 2.1999999999999999e79 < (*.f64 x x)

   1. Initial program 97.8%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. lower-*.f64 93.3

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

   5. Applied rewrites 93.3%

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

Alternative 3: 83.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2.2 \cdot 10^{+79}:\\ \;\;\;\;-4 \cdot \left(z \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* x x) 2.2e+79) (* -4.0 (* z y)) (* x x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x * x) <= 2.2e+79) {
		tmp = -4.0 * (z * y);
	} else {
		tmp = x * 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 ((x * x) <= 2.2d+79) then
        tmp = (-4.0d0) * (z * y)
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x * x) <= 2.2e+79) {
		tmp = -4.0 * (z * y);
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x * x) <= 2.2e+79:
		tmp = -4.0 * (z * y)
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x * x) <= 2.2e+79)
		tmp = Float64(-4.0 * Float64(z * y));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x * x) <= 2.2e+79)
		tmp = -4.0 * (z * y);
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(x * x), $MachinePrecision], 2.2e+79], N[(-4.0 * N[(z * y), $MachinePrecision]), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 2.1999999999999999e79

   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

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 80.2

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

   5. Applied rewrites 80.2%

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

   if 2.1999999999999999e79 < (*.f64 x x)

   1. Initial program 97.8%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. lower-*.f64 93.3

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

   5. Applied rewrites 93.3%

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

4. Final simplification 85.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2.2 \cdot 10^{+79}:\\ \;\;\;\;-4 \cdot \left(z \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 53.6% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{{x}^{2}} \]
4. Step-by-step derivation

   1. unpow2 N/A

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

   2. lower-*.f64 51.2

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

5. Applied rewrites 51.2%

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

Reproduce

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