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

Average Error: 6.1 → 2.6

Time: 3.4s

Precision: binary64

Cost: 1100

\[ \begin{array}{c}[x, y] = \mathsf{sort}([x, y])\\ \end{array} \]

Math

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

↓

\[\begin{array}{l} t_0 := \frac{x \cdot y}{z}\\ \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{-156}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-243}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{elif}\;x \cdot y \leq 10^{+71}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \end{array} \]

FPCore

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

↓

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* x y) z)))
   (if (<= (* x y) -4e-156)
     t_0
     (if (<= (* x y) 2e-243)
       (/ x (/ z y))
       (if (<= (* x y) 1e+71) t_0 (/ y (/ z x)))))))

C

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

↓

double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double tmp;
	if ((x * y) <= -4e-156) {
		tmp = t_0;
	} else if ((x * y) <= 2e-243) {
		tmp = x / (z / y);
	} else if ((x * y) <= 1e+71) {
		tmp = t_0;
	} else {
		tmp = y / (z / x);
	}
	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
    code = (x * y) / z
end function

↓

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x * y) / z
    if ((x * y) <= (-4d-156)) then
        tmp = t_0
    else if ((x * y) <= 2d-243) then
        tmp = x / (z / y)
    else if ((x * y) <= 1d+71) then
        tmp = t_0
    else
        tmp = y / (z / x)
    end if
    code = tmp
end function

Java

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

↓

public static double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double tmp;
	if ((x * y) <= -4e-156) {
		tmp = t_0;
	} else if ((x * y) <= 2e-243) {
		tmp = x / (z / y);
	} else if ((x * y) <= 1e+71) {
		tmp = t_0;
	} else {
		tmp = y / (z / x);
	}
	return tmp;
}

Python

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

↓

def code(x, y, z):
	t_0 = (x * y) / z
	tmp = 0
	if (x * y) <= -4e-156:
		tmp = t_0
	elif (x * y) <= 2e-243:
		tmp = x / (z / y)
	elif (x * y) <= 1e+71:
		tmp = t_0
	else:
		tmp = y / (z / x)
	return tmp

Julia

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

↓

function code(x, y, z)
	t_0 = Float64(Float64(x * y) / z)
	tmp = 0.0
	if (Float64(x * y) <= -4e-156)
		tmp = t_0;
	elseif (Float64(x * y) <= 2e-243)
		tmp = Float64(x / Float64(z / y));
	elseif (Float64(x * y) <= 1e+71)
		tmp = t_0;
	else
		tmp = Float64(y / Float64(z / x));
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(x, y, z)
	t_0 = (x * y) / z;
	tmp = 0.0;
	if ((x * y) <= -4e-156)
		tmp = t_0;
	elseif ((x * y) <= 2e-243)
		tmp = x / (z / y);
	elseif ((x * y) <= 1e+71)
		tmp = t_0;
	else
		tmp = y / (z / x);
	end
	tmp_2 = tmp;
end

Wolfram

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

↓

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -4e-156], t$95$0, If[LessEqual[N[(x * y), $MachinePrecision], 2e-243], N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+71], t$95$0, N[(y / N[(z / x), $MachinePrecision]), $MachinePrecision]]]]]

Target

Original	6.1
Target	6.2
Herbie	2.6

\[\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} \]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -4.00000000000000016e-156 or 1.99999999999999999e-243 < (*.f64 x y) < 1e71

   1. Initial program 2.9

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

   if -4.00000000000000016e-156 < (*.f64 x y) < 1.99999999999999999e-243

   1. Initial program 10.3

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

   2. Simplified 0.8

      \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]
      Proof
      (*.f64 x (/.f64 y z)): 0 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 x y) z)): 51 points increase in error, 50 points decrease in error

   3. Applied egg-rr 0.8

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

   if 1e71 < (*.f64 x y)

   1. Initial program 11.3

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

   2. Applied egg-rr 6.2

      \[\leadsto \color{blue}{{\left(\sqrt[3]{\frac{x}{z} \cdot y}\right)}^{3}} \]

   3. Applied egg-rr 5.3

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

4. Final simplification 2.6

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{-156}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-243}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{elif}\;x \cdot y \leq 10^{+71}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \end{array} \]

Alternatives

Alternative 1
Error	6.1
Cost	320

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

Reproduce

herbie shell --seed 2022316 
(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))