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

Average Error: 6.4 → 1.0

Time: 3.2s

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 := y \cdot \frac{x}{z}\\ t_1 := \frac{x \cdot y}{z}\\ \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+200}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-67}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-272}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+193}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

FPCore

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

↓

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (/ x z))) (t_1 (/ (* x y) z)))
   (if (<= (* x y) -1e+200)
     t_0
     (if (<= (* x y) -5e-67)
       t_1
       (if (<= (* x y) 5e-272)
         (* x (/ y z))
         (if (<= (* x y) 2e+193) t_1 t_0))))))

C

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

↓

double code(double x, double y, double z) {
	double t_0 = y * (x / z);
	double t_1 = (x * y) / z;
	double tmp;
	if ((x * y) <= -1e+200) {
		tmp = t_0;
	} else if ((x * y) <= -5e-67) {
		tmp = t_1;
	} else if ((x * y) <= 5e-272) {
		tmp = x * (y / z);
	} else if ((x * y) <= 2e+193) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = y * (x / z)
    t_1 = (x * y) / z
    if ((x * y) <= (-1d+200)) then
        tmp = t_0
    else if ((x * y) <= (-5d-67)) then
        tmp = t_1
    else if ((x * y) <= 5d-272) then
        tmp = x * (y / z)
    else if ((x * y) <= 2d+193) then
        tmp = t_1
    else
        tmp = t_0
    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 = y * (x / z);
	double t_1 = (x * y) / z;
	double tmp;
	if ((x * y) <= -1e+200) {
		tmp = t_0;
	} else if ((x * y) <= -5e-67) {
		tmp = t_1;
	} else if ((x * y) <= 5e-272) {
		tmp = x * (y / z);
	} else if ((x * y) <= 2e+193) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

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

↓

def code(x, y, z):
	t_0 = y * (x / z)
	t_1 = (x * y) / z
	tmp = 0
	if (x * y) <= -1e+200:
		tmp = t_0
	elif (x * y) <= -5e-67:
		tmp = t_1
	elif (x * y) <= 5e-272:
		tmp = x * (y / z)
	elif (x * y) <= 2e+193:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

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

↓

function code(x, y, z)
	t_0 = Float64(y * Float64(x / z))
	t_1 = Float64(Float64(x * y) / z)
	tmp = 0.0
	if (Float64(x * y) <= -1e+200)
		tmp = t_0;
	elseif (Float64(x * y) <= -5e-67)
		tmp = t_1;
	elseif (Float64(x * y) <= 5e-272)
		tmp = Float64(x * Float64(y / z));
	elseif (Float64(x * y) <= 2e+193)
		tmp = t_1;
	else
		tmp = t_0;
	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 = y * (x / z);
	t_1 = (x * y) / z;
	tmp = 0.0;
	if ((x * y) <= -1e+200)
		tmp = t_0;
	elseif ((x * y) <= -5e-67)
		tmp = t_1;
	elseif ((x * y) <= 5e-272)
		tmp = x * (y / z);
	elseif ((x * y) <= 2e+193)
		tmp = t_1;
	else
		tmp = t_0;
	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[(y * N[(x / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+200], t$95$0, If[LessEqual[N[(x * y), $MachinePrecision], -5e-67], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 5e-272], N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+193], t$95$1, t$95$0]]]]]]

Target

Original	6.4
Target	6.4
Herbie	1.0

\[\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) < -9.9999999999999997e199 or 2.00000000000000013e193 < (*.f64 x y)

   1. Initial program 25.4

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

   2. Simplified 1.2

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

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

   if -9.9999999999999997e199 < (*.f64 x y) < -4.9999999999999999e-67 or 4.99999999999999982e-272 < (*.f64 x y) < 2.00000000000000013e193

   1. Initial program 0.2

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

   if -4.9999999999999999e-67 < (*.f64 x y) < 4.99999999999999982e-272

   1. Initial program 8.7

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

   2. Simplified 2.1

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

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

3. Recombined 3 regimes into one program.

4. Final simplification 1.0

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

Alternatives

Alternative 1
Error	5.9
Cost	585

\[\begin{array}{l} \mathbf{if}\;x \leq -1.05 \cdot 10^{+228} \lor \neg \left(x \leq -1.05 \cdot 10^{-194}\right):\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]

Alternative 2
Error	5.7
Cost	584

\[\begin{array}{l} \mathbf{if}\;x \leq -1.9 \cdot 10^{+228}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq -3.2 \cdot 10^{-212}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \end{array} \]

Alternative 3
Error	5.6
Cost	584

\[\begin{array}{l} \mathbf{if}\;x \leq -7.5 \cdot 10^{+225}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq -5.1 \cdot 10^{-214}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \end{array} \]

Alternative 4
Error	6.0
Cost	320

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

Reproduce

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