logq (problem 3.4.3)

Percentage Accurate: 8.4% → 100.0%

Time: 8.0s

Alternatives: 4

Speedup: 35.7×

Specification

\[\left|\varepsilon\right| < 1\]

Math

\[\begin{array}{l} \\ \log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right) \end{array} \]

FPCore

(FPCore (eps) :precision binary64 (log (/ (- 1.0 eps) (+ 1.0 eps))))

C

double code(double eps) {
	return log(((1.0 - eps) / (1.0 + eps)));
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = log(((1.0d0 - eps) / (1.0d0 + eps)))
end function

Java

public static double code(double eps) {
	return Math.log(((1.0 - eps) / (1.0 + eps)));
}

Python

def code(eps):
	return math.log(((1.0 - eps) / (1.0 + eps)))

Julia

function code(eps)
	return log(Float64(Float64(1.0 - eps) / Float64(1.0 + eps)))
end

MATLAB

function tmp = code(eps)
	tmp = log(((1.0 - eps) / (1.0 + eps)));
end

Wolfram

code[eps_] := N[Log[N[(N[(1.0 - eps), $MachinePrecision] / N[(1.0 + eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Initial Program: 8.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right) \end{array} \]

FPCore

(FPCore (eps) :precision binary64 (log (/ (- 1.0 eps) (+ 1.0 eps))))

C

double code(double eps) {
	return log(((1.0 - eps) / (1.0 + eps)));
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = log(((1.0d0 - eps) / (1.0d0 + eps)))
end function

Java

public static double code(double eps) {
	return Math.log(((1.0 - eps) / (1.0 + eps)));
}

Python

def code(eps):
	return math.log(((1.0 - eps) / (1.0 + eps)))

Julia

function code(eps)
	return log(Float64(Float64(1.0 - eps) / Float64(1.0 + eps)))
end

MATLAB

function tmp = code(eps)
	tmp = log(((1.0 - eps) / (1.0 + eps)));
end

Wolfram

code[eps_] := N[Log[N[(N[(1.0 - eps), $MachinePrecision] / N[(1.0 + eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \mathsf{log1p}\left(-\varepsilon\right) - \mathsf{log1p}\left(\varepsilon\right) \end{array} \]

FPCore

(FPCore (eps) :precision binary64 (- (log1p (- eps)) (log1p eps)))

C

double code(double eps) {
	return log1p(-eps) - log1p(eps);
}

Java

public static double code(double eps) {
	return Math.log1p(-eps) - Math.log1p(eps);
}

Python

def code(eps):
	return math.log1p(-eps) - math.log1p(eps)

Julia

function code(eps)
	return Float64(log1p(Float64(-eps)) - log1p(eps))
end

Wolfram

code[eps_] := N[(N[Log[1 + (-eps)], $MachinePrecision] - N[Log[1 + eps], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 9.1%

   \[\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. *-un-lft-identity 9.1%

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

   2. *-commutative 9.1%

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

   3. log-prod 9.1%

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

   4. log-div 9.1%

      \[\leadsto \color{blue}{\left(\log \left(1 - \varepsilon\right) - \log \left(1 + \varepsilon\right)\right)} + \log 1 \]

   5. sub-neg 9.1%

      \[\leadsto \left(\log \color{blue}{\left(1 + \left(-\varepsilon\right)\right)} - \log \left(1 + \varepsilon\right)\right) + \log 1 \]

   6. log1p-define 21.5%

      \[\leadsto \left(\color{blue}{\mathsf{log1p}\left(-\varepsilon\right)} - \log \left(1 + \varepsilon\right)\right) + \log 1 \]

   7. log1p-define 100.0%

      \[\leadsto \left(\mathsf{log1p}\left(-\varepsilon\right) - \color{blue}{\mathsf{log1p}\left(\varepsilon\right)}\right) + \log 1 \]

   8. metadata-eval 100.0%

      \[\leadsto \left(\mathsf{log1p}\left(-\varepsilon\right) - \mathsf{log1p}\left(\varepsilon\right)\right) + \color{blue}{0} \]

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\left(\mathsf{log1p}\left(-\varepsilon\right) - \mathsf{log1p}\left(\varepsilon\right)\right) + 0} \]
5. Step-by-step derivation

   1. +-rgt-identity 100.0%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(-\varepsilon\right) - \mathsf{log1p}\left(\varepsilon\right)} \]

6. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(-\varepsilon\right) - \mathsf{log1p}\left(\varepsilon\right)} \]
7. Add Preprocessing

Alternative 2: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ -0.6666666666666666 \cdot {\varepsilon}^{3} + \varepsilon \cdot -2 \end{array} \]

FPCore

(FPCore (eps)
 :precision binary64
 (+ (* -0.6666666666666666 (pow eps 3.0)) (* eps -2.0)))

C

double code(double eps) {
	return (-0.6666666666666666 * pow(eps, 3.0)) + (eps * -2.0);
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = ((-0.6666666666666666d0) * (eps ** 3.0d0)) + (eps * (-2.0d0))
end function

Java

public static double code(double eps) {
	return (-0.6666666666666666 * Math.pow(eps, 3.0)) + (eps * -2.0);
}

Python

def code(eps):
	return (-0.6666666666666666 * math.pow(eps, 3.0)) + (eps * -2.0)

Julia

function code(eps)
	return Float64(Float64(-0.6666666666666666 * (eps ^ 3.0)) + Float64(eps * -2.0))
end

MATLAB

function tmp = code(eps)
	tmp = (-0.6666666666666666 * (eps ^ 3.0)) + (eps * -2.0);
end

Wolfram

code[eps_] := N[(N[(-0.6666666666666666 * N[Power[eps, 3.0], $MachinePrecision]), $MachinePrecision] + N[(eps * -2.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 9.1%

   \[\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right) \]
2. Add Preprocessing

3. Taylor expanded in eps around 0 99.0%

   \[\leadsto \color{blue}{\varepsilon \cdot \left(-0.6666666666666666 \cdot {\varepsilon}^{2} - 2\right)} \]
4. Step-by-step derivation

   1. sub-neg 99.0%

      \[\leadsto \varepsilon \cdot \color{blue}{\left(-0.6666666666666666 \cdot {\varepsilon}^{2} + \left(-2\right)\right)} \]

   2. distribute-rgt-in 99.0%

      \[\leadsto \color{blue}{\left(-0.6666666666666666 \cdot {\varepsilon}^{2}\right) \cdot \varepsilon + \left(-2\right) \cdot \varepsilon} \]

   3. metadata-eval 99.0%

      \[\leadsto \left(-0.6666666666666666 \cdot {\varepsilon}^{2}\right) \cdot \varepsilon + \color{blue}{-2} \cdot \varepsilon \]

5. Applied egg-rr 99.0%

   \[\leadsto \color{blue}{\left(-0.6666666666666666 \cdot {\varepsilon}^{2}\right) \cdot \varepsilon + -2 \cdot \varepsilon} \]

6. Taylor expanded in eps around 0 99.0%

   \[\leadsto \color{blue}{-0.6666666666666666 \cdot {\varepsilon}^{3}} + -2 \cdot \varepsilon \]

7. Final simplification 99.0%

   \[\leadsto -0.6666666666666666 \cdot {\varepsilon}^{3} + \varepsilon \cdot -2 \]
8. Add Preprocessing

Alternative 3: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(-0.6666666666666666 \cdot {\varepsilon}^{2} - 2\right) \end{array} \]

FPCore

(FPCore (eps)
 :precision binary64
 (* eps (- (* -0.6666666666666666 (pow eps 2.0)) 2.0)))

C

double code(double eps) {
	return eps * ((-0.6666666666666666 * pow(eps, 2.0)) - 2.0);
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = eps * (((-0.6666666666666666d0) * (eps ** 2.0d0)) - 2.0d0)
end function

Java

public static double code(double eps) {
	return eps * ((-0.6666666666666666 * Math.pow(eps, 2.0)) - 2.0);
}

Python

def code(eps):
	return eps * ((-0.6666666666666666 * math.pow(eps, 2.0)) - 2.0)

Julia

function code(eps)
	return Float64(eps * Float64(Float64(-0.6666666666666666 * (eps ^ 2.0)) - 2.0))
end

MATLAB

function tmp = code(eps)
	tmp = eps * ((-0.6666666666666666 * (eps ^ 2.0)) - 2.0);
end

Wolfram

code[eps_] := N[(eps * N[(N[(-0.6666666666666666 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 9.1%

   \[\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right) \]
2. Add Preprocessing

3. Taylor expanded in eps around 0 99.0%

   \[\leadsto \color{blue}{\varepsilon \cdot \left(-0.6666666666666666 \cdot {\varepsilon}^{2} - 2\right)} \]
4. Add Preprocessing

Alternative 4: 99.0% accurate, 35.7× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot -2 \end{array} \]

FPCore

(FPCore (eps) :precision binary64 (* eps -2.0))

C

double code(double eps) {
	return eps * -2.0;
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = eps * (-2.0d0)
end function

Java

public static double code(double eps) {
	return eps * -2.0;
}

Python

def code(eps):
	return eps * -2.0

Julia

function code(eps)
	return Float64(eps * -2.0)
end

MATLAB

function tmp = code(eps)
	tmp = eps * -2.0;
end

Wolfram

code[eps_] := N[(eps * -2.0), $MachinePrecision]

Derivation

1. Initial program 9.1%

   \[\log \left(\frac{1 - \varepsilon}{1 + \varepsilon}\right) \]
2. Add Preprocessing

3. Taylor expanded in eps around 0 98.6%

   \[\leadsto \color{blue}{-2 \cdot \varepsilon} \]

4. Final simplification 98.6%

   \[\leadsto \varepsilon \cdot -2 \]
5. Add Preprocessing

Developer target: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \mathsf{log1p}\left(-\varepsilon\right) - \mathsf{log1p}\left(\varepsilon\right) \end{array} \]

FPCore

(FPCore (eps) :precision binary64 (- (log1p (- eps)) (log1p eps)))

C

double code(double eps) {
	return log1p(-eps) - log1p(eps);
}

Java

public static double code(double eps) {
	return Math.log1p(-eps) - Math.log1p(eps);
}

Python

def code(eps):
	return math.log1p(-eps) - math.log1p(eps)

Julia

function code(eps)
	return Float64(log1p(Float64(-eps)) - log1p(eps))
end

Wolfram

code[eps_] := N[(N[Log[1 + (-eps)], $MachinePrecision] - N[Log[1 + eps], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024101 
(FPCore (eps)
  :name "logq (problem 3.4.3)"
  :precision binary64
  :pre (< (fabs eps) 1.0)

  :alt
  (- (log1p (- eps)) (log1p eps))

  (log (/ (- 1.0 eps) (+ 1.0 eps))))