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

Average Error: 6.1 → 0.6

Time: 4.8s

Precision: binary64

Cost: 1360

\[ \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 -2 \cdot 10^{+253}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-272}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-205}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+118}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \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) -2e+253)
     (/ y (/ z x))
     (if (<= (* x y) -5e-272)
       t_0
       (if (<= (* x y) 5e-205)
         (/ x (/ z y))
         (if (<= (* x y) 2e+118) t_0 (* y (/ x z))))))))

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) <= -2e+253) {
		tmp = y / (z / x);
	} else if ((x * y) <= -5e-272) {
		tmp = t_0;
	} else if ((x * y) <= 5e-205) {
		tmp = x / (z / y);
	} else if ((x * y) <= 2e+118) {
		tmp = t_0;
	} else {
		tmp = y * (x / z);
	}
	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) <= (-2d+253)) then
        tmp = y / (z / x)
    else if ((x * y) <= (-5d-272)) then
        tmp = t_0
    else if ((x * y) <= 5d-205) then
        tmp = x / (z / y)
    else if ((x * y) <= 2d+118) then
        tmp = t_0
    else
        tmp = y * (x / z)
    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) <= -2e+253) {
		tmp = y / (z / x);
	} else if ((x * y) <= -5e-272) {
		tmp = t_0;
	} else if ((x * y) <= 5e-205) {
		tmp = x / (z / y);
	} else if ((x * y) <= 2e+118) {
		tmp = t_0;
	} else {
		tmp = y * (x / z);
	}
	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) <= -2e+253:
		tmp = y / (z / x)
	elif (x * y) <= -5e-272:
		tmp = t_0
	elif (x * y) <= 5e-205:
		tmp = x / (z / y)
	elif (x * y) <= 2e+118:
		tmp = t_0
	else:
		tmp = y * (x / z)
	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) <= -2e+253)
		tmp = Float64(y / Float64(z / x));
	elseif (Float64(x * y) <= -5e-272)
		tmp = t_0;
	elseif (Float64(x * y) <= 5e-205)
		tmp = Float64(x / Float64(z / y));
	elseif (Float64(x * y) <= 2e+118)
		tmp = t_0;
	else
		tmp = Float64(y * Float64(x / z));
	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) <= -2e+253)
		tmp = y / (z / x);
	elseif ((x * y) <= -5e-272)
		tmp = t_0;
	elseif ((x * y) <= 5e-205)
		tmp = x / (z / y);
	elseif ((x * y) <= 2e+118)
		tmp = t_0;
	else
		tmp = y * (x / z);
	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], -2e+253], N[(y / N[(z / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -5e-272], t$95$0, If[LessEqual[N[(x * y), $MachinePrecision], 5e-205], N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+118], t$95$0, N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]]

Target

Original	6.1
Target	6.2
Herbie	0.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 4 regimes

2. if (*.f64 x y) < -1.9999999999999999e253

   1. Initial program 37.9

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

   2. Simplified 0.5

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

      [Start] 37.9	\[ \frac{x \cdot y}{z} \]
      associate-*l/ [<=] 0.5	\[ \color{blue}{\frac{x}{z} \cdot y} \]

   3. Applied egg-rr 0.5

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

   if -1.9999999999999999e253 < (*.f64 x y) < -4.99999999999999982e-272 or 5.00000000000000001e-205 < (*.f64 x y) < 1.99999999999999993e118

   1. Initial program 0.2

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

   if -4.99999999999999982e-272 < (*.f64 x y) < 5.00000000000000001e-205

   1. Initial program 12.7

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

   2. Simplified 0.3

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

      [Start] 12.7	\[ \frac{x \cdot y}{z} \]
      associate-/l* [=>] 0.3	\[ \color{blue}{\frac{x}{\frac{z}{y}}} \]

   if 1.99999999999999993e118 < (*.f64 x y)

   1. Initial program 14.9

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

   2. Simplified 3.3

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

      [Start] 14.9	\[ \frac{x \cdot y}{z} \]
      associate-*l/ [<=] 3.3	\[ \color{blue}{\frac{x}{z} \cdot y} \]

3. Recombined 4 regimes into one program.

4. Final simplification 0.6

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -2 \cdot 10^{+253}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-272}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-205}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+118}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]

Alternatives

Alternative 1
Error	6.2
Cost	452

\[\begin{array}{l} \mathbf{if}\;y \leq 1.1 \cdot 10^{+101}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]

Alternative 2
Error	6.5
Cost	320

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

Reproduce

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