qlog (example 3.10)

Average Error: 61.5 → 0.4

Time: 8.5s

Precision: binary64

Cost: 6976

\[-1 < x \land x < 1\]

Math

\[\frac{\log \left(1 - x\right)}{\log \left(1 + x\right)} \]

↓

\[\left(-0.5 \cdot {x}^{2} + \left(-x\right)\right) + -1 \]

FPCore

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

↓

(FPCore (x) :precision binary64 (+ (+ (* -0.5 (pow x 2.0)) (- x)) -1.0))

C

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

↓

double code(double x) {
	return ((-0.5 * pow(x, 2.0)) + -x) + -1.0;
}

Fortran

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

↓

real(8) function code(x)
    real(8), intent (in) :: x
    code = (((-0.5d0) * (x ** 2.0d0)) + -x) + (-1.0d0)
end function

Java

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

↓

public static double code(double x) {
	return ((-0.5 * Math.pow(x, 2.0)) + -x) + -1.0;
}

Python

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

↓

def code(x):
	return ((-0.5 * math.pow(x, 2.0)) + -x) + -1.0

Julia

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

↓

function code(x)
	return Float64(Float64(Float64(-0.5 * (x ^ 2.0)) + Float64(-x)) + -1.0)
end

MATLAB

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

↓

function tmp = code(x)
	tmp = ((-0.5 * (x ^ 2.0)) + -x) + -1.0;
end

Wolfram

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

↓

code[x_] := N[(N[(N[(-0.5 * N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision] + (-x)), $MachinePrecision] + -1.0), $MachinePrecision]

Target

Original	61.5
Target	0.3
Herbie	0.4

\[-\left(\left(\left(1 + x\right) + \frac{x \cdot x}{2}\right) + 0.4166666666666667 \cdot {x}^{3}\right) \]

Derivation

1. Initial program 61.5

   \[\frac{\log \left(1 - x\right)}{\log \left(1 + x\right)} \]

2. Taylor expanded in x around 0 0.4

   \[\leadsto \color{blue}{\left(-0.5 \cdot {x}^{2} + -1 \cdot x\right) - 1} \]

3. Simplified 0.4

   \[\leadsto \color{blue}{\left(-0.5 \cdot {x}^{2} + \left(-x\right)\right) + -1} \]
   Proof

   [Start] 0.4	\[ \left(-0.5 \cdot {x}^{2} + -1 \cdot x\right) - 1 \]
   rational_best-simplify-19 [=>] 0.4	\[ \color{blue}{\left(-0.5 \cdot {x}^{2} + -1 \cdot x\right) + -1} \]
   rational_best-simplify-10 [=>] 0.4	\[ \left(-0.5 \cdot {x}^{2} + \color{blue}{\left(-x\right)}\right) + -1 \]

4. Final simplification 0.4

   \[\leadsto \left(-0.5 \cdot {x}^{2} + \left(-x\right)\right) + -1 \]

Alternatives

Alternative 1
Error	0.6
Cost	256

\[\left(-x\right) + -1 \]

Alternative 2
Error	1.3
Cost	64

\[-1 \]

Reproduce

herbie shell --seed 2023097 
(FPCore (x)
  :name "qlog (example 3.10)"
  :precision binary64
  :pre (and (< -1.0 x) (< x 1.0))

  :herbie-target
  (- (+ (+ (+ 1.0 x) (/ (* x x) 2.0)) (* 0.4166666666666667 (pow x 3.0))))

  (/ (log (- 1.0 x)) (log (+ 1.0 x))))