Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, C

Percentage Accurate: 100.0% → 100.0%

Time: 1.7s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x - y \cdot z \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - y \cdot z \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(-z, y, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (- z) y x))

C

double code(double x, double y, double z) {
	return fma(-z, y, x);
}

Julia

function code(x, y, z)
	return fma(Float64(-z), y, x)
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x - y \cdot z \]
2. Step-by-step derivation

   1. sub-neg 100.0%

      \[\leadsto \color{blue}{x + \left(-y \cdot z\right)} \]

   2. +-commutative 100.0%

      \[\leadsto \color{blue}{\left(-y \cdot z\right) + x} \]

   3. *-commutative 100.0%

      \[\leadsto \left(-\color{blue}{z \cdot y}\right) + x \]

   4. distribute-lft-neg-in 100.0%

      \[\leadsto \color{blue}{\left(-z\right) \cdot y} + x \]

   5. fma-def 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-z, y, x\right)} \]

3. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-z, y, x\right)} \]

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(-z, y, x\right) \]

Alternative 2: 67.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+107} \lor \neg \left(y \leq 1.15 \cdot 10^{-151}\right):\\ \;\;\;\;z \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.65e+107) (not (<= y 1.15e-151))) (* z (- y)) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.65e+107) || !(y <= 1.15e-151)) {
		tmp = z * -y;
	} else {
		tmp = 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
    real(8) :: tmp
    if ((y <= (-2.65d+107)) .or. (.not. (y <= 1.15d-151))) then
        tmp = z * -y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.65e+107) || !(y <= 1.15e-151)) {
		tmp = z * -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.65e+107) or not (y <= 1.15e-151):
		tmp = z * -y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.65e+107) || !(y <= 1.15e-151))
		tmp = Float64(z * Float64(-y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.65e+107) || ~((y <= 1.15e-151)))
		tmp = z * -y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.65e+107], N[Not[LessEqual[y, 1.15e-151]], $MachinePrecision]], N[(z * (-y)), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -2.65e107 or 1.14999999999999998e-151 < y

   1. Initial program 100.0%

      \[x - y \cdot z \]

   2. Taylor expanded in x around 0 67.2%

      \[\leadsto \color{blue}{-1 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. mul-1-neg 67.2%

         \[\leadsto \color{blue}{-y \cdot z} \]

      2. *-commutative 67.2%

         \[\leadsto -\color{blue}{z \cdot y} \]

      3. distribute-rgt-neg-in 67.2%

         \[\leadsto \color{blue}{z \cdot \left(-y\right)} \]

   4. Simplified 67.2%

      \[\leadsto \color{blue}{z \cdot \left(-y\right)} \]

   if -2.65e107 < y < 1.14999999999999998e-151

   1. Initial program 100.0%

      \[x - y \cdot z \]

   2. Taylor expanded in x around inf 65.7%

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

4. Final simplification 66.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+107} \lor \neg \left(y \leq 1.15 \cdot 10^{-151}\right):\\ \;\;\;\;z \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - z \cdot y \end{array} \]

FPCore

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

C

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

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 - (z * y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x - y \cdot z \]

2. Final simplification 100.0%

   \[\leadsto x - z \cdot y \]

Alternative 4: 49.8% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

function code(x, y, z)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

   \[x - y \cdot z \]

2. Taylor expanded in x around inf 50.9%

   \[\leadsto \color{blue}{x} \]

3. Final simplification 50.9%

   \[\leadsto x \]

Developer target: 87.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + y \cdot z\\ \frac{t_0}{\frac{t_0}{x - y \cdot z}} \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (* y z)))) (/ t_0 (/ t_0 (- x (* y z))))))

C

double code(double x, double y, double z) {
	double t_0 = x + (y * z);
	return t_0 / (t_0 / (x - (y * z)));
}

Fortran

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
    t_0 = x + (y * z)
    code = t_0 / (t_0 / (x - (y * z)))
end function

Java

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

Python

def code(x, y, z):
	t_0 = x + (y * z)
	return t_0 / (t_0 / (x - (y * z)))

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(y * z))
	return Float64(t_0 / Float64(t_0 / Float64(x - Float64(y * z))))
end

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 / N[(t$95$0 / N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2023332 
(FPCore (x y z)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, C"
  :precision binary64

  :herbie-target
  (/ (+ x (* y z)) (/ (+ x (* y z)) (- x (* y z))))

  (- x (* y z)))