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

Percentage Accurate: 99.7% → 99.7%

Time: 5.7s

Alternatives: 7

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.8%

   \[\frac{x}{1 + \sqrt{x + 1}} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 3:\\ \;\;\;\;\frac{x}{2 + x \cdot \left(0.5 + x \cdot \left(x \cdot 0.0625 - 0.125\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x} + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 3.0)
   (/ x (+ 2.0 (* x (+ 0.5 (* x (- (* x 0.0625) 0.125))))))
   (+ (sqrt x) -1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 3.0) {
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))));
	} else {
		tmp = sqrt(x) + -1.0;
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x):
	tmp = 0
	if x <= 3.0:
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))))
	else:
		tmp = math.sqrt(x) + -1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 3.0)
		tmp = Float64(x / Float64(2.0 + Float64(x * Float64(0.5 + Float64(x * Float64(Float64(x * 0.0625) - 0.125))))));
	else
		tmp = Float64(sqrt(x) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 3.0)
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))));
	else
		tmp = sqrt(x) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 3.0], N[(x / N[(2.0 + N[(x * N[(0.5 + N[(x * N[(N[(x * 0.0625), $MachinePrecision] - 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[x], $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3

   1. Initial program 100.0%

      \[\frac{x}{1 + \sqrt{x + 1}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.6%

      \[\leadsto \frac{x}{\color{blue}{2 + x \cdot \left(0.5 + x \cdot \left(0.0625 \cdot x - 0.125\right)\right)}} \]

   if 3 < x

   1. Initial program 99.3%

      \[\frac{x}{1 + \sqrt{x + 1}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

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

4. Final simplification 99.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 3:\\ \;\;\;\;\frac{x}{2 + x \cdot \left(0.5 + x \cdot \left(x \cdot 0.0625 - 0.125\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x} + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 3.7:\\ \;\;\;\;\frac{x}{2 + x \cdot \left(0.5 + x \cdot \left(x \cdot 0.0625 - 0.125\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 3.7)
   (/ x (+ 2.0 (* x (+ 0.5 (* x (- (* x 0.0625) 0.125))))))
   (sqrt x)))

C

double code(double x) {
	double tmp;
	if (x <= 3.7) {
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))));
	} else {
		tmp = sqrt(x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 3.7d0) then
        tmp = x / (2.0d0 + (x * (0.5d0 + (x * ((x * 0.0625d0) - 0.125d0)))))
    else
        tmp = sqrt(x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 3.7) {
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))));
	} else {
		tmp = Math.sqrt(x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 3.7:
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))))
	else:
		tmp = math.sqrt(x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 3.7)
		tmp = Float64(x / Float64(2.0 + Float64(x * Float64(0.5 + Float64(x * Float64(Float64(x * 0.0625) - 0.125))))));
	else
		tmp = sqrt(x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 3.7)
		tmp = x / (2.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125)))));
	else
		tmp = sqrt(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 3.7], N[(x / N[(2.0 + N[(x * N[(0.5 + N[(x * N[(N[(x * 0.0625), $MachinePrecision] - 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[x], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3.7000000000000002

   1. Initial program 100.0%

      \[\frac{x}{1 + \sqrt{x + 1}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.6%

      \[\leadsto \frac{x}{\color{blue}{2 + x \cdot \left(0.5 + x \cdot \left(0.0625 \cdot x - 0.125\right)\right)}} \]

   if 3.7000000000000002 < x

   1. Initial program 99.3%

      \[\frac{x}{1 + \sqrt{x + 1}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.0%

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

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 3.7:\\ \;\;\;\;\frac{x}{2 + x \cdot \left(0.5 + x \cdot \left(x \cdot 0.0625 - 0.125\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.7% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \frac{x}{1 + \left(1 + x \cdot 0.5\right)} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\frac{x}{1 + \sqrt{x + 1}} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 72.5%

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

   1. +-commutative 72.5%

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

5. Simplified 72.5%

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

6. Final simplification 72.5%

   \[\leadsto \frac{x}{1 + \left(1 + x \cdot 0.5\right)} \]
7. Add Preprocessing

Alternative 5: 67.7% accurate, 15.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\frac{x}{1 + \sqrt{x + 1}} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 72.5%

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

   1. +-commutative 72.5%

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

5. Simplified 72.5%

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

6. Final simplification 72.5%

   \[\leadsto \frac{x}{2 + x \cdot 0.5} \]
7. Add Preprocessing

Alternative 6: 67.0% 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.8%

   \[\frac{x}{1 + \sqrt{x + 1}} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 71.6%

   \[\leadsto \frac{x}{\color{blue}{2}} \]
4. Add Preprocessing

Alternative 7: 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.8%

   \[\frac{x}{1 + \sqrt{x + 1}} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 72.5%

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

   1. +-commutative 72.5%

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

5. Simplified 72.5%

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

6. Taylor expanded in x around inf 4.6%

   \[\leadsto \color{blue}{2} \]
7. Add Preprocessing

Reproduce

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