Numeric.Log:$clog1p from log-domain-0.10.2.1, B

Percentage Accurate: 99.7% → 99.7%

Time: 4.4s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x}{1 + \sqrt{x + 1}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x (+ 1.0 (sqrt (+ x 1.0)))))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return Float64(x / Float64(1.0 + sqrt(Float64(x + 1.0))))
end

MATLAB

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

Wolfram

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

Initial Program: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{1 + \sqrt{x + 1}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x (+ 1.0 (sqrt (+ x 1.0)))))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return Float64(x / Float64(1.0 + sqrt(Float64(x + 1.0))))
end

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{1 + \sqrt{x + 1}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x (+ 1.0 (sqrt (+ x 1.0)))))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return Float64(x / Float64(1.0 + sqrt(Float64(x + 1.0))))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\frac{x}{1 + \sqrt{x + 1}} \]

2. Final simplification 99.7%

   \[\leadsto \frac{x}{1 + \sqrt{x + 1}} \]

Alternative 2: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.1 \cdot 10^{-5}:\\ \;\;\;\;\frac{x}{x \cdot 0.5 + 2}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x + 1} + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.1e-5) (/ x (+ (* x 0.5) 2.0)) (+ (sqrt (+ x 1.0)) -1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 1.1e-5) {
		tmp = x / ((x * 0.5) + 2.0);
	} else {
		tmp = sqrt((x + 1.0)) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.1d-5) then
        tmp = x / ((x * 0.5d0) + 2.0d0)
    else
        tmp = sqrt((x + 1.0d0)) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.1e-5) {
		tmp = x / ((x * 0.5) + 2.0);
	} else {
		tmp = Math.sqrt((x + 1.0)) + -1.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.1e-5:
		tmp = x / ((x * 0.5) + 2.0)
	else:
		tmp = math.sqrt((x + 1.0)) + -1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.1e-5)
		tmp = Float64(x / Float64(Float64(x * 0.5) + 2.0));
	else
		tmp = Float64(sqrt(Float64(x + 1.0)) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.1e-5)
		tmp = x / ((x * 0.5) + 2.0);
	else
		tmp = sqrt((x + 1.0)) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.1e-5], N[(x / N[(N[(x * 0.5), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.1e-5

   1. Initial program 100.0%

      \[\frac{x}{1 + \sqrt{x + 1}} \]

   2. Taylor expanded in x around 0 99.6%

      \[\leadsto \frac{x}{\color{blue}{2 + 0.5 \cdot x}} \]
   3. Step-by-step derivation

      1. +-commutative 99.6%

         \[\leadsto \frac{x}{\color{blue}{0.5 \cdot x + 2}} \]

   4. Simplified 99.6%

      \[\leadsto \frac{x}{\color{blue}{0.5 \cdot x + 2}} \]

   if 1.1e-5 < x

   1. Initial program 99.2%

      \[\frac{x}{1 + \sqrt{x + 1}} \]
   2. Step-by-step derivation

      1. flip-+ 99.0%

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

      2. metadata-eval 99.0%

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

      3. add-sqr-sqrt 99.7%

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

      4. +-commutative 99.7%

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

      5. associate--r+ 99.7%

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

      6. metadata-eval 99.7%

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

      7. neg-sub0 99.7%

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

      8. associate-/r/ 99.7%

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

   3. Applied egg-rr 99.7%

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

      1. remove-double-neg 99.7%

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

      2. distribute-frac-neg 99.7%

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

      3. *-inverses 99.7%

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

      4. metadata-eval 99.7%

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

      5. neg-mul-1 99.7%

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

      6. neg-sub0 99.7%

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

      7. associate--r- 99.7%

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

      8. metadata-eval 99.7%

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

   5. Simplified 99.7%

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

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.1 \cdot 10^{-5}:\\ \;\;\;\;\frac{x}{x \cdot 0.5 + 2}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x + 1} + -1\\ \end{array} \]

Alternative 3: 67.7% accurate, 15.3× speedup

Math

\[\begin{array}{l} \\ \frac{1}{0.5 + \frac{2}{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ 0.5 (/ 2.0 x))))

C

double code(double x) {
	return 1.0 / (0.5 + (2.0 / x));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 / (0.5 + (2.0 / x));
}

Python

def code(x):
	return 1.0 / (0.5 + (2.0 / x))

Julia

function code(x)
	return Float64(1.0 / Float64(0.5 + Float64(2.0 / x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (0.5 + (2.0 / x));
end

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\frac{x}{1 + \sqrt{x + 1}} \]
2. Step-by-step derivation

   1. clear-num 99.5%

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

   2. inv-pow 99.5%

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

   3. metadata-eval 99.5%

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

   4. pow-to-exp 63.4%

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

   5. diff-log 63.1%

      \[\leadsto e^{\color{blue}{\left(\log \left(1 + \sqrt{x + 1}\right) - \log x\right)} \cdot \left(-1\right)} \]

   6. log1p-udef 63.1%

      \[\leadsto e^{\left(\color{blue}{\mathsf{log1p}\left(\sqrt{x + 1}\right)} - \log x\right) \cdot \left(-1\right)} \]

   7. metadata-eval 63.1%

      \[\leadsto e^{\left(\mathsf{log1p}\left(\sqrt{x + 1}\right) - \log x\right) \cdot \color{blue}{-1}} \]

3. Applied egg-rr 63.1%

   \[\leadsto \color{blue}{e^{\left(\mathsf{log1p}\left(\sqrt{x + 1}\right) - \log x\right) \cdot -1}} \]
4. Step-by-step derivation

   1. exp-prod 63.1%

      \[\leadsto \color{blue}{{\left(e^{\mathsf{log1p}\left(\sqrt{x + 1}\right) - \log x}\right)}^{-1}} \]

   2. unpow-1 63.1%

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

   3. exp-diff 63.3%

      \[\leadsto \frac{1}{\color{blue}{\frac{e^{\mathsf{log1p}\left(\sqrt{x + 1}\right)}}{e^{\log x}}}} \]

   4. rem-exp-log 97.5%

      \[\leadsto \frac{1}{\frac{e^{\mathsf{log1p}\left(\sqrt{x + 1}\right)}}{\color{blue}{x}}} \]

5. Simplified 97.5%

   \[\leadsto \color{blue}{\frac{1}{\frac{e^{\mathsf{log1p}\left(\sqrt{x + 1}\right)}}{x}}} \]

6. Taylor expanded in x around 0 69.4%

   \[\leadsto \frac{1}{\color{blue}{0.5 + 2 \cdot \frac{1}{x}}} \]
7. Step-by-step derivation

   1. associate-*r/ 69.4%

      \[\leadsto \frac{1}{0.5 + \color{blue}{\frac{2 \cdot 1}{x}}} \]

   2. metadata-eval 69.4%

      \[\leadsto \frac{1}{0.5 + \frac{\color{blue}{2}}{x}} \]

8. Simplified 69.4%

   \[\leadsto \frac{1}{\color{blue}{0.5 + \frac{2}{x}}} \]

9. Final simplification 69.4%

   \[\leadsto \frac{1}{0.5 + \frac{2}{x}} \]

Alternative 4: 67.9% accurate, 15.3× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x \cdot 0.5 + 2} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x (+ (* x 0.5) 2.0)))

C

double code(double x) {
	return x / ((x * 0.5) + 2.0);
}

Fortran

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

Java

public static double code(double x) {
	return x / ((x * 0.5) + 2.0);
}

Python

def code(x):
	return x / ((x * 0.5) + 2.0)

Julia

function code(x)
	return Float64(x / Float64(Float64(x * 0.5) + 2.0))
end

MATLAB

function tmp = code(x)
	tmp = x / ((x * 0.5) + 2.0);
end

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\frac{x}{1 + \sqrt{x + 1}} \]

2. Taylor expanded in x around 0 69.6%

   \[\leadsto \frac{x}{\color{blue}{2 + 0.5 \cdot x}} \]
3. Step-by-step derivation

   1. +-commutative 69.6%

      \[\leadsto \frac{x}{\color{blue}{0.5 \cdot x + 2}} \]

4. Simplified 69.6%

   \[\leadsto \frac{x}{\color{blue}{0.5 \cdot x + 2}} \]

5. Final simplification 69.6%

   \[\leadsto \frac{x}{x \cdot 0.5 + 2} \]

Alternative 5: 67.3% accurate, 35.7× speedup

Math

\[\begin{array}{l} \\ \frac{x}{2} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ x 2.0))

C

double code(double x) {
	return x / 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x / 2.0d0
end function

Java

public static double code(double x) {
	return x / 2.0;
}

Python

def code(x):
	return x / 2.0

Julia

function code(x)
	return Float64(x / 2.0)
end

MATLAB

function tmp = code(x)
	tmp = x / 2.0;
end

Wolfram

code[x_] := N[(x / 2.0), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\frac{x}{1 + \sqrt{x + 1}} \]

2. Taylor expanded in x around 0 68.9%

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

3. Final simplification 68.9%

   \[\leadsto \frac{x}{2} \]

Alternative 6: 4.9% accurate, 107.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 2.0)

C

double code(double x) {
	return 2.0;
}

Fortran

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

Java

public static double code(double x) {
	return 2.0;
}

Python

def code(x):
	return 2.0

Julia

function code(x)
	return 2.0
end

MATLAB

function tmp = code(x)
	tmp = 2.0;
end

Wolfram

code[x_] := 2.0

Derivation

1. Initial program 99.7%

   \[\frac{x}{1 + \sqrt{x + 1}} \]

2. Taylor expanded in x around 0 69.6%

   \[\leadsto \frac{x}{\color{blue}{2 + 0.5 \cdot x}} \]
3. Step-by-step derivation

   1. +-commutative 69.6%

      \[\leadsto \frac{x}{\color{blue}{0.5 \cdot x + 2}} \]

4. Simplified 69.6%

   \[\leadsto \frac{x}{\color{blue}{0.5 \cdot x + 2}} \]

5. Taylor expanded in x around inf 5.0%

   \[\leadsto \color{blue}{2} \]

6. Final simplification 5.0%

   \[\leadsto 2 \]

Reproduce

herbie shell --seed 2023309 
(FPCore (x)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, B"
  :precision binary64
  (/ x (+ 1.0 (sqrt (+ x 1.0)))))