Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, B

Percentage Accurate: 95.8% → 95.8%

Time: 9.0s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 95.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

   \[\frac{x}{y - z \cdot t} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 79.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+19} \lor \neg \left(z \cdot t \leq 2 \cdot 10^{-48}\right):\\ \;\;\;\;\frac{\frac{x}{t}}{-z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (* z t) -1e+19) (not (<= (* z t) 2e-48)))
   (/ (/ x t) (- z))
   (/ x y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * t) <= -1e+19) || !((z * t) <= 2e-48)) {
		tmp = (x / t) / -z;
	} else {
		tmp = x / y;
	}
	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 * t) <= (-1d+19)) .or. (.not. ((z * t) <= 2d-48))) then
        tmp = (x / t) / -z
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * t) <= -1e+19) || !((z * t) <= 2e-48)) {
		tmp = (x / t) / -z;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((z * t) <= -1e+19) or not ((z * t) <= 2e-48):
		tmp = (x / t) / -z
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(z * t) <= -1e+19) || !(Float64(z * t) <= 2e-48))
		tmp = Float64(Float64(x / t) / Float64(-z));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z * t) <= -1e+19) || ~(((z * t) <= 2e-48)))
		tmp = (x / t) / -z;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(z * t), $MachinePrecision], -1e+19], N[Not[LessEqual[N[(z * t), $MachinePrecision], 2e-48]], $MachinePrecision]], N[(N[(x / t), $MachinePrecision] / (-z)), $MachinePrecision], N[(x / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -1e19 or 1.9999999999999999e-48 < (*.f64 z t)

   1. Initial program 95.5%

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

      1. clear-num 94.7%

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

      2. associate-/r/ 95.3%

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

   4. Applied egg-rr 95.3%

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

   5. Taylor expanded in t around inf 63.8%

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

      1. distribute-lft-out 63.8%

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

      2. associate-*r/ 63.8%

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

      3. mul-1-neg 63.8%

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

      4. associate-/r* 63.0%

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

   7. Simplified 63.0%

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

   8. Taylor expanded in z around inf 73.6%

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

      1. associate-/r* 76.0%

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

   10. Simplified 76.0%

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

   if -1e19 < (*.f64 z t) < 1.9999999999999999e-48

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 83.6%

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

4. Final simplification 79.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+19} \lor \neg \left(z \cdot t \leq 2 \cdot 10^{-48}\right):\\ \;\;\;\;\frac{\frac{x}{t}}{-z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+19}:\\ \;\;\;\;\frac{\frac{x}{t}}{-z}\\ \mathbf{elif}\;z \cdot t \leq 10^{-38}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{z}}{-t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* z t) -1e+19)
   (/ (/ x t) (- z))
   (if (<= (* z t) 1e-38) (/ x y) (/ (/ x z) (- t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z * t) <= -1e+19) {
		tmp = (x / t) / -z;
	} else if ((z * t) <= 1e-38) {
		tmp = x / y;
	} else {
		tmp = (x / z) / -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 * t) <= (-1d+19)) then
        tmp = (x / t) / -z
    else if ((z * t) <= 1d-38) then
        tmp = x / y
    else
        tmp = (x / z) / -t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z * t) <= -1e+19) {
		tmp = (x / t) / -z;
	} else if ((z * t) <= 1e-38) {
		tmp = x / y;
	} else {
		tmp = (x / z) / -t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z * t) <= -1e+19:
		tmp = (x / t) / -z
	elif (z * t) <= 1e-38:
		tmp = x / y
	else:
		tmp = (x / z) / -t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(z * t) <= -1e+19)
		tmp = Float64(Float64(x / t) / Float64(-z));
	elseif (Float64(z * t) <= 1e-38)
		tmp = Float64(x / y);
	else
		tmp = Float64(Float64(x / z) / Float64(-t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z * t) <= -1e+19)
		tmp = (x / t) / -z;
	elseif ((z * t) <= 1e-38)
		tmp = x / y;
	else
		tmp = (x / z) / -t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -1e19

   1. Initial program 96.6%

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

      1. clear-num 96.4%

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

      2. associate-/r/ 96.2%

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

   4. Applied egg-rr 96.2%

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

   5. Taylor expanded in t around inf 66.8%

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

      1. distribute-lft-out 66.8%

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

      2. associate-*r/ 66.8%

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

      3. mul-1-neg 66.8%

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

      4. associate-/r* 66.8%

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

   7. Simplified 66.8%

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

   8. Taylor expanded in z around inf 78.2%

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

      1. associate-/r* 80.0%

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

   10. Simplified 80.0%

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

   if -1e19 < (*.f64 z t) < 9.9999999999999996e-39

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 83.1%

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

   if 9.9999999999999996e-39 < (*.f64 z t)

   1. Initial program 94.5%

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

      1. clear-num 93.0%

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

      2. associate-/r/ 94.4%

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

   4. Applied egg-rr 94.4%

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

   5. Taylor expanded in t around inf 61.6%

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

      1. distribute-lft-out 61.6%

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

      2. associate-*r/ 61.6%

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

      3. mul-1-neg 61.6%

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

      4. associate-/r* 60.1%

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

   7. Simplified 60.1%

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

   8. Taylor expanded in z around inf 74.1%

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

4. Final simplification 79.8%

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

Alternative 4: 62.5% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (* z t) -4e+154) (not (<= (* z t) 1e+251)))
   (/ x (* z t))
   (/ x y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * t) <= -4e+154) || !((z * t) <= 1e+251)) {
		tmp = x / (z * t);
	} else {
		tmp = x / y;
	}
	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 * t) <= (-4d+154)) .or. (.not. ((z * t) <= 1d+251))) then
        tmp = x / (z * t)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * t) <= -4e+154) || !((z * t) <= 1e+251)) {
		tmp = x / (z * t);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((z * t) <= -4e+154) or not ((z * t) <= 1e+251):
		tmp = x / (z * t)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(z * t) <= -4e+154) || !(Float64(z * t) <= 1e+251))
		tmp = Float64(x / Float64(z * t));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z * t) <= -4e+154) || ~(((z * t) <= 1e+251)))
		tmp = x / (z * t);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(z * t), $MachinePrecision], -4e+154], N[Not[LessEqual[N[(z * t), $MachinePrecision], 1e+251]], $MachinePrecision]], N[(x / N[(z * t), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -4.00000000000000015e154 or 1e251 < (*.f64 z t)

   1. Initial program 89.0%

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

   3. Taylor expanded in y around 0 86.2%

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

      1. associate-*r/ 86.2%

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

      2. neg-mul-1 86.2%

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

   5. Simplified 86.2%

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

      1. neg-sub0 86.2%

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

      2. sub-neg 86.2%

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

      3. add-sqr-sqrt 47.2%

         \[\leadsto \frac{0 + \color{blue}{\sqrt{-x} \cdot \sqrt{-x}}}{t \cdot z} \]

      4. sqrt-unprod 56.9%

         \[\leadsto \frac{0 + \color{blue}{\sqrt{\left(-x\right) \cdot \left(-x\right)}}}{t \cdot z} \]

      5. sqr-neg 56.9%

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

      6. sqrt-unprod 19.3%

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

      7. add-sqr-sqrt 51.3%

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

   7. Applied egg-rr 51.3%

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

      1. +-lft-identity 51.3%

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

   9. Simplified 51.3%

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

   if -4.00000000000000015e154 < (*.f64 z t) < 1e251

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 67.3%

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

4. Final simplification 63.9%

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

Alternative 5: 72.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{-72} \lor \neg \left(y \leq 0.0075\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x}{z \cdot t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -4e-72) (not (<= y 0.0075))) (/ x y) (/ (- x) (* z t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -4e-72) || !(y <= 0.0075)) {
		tmp = x / y;
	} else {
		tmp = -x / (z * 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 ((y <= (-4d-72)) .or. (.not. (y <= 0.0075d0))) then
        tmp = x / y
    else
        tmp = -x / (z * t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -4e-72) || !(y <= 0.0075)) {
		tmp = x / y;
	} else {
		tmp = -x / (z * t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -4e-72) or not (y <= 0.0075):
		tmp = x / y
	else:
		tmp = -x / (z * t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -4e-72) || !(y <= 0.0075))
		tmp = Float64(x / y);
	else
		tmp = Float64(Float64(-x) / Float64(z * t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -4e-72) || ~((y <= 0.0075)))
		tmp = x / y;
	else
		tmp = -x / (z * t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -4e-72], N[Not[LessEqual[y, 0.0075]], $MachinePrecision]], N[(x / y), $MachinePrecision], N[((-x) / N[(z * t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.9999999999999999e-72 or 0.0074999999999999997 < y

   1. Initial program 96.7%

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

   3. Taylor expanded in y around inf 78.5%

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

   if -3.9999999999999999e-72 < y < 0.0074999999999999997

   1. Initial program 98.9%

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

   3. Taylor expanded in y around 0 82.3%

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

      1. associate-*r/ 82.3%

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

      2. neg-mul-1 82.3%

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

   5. Simplified 82.3%

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

4. Final simplification 80.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{-72} \lor \neg \left(y \leq 0.0075\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x}{z \cdot t}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 54.6% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in y around inf 55.3%

   \[\leadsto \color{blue}{\frac{x}{y}} \]
4. Add Preprocessing

Developer Target 1: 96.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{1}{\frac{y}{x} - \frac{z}{x} \cdot t}\\ \mathbf{if}\;x < -1.618195973607049 \cdot 10^{+50}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x < 2.1378306434876444 \cdot 10^{+131}:\\ \;\;\;\;\frac{x}{y - z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ 1.0 (- (/ y x) (* (/ z x) t)))))
   (if (< x -1.618195973607049e+50)
     t_1
     (if (< x 2.1378306434876444e+131) (/ x (- y (* z t))) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = 1.0 / ((y / x) - ((z / x) * t));
	double tmp;
	if (x < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (x < 2.1378306434876444e+131) {
		tmp = x / (y - (z * 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 = 1.0d0 / ((y / x) - ((z / x) * t))
    if (x < (-1.618195973607049d+50)) then
        tmp = t_1
    else if (x < 2.1378306434876444d+131) then
        tmp = x / (y - (z * 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 = 1.0 / ((y / x) - ((z / x) * t));
	double tmp;
	if (x < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (x < 2.1378306434876444e+131) {
		tmp = x / (y - (z * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = 1.0 / ((y / x) - ((z / x) * t))
	tmp = 0
	if x < -1.618195973607049e+50:
		tmp = t_1
	elif x < 2.1378306434876444e+131:
		tmp = x / (y - (z * t))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(1.0 / Float64(Float64(y / x) - Float64(Float64(z / x) * t)))
	tmp = 0.0
	if (x < -1.618195973607049e+50)
		tmp = t_1;
	elseif (x < 2.1378306434876444e+131)
		tmp = Float64(x / Float64(y - Float64(z * t)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = 1.0 / ((y / x) - ((z / x) * t));
	tmp = 0.0;
	if (x < -1.618195973607049e+50)
		tmp = t_1;
	elseif (x < 2.1378306434876444e+131)
		tmp = x / (y - (z * t));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(1.0 / N[(N[(y / x), $MachinePrecision] - N[(N[(z / x), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[x, -1.618195973607049e+50], t$95$1, If[Less[x, 2.1378306434876444e+131], N[(x / N[(y - N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< x -161819597360704900000000000000000000000000000000000) (/ 1 (- (/ y x) (* (/ z x) t))) (if (< x 213783064348764440000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ x (- y (* z t))) (/ 1 (- (/ y x) (* (/ z x) t))))))

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