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

Percentage Accurate: 95.8% → 95.8%

Time: 3.1s

Alternatives: 3

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 - t \cdot z} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.0%

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

3. Final simplification 98.0%

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

Alternative 2: 76.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{\left(-z\right) \cdot t}\\ \mathbf{if}\;t \cdot z \leq -50:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \cdot z \leq 5 \cdot 10^{+39}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ x (* (- z) t))))
   (if (<= (* t z) -50.0) t_1 (if (<= (* t z) 5e+39) (/ x y) t_1))))

C

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

Python

def code(x, y, z, t):
	t_1 = x / (-z * t)
	tmp = 0
	if (t * z) <= -50.0:
		tmp = t_1
	elif (t * z) <= 5e+39:
		tmp = x / y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x / Float64(Float64(-z) * t))
	tmp = 0.0
	if (Float64(t * z) <= -50.0)
		tmp = t_1;
	elseif (Float64(t * z) <= 5e+39)
		tmp = Float64(x / y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x / (-z * t);
	tmp = 0.0;
	if ((t * z) <= -50.0)
		tmp = t_1;
	elseif ((t * z) <= 5e+39)
		tmp = x / y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x / N[((-z) * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * z), $MachinePrecision], -50.0], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], 5e+39], N[(x / y), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -50 or 5.00000000000000015e39 < (*.f64 z t)

   1. Initial program 95.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 78.5

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

   5. Applied rewrites 78.5%

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

   if -50 < (*.f64 z t) < 5.00000000000000015e39

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 81.0

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

   5. Applied rewrites 81.0%

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

4. Final simplification 79.8%

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

Alternative 3: 54.4% accurate, 1.7× 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 98.0%

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

3. Taylor expanded in y around inf

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

   1. lower-/.f64 56.0

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

5. Applied rewrites 56.0%

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

Developer Target 1: 96.6% accurate, 0.4× 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 2024332 
(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))))