Hyperbolic arcsine

Percentage Accurate: 17.8% → 99.8%

Time: 3.9s

Alternatives: 6

Speedup: 207.0×

Specification

Math

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

FPCore

(FPCore (x) :precision binary64 (log (+ x (sqrt (+ (* x x) 1.0)))))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return log(Float64(x + sqrt(Float64(Float64(x * x) + 1.0))))
end

MATLAB

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

Wolfram

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

Initial Program: 17.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (log (+ x (sqrt (+ (* x x) 1.0)))))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return log(Float64(x + sqrt(Float64(Float64(x * x) + 1.0))))
end

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -7 \cdot 10^{-6}:\\ \;\;\;\;\log \left(\frac{-1}{x - \mathsf{hypot}\left(1, x\right)}\right)\\ \mathbf{elif}\;x \leq 7.4 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -7e-6)
   (log (/ -1.0 (- x (hypot 1.0 x))))
   (if (<= x 7.4e-6) x (log (+ x (hypot 1.0 x))))))

C

double code(double x) {
	double tmp;
	if (x <= -7e-6) {
		tmp = log((-1.0 / (x - hypot(1.0, x))));
	} else if (x <= 7.4e-6) {
		tmp = x;
	} else {
		tmp = log((x + hypot(1.0, x)));
	}
	return tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (x <= -7e-6) {
		tmp = Math.log((-1.0 / (x - Math.hypot(1.0, x))));
	} else if (x <= 7.4e-6) {
		tmp = x;
	} else {
		tmp = Math.log((x + Math.hypot(1.0, x)));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -7e-6:
		tmp = math.log((-1.0 / (x - math.hypot(1.0, x))))
	elif x <= 7.4e-6:
		tmp = x
	else:
		tmp = math.log((x + math.hypot(1.0, x)))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -7e-6)
		tmp = log(Float64(-1.0 / Float64(x - hypot(1.0, x))));
	elseif (x <= 7.4e-6)
		tmp = x;
	else
		tmp = log(Float64(x + hypot(1.0, x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -7e-6)
		tmp = log((-1.0 / (x - hypot(1.0, x))));
	elseif (x <= 7.4e-6)
		tmp = x;
	else
		tmp = log((x + hypot(1.0, x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -7e-6], N[Log[N[(-1.0 / N[(x - N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 7.4e-6], x, N[Log[N[(x + N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.99999999999999989e-6

   1. Initial program 3.0%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 3.0%

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

      2. hypot-1-def 4.4%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 4.4%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]
   4. Step-by-step derivation

      1. flip-+ 3.3%

         \[\leadsto \log \color{blue}{\left(\frac{x \cdot x - \mathsf{hypot}\left(1, x\right) \cdot \mathsf{hypot}\left(1, x\right)}{x - \mathsf{hypot}\left(1, x\right)}\right)} \]

      2. div-sub 2.6%

         \[\leadsto \log \color{blue}{\left(\frac{x \cdot x}{x - \mathsf{hypot}\left(1, x\right)} - \frac{\mathsf{hypot}\left(1, x\right) \cdot \mathsf{hypot}\left(1, x\right)}{x - \mathsf{hypot}\left(1, x\right)}\right)} \]

      3. hypot-udef 2.6%

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

      4. hypot-udef 2.6%

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

      5. add-sqr-sqrt 2.6%

         \[\leadsto \log \left(\frac{x \cdot x}{x - \mathsf{hypot}\left(1, x\right)} - \frac{\color{blue}{1 \cdot 1 + x \cdot x}}{x - \mathsf{hypot}\left(1, x\right)}\right) \]

      6. metadata-eval 2.6%

         \[\leadsto \log \left(\frac{x \cdot x}{x - \mathsf{hypot}\left(1, x\right)} - \frac{\color{blue}{1} + x \cdot x}{x - \mathsf{hypot}\left(1, x\right)}\right) \]

   5. Applied egg-rr 2.6%

      \[\leadsto \log \color{blue}{\left(\frac{x \cdot x}{x - \mathsf{hypot}\left(1, x\right)} - \frac{1 + x \cdot x}{x - \mathsf{hypot}\left(1, x\right)}\right)} \]
   6. Step-by-step derivation

      1. div-sub 4.3%

         \[\leadsto \log \color{blue}{\left(\frac{x \cdot x - \left(1 + x \cdot x\right)}{x - \mathsf{hypot}\left(1, x\right)}\right)} \]

      2. +-commutative 4.3%

         \[\leadsto \log \left(\frac{x \cdot x - \color{blue}{\left(x \cdot x + 1\right)}}{x - \mathsf{hypot}\left(1, x\right)}\right) \]

      3. associate--r+ 42.4%

         \[\leadsto \log \left(\frac{\color{blue}{\left(x \cdot x - x \cdot x\right) - 1}}{x - \mathsf{hypot}\left(1, x\right)}\right) \]

      4. +-inverses 100.0%

         \[\leadsto \log \left(\frac{\color{blue}{0} - 1}{x - \mathsf{hypot}\left(1, x\right)}\right) \]

      5. metadata-eval 100.0%

         \[\leadsto \log \left(\frac{\color{blue}{-1}}{x - \mathsf{hypot}\left(1, x\right)}\right) \]

   7. Simplified 100.0%

      \[\leadsto \log \color{blue}{\left(\frac{-1}{x - \mathsf{hypot}\left(1, x\right)}\right)} \]

   if -6.99999999999999989e-6 < x < 7.4000000000000003e-6

   1. Initial program 6.3%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 6.3%

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

      2. hypot-1-def 6.3%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 6.3%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around 0 100.0%

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

   if 7.4000000000000003e-6 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 50.8%

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

      2. hypot-1-def 100.0%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -7 \cdot 10^{-6}:\\ \;\;\;\;\log \left(\frac{-1}{x - \mathsf{hypot}\left(1, x\right)}\right)\\ \mathbf{elif}\;x \leq 7.4 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \]

Alternative 2: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.25:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 7.4 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.25)
   (log (/ -0.5 x))
   (if (<= x 7.4e-6) x (log (+ x (hypot 1.0 x))))))

C

double code(double x) {
	double tmp;
	if (x <= -1.25) {
		tmp = log((-0.5 / x));
	} else if (x <= 7.4e-6) {
		tmp = x;
	} else {
		tmp = log((x + hypot(1.0, x)));
	}
	return tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.25) {
		tmp = Math.log((-0.5 / x));
	} else if (x <= 7.4e-6) {
		tmp = x;
	} else {
		tmp = Math.log((x + Math.hypot(1.0, x)));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.25:
		tmp = math.log((-0.5 / x))
	elif x <= 7.4e-6:
		tmp = x
	else:
		tmp = math.log((x + math.hypot(1.0, x)))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.25)
		tmp = log(Float64(-0.5 / x));
	elseif (x <= 7.4e-6)
		tmp = x;
	else
		tmp = log(Float64(x + hypot(1.0, x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.25)
		tmp = log((-0.5 / x));
	elseif (x <= 7.4e-6)
		tmp = x;
	else
		tmp = log((x + hypot(1.0, x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.25], N[Log[N[(-0.5 / x), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 7.4e-6], x, N[Log[N[(x + N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.25

   1. Initial program 3.0%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 3.0%

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

      2. hypot-1-def 4.4%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 4.4%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around -inf 99.7%

      \[\leadsto \log \color{blue}{\left(\frac{-0.5}{x}\right)} \]

   if -1.25 < x < 7.4000000000000003e-6

   1. Initial program 6.3%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 6.3%

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

      2. hypot-1-def 6.3%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 6.3%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around 0 100.0%

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

   if 7.4000000000000003e-6 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 50.8%

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

      2. hypot-1-def 100.0%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.25:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 7.4 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \]

Alternative 3: 99.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.25:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 0.8:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x \cdot 2 + 0.5 \cdot \frac{1}{x}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.25)
   (log (/ -0.5 x))
   (if (<= x 0.8) x (log (+ (* x 2.0) (* 0.5 (/ 1.0 x)))))))

C

double code(double x) {
	double tmp;
	if (x <= -1.25) {
		tmp = log((-0.5 / x));
	} else if (x <= 0.8) {
		tmp = x;
	} else {
		tmp = log(((x * 2.0) + (0.5 * (1.0 / x))));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.25d0)) then
        tmp = log(((-0.5d0) / x))
    else if (x <= 0.8d0) then
        tmp = x
    else
        tmp = log(((x * 2.0d0) + (0.5d0 * (1.0d0 / x))))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.25) {
		tmp = Math.log((-0.5 / x));
	} else if (x <= 0.8) {
		tmp = x;
	} else {
		tmp = Math.log(((x * 2.0) + (0.5 * (1.0 / x))));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.25:
		tmp = math.log((-0.5 / x))
	elif x <= 0.8:
		tmp = x
	else:
		tmp = math.log(((x * 2.0) + (0.5 * (1.0 / x))))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.25)
		tmp = log(Float64(-0.5 / x));
	elseif (x <= 0.8)
		tmp = x;
	else
		tmp = log(Float64(Float64(x * 2.0) + Float64(0.5 * Float64(1.0 / x))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.25)
		tmp = log((-0.5 / x));
	elseif (x <= 0.8)
		tmp = x;
	else
		tmp = log(((x * 2.0) + (0.5 * (1.0 / x))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.25], N[Log[N[(-0.5 / x), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 0.8], x, N[Log[N[(N[(x * 2.0), $MachinePrecision] + N[(0.5 * N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.25

   1. Initial program 3.0%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 3.0%

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

      2. hypot-1-def 4.4%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 4.4%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around -inf 99.7%

      \[\leadsto \log \color{blue}{\left(\frac{-0.5}{x}\right)} \]

   if -1.25 < x < 0.80000000000000004

   1. Initial program 6.3%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 6.3%

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

      2. hypot-1-def 6.3%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 6.3%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around 0 100.0%

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

   if 0.80000000000000004 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 50.8%

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

      2. hypot-1-def 100.0%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around inf 98.9%

      \[\leadsto \log \color{blue}{\left(2 \cdot x + 0.5 \cdot \frac{1}{x}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.25:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 0.8:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x \cdot 2 + 0.5 \cdot \frac{1}{x}\right)\\ \end{array} \]

Alternative 4: 99.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.25:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 1.25:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.25) (log (/ -0.5 x)) (if (<= x 1.25) x (log (+ x x)))))

C

double code(double x) {
	double tmp;
	if (x <= -1.25) {
		tmp = log((-0.5 / x));
	} else if (x <= 1.25) {
		tmp = x;
	} else {
		tmp = log((x + x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.25d0)) then
        tmp = log(((-0.5d0) / x))
    else if (x <= 1.25d0) then
        tmp = x
    else
        tmp = log((x + x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.25) {
		tmp = Math.log((-0.5 / x));
	} else if (x <= 1.25) {
		tmp = x;
	} else {
		tmp = Math.log((x + x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.25:
		tmp = math.log((-0.5 / x))
	elif x <= 1.25:
		tmp = x
	else:
		tmp = math.log((x + x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.25)
		tmp = log(Float64(-0.5 / x));
	elseif (x <= 1.25)
		tmp = x;
	else
		tmp = log(Float64(x + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.25)
		tmp = log((-0.5 / x));
	elseif (x <= 1.25)
		tmp = x;
	else
		tmp = log((x + x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.25], N[Log[N[(-0.5 / x), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 1.25], x, N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.25

   1. Initial program 3.0%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 3.0%

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

      2. hypot-1-def 4.4%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 4.4%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around -inf 99.7%

      \[\leadsto \log \color{blue}{\left(\frac{-0.5}{x}\right)} \]

   if -1.25 < x < 1.25

   1. Initial program 6.3%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 6.3%

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

      2. hypot-1-def 6.3%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 6.3%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around 0 100.0%

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

   if 1.25 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 50.8%

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

      2. hypot-1-def 100.0%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around inf 98.8%

      \[\leadsto \log \color{blue}{\left(2 \cdot x\right)} \]
   5. Step-by-step derivation

      1. count-2 98.8%

         \[\leadsto \log \color{blue}{\left(x + x\right)} \]

   6. Simplified 98.8%

      \[\leadsto \log \color{blue}{\left(x + x\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.25:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 1.25:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + x\right)\\ \end{array} \]

Alternative 5: 75.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.25:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 1.25) x (log (+ x x))))

C

double code(double x) {
	double tmp;
	if (x <= 1.25) {
		tmp = x;
	} else {
		tmp = log((x + x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.25d0) then
        tmp = x
    else
        tmp = log((x + x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.25) {
		tmp = x;
	} else {
		tmp = Math.log((x + x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.25:
		tmp = x
	else:
		tmp = math.log((x + x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.25)
		tmp = x;
	else
		tmp = log(Float64(x + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.25)
		tmp = x;
	else
		tmp = log((x + x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.25], x, N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.25

   1. Initial program 5.2%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 5.2%

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

      2. hypot-1-def 5.7%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 5.7%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around 0 68.3%

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

   if 1.25 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Step-by-step derivation

      1. +-commutative 50.8%

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

      2. hypot-1-def 100.0%

         \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

   4. Taylor expanded in x around inf 98.8%

      \[\leadsto \log \color{blue}{\left(2 \cdot x\right)} \]
   5. Step-by-step derivation

      1. count-2 98.8%

         \[\leadsto \log \color{blue}{\left(x + x\right)} \]

   6. Simplified 98.8%

      \[\leadsto \log \color{blue}{\left(x + x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.25:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + x\right)\\ \end{array} \]

Alternative 6: 52.7% accurate, 207.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 x)

C

double code(double x) {
	return x;
}

Fortran

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

Java

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

Python

def code(x):
	return x

Julia

function code(x)
	return x
end

MATLAB

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

Wolfram

code[x_] := x

Derivation

1. Initial program 15.7%

   \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
2. Step-by-step derivation

   1. +-commutative 15.7%

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

   2. hypot-1-def 27.4%

      \[\leadsto \log \left(x + \color{blue}{\mathsf{hypot}\left(1, x\right)}\right) \]

3. Simplified 27.4%

   \[\leadsto \color{blue}{\log \left(x + \mathsf{hypot}\left(1, x\right)\right)} \]

4. Taylor expanded in x around 0 53.7%

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

5. Final simplification 53.7%

   \[\leadsto x \]

Developer target: 30.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{x \cdot x + 1}\\ \mathbf{if}\;x < 0:\\ \;\;\;\;\log \left(\frac{-1}{x - t_0}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + t_0\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (+ (* x x) 1.0))))
   (if (< x 0.0) (log (/ -1.0 (- x t_0))) (log (+ x t_0)))))

C

double code(double x) {
	double t_0 = sqrt(((x * x) + 1.0));
	double tmp;
	if (x < 0.0) {
		tmp = log((-1.0 / (x - t_0)));
	} else {
		tmp = log((x + t_0));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((x * x) + 1.0d0))
    if (x < 0.0d0) then
        tmp = log(((-1.0d0) / (x - t_0)))
    else
        tmp = log((x + t_0))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double t_0 = Math.sqrt(((x * x) + 1.0));
	double tmp;
	if (x < 0.0) {
		tmp = Math.log((-1.0 / (x - t_0)));
	} else {
		tmp = Math.log((x + t_0));
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.sqrt(((x * x) + 1.0))
	tmp = 0
	if x < 0.0:
		tmp = math.log((-1.0 / (x - t_0)))
	else:
		tmp = math.log((x + t_0))
	return tmp

Julia

function code(x)
	t_0 = sqrt(Float64(Float64(x * x) + 1.0))
	tmp = 0.0
	if (x < 0.0)
		tmp = log(Float64(-1.0 / Float64(x - t_0)));
	else
		tmp = log(Float64(x + t_0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = sqrt(((x * x) + 1.0));
	tmp = 0.0;
	if (x < 0.0)
		tmp = log((-1.0 / (x - t_0)));
	else
		tmp = log((x + t_0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]}, If[Less[x, 0.0], N[Log[N[(-1.0 / N[(x - t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Log[N[(x + t$95$0), $MachinePrecision]], $MachinePrecision]]]

Reproduce

herbie shell --seed 2023181 
(FPCore (x)
  :name "Hyperbolic arcsine"
  :precision binary64

  :herbie-target
  (if (< x 0.0) (log (/ -1.0 (- x (sqrt (+ (* x x) 1.0))))) (log (+ x (sqrt (+ (* x x) 1.0)))))

  (log (+ x (sqrt (+ (* x x) 1.0)))))