Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, A

Percentage Accurate: 92.3% → 98.8%

Time: 2.1s

Alternatives: 3

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 92.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} t_0 := \frac{x \cdot y}{z}\\ t_1 := y \cdot \frac{x}{z}\\ \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \cdot y \leq -4 \cdot 10^{-200}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \cdot y \leq 10^{-262}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \cdot y \leq 10^{+65}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* x y) z)) (t_1 (* y (/ x z))))
   (if (<= (* x y) (- INFINITY))
     t_1
     (if (<= (* x y) -4e-200)
       t_0
       (if (<= (* x y) 1e-262)
         t_1
         (if (<= (* x y) 1e+65) t_0 (* x (/ y z))))))))

C

assert(x < y);
double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double t_1 = y * (x / z);
	double tmp;
	if ((x * y) <= -((double) INFINITY)) {
		tmp = t_1;
	} else if ((x * y) <= -4e-200) {
		tmp = t_0;
	} else if ((x * y) <= 1e-262) {
		tmp = t_1;
	} else if ((x * y) <= 1e+65) {
		tmp = t_0;
	} else {
		tmp = x * (y / z);
	}
	return tmp;
}

Java

assert x < y;
public static double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double t_1 = y * (x / z);
	double tmp;
	if ((x * y) <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if ((x * y) <= -4e-200) {
		tmp = t_0;
	} else if ((x * y) <= 1e-262) {
		tmp = t_1;
	} else if ((x * y) <= 1e+65) {
		tmp = t_0;
	} else {
		tmp = x * (y / z);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	t_0 = (x * y) / z
	t_1 = y * (x / z)
	tmp = 0
	if (x * y) <= -math.inf:
		tmp = t_1
	elif (x * y) <= -4e-200:
		tmp = t_0
	elif (x * y) <= 1e-262:
		tmp = t_1
	elif (x * y) <= 1e+65:
		tmp = t_0
	else:
		tmp = x * (y / z)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	t_0 = Float64(Float64(x * y) / z)
	t_1 = Float64(y * Float64(x / z))
	tmp = 0.0
	if (Float64(x * y) <= Float64(-Inf))
		tmp = t_1;
	elseif (Float64(x * y) <= -4e-200)
		tmp = t_0;
	elseif (Float64(x * y) <= 1e-262)
		tmp = t_1;
	elseif (Float64(x * y) <= 1e+65)
		tmp = t_0;
	else
		tmp = Float64(x * Float64(y / z));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	t_0 = (x * y) / z;
	t_1 = y * (x / z);
	tmp = 0.0;
	if ((x * y) <= -Inf)
		tmp = t_1;
	elseif ((x * y) <= -4e-200)
		tmp = t_0;
	elseif ((x * y) <= 1e-262)
		tmp = t_1;
	elseif ((x * y) <= 1e+65)
		tmp = t_0;
	else
		tmp = x * (y / z);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -4e-200], t$95$0, If[LessEqual[N[(x * y), $MachinePrecision], 1e-262], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1e+65], t$95$0, N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -inf.0 or -3.9999999999999999e-200 < (*.f64 x y) < 1.00000000000000001e-262

   1. Initial program 76.8%

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

      1. associate-*l/ 99.9%

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

   3. Simplified 99.9%

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

   if -inf.0 < (*.f64 x y) < -3.9999999999999999e-200 or 1.00000000000000001e-262 < (*.f64 x y) < 9.9999999999999999e64

   1. Initial program 99.7%

      \[\frac{x \cdot y}{z} \]

   if 9.9999999999999999e64 < (*.f64 x y)

   1. Initial program 86.6%

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

      1. associate-*r/ 99.8%

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

   3. Simplified 99.8%

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

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;x \cdot y \leq -4 \cdot 10^{-200}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;x \cdot y \leq 10^{-262}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;x \cdot y \leq 10^{+65}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \end{array} \]

Alternative 2: 92.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ x \cdot \frac{y}{z} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* x (/ y z)))

C

assert(x < y);
double code(double x, double y, double z) {
	return x * (y / z);
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x * (y / z)
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y, z):
	return x * (y / z)

Julia

x, y = sort([x, y])
function code(x, y, z)
	return Float64(x * Float64(y / z))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
	tmp = x * (y / z);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 92.0%

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

   1. associate-*r/ 93.8%

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

3. Simplified 93.8%

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

4. Final simplification 93.8%

   \[\leadsto x \cdot \frac{y}{z} \]

Alternative 3: 91.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ y \cdot \frac{x}{z} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* y (/ x z)))

C

assert(x < y);
double code(double x, double y, double z) {
	return y * (x / z);
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = y * (x / z)
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y, z):
	return y * (x / z)

Julia

x, y = sort([x, y])
function code(x, y, z)
	return Float64(y * Float64(x / z))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
	tmp = y * (x / z);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 92.0%

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

   1. associate-*l/ 90.6%

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

3. Simplified 90.6%

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

4. Final simplification 90.6%

   \[\leadsto y \cdot \frac{x}{z} \]

Developer target: 92.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z < -4.262230790519429 \cdot 10^{-138}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;z < 1.7042130660650472 \cdot 10^{-164}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (< z -4.262230790519429e-138)
   (/ (* x y) z)
   (if (< z 1.7042130660650472e-164) (/ x (/ z y)) (* (/ x z) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z < -4.262230790519429e-138) {
		tmp = (x * y) / z;
	} else if (z < 1.7042130660650472e-164) {
		tmp = x / (z / y);
	} else {
		tmp = (x / z) * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z < (-4.262230790519429d-138)) then
        tmp = (x * y) / z
    else if (z < 1.7042130660650472d-164) then
        tmp = x / (z / y)
    else
        tmp = (x / z) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z < -4.262230790519429e-138) {
		tmp = (x * y) / z;
	} else if (z < 1.7042130660650472e-164) {
		tmp = x / (z / y);
	} else {
		tmp = (x / z) * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z < -4.262230790519429e-138:
		tmp = (x * y) / z
	elif z < 1.7042130660650472e-164:
		tmp = x / (z / y)
	else:
		tmp = (x / z) * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z < -4.262230790519429e-138)
		tmp = Float64(Float64(x * y) / z);
	elseif (z < 1.7042130660650472e-164)
		tmp = Float64(x / Float64(z / y));
	else
		tmp = Float64(Float64(x / z) * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z < -4.262230790519429e-138)
		tmp = (x * y) / z;
	elseif (z < 1.7042130660650472e-164)
		tmp = x / (z / y);
	else
		tmp = (x / z) * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Less[z, -4.262230790519429e-138], N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision], If[Less[z, 1.7042130660650472e-164], N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision], N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision]]]

Reproduce

herbie shell --seed 2023240 
(FPCore (x y z)
  :name "Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, A"
  :precision binary64

  :herbie-target
  (if (< z -4.262230790519429e-138) (/ (* x y) z) (if (< z 1.7042130660650472e-164) (/ x (/ z y)) (* (/ x z) y)))

  (/ (* x y) z))