Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1

Percentage Accurate: 98.4% → 98.9%

Time: 3.4s

Alternatives: 3

Speedup: 1.1×

• 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: 98.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

   \[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. lift-*.f64 N/A

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

   4. lower-fma.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lift-*.f64 N/A

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

   8. associate-*r* N/A

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

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

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

   10. lower-*.f64 N/A

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

   11. lower-*.f64 N/A

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

   12. metadata-eval 99.2

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

4. Applied rewrites 99.2%

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

5. Final simplification 99.2%

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

Alternative 2: 84.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 3.7999999999999999e37

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 88.2

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

   5. Applied rewrites 88.2%

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

   if 3.7999999999999999e37 < (*.f64 x x)

   1. Initial program 96.7%

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

   3. Taylor expanded in z around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 88.1

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

   5. Applied rewrites 88.1%

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

4. Final simplification 88.1%

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

Alternative 3: 53.3% 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 98.4%

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

3. Taylor expanded in z around 0

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

   1. unpow2 N/A

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

   2. lower-*.f64 52.5

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

5. Applied rewrites 52.5%

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

Reproduce

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