Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, B

Percentage Accurate: 100.0% → 100.0%

Time: 7.2s

Alternatives: 6

Speedup: 1.2×

Specification

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + 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 = (((1.0d0 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(1.0 / 8.0) * x) - Float64(Float64(y * z) / 2.0)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
end

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + 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 = (((1.0d0 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(1.0 / 8.0) * x) - Float64(Float64(y * z) / 2.0)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
end

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (+ (fma z (/ y -2.0) (* 0.125 x)) t))

C

double code(double x, double y, double z, double t) {
	return fma(z, (y / -2.0), (0.125 * x)) + t;
}

Julia

function code(x, y, z, t)
	return Float64(fma(z, Float64(y / -2.0), Float64(0.125 * x)) + t)
end

Wolfram

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

Derivation

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

Alternative 2: 71.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.05 \cdot 10^{-38} \lor \neg \left(z \leq 1.45 \cdot 10^{+60} \lor \neg \left(z \leq 1.06 \cdot 10^{+82}\right) \land z \leq 5.2 \cdot 10^{+156}\right):\\ \;\;\;\;y \cdot \left(z \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.125 \cdot x + t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -2.05e-38)
         (not
          (or (<= z 1.45e+60) (and (not (<= z 1.06e+82)) (<= z 5.2e+156)))))
   (* y (* z -0.5))
   (+ (* 0.125 x) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -2.05e-38) || !((z <= 1.45e+60) || (!(z <= 1.06e+82) && (z <= 5.2e+156)))) {
		tmp = y * (z * -0.5);
	} else {
		tmp = (0.125 * x) + t;
	}
	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 ((z <= (-2.05d-38)) .or. (.not. (z <= 1.45d+60) .or. (.not. (z <= 1.06d+82)) .and. (z <= 5.2d+156))) then
        tmp = y * (z * (-0.5d0))
    else
        tmp = (0.125d0 * x) + t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -2.05e-38) || !((z <= 1.45e+60) || (!(z <= 1.06e+82) && (z <= 5.2e+156)))) {
		tmp = y * (z * -0.5);
	} else {
		tmp = (0.125 * x) + t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -2.05e-38) or not ((z <= 1.45e+60) or (not (z <= 1.06e+82) and (z <= 5.2e+156))):
		tmp = y * (z * -0.5)
	else:
		tmp = (0.125 * x) + t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -2.05e-38) || !((z <= 1.45e+60) || (!(z <= 1.06e+82) && (z <= 5.2e+156))))
		tmp = Float64(y * Float64(z * -0.5));
	else
		tmp = Float64(Float64(0.125 * x) + t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -2.05e-38) || ~(((z <= 1.45e+60) || (~((z <= 1.06e+82)) && (z <= 5.2e+156)))))
		tmp = y * (z * -0.5);
	else
		tmp = (0.125 * x) + t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -2.05e-38], N[Not[Or[LessEqual[z, 1.45e+60], And[N[Not[LessEqual[z, 1.06e+82]], $MachinePrecision], LessEqual[z, 5.2e+156]]]], $MachinePrecision]], N[(y * N[(z * -0.5), $MachinePrecision]), $MachinePrecision], N[(N[(0.125 * x), $MachinePrecision] + t), $MachinePrecision]]

Derivation

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

Alternative 3: 81.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{-39} \lor \neg \left(z \leq 3.1 \cdot 10^{+37}\right):\\ \;\;\;\;t + z \cdot \left(y \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.125 \cdot x + t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -3.4e-39) (not (<= z 3.1e+37)))
   (+ t (* z (* y -0.5)))
   (+ (* 0.125 x) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -3.4e-39) || !(z <= 3.1e+37)) {
		tmp = t + (z * (y * -0.5));
	} else {
		tmp = (0.125 * x) + t;
	}
	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 ((z <= (-3.4d-39)) .or. (.not. (z <= 3.1d+37))) then
        tmp = t + (z * (y * (-0.5d0)))
    else
        tmp = (0.125d0 * x) + t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -3.4e-39) || !(z <= 3.1e+37)) {
		tmp = t + (z * (y * -0.5));
	} else {
		tmp = (0.125 * x) + t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -3.4e-39) or not (z <= 3.1e+37):
		tmp = t + (z * (y * -0.5))
	else:
		tmp = (0.125 * x) + t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -3.4e-39) || !(z <= 3.1e+37))
		tmp = Float64(t + Float64(z * Float64(y * -0.5)));
	else
		tmp = Float64(Float64(0.125 * x) + t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -3.4e-39) || ~((z <= 3.1e+37)))
		tmp = t + (z * (y * -0.5));
	else
		tmp = (0.125 * x) + t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -3.4e-39], N[Not[LessEqual[z, 3.1e+37]], $MachinePrecision]], N[(t + N[(z * N[(y * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.125 * x), $MachinePrecision] + t), $MachinePrecision]]

Derivation

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

Alternative 4: 100.0% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (+ t (- (* 0.125 x) (* y (* z 0.5)))))

C

double code(double x, double y, double z, double t) {
	return t + ((0.125 * x) - (y * (z * 0.5)));
}

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 = t + ((0.125d0 * x) - (y * (z * 0.5d0)))
end function

Java

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

Python

def code(x, y, z, t):
	return t + ((0.125 * x) - (y * (z * 0.5)))

Julia

function code(x, y, z, t)
	return Float64(t + Float64(Float64(0.125 * x) - Float64(y * Float64(z * 0.5))))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t + ((0.125 * x) - (y * (z * 0.5)));
end

Wolfram

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

Derivation

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

Alternative 5: 51.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -4 \cdot 10^{+42}:\\ \;\;\;\;t\\ \mathbf{elif}\;t \leq 8.5 \cdot 10^{+43}:\\ \;\;\;\;y \cdot \left(z \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -4e+42) t (if (<= t 8.5e+43) (* y (* z -0.5)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -4e+42) {
		tmp = t;
	} else if (t <= 8.5e+43) {
		tmp = y * (z * -0.5);
	} else {
		tmp = t;
	}
	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 (t <= (-4d+42)) then
        tmp = t
    else if (t <= 8.5d+43) then
        tmp = y * (z * (-0.5d0))
    else
        tmp = t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -4e+42) {
		tmp = t;
	} else if (t <= 8.5e+43) {
		tmp = y * (z * -0.5);
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -4e+42:
		tmp = t
	elif t <= 8.5e+43:
		tmp = y * (z * -0.5)
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -4e+42)
		tmp = t;
	elseif (t <= 8.5e+43)
		tmp = Float64(y * Float64(z * -0.5));
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -4e+42)
		tmp = t;
	elseif (t <= 8.5e+43)
		tmp = y * (z * -0.5);
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -4e+42], t, If[LessEqual[t, 8.5e+43], N[(y * N[(z * -0.5), $MachinePrecision]), $MachinePrecision], t]]

Derivation

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

Alternative 6: 32.4% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ t \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

function code(x, y, z, t)
	return t
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := t

Derivation

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

Developer target: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \left(\frac{x}{8} + t\right) - \frac{z}{2} \cdot y \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (+ (/ x 8.0) t) (* (/ z 2.0) y)))

C

double code(double x, double y, double z, double t) {
	return ((x / 8.0) + t) - ((z / 2.0) * 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 / 8.0d0) + t) - ((z / 2.0d0) * y)
end function

Java

public static double code(double x, double y, double z, double t) {
	return ((x / 8.0) + t) - ((z / 2.0) * y);
}

Python

def code(x, y, z, t):
	return ((x / 8.0) + t) - ((z / 2.0) * y)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x / 8.0) + t) - Float64(Float64(z / 2.0) * y))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x / 8.0) + t) - ((z / 2.0) * y);
end

Wolfram

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

Reproduce

herbie shell --seed 2024010 
(FPCore (x y z t)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (- (+ (/ x 8.0) t) (* (/ z 2.0) y))

  (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))