Hyperbolic arcsine

Percentage Accurate: 17.2% → 100.0%

Time: 7.8s

Alternatives: 5

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.2% 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: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.0076:\\ \;\;\;\;-\log \left(\mathsf{hypot}\left(1, x\right) - x\right)\\ \mathbf{elif}\;x \leq 0.0074:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.075 - 0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -0.0076)
   (- (log (- (hypot 1.0 x) x)))
   (if (<= x 0.0074)
     (* x (+ 1.0 (* (* x x) (- (* (* x x) 0.075) 0.16666666666666666))))
     (log (+ x (hypot 1.0 x))))))

C

double code(double x) {
	double tmp;
	if (x <= -0.0076) {
		tmp = -log((hypot(1.0, x) - x));
	} else if (x <= 0.0074) {
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	} else {
		tmp = log((x + hypot(1.0, x)));
	}
	return tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (x <= -0.0076) {
		tmp = -Math.log((Math.hypot(1.0, x) - x));
	} else if (x <= 0.0074) {
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	} else {
		tmp = Math.log((x + Math.hypot(1.0, x)));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -0.0076:
		tmp = -math.log((math.hypot(1.0, x) - x))
	elif x <= 0.0074:
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)))
	else:
		tmp = math.log((x + math.hypot(1.0, x)))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -0.0076)
		tmp = Float64(-log(Float64(hypot(1.0, x) - x)));
	elseif (x <= 0.0074)
		tmp = Float64(x * Float64(1.0 + Float64(Float64(x * x) * Float64(Float64(Float64(x * x) * 0.075) - 0.16666666666666666))));
	else
		tmp = log(Float64(x + hypot(1.0, x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -0.0076)
		tmp = -log((hypot(1.0, x) - x));
	elseif (x <= 0.0074)
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	else
		tmp = log((x + hypot(1.0, x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -0.0076], (-N[Log[N[(N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), If[LessEqual[x, 0.0074], N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * N[(N[(N[(x * x), $MachinePrecision] * 0.075), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Log[N[(x + N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -0.00759999999999999998

   1. Initial program 2.8%

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

      1. flip-+ 2.5%

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

      2. frac-2neg 2.5%

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

      3. log-div 2.5%

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

      4. add-sqr-sqrt 3.0%

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

      5. pow2 3.0%

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

      6. fma-define 3.0%

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

      7. +-commutative 3.0%

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

      8. hypot-1-def 3.0%

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

   4. Applied egg-rr 3.0%

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

      1. sub-neg 3.0%

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

      2. sub-neg 3.0%

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

      3. fma-undefine 3.0%

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

      4. unpow2 3.0%

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

      5. associate--r+ 45.2%

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

      6. +-inverses 100.0%

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

      7. metadata-eval 100.0%

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

      8. metadata-eval 100.0%

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

      9. metadata-eval 100.0%

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

      10. neg-sub0 100.0%

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

      11. neg-sub0 100.0%

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

      12. associate--r- 100.0%

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

      13. neg-sub0 100.0%

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

      14. +-commutative 100.0%

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

      15. sub-neg 100.0%

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

   6. Simplified 100.0%

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

   if -0.00759999999999999998 < x < 0.0074000000000000003

   1. Initial program 8.7%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(0.075 \cdot {x}^{2} - 0.16666666666666666\right)\right)} \]
   4. Step-by-step derivation

      1. unpow2 100.0%

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

   5. Applied egg-rr 100.0%

      \[\leadsto x \cdot \left(1 + {x}^{2} \cdot \left(0.075 \cdot \color{blue}{\left(x \cdot x\right)} - 0.16666666666666666\right)\right) \]
   6. Step-by-step derivation

      1. unpow2 100.0%

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

   7. Applied egg-rr 100.0%

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

   if 0.0074000000000000003 < x

   1. Initial program 51.6%

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

      1. sqr-neg 51.6%

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

      2. +-commutative 51.6%

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

      3. sqr-neg 51.6%

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

      4. 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. Add Preprocessing
3. Recombined 3 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.0076:\\ \;\;\;\;-\log \left(\mathsf{hypot}\left(1, x\right) - x\right)\\ \mathbf{elif}\;x \leq 0.0074:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.075 - 0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 0.0074:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.075 - 0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.35)
   (log (/ -0.5 x))
   (if (<= x 0.0074)
     (* x (+ 1.0 (* (* x x) (- (* (* x x) 0.075) 0.16666666666666666))))
     (log (+ x (hypot 1.0 x))))))

C

double code(double x) {
	double tmp;
	if (x <= -1.35) {
		tmp = log((-0.5 / x));
	} else if (x <= 0.0074) {
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	} else {
		tmp = log((x + hypot(1.0, x)));
	}
	return tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.35) {
		tmp = Math.log((-0.5 / x));
	} else if (x <= 0.0074) {
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	} else {
		tmp = Math.log((x + Math.hypot(1.0, x)));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.35:
		tmp = math.log((-0.5 / x))
	elif x <= 0.0074:
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)))
	else:
		tmp = math.log((x + math.hypot(1.0, x)))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.35)
		tmp = log(Float64(-0.5 / x));
	elseif (x <= 0.0074)
		tmp = Float64(x * Float64(1.0 + Float64(Float64(x * x) * Float64(Float64(Float64(x * x) * 0.075) - 0.16666666666666666))));
	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.35)
		tmp = log((-0.5 / x));
	elseif (x <= 0.0074)
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	else
		tmp = log((x + hypot(1.0, x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.35], N[Log[N[(-0.5 / x), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 0.0074], N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * N[(N[(N[(x * x), $MachinePrecision] * 0.075), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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.3500000000000001

   1. Initial program 2.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf 99.4%

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

   if -1.3500000000000001 < x < 0.0074000000000000003

   1. Initial program 8.7%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(0.075 \cdot {x}^{2} - 0.16666666666666666\right)\right)} \]
   4. Step-by-step derivation

      1. unpow2 100.0%

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

   5. Applied egg-rr 100.0%

      \[\leadsto x \cdot \left(1 + {x}^{2} \cdot \left(0.075 \cdot \color{blue}{\left(x \cdot x\right)} - 0.16666666666666666\right)\right) \]
   6. Step-by-step derivation

      1. unpow2 100.0%

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

   7. Applied egg-rr 100.0%

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

   if 0.0074000000000000003 < x

   1. Initial program 51.6%

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

      1. sqr-neg 51.6%

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

      2. +-commutative 51.6%

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

      3. sqr-neg 51.6%

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

      4. 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. Add Preprocessing
3. Recombined 3 regimes into one program.

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 0.0074:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.075 - 0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + \mathsf{hypot}\left(1, x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.35)
   (log (/ -0.5 x))
   (if (<= x 1.3)
     (* x (+ 1.0 (* (* x x) (- (* (* x x) 0.075) 0.16666666666666666))))
     (log (* x 2.0)))))

C

double code(double x) {
	double tmp;
	if (x <= -1.35) {
		tmp = log((-0.5 / x));
	} else if (x <= 1.3) {
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	} else {
		tmp = log((x * 2.0));
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.35)
		tmp = log((-0.5 / x));
	elseif (x <= 1.3)
		tmp = x * (1.0 + ((x * x) * (((x * x) * 0.075) - 0.16666666666666666)));
	else
		tmp = log((x * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.35], N[Log[N[(-0.5 / x), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 1.3], N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * N[(N[(N[(x * x), $MachinePrecision] * 0.075), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Log[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.3500000000000001

   1. Initial program 2.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf 99.4%

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

   if -1.3500000000000001 < x < 1.30000000000000004

   1. Initial program 9.4%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(0.075 \cdot {x}^{2} - 0.16666666666666666\right)\right)} \]
   4. Step-by-step derivation

      1. unpow2 99.4%

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

   5. Applied egg-rr 99.4%

      \[\leadsto x \cdot \left(1 + {x}^{2} \cdot \left(0.075 \cdot \color{blue}{\left(x \cdot x\right)} - 0.16666666666666666\right)\right) \]
   6. Step-by-step derivation

      1. unpow2 99.4%

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

   7. Applied egg-rr 99.4%

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

   if 1.30000000000000004 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.0%

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

      1. *-commutative 99.0%

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

   5. Simplified 99.0%

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

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 1.3:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.075 - 0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x \cdot 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.8% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (if (<= x 1.26) x (log (* x 2.0))))

C

double code(double x) {
	double tmp;
	if (x <= 1.26) {
		tmp = x;
	} else {
		tmp = log((x * 2.0));
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.26) {
		tmp = x;
	} else {
		tmp = Math.log((x * 2.0));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.26:
		tmp = x
	else:
		tmp = math.log((x * 2.0))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.26)
		tmp = x;
	else
		tmp = log(Float64(x * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.26)
		tmp = x;
	else
		tmp = log((x * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.26], x, N[Log[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.26000000000000001

   1. Initial program 7.3%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 68.7%

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

   if 1.26000000000000001 < x

   1. Initial program 50.8%

      \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.0%

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

      1. *-commutative 99.0%

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

   5. Simplified 99.0%

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

Alternative 5: 53.4% 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 18.0%

   \[\log \left(x + \sqrt{x \cdot x + 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0 53.1%

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

Developer Target 1: 29.4% 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 2024188 
(FPCore (x)
  :name "Hyperbolic arcsine"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< x 0) (log (/ -1 (- x (sqrt (+ (* x x) 1))))) (log (+ x (sqrt (+ (* x x) 1))))))

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