Numeric.LinearAlgebra.Util:formatSparse from hmatrix-0.16.1.5

Percentage Accurate: 100.0% → 100.0%

Time: 6.1s

Alternatives: 6

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.1 \cdot 10^{+26} \lor \neg \left(x \leq 4.8 \cdot 10^{-14}\right):\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.1e+26) (not (<= x 4.8e-14))) (fabs (/ x y)) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.1e+26) || !(x <= 4.8e-14)) {
		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.1d+26)) .or. (.not. (x <= 4.8d-14))) 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.1e+26) || !(x <= 4.8e-14)) {
		tmp = Math.abs((x / y));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.1e+26) or not (x <= 4.8e-14):
		tmp = math.fabs((x / y))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.1e+26) || !(x <= 4.8e-14))
		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.1e+26) || ~((x <= 4.8e-14)))
		tmp = abs((x / y));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.1e+26], N[Not[LessEqual[x, 4.8e-14]], $MachinePrecision]], N[Abs[N[(x / y), $MachinePrecision]], $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -1.10000000000000004e26 or 4.8e-14 < 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 76.5%

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

   if -1.10000000000000004e26 < x < 4.8e-14

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

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

   8. Applied egg-rr 78.3%

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

4. Final simplification 77.4%

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

Alternative 3: 59.5% accurate, 15.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{+175} \lor \neg \left(x \leq 2 \cdot 10^{+87}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -4.8e+175) (not (<= x 2e+87))) (/ x y) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -4.8e+175) || !(x <= 2e+87)) {
		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 <= (-4.8d+175)) .or. (.not. (x <= 2d+87))) 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 <= -4.8e+175) || !(x <= 2e+87)) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -4.8e+175) or not (x <= 2e+87):
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -4.8e+175) || !(x <= 2e+87))
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -4.8e+175) || ~((x <= 2e+87)))
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -4.8e+175], N[Not[LessEqual[x, 2e+87]], $MachinePrecision]], N[(x / y), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -4.8e175 or 1.9999999999999999e87 < 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.7%

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

      2. add-sqr-sqrt 54.2%

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

      3. fabs-sqr 54.2%

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

      4. add-sqr-sqrt 54.6%

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

      5. *-commutative 54.6%

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

      6. add-sqr-sqrt 23.5%

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

      7. fabs-sqr 23.5%

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

      8. add-sqr-sqrt 44.4%

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

   4. Applied egg-rr 44.4%

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

   5. Taylor expanded in x around inf 44.5%

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

   6. Taylor expanded in y around 0 44.6%

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

   if -4.8e175 < x < 1.9999999999999999e87

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

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

   8. Applied egg-rr 67.9%

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

4. Final simplification 60.9%

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

Alternative 4: 58.0% accurate, 15.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.2 \cdot 10^{+191} \lor \neg \left(x \leq 2.5 \cdot 10^{+166}\right):\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -9.2e+191) (not (<= x 2.5e+166))) (* x x) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -9.2e+191) || !(x <= 2.5e+166)) {
		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 <= (-9.2d+191)) .or. (.not. (x <= 2.5d+166))) 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 <= -9.2e+191) || !(x <= 2.5e+166)) {
		tmp = x * x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -9.2e+191) or not (x <= 2.5e+166):
		tmp = x * x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -9.2e+191) || !(x <= 2.5e+166))
		tmp = Float64(x * x);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -9.2e+191) || ~((x <= 2.5e+166)))
		tmp = x * x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -9.2e+191], N[Not[LessEqual[x, 2.5e+166]], $MachinePrecision]], N[(x * x), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -9.1999999999999997e191 or 2.5000000000000001e166 < 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 56.7%

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

      2. *-un-lft-identity 56.7%

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

      3. log-prod 56.7%

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

      4. metadata-eval 56.7%

         \[\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 43.9%

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

      7. fabs-sqr 43.9%

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

      8. add-sqr-sqrt 15.8%

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

      9. fabs-sqr 15.8%

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

      10. add-sqr-sqrt 16.0%

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

      11. add-sqr-sqrt 42.3%

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

   4. Applied egg-rr 42.3%

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

   5. Taylor expanded in x around inf 41.8%

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

   7. Applied egg-rr 43.1%

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

   if -9.1999999999999997e191 < x < 2.5000000000000001e166

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

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

   8. Applied egg-rr 61.2%

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

4. Final simplification 57.6%

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

Alternative 5: 52.4% 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.2%

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

8. Applied egg-rr 52.2%

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

Alternative 6: 12.1% accurate, 205.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 0.5)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 0.5

Julia

function code(x, y)
	return 0.5
end

MATLAB

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

Wolfram

code[x_, y_] := 0.5

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. Step-by-step derivation

   1. add-sqr-sqrt 20.2%

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

   2. fabs-sqr 20.2%

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

   3. add-sqr-sqrt 21.3%

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

   4. metadata-eval 21.3%

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

   5. sub-neg 21.3%

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

   6. *-inverses 21.3%

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

   7. div-sub 21.3%

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

7. Applied egg-rr 21.3%

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

9. Applied egg-rr 5.1%

   \[\leadsto \color{blue}{\frac{x}{x + \left(-1 + x\right)} - \frac{-1}{x + \left(-1 + x\right)}} \]
10. Step-by-step derivation

    1. +-commutative 5.1%

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

    2. +-commutative 5.1%

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

11. Simplified 5.1%

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

12. Taylor expanded in x around inf 12.2%

    \[\leadsto \color{blue}{0.5} \]
13. Add Preprocessing

Reproduce

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