logq (problem 3.4.3)

Percentage Accurate: 8.5% → 100.0%

Time: 8.1s

Alternatives: 5

Speedup: 15.3×

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

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

   1. *-un-lft-identity 9.2%

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

   2. *-commutative 9.2%

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

   3. log-prod 9.2%

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

   4. log-div 9.2%

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

   5. sub-neg 9.2%

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

   6. log1p-define 21.7%

      \[\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.6% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot -0.2 - 0.25\right) - 0.3333333333333333\right) - 0.5\right) + -1\right) + \varepsilon \cdot \left(-1 + \varepsilon \cdot \left(0.5 - \varepsilon \cdot \left(0.3333333333333333 + \varepsilon \cdot \left(\varepsilon \cdot 0.2 - 0.25\right)\right)\right)\right) \end{array} \]

FPCore

(FPCore (eps)
 :precision binary64
 (+
  (*
   eps
   (+
    (*
     eps
     (- (* eps (- (* eps (- (* eps -0.2) 0.25)) 0.3333333333333333)) 0.5))
    -1.0))
  (*
   eps
   (+
    -1.0
    (*
     eps
     (- 0.5 (* eps (+ 0.3333333333333333 (* eps (- (* eps 0.2) 0.25))))))))))

C

double code(double eps) {
	return (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * ((eps * 0.2) - 0.25))))))));
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = (eps * ((eps * ((eps * ((eps * ((eps * (-0.2d0)) - 0.25d0)) - 0.3333333333333333d0)) - 0.5d0)) + (-1.0d0))) + (eps * ((-1.0d0) + (eps * (0.5d0 - (eps * (0.3333333333333333d0 + (eps * ((eps * 0.2d0) - 0.25d0))))))))
end function

Java

public static double code(double eps) {
	return (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * ((eps * 0.2) - 0.25))))))));
}

Python

def code(eps):
	return (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * ((eps * 0.2) - 0.25))))))))

Julia

function code(eps)
	return Float64(Float64(eps * Float64(Float64(eps * Float64(Float64(eps * Float64(Float64(eps * Float64(Float64(eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + Float64(eps * Float64(-1.0 + Float64(eps * Float64(0.5 - Float64(eps * Float64(0.3333333333333333 + Float64(eps * Float64(Float64(eps * 0.2) - 0.25)))))))))
end

MATLAB

function tmp = code(eps)
	tmp = (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * ((eps * 0.2) - 0.25))))))));
end

Wolfram

code[eps_] := N[(N[(eps * N[(N[(eps * N[(N[(eps * N[(N[(eps * N[(N[(eps * -0.2), $MachinePrecision] - 0.25), $MachinePrecision]), $MachinePrecision] - 0.3333333333333333), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] + N[(eps * N[(-1.0 + N[(eps * N[(0.5 - N[(eps * N[(0.3333333333333333 + N[(eps * N[(N[(eps * 0.2), $MachinePrecision] - 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 9.2%

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

   1. *-un-lft-identity 9.2%

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

   2. *-commutative 9.2%

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

   3. log-prod 9.2%

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

   4. log-div 9.2%

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

   5. sub-neg 9.2%

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

   6. log1p-define 21.7%

      \[\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. Taylor expanded in eps around 0 99.4%

   \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(-0.2 \cdot \varepsilon - 0.25\right) - 0.3333333333333333\right) - 0.5\right) - 1\right)} - \mathsf{log1p}\left(\varepsilon\right) \]

8. Taylor expanded in eps around 0 99.4%

   \[\leadsto \varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(-0.2 \cdot \varepsilon - 0.25\right) - 0.3333333333333333\right) - 0.5\right) - 1\right) - \color{blue}{\varepsilon \cdot \left(1 + \varepsilon \cdot \left(\varepsilon \cdot \left(0.3333333333333333 + \varepsilon \cdot \left(0.2 \cdot \varepsilon - 0.25\right)\right) - 0.5\right)\right)} \]

9. Final simplification 99.4%

   \[\leadsto \varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot -0.2 - 0.25\right) - 0.3333333333333333\right) - 0.5\right) + -1\right) + \varepsilon \cdot \left(-1 + \varepsilon \cdot \left(0.5 - \varepsilon \cdot \left(0.3333333333333333 + \varepsilon \cdot \left(\varepsilon \cdot 0.2 - 0.25\right)\right)\right)\right) \]
10. Add Preprocessing

Alternative 3: 99.5% accurate, 3.1× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot -0.2 - 0.25\right) - 0.3333333333333333\right) - 0.5\right) + -1\right) + \varepsilon \cdot \left(-1 + \varepsilon \cdot \left(0.5 - \varepsilon \cdot \left(0.3333333333333333 + \varepsilon \cdot -0.25\right)\right)\right) \end{array} \]

FPCore

(FPCore (eps)
 :precision binary64
 (+
  (*
   eps
   (+
    (*
     eps
     (- (* eps (- (* eps (- (* eps -0.2) 0.25)) 0.3333333333333333)) 0.5))
    -1.0))
  (*
   eps
   (+ -1.0 (* eps (- 0.5 (* eps (+ 0.3333333333333333 (* eps -0.25)))))))))

C

double code(double eps) {
	return (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * -0.25)))))));
}

Fortran

real(8) function code(eps)
    real(8), intent (in) :: eps
    code = (eps * ((eps * ((eps * ((eps * ((eps * (-0.2d0)) - 0.25d0)) - 0.3333333333333333d0)) - 0.5d0)) + (-1.0d0))) + (eps * ((-1.0d0) + (eps * (0.5d0 - (eps * (0.3333333333333333d0 + (eps * (-0.25d0))))))))
end function

Java

public static double code(double eps) {
	return (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * -0.25)))))));
}

Python

def code(eps):
	return (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * -0.25)))))))

Julia

function code(eps)
	return Float64(Float64(eps * Float64(Float64(eps * Float64(Float64(eps * Float64(Float64(eps * Float64(Float64(eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + Float64(eps * Float64(-1.0 + Float64(eps * Float64(0.5 - Float64(eps * Float64(0.3333333333333333 + Float64(eps * -0.25))))))))
end

MATLAB

function tmp = code(eps)
	tmp = (eps * ((eps * ((eps * ((eps * ((eps * -0.2) - 0.25)) - 0.3333333333333333)) - 0.5)) + -1.0)) + (eps * (-1.0 + (eps * (0.5 - (eps * (0.3333333333333333 + (eps * -0.25)))))));
end

Wolfram

code[eps_] := N[(N[(eps * N[(N[(eps * N[(N[(eps * N[(N[(eps * N[(N[(eps * -0.2), $MachinePrecision] - 0.25), $MachinePrecision]), $MachinePrecision] - 0.3333333333333333), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] + N[(eps * N[(-1.0 + N[(eps * N[(0.5 - N[(eps * N[(0.3333333333333333 + N[(eps * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 9.2%

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

   1. *-un-lft-identity 9.2%

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

   2. *-commutative 9.2%

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

   3. log-prod 9.2%

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

   4. log-div 9.2%

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

   5. sub-neg 9.2%

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

   6. log1p-define 21.7%

      \[\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. Taylor expanded in eps around 0 99.4%

   \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(-0.2 \cdot \varepsilon - 0.25\right) - 0.3333333333333333\right) - 0.5\right) - 1\right)} - \mathsf{log1p}\left(\varepsilon\right) \]

8. Taylor expanded in eps around 0 99.2%

   \[\leadsto \varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(-0.2 \cdot \varepsilon - 0.25\right) - 0.3333333333333333\right) - 0.5\right) - 1\right) - \color{blue}{\varepsilon \cdot \left(1 + \varepsilon \cdot \left(\varepsilon \cdot \left(0.3333333333333333 + -0.25 \cdot \varepsilon\right) - 0.5\right)\right)} \]

9. Final simplification 99.2%

   \[\leadsto \varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot \left(\varepsilon \cdot -0.2 - 0.25\right) - 0.3333333333333333\right) - 0.5\right) + -1\right) + \varepsilon \cdot \left(-1 + \varepsilon \cdot \left(0.5 - \varepsilon \cdot \left(0.3333333333333333 + \varepsilon \cdot -0.25\right)\right)\right) \]
10. Add Preprocessing

Alternative 4: 99.5% accurate, 11.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(eps):
	return eps * ((-0.6666666666666666 * (eps * eps)) - 2.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 9.2%

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

3. Taylor expanded in eps around 0 99.2%

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

   1. unpow2 99.2%

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

5. Applied egg-rr 99.2%

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

Alternative 5: 97.8% accurate, 15.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(eps):
	return eps * ((eps * -2.0) - 2.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 9.2%

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

3. Taylor expanded in eps around 0 7.3%

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

   1. *-commutative 7.3%

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

5. Simplified 7.3%

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

6. Taylor expanded in eps around 0 97.3%

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

7. Final simplification 97.3%

   \[\leadsto \varepsilon \cdot \left(\varepsilon \cdot -2 - 2\right) \]
8. Add Preprocessing

Developer Target 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]

Reproduce

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

  :alt
  (! :herbie-platform default (- (log1p (- eps)) (log1p eps)))

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