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

Average Error: 6.4 → 0.4

Time: 21.9s

Precision: binary64

Cost: 1360

Math

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

↓

\[\begin{array}{l} t_0 := \frac{x \cdot y}{z}\\ \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+188}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-256}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \cdot y \leq 0:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;x \cdot y \leq 10^{+264}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{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) -1e+188)
     (/ y (/ z x))
     (if (<= (* x y) -5e-256)
       t_0
       (if (<= (* x y) 0.0)
         (* y (/ x z))
         (if (<= (* x y) 1e+264) t_0 (* x (/ y 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) <= -1e+188) {
		tmp = y / (z / x);
	} else if ((x * y) <= -5e-256) {
		tmp = t_0;
	} else if ((x * y) <= 0.0) {
		tmp = y * (x / z);
	} else if ((x * y) <= 1e+264) {
		tmp = t_0;
	} else {
		tmp = x * (y / 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) <= (-1d+188)) then
        tmp = y / (z / x)
    else if ((x * y) <= (-5d-256)) then
        tmp = t_0
    else if ((x * y) <= 0.0d0) then
        tmp = y * (x / z)
    else if ((x * y) <= 1d+264) then
        tmp = t_0
    else
        tmp = x * (y / 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) <= -1e+188) {
		tmp = y / (z / x);
	} else if ((x * y) <= -5e-256) {
		tmp = t_0;
	} else if ((x * y) <= 0.0) {
		tmp = y * (x / z);
	} else if ((x * y) <= 1e+264) {
		tmp = t_0;
	} else {
		tmp = x * (y / 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) <= -1e+188:
		tmp = y / (z / x)
	elif (x * y) <= -5e-256:
		tmp = t_0
	elif (x * y) <= 0.0:
		tmp = y * (x / z)
	elif (x * y) <= 1e+264:
		tmp = t_0
	else:
		tmp = x * (y / 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) <= -1e+188)
		tmp = Float64(y / Float64(z / x));
	elseif (Float64(x * y) <= -5e-256)
		tmp = t_0;
	elseif (Float64(x * y) <= 0.0)
		tmp = Float64(y * Float64(x / z));
	elseif (Float64(x * y) <= 1e+264)
		tmp = t_0;
	else
		tmp = Float64(x * Float64(y / 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) <= -1e+188)
		tmp = y / (z / x);
	elseif ((x * y) <= -5e-256)
		tmp = t_0;
	elseif ((x * y) <= 0.0)
		tmp = y * (x / z);
	elseif ((x * y) <= 1e+264)
		tmp = t_0;
	else
		tmp = x * (y / 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], -1e+188], N[(y / N[(z / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -5e-256], t$95$0, If[LessEqual[N[(x * y), $MachinePrecision], 0.0], N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+264], t$95$0, N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]]]]]]

Target

Original	6.4
Target	6.3
Herbie	0.4

\[\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) < -1e188

   1. Initial program 25.3

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

   2. Simplified 1.5

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

   3. Applied egg-rr 1.8

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

   if -1e188 < (*.f64 x y) < -5e-256 or 0.0 < (*.f64 x y) < 1.00000000000000004e264

   1. Initial program 0.4

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

   if -5e-256 < (*.f64 x y) < 0.0

   1. Initial program 16.7

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

   2. Simplified 0.1

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

   if 1.00000000000000004e264 < (*.f64 x y)

   1. Initial program 40.6

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

   2. Simplified 0.2

      \[\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)): 63 points increase in error, 49 points decrease in error
3. Recombined 4 regimes into one program.

4. Final simplification 0.4

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+188}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-256}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;x \cdot y \leq 0:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;x \cdot y \leq 10^{+264}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \end{array} \]

Alternatives

Alternative 1
Error	6.1
Cost	716

\[\begin{array}{l} t_0 := y \cdot \frac{x}{z}\\ t_1 := x \cdot \frac{y}{z}\\ \mathbf{if}\;x \leq -1.5 \cdot 10^{+252}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -4.5 \cdot 10^{+39}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -3.7 \cdot 10^{-235}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 2
Error	6.1
Cost	716

\[\begin{array}{l} t_0 := \frac{y}{\frac{z}{x}}\\ t_1 := x \cdot \frac{y}{z}\\ \mathbf{if}\;x \leq -8.2 \cdot 10^{+256}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -1.75 \cdot 10^{+75}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -3.7 \cdot 10^{-235}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 3
Error	5.8
Cost	320

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

Reproduce

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