Numeric.LinearAlgebra.Util:formatSparse from hmatrix-0.16.1.5

Percentage Accurate: 100.0% → 100.0%

Time: 6.0s

Alternatives: 5

Speedup: 2.0×

Specification

Math

\[\begin{array}{l} \\ \frac{\left|x - y\right|}{\left|y\right|} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (fabs (- x y)) (fabs y)))

C

double code(double x, double y) {
	return fabs((x - y)) / fabs(y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = abs((x - y)) / abs(y)
end function

Java

public static double code(double x, double y) {
	return Math.abs((x - y)) / Math.abs(y);
}

Python

def code(x, y):
	return math.fabs((x - y)) / math.fabs(y)

Julia

function code(x, y)
	return Float64(abs(Float64(x - y)) / abs(y))
end

MATLAB

function tmp = code(x, y)
	tmp = abs((x - y)) / abs(y);
end

Wolfram

code[x_, y_] := N[(N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision] / N[Abs[y], $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left|x - y\right|}{\left|y\right|} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (fabs (- x y)) (fabs y)))

C

double code(double x, double y) {
	return fabs((x - y)) / fabs(y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = abs((x - y)) / abs(y)
end function

Java

public static double code(double x, double y) {
	return Math.abs((x - y)) / Math.abs(y);
}

Python

def code(x, y):
	return math.fabs((x - y)) / math.fabs(y)

Julia

function code(x, y)
	return Float64(abs(Float64(x - y)) / abs(y))
end

MATLAB

function tmp = code(x, y)
	tmp = abs((x - y)) / abs(y);
end

Wolfram

code[x_, y_] := N[(N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision] / N[Abs[y], $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \left|\frac{x}{y} + -1\right| \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (fabs (+ (/ x y) -1.0)))

C

double code(double x, double y) {
	return fabs(((x / y) + -1.0));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = abs(((x / y) + (-1.0d0)))
end function

Java

public static double code(double x, double y) {
	return Math.abs(((x / y) + -1.0));
}

Python

def code(x, y):
	return math.fabs(((x / y) + -1.0))

Julia

function code(x, y)
	return abs(Float64(Float64(x / y) + -1.0))
end

MATLAB

function tmp = code(x, y)
	tmp = abs(((x / y) + -1.0));
end

Wolfram

code[x_, y_] := N[Abs[N[(N[(x / y), $MachinePrecision] + -1.0), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{\left|x - y\right|}{\left|y\right|} \]
2. Add Preprocessing

3. Taylor expanded in x around -inf 100.0%

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

5. Simplified 100.0%

   \[\leadsto \color{blue}{\left|\frac{x}{y} + -1\right|} \]
6. Add Preprocessing

Alternative 2: 75.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+27}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 600:\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.35e+27) 1.0 (if (<= y 600.0) (fabs (/ x y)) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.35e+27) {
		tmp = 1.0;
	} else if (y <= 600.0) {
		tmp = fabs((x / y));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-1.35d+27)) then
        tmp = 1.0d0
    else if (y <= 600.0d0) then
        tmp = abs((x / y))
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.35e+27) {
		tmp = 1.0;
	} else if (y <= 600.0) {
		tmp = Math.abs((x / y));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.35e+27:
		tmp = 1.0
	elif y <= 600.0:
		tmp = math.fabs((x / y))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.35e+27)
		tmp = 1.0;
	elseif (y <= 600.0)
		tmp = abs(Float64(x / y));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.35e+27)
		tmp = 1.0;
	elseif (y <= 600.0)
		tmp = abs((x / y));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.35e+27], 1.0, If[LessEqual[y, 600.0], N[Abs[N[(x / y), $MachinePrecision]], $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3499999999999999e27 or 600 < y

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf 100.0%

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

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\left|\frac{x}{y} + -1\right|} \]

   6. Taylor expanded in x around 0 79.0%

      \[\leadsto \left|\color{blue}{-1}\right| \]

   8. Applied egg-rr 79.0%

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

   if -1.3499999999999999e27 < y < 600

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf 100.0%

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

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\left|\frac{x}{y} + -1\right|} \]

   6. Taylor expanded in x around inf 79.6%

      \[\leadsto \left|\color{blue}{\frac{x}{y}}\right| \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 59.5% accurate, 13.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+112}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+157}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.4e+112) (/ x y) (if (<= x 9e+157) 1.0 (+ (/ x y) -1.0))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.4e+112) {
		tmp = x / y;
	} else if (x <= 9e+157) {
		tmp = 1.0;
	} else {
		tmp = (x / y) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-4.4d+112)) then
        tmp = x / y
    else if (x <= 9d+157) then
        tmp = 1.0d0
    else
        tmp = (x / y) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.4e+112) {
		tmp = x / y;
	} else if (x <= 9e+157) {
		tmp = 1.0;
	} else {
		tmp = (x / y) + -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.4e+112:
		tmp = x / y
	elif x <= 9e+157:
		tmp = 1.0
	else:
		tmp = (x / y) + -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.4e+112)
		tmp = Float64(x / y);
	elseif (x <= 9e+157)
		tmp = 1.0;
	else
		tmp = Float64(Float64(x / y) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.4e+112)
		tmp = x / y;
	elseif (x <= 9e+157)
		tmp = 1.0;
	else
		tmp = (x / y) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.4e+112], N[(x / y), $MachinePrecision], If[LessEqual[x, 9e+157], 1.0, N[(N[(x / y), $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.3999999999999999e112

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. div-inv 99.8%

         \[\leadsto \color{blue}{\left|x - y\right| \cdot \frac{1}{\left|y\right|}} \]

      2. add-sqr-sqrt 6.8%

         \[\leadsto \left|\color{blue}{\sqrt{x - y} \cdot \sqrt{x - y}}\right| \cdot \frac{1}{\left|y\right|} \]

      3. fabs-sqr 6.8%

         \[\leadsto \color{blue}{\left(\sqrt{x - y} \cdot \sqrt{x - y}\right)} \cdot \frac{1}{\left|y\right|} \]

      4. add-sqr-sqrt 7.3%

         \[\leadsto \color{blue}{\left(x - y\right)} \cdot \frac{1}{\left|y\right|} \]

      5. *-commutative 7.3%

         \[\leadsto \color{blue}{\frac{1}{\left|y\right|} \cdot \left(x - y\right)} \]

      6. add-sqr-sqrt 0.3%

         \[\leadsto \frac{1}{\left|\color{blue}{\sqrt{y} \cdot \sqrt{y}}\right|} \cdot \left(x - y\right) \]

      7. fabs-sqr 0.3%

         \[\leadsto \frac{1}{\color{blue}{\sqrt{y} \cdot \sqrt{y}}} \cdot \left(x - y\right) \]

      8. add-sqr-sqrt 54.8%

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

   4. Applied egg-rr 54.8%

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

   5. Taylor expanded in x around inf 55.2%

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

   6. Taylor expanded in y around 0 55.4%

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

   if -4.3999999999999999e112 < x < 8.9999999999999997e157

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf 100.0%

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

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\left|\frac{x}{y} + -1\right|} \]

   6. Taylor expanded in x around 0 68.9%

      \[\leadsto \left|\color{blue}{-1}\right| \]

   8. Applied egg-rr 68.9%

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

   if 8.9999999999999997e157 < x

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-sqr-sqrt 99.5%

         \[\leadsto \frac{\left|\color{blue}{\sqrt{x - y} \cdot \sqrt{x - y}}\right|}{\left|y\right|} \]

      2. fabs-sqr 99.5%

         \[\leadsto \frac{\color{blue}{\sqrt{x - y} \cdot \sqrt{x - y}}}{\left|y\right|} \]

      3. add-sqr-sqrt 62.0%

         \[\leadsto \frac{\sqrt{x - y} \cdot \sqrt{x - y}}{\left|\color{blue}{\sqrt{y} \cdot \sqrt{y}}\right|} \]

      4. fabs-sqr 62.0%

         \[\leadsto \frac{\sqrt{x - y} \cdot \sqrt{x - y}}{\color{blue}{\sqrt{y} \cdot \sqrt{y}}} \]

      5. add-sqr-sqrt 62.4%

         \[\leadsto \frac{\sqrt{x - y} \cdot \sqrt{x - y}}{\color{blue}{y}} \]

      6. add-sqr-sqrt 62.6%

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

      7. div-sub 62.7%

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

   4. Applied egg-rr 62.7%

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

   5. Taylor expanded in y around 0 62.7%

      \[\leadsto \frac{x}{y} - \color{blue}{1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 65.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+112}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+157}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 59.3% accurate, 15.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{+104} \lor \neg \left(x \leq 1.72 \cdot 10^{+159}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -4e+104) (not (<= x 1.72e+159))) (/ x y) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -4e+104) || !(x <= 1.72e+159)) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-4d+104)) .or. (.not. (x <= 1.72d+159))) then
        tmp = x / y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -4e+104) || !(x <= 1.72e+159)) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -4e+104) or not (x <= 1.72e+159):
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -4e+104) || !(x <= 1.72e+159))
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -4e+104) || ~((x <= 1.72e+159)))
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -4e+104], N[Not[LessEqual[x, 1.72e+159]], $MachinePrecision]], N[(x / y), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -4e104 or 1.72e159 < x

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. div-inv 99.8%

         \[\leadsto \color{blue}{\left|x - y\right| \cdot \frac{1}{\left|y\right|}} \]

      2. add-sqr-sqrt 45.8%

         \[\leadsto \left|\color{blue}{\sqrt{x - y} \cdot \sqrt{x - y}}\right| \cdot \frac{1}{\left|y\right|} \]

      3. fabs-sqr 45.8%

         \[\leadsto \color{blue}{\left(\sqrt{x - y} \cdot \sqrt{x - y}\right)} \cdot \frac{1}{\left|y\right|} \]

      4. add-sqr-sqrt 46.2%

         \[\leadsto \color{blue}{\left(x - y\right)} \cdot \frac{1}{\left|y\right|} \]

      5. *-commutative 46.2%

         \[\leadsto \color{blue}{\frac{1}{\left|y\right|} \cdot \left(x - y\right)} \]

      6. add-sqr-sqrt 26.4%

         \[\leadsto \frac{1}{\left|\color{blue}{\sqrt{y} \cdot \sqrt{y}}\right|} \cdot \left(x - y\right) \]

      7. fabs-sqr 26.4%

         \[\leadsto \frac{1}{\color{blue}{\sqrt{y} \cdot \sqrt{y}}} \cdot \left(x - y\right) \]

      8. add-sqr-sqrt 58.1%

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

   4. Applied egg-rr 58.1%

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

   5. Taylor expanded in x around inf 57.5%

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

   6. Taylor expanded in y around 0 57.5%

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

   if -4e104 < x < 1.72e159

   1. Initial program 100.0%

      \[\frac{\left|x - y\right|}{\left|y\right|} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf 100.0%

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

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\left|\frac{x}{y} + -1\right|} \]

   6. Taylor expanded in x around 0 68.9%

      \[\leadsto \left|\color{blue}{-1}\right| \]

   8. Applied egg-rr 68.9%

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

4. Final simplification 65.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{+104} \lor \neg \left(x \leq 1.72 \cdot 10^{+159}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 51.7% accurate, 205.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0
end function

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 100.0%

   \[\frac{\left|x - y\right|}{\left|y\right|} \]
2. Add Preprocessing

3. Taylor expanded in x around -inf 100.0%

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

5. Simplified 100.0%

   \[\leadsto \color{blue}{\left|\frac{x}{y} + -1\right|} \]

6. Taylor expanded in x around 0 52.8%

   \[\leadsto \left|\color{blue}{-1}\right| \]

8. Applied egg-rr 52.8%

   \[\leadsto \color{blue}{1} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024185 
(FPCore (x y)
  :name "Numeric.LinearAlgebra.Util:formatSparse from hmatrix-0.16.1.5"
  :precision binary64
  (/ (fabs (- x y)) (fabs y)))