Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B

Percentage Accurate: 90.8% → 92.5%

Time: 10.8s

Alternatives: 7

Speedup: 0.8×

• 50.4% 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 \left(z \cdot z - t\right) \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - ((y * 4.0d0) * ((z * z) - t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 90.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - ((y * 4.0d0) * ((z * z) - t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 92.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right)\\ \mathbf{if}\;t_1 \leq \infty:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-4 \cdot {z}^{2}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* x x) (* (* y 4.0) (- (* z z) t)))))
   (if (<= t_1 INFINITY) t_1 (* y (* -4.0 (pow z 2.0))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * x) - ((y * 4.0) * ((z * z) - t));
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = y * (-4.0 * pow(z, 2.0));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x * x) - ((y * 4.0) * ((z * z) - t));
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = y * (-4.0 * Math.pow(z, 2.0));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x * x) - ((y * 4.0) * ((z * z) - t))
	tmp = 0
	if t_1 <= math.inf:
		tmp = t_1
	else:
		tmp = y * (-4.0 * math.pow(z, 2.0))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * x) - Float64(Float64(y * 4.0) * Float64(Float64(z * z) - t)))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(y * Float64(-4.0 * (z ^ 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * x) - ((y * 4.0) * ((z * z) - t));
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = y * (-4.0 * (z ^ 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] - N[(N[(y * 4.0), $MachinePrecision] * N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(y * N[(-4.0 * N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 92.8% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 93.4% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* x x) 4e+298) (- (* x x) (* (- (* z z) t) (* y 4.0))) (pow x 2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 4e+298) {
		tmp = (x * x) - (((z * z) - t) * (y * 4.0));
	} else {
		tmp = pow(x, 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x * x) <= 4d+298) then
        tmp = (x * x) - (((z * z) - t) * (y * 4.0d0))
    else
        tmp = x ** 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 4e+298) {
		tmp = (x * x) - (((z * z) - t) * (y * 4.0));
	} else {
		tmp = Math.pow(x, 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x * x) <= 4e+298:
		tmp = (x * x) - (((z * z) - t) * (y * 4.0))
	else:
		tmp = math.pow(x, 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x * x) <= 4e+298)
		tmp = Float64(Float64(x * x) - Float64(Float64(Float64(z * z) - t) * Float64(y * 4.0)));
	else
		tmp = x ^ 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x * x) <= 4e+298)
		tmp = (x * x) - (((z * z) - t) * (y * 4.0));
	else
		tmp = x ^ 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x * x), $MachinePrecision], 4e+298], N[(N[(x * x), $MachinePrecision] - N[(N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision] * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[x, 2.0], $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 91.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x * x) <= 2.2d+299) then
        tmp = (x * x) - ((y * 4.0d0) * ((z * z) - t))
    else
        tmp = (x * x) + (y * (t * (-4.0d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 66.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - ((-4.0d0) * (t * y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 6.7% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (-4.0d0) * (t * y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 31.9% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = y * (t * 4.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(y * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Developer target: 90.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - (4.0d0 * (y * ((z * z) - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023348 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B"
  :precision binary64

  :herbie-target
  (- (* x x) (* 4.0 (* y (- (* z z) t))))

  (- (* x x) (* (* y 4.0) (- (* z z) t))))