Numeric.LinearAlgebra.Util:formatSparse from hmatrix-0.16.1.5

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

Alternatives: 4

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.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{-21} \lor \neg \left(x \leq 2.45 \cdot 10^{+25}\right):\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.35e-21) (not (<= x 2.45e+25))) (fabs (/ x y)) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.35e-21) || !(x <= 2.45e+25)) {
		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 ((x <= (-1.35d-21)) .or. (.not. (x <= 2.45d+25))) 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 ((x <= -1.35e-21) || !(x <= 2.45e+25)) {
		tmp = Math.abs((x / y));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.35e-21) or not (x <= 2.45e+25):
		tmp = math.fabs((x / y))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.35e-21) || !(x <= 2.45e+25))
		tmp = abs(Float64(x / y));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.35e-21) || ~((x <= 2.45e+25)))
		tmp = abs((x / y));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.35e-21], N[Not[LessEqual[x, 2.45e+25]], $MachinePrecision]], N[Abs[N[(x / y), $MachinePrecision]], $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -1.3500000000000001e-21 or 2.45e25 < x

   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 77.6%

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

   if -1.3500000000000001e-21 < x < 2.45e25

   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 86.6%

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

   8. Applied egg-rr 86.6%

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

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{-21} \lor \neg \left(x \leq 2.45 \cdot 10^{+25}\right):\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 56.4% accurate, 15.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+239} \lor \neg \left(x \leq 1.45 \cdot 10^{+165}\right):\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.2e+239) (not (<= x 1.45e+165))) (* x x) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.2e+239) || !(x <= 1.45e+165)) {
		tmp = x * x;
	} 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 <= (-1.2d+239)) .or. (.not. (x <= 1.45d+165))) then
        tmp = x * x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.2e+239) || !(x <= 1.45e+165)) {
		tmp = x * x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.2e+239) or not (x <= 1.45e+165):
		tmp = x * x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.2e+239) || !(x <= 1.45e+165))
		tmp = Float64(x * x);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.2e+239) || ~((x <= 1.45e+165)))
		tmp = x * x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.2e+239], N[Not[LessEqual[x, 1.45e+165]], $MachinePrecision]], N[(x * x), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -1.2e239 or 1.45000000000000003e165 < x

   1. Initial program 100.0%

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

      1. add-log-exp 48.5%

         \[\leadsto \color{blue}{\log \left(e^{\frac{\left|x - y\right|}{\left|y\right|}}\right)} \]

      2. *-un-lft-identity 48.5%

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

      3. log-prod 48.5%

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

      4. metadata-eval 48.5%

         \[\leadsto \color{blue}{0} + \log \left(e^{\frac{\left|x - y\right|}{\left|y\right|}}\right) \]

      5. add-log-exp 100.0%

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

      6. add-sqr-sqrt 55.9%

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

      7. fabs-sqr 55.9%

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

      8. add-sqr-sqrt 21.0%

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

      9. fabs-sqr 21.0%

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

      10. add-sqr-sqrt 21.2%

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

      11. add-sqr-sqrt 37.2%

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

   4. Applied egg-rr 37.2%

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

   5. Taylor expanded in x around inf 37.5%

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

   7. Applied egg-rr 43.4%

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

   if -1.2e239 < x < 1.45000000000000003e165

   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 71.1%

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

   8. Applied egg-rr 71.1%

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

4. Final simplification 64.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+239} \lor \neg \left(x \leq 1.45 \cdot 10^{+165}\right):\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 50.8% 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 57.1%

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

8. Applied egg-rr 57.1%

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

Reproduce

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