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

Average Accuracy: 90.3% → 96.9%

Time: 2.7s

Precision: binary64

Cost: 1484

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

Target

Original	90.3%
Target	90.5%
Herbie	96.9%

\[\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 (*.f64 x y) z) < -9.88131e-323 or 0.0 < (/.f64 (*.f64 x y) z) < 1.00000000000000002e306

   1. Initial program 95.9%

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

   if -9.88131e-323 < (/.f64 (*.f64 x y) z) < 0.0

   1. Initial program 81.4%

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

   2. Simplified 99.9%

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

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

   if 1.00000000000000002e306 < (/.f64 (*.f64 x y) z)

   1. Initial program 3.6%

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

   2. Simplified 99.6%

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

      [Start] 3.6	\[ \frac{x \cdot y}{z} \]
      associate-*r/ [<=] 99.6	\[ \color{blue}{x \cdot \frac{y}{z}} \]

3. Recombined 3 regimes into one program.

4. Final simplification 96.9%

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

Alternatives

Alternative 1
Accuracy	90.4%
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -3.4 \cdot 10^{-231} \lor \neg \left(y \leq 4.7 \cdot 10^{-141}\right):\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \end{array} \]

Alternative 2
Accuracy	90.6%
Cost	584

\[\begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{-230}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{-141}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]

Alternative 3
Accuracy	90.2%
Cost	320

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

Reproduce

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