Numeric.AD.Rank1.Halley:findZero from ad-4.2.4

Percentage Accurate: 81.6% → 94.4%

Time: 10.8s

Alternatives: 6

Speedup: 1.4×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 81.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 94.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\left(y \cdot 2\right) \cdot z}{z \cdot \left(2 \cdot z\right) - y \cdot t} \leq 5 \cdot 10^{+201}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{\mathsf{fma}\left(z \cdot z, -2, y \cdot t\right)}, y \cdot 2, x\right)\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* (* y 2.0) z) (- (* z (* 2.0 z)) (* y t))) 5e+201)
   (fma (/ z (fma (* z z) -2.0 (* y t))) (* y 2.0) x)
   (- x (/ y z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((((y * 2.0) * z) / ((z * (2.0 * z)) - (y * t))) <= 5e+201) {
		tmp = fma((z / fma((z * z), -2.0, (y * t))), (y * 2.0), x);
	} else {
		tmp = x - (y / z);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(Float64(y * 2.0) * z) / Float64(Float64(z * Float64(2.0 * z)) - Float64(y * t))) <= 5e+201)
		tmp = fma(Float64(z / fma(Float64(z * z), -2.0, Float64(y * t))), Float64(y * 2.0), x);
	else
		tmp = Float64(x - Float64(y / z));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (*.f64 y #s(literal 2 binary64)) z) (-.f64 (*.f64 (*.f64 z #s(literal 2 binary64)) z) (*.f64 y t))) < 4.9999999999999995e201

   1. Initial program 94.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right)} \]

      9. +-commutative N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right) + x} \]

      10. lift-/.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}}\right)\right) + x \]

      11. lift-*.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\left(y \cdot 2\right) \cdot z}}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right) + x \]

      12. associate-/l* N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(y \cdot 2\right) \cdot \frac{z}{\left(z \cdot 2\right) \cdot z - y \cdot t}}\right)\right) + x \]

      13. *-commutative N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \cdot \left(y \cdot 2\right)}\right)\right) + x \]

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

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right) \cdot \left(y \cdot 2\right)} + x \]

   4. Applied egg-rr 97.9%

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

   if 4.9999999999999995e201 < (/.f64 (*.f64 (*.f64 y #s(literal 2 binary64)) z) (-.f64 (*.f64 (*.f64 z #s(literal 2 binary64)) z) (*.f64 y t)))

   1. Initial program 0.0%

      \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -1 \cdot \frac{y}{z}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. sub-neg N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      4. lower-/.f64 76.7

         \[\leadsto x - \color{blue}{\frac{y}{z}} \]

   5. Simplified 76.7%

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(y \cdot 2\right) \cdot z}{z \cdot \left(2 \cdot z\right) - y \cdot t} \leq 5 \cdot 10^{+201}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{\mathsf{fma}\left(z \cdot z, -2, y \cdot t\right)}, y \cdot 2, x\right)\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 88.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x - \frac{y}{z}\\ \mathbf{if}\;z \leq -2 \cdot 10^{+60}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 5.6 \cdot 10^{-40}:\\ \;\;\;\;x - \frac{z \cdot -2}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- x (/ y z))))
   (if (<= z -2e+60) t_1 (if (<= z 5.6e-40) (- x (/ (* z -2.0) t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x - (y / z);
	double tmp;
	if (z <= -2e+60) {
		tmp = t_1;
	} else if (z <= 5.6e-40) {
		tmp = x - ((z * -2.0) / t);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = x - (y / z)
    if (z <= (-2d+60)) then
        tmp = t_1
    else if (z <= 5.6d-40) then
        tmp = x - ((z * (-2.0d0)) / t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x - (y / z);
	double tmp;
	if (z <= -2e+60) {
		tmp = t_1;
	} else if (z <= 5.6e-40) {
		tmp = x - ((z * -2.0) / t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x - (y / z)
	tmp = 0
	if z <= -2e+60:
		tmp = t_1
	elif z <= 5.6e-40:
		tmp = x - ((z * -2.0) / t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x - Float64(y / z))
	tmp = 0.0
	if (z <= -2e+60)
		tmp = t_1;
	elseif (z <= 5.6e-40)
		tmp = Float64(x - Float64(Float64(z * -2.0) / t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x - (y / z);
	tmp = 0.0;
	if (z <= -2e+60)
		tmp = t_1;
	elseif (z <= 5.6e-40)
		tmp = x - ((z * -2.0) / t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x - N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2e+60], t$95$1, If[LessEqual[z, 5.6e-40], N[(x - N[(N[(z * -2.0), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.9999999999999999e60 or 5.5999999999999999e-40 < z

   1. Initial program 71.1%

      \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -1 \cdot \frac{y}{z}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. sub-neg N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      4. lower-/.f64 90.0

         \[\leadsto x - \color{blue}{\frac{y}{z}} \]

   5. Simplified 90.0%

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   if -1.9999999999999999e60 < z < 5.5999999999999999e-40

   1. Initial program 88.5%

      \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto x - \color{blue}{-2 \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto x - \color{blue}{\frac{-2 \cdot z}{t}} \]

      2. lower-/.f64 N/A

         \[\leadsto x - \color{blue}{\frac{-2 \cdot z}{t}} \]

      3. lower-*.f64 87.8

         \[\leadsto x - \frac{\color{blue}{-2 \cdot z}}{t} \]

   5. Simplified 87.8%

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

4. Final simplification 88.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{+60}:\\ \;\;\;\;x - \frac{y}{z}\\ \mathbf{elif}\;z \leq 5.6 \cdot 10^{-40}:\\ \;\;\;\;x - \frac{z \cdot -2}{t}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 88.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x - \frac{y}{z}\\ \mathbf{if}\;z \leq -2.3 \cdot 10^{+60}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{-40}:\\ \;\;\;\;\mathsf{fma}\left(z, \frac{2}{t}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- x (/ y z))))
   (if (<= z -2.3e+60) t_1 (if (<= z 5.8e-40) (fma z (/ 2.0 t) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x - (y / z);
	double tmp;
	if (z <= -2.3e+60) {
		tmp = t_1;
	} else if (z <= 5.8e-40) {
		tmp = fma(z, (2.0 / t), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x - Float64(y / z))
	tmp = 0.0
	if (z <= -2.3e+60)
		tmp = t_1;
	elseif (z <= 5.8e-40)
		tmp = fma(z, Float64(2.0 / t), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x - N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.3e+60], t$95$1, If[LessEqual[z, 5.8e-40], N[(z * N[(2.0 / t), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.30000000000000017e60 or 5.7999999999999998e-40 < z

   1. Initial program 71.1%

      \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -1 \cdot \frac{y}{z}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. sub-neg N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      4. lower-/.f64 90.0

         \[\leadsto x - \color{blue}{\frac{y}{z}} \]

   5. Simplified 90.0%

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   if -2.30000000000000017e60 < z < 5.7999999999999998e-40

   1. Initial program 88.5%

      \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x - -2 \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{z}{t}} \]

      2. metadata-eval N/A

         \[\leadsto x + \color{blue}{2} \cdot \frac{z}{t} \]

      3. +-commutative N/A

         \[\leadsto \color{blue}{2 \cdot \frac{z}{t} + x} \]

      4. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{2 \cdot z}{t}} + x \]

      5. *-commutative N/A

         \[\leadsto \frac{\color{blue}{z \cdot 2}}{t} + x \]

      6. associate-*r/ N/A

         \[\leadsto \color{blue}{z \cdot \frac{2}{t}} + x \]

      7. metadata-eval N/A

         \[\leadsto z \cdot \frac{\color{blue}{2 \cdot 1}}{t} + x \]

      8. associate-*r/ N/A

         \[\leadsto z \cdot \color{blue}{\left(2 \cdot \frac{1}{t}\right)} + x \]

      9. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, 2 \cdot \frac{1}{t}, x\right)} \]

      10. associate-*r/ N/A

          \[\leadsto \mathsf{fma}\left(z, \color{blue}{\frac{2 \cdot 1}{t}}, x\right) \]

      11. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(z, \frac{\color{blue}{2}}{t}, x\right) \]

      12. lower-/.f64 87.7

          \[\leadsto \mathsf{fma}\left(z, \color{blue}{\frac{2}{t}}, x\right) \]

   5. Simplified 87.7%

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

Alternative 4: 76.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x - \frac{y}{z}\\ \mathbf{if}\;z \leq -2.7 \cdot 10^{-80}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.2 \cdot 10^{-29}:\\ \;\;\;\;\frac{t \cdot x}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- x (/ y z))))
   (if (<= z -2.7e-80) t_1 (if (<= z 2.2e-29) (/ (* t x) t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x - (y / z);
	double tmp;
	if (z <= -2.7e-80) {
		tmp = t_1;
	} else if (z <= 2.2e-29) {
		tmp = (t * x) / t;
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = x - (y / z)
    if (z <= (-2.7d-80)) then
        tmp = t_1
    else if (z <= 2.2d-29) then
        tmp = (t * x) / t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x - (y / z);
	double tmp;
	if (z <= -2.7e-80) {
		tmp = t_1;
	} else if (z <= 2.2e-29) {
		tmp = (t * x) / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x - (y / z)
	tmp = 0
	if z <= -2.7e-80:
		tmp = t_1
	elif z <= 2.2e-29:
		tmp = (t * x) / t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x - Float64(y / z))
	tmp = 0.0
	if (z <= -2.7e-80)
		tmp = t_1;
	elseif (z <= 2.2e-29)
		tmp = Float64(Float64(t * x) / t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x - (y / z);
	tmp = 0.0;
	if (z <= -2.7e-80)
		tmp = t_1;
	elseif (z <= 2.2e-29)
		tmp = (t * x) / t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x - N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.7e-80], t$95$1, If[LessEqual[z, 2.2e-29], N[(N[(t * x), $MachinePrecision] / t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.7000000000000002e-80 or 2.1999999999999999e-29 < z

   1. Initial program 75.8%

      \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -1 \cdot \frac{y}{z}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. sub-neg N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{x - \frac{y}{z}} \]

      4. lower-/.f64 85.8

         \[\leadsto x - \color{blue}{\frac{y}{z}} \]

   5. Simplified 85.8%

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   if -2.7000000000000002e-80 < z < 2.1999999999999999e-29

   1. Initial program 86.2%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right)} \]

      9. +-commutative N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right) + x} \]

      10. lift-/.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}}\right)\right) + x \]

      11. lift-*.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\left(y \cdot 2\right) \cdot z}}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right) + x \]

      12. associate-/l* N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(y \cdot 2\right) \cdot \frac{z}{\left(z \cdot 2\right) \cdot z - y \cdot t}}\right)\right) + x \]

      13. *-commutative N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \cdot \left(y \cdot 2\right)}\right)\right) + x \]

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

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\right)\right) \cdot \left(y \cdot 2\right)} + x \]

   4. Applied egg-rr 88.7%

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

   5. Taylor expanded in z around 0

      \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{z}{t \cdot y}}, y \cdot 2, x\right) \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{z}{t \cdot y}}, y \cdot 2, x\right) \]

      2. lower-*.f64 83.0

         \[\leadsto \mathsf{fma}\left(\frac{z}{\color{blue}{t \cdot y}}, y \cdot 2, x\right) \]

   7. Simplified 83.0%

      \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{z}{t \cdot y}}, y \cdot 2, x\right) \]

   8. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{2 \cdot z + t \cdot x}{t}} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{2 \cdot z + t \cdot x}{t}} \]

      2. *-commutative N/A

         \[\leadsto \frac{\color{blue}{z \cdot 2} + t \cdot x}{t} \]

      3. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(z, 2, t \cdot x\right)}}{t} \]

      4. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(z, 2, \color{blue}{x \cdot t}\right)}{t} \]

      5. lower-*.f64 84.1

         \[\leadsto \frac{\mathsf{fma}\left(z, 2, \color{blue}{x \cdot t}\right)}{t} \]

   10. Simplified 84.1%

       \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(z, 2, x \cdot t\right)}{t}} \]

   11. Taylor expanded in z around 0

       \[\leadsto \frac{\color{blue}{t \cdot x}}{t} \]
   12. Step-by-step derivation

       1. *-commutative N/A

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

       2. lower-*.f64 58.6

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

   13. Simplified 58.6%

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

4. Final simplification 75.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.7 \cdot 10^{-80}:\\ \;\;\;\;x - \frac{y}{z}\\ \mathbf{elif}\;z \leq 2.2 \cdot 10^{-29}:\\ \;\;\;\;\frac{t \cdot x}{t}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.4% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ x - \frac{y}{z} \end{array} \]

FPCore

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

C

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

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 - (y / z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 79.9%

   \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{x + -1 \cdot \frac{y}{z}} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. sub-neg N/A

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   3. lower--.f64 N/A

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   4. lower-/.f64 63.7

      \[\leadsto x - \color{blue}{\frac{y}{z}} \]

5. Simplified 63.7%

   \[\leadsto \color{blue}{x - \frac{y}{z}} \]
6. Add Preprocessing

Alternative 6: 15.1% accurate, 3.1× speedup

Math

\[\begin{array}{l} \\ -\frac{y}{z} \end{array} \]

FPCore

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

C

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

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 / z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := (-N[(y / z), $MachinePrecision])

Derivation

1. Initial program 79.9%

   \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{x + -1 \cdot \frac{y}{z}} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. sub-neg N/A

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   3. lower--.f64 N/A

      \[\leadsto \color{blue}{x - \frac{y}{z}} \]

   4. lower-/.f64 63.7

      \[\leadsto x - \color{blue}{\frac{y}{z}} \]

5. Simplified 63.7%

   \[\leadsto \color{blue}{x - \frac{y}{z}} \]

6. Taylor expanded in x around 0

   \[\leadsto \color{blue}{-1 \cdot \frac{y}{z}} \]
7. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{y}{z}\right)} \]

   2. distribute-neg-frac2 N/A

      \[\leadsto \color{blue}{\frac{y}{\mathsf{neg}\left(z\right)}} \]

   3. mul-1-neg N/A

      \[\leadsto \frac{y}{\color{blue}{-1 \cdot z}} \]

   4. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{y}{-1 \cdot z}} \]

   5. mul-1-neg N/A

      \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(z\right)}} \]

   6. lower-neg.f64 13.9

      \[\leadsto \frac{y}{\color{blue}{-z}} \]

8. Simplified 13.9%

   \[\leadsto \color{blue}{\frac{y}{-z}} \]

9. Final simplification 13.9%

   \[\leadsto -\frac{y}{z} \]
10. Add Preprocessing

Developer Target 1: 99.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ x - \frac{1}{\frac{z}{y} - \frac{\frac{t}{2}}{z}} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return x - (1.0 / ((z / y) - ((t / 2.0) / z)));
}

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 - (1.0d0 / ((z / y) - ((t / 2.0d0) / z)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024207 
(FPCore (x y z t)
  :name "Numeric.AD.Rank1.Halley:findZero from ad-4.2.4"
  :precision binary64

  :alt
  (! :herbie-platform default (- x (/ 1 (- (/ z y) (/ (/ t 2) z)))))

  (- x (/ (* (* y 2.0) z) (- (* (* z 2.0) z) (* y t)))))