Hyperbolic arcsine

Percentage Accurate: 17.3% → 99.4%

Time: 4.0s

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.3% 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.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.26:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 1.25:\\ \;\;\;\;-0.16666666666666666 \cdot {x}^{3} + \left(0.075 \cdot {x}^{5} + \left(x + -0.044642857142857144 \cdot {x}^{7}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.26)
   (log (/ -0.5 x))
   (if (<= x 1.25)
     (+
      (* -0.16666666666666666 (pow x 3.0))
      (+ (* 0.075 (pow x 5.0)) (+ x (* -0.044642857142857144 (pow x 7.0)))))
     (log (+ x x)))))

C

double code(double x) {
	double tmp;
	if (x <= -1.26) {
		tmp = log((-0.5 / x));
	} else if (x <= 1.25) {
		tmp = (-0.16666666666666666 * pow(x, 3.0)) + ((0.075 * pow(x, 5.0)) + (x + (-0.044642857142857144 * pow(x, 7.0))));
	} else {
		tmp = log((x + x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.26d0)) then
        tmp = log(((-0.5d0) / x))
    else if (x <= 1.25d0) then
        tmp = ((-0.16666666666666666d0) * (x ** 3.0d0)) + ((0.075d0 * (x ** 5.0d0)) + (x + ((-0.044642857142857144d0) * (x ** 7.0d0))))
    else
        tmp = log((x + x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.26) {
		tmp = Math.log((-0.5 / x));
	} else if (x <= 1.25) {
		tmp = (-0.16666666666666666 * Math.pow(x, 3.0)) + ((0.075 * Math.pow(x, 5.0)) + (x + (-0.044642857142857144 * Math.pow(x, 7.0))));
	} else {
		tmp = Math.log((x + x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.26:
		tmp = math.log((-0.5 / x))
	elif x <= 1.25:
		tmp = (-0.16666666666666666 * math.pow(x, 3.0)) + ((0.075 * math.pow(x, 5.0)) + (x + (-0.044642857142857144 * math.pow(x, 7.0))))
	else:
		tmp = math.log((x + x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.26)
		tmp = log(Float64(-0.5 / x));
	elseif (x <= 1.25)
		tmp = Float64(Float64(-0.16666666666666666 * (x ^ 3.0)) + Float64(Float64(0.075 * (x ^ 5.0)) + Float64(x + Float64(-0.044642857142857144 * (x ^ 7.0)))));
	else
		tmp = log(Float64(x + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.26)
		tmp = log((-0.5 / x));
	elseif (x <= 1.25)
		tmp = (-0.16666666666666666 * (x ^ 3.0)) + ((0.075 * (x ^ 5.0)) + (x + (-0.044642857142857144 * (x ^ 7.0))));
	else
		tmp = log((x + x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.26], N[Log[N[(-0.5 / x), $MachinePrecision]], $MachinePrecision], If[LessEqual[x, 1.25], N[(N[(-0.16666666666666666 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision] + N[(N[(0.075 * N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision] + N[(x + N[(-0.044642857142857144 * N[Power[x, 7.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.26000000000000001

   1. Initial program 1.7%

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

      1. +-commutative 1.7%

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

      2. hypot-1-def 3.1%

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

   3. Simplified 3.1%

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

   4. Taylor expanded in x around -inf 100.0%

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

   if -1.26000000000000001 < x < 1.25

   1. Initial program 7.6%

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

      1. +-commutative 7.6%

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

      2. hypot-1-def 7.6%

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

   3. Simplified 7.6%

      \[\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}{-0.16666666666666666 \cdot {x}^{3} + \left(0.075 \cdot {x}^{5} + \left(-0.044642857142857144 \cdot {x}^{7} + x\right)\right)} \]

   if 1.25 < x

   1. Initial program 46.5%

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

      1. +-commutative 46.5%

         \[\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 100.0%

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

      1. count-2 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.26:\\ \;\;\;\;\log \left(\frac{-0.5}{x}\right)\\ \mathbf{elif}\;x \leq 1.25:\\ \;\;\;\;-0.16666666666666666 \cdot {x}^{3} + \left(0.075 \cdot {x}^{5} + \left(x + -0.044642857142857144 \cdot {x}^{7}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + x\right)\\ \end{array} \]

Alternative 2: 99.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.3)
   (log (/ -0.5 x))
   (if (<= x 1.3)
     (+ (* -0.16666666666666666 (pow x 3.0)) (+ x (* 0.075 (pow x 5.0))))
     (log (+ x x)))))

C

double code(double x) {
	double tmp;
	if (x <= -1.3) {
		tmp = log((-0.5 / x));
	} else if (x <= 1.3) {
		tmp = (-0.16666666666666666 * pow(x, 3.0)) + (x + (0.075 * pow(x, 5.0)));
	} else {
		tmp = log((x + x));
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.3) {
		tmp = Math.log((-0.5 / x));
	} else if (x <= 1.3) {
		tmp = (-0.16666666666666666 * Math.pow(x, 3.0)) + (x + (0.075 * Math.pow(x, 5.0)));
	} else {
		tmp = Math.log((x + x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.3:
		tmp = math.log((-0.5 / x))
	elif x <= 1.3:
		tmp = (-0.16666666666666666 * math.pow(x, 3.0)) + (x + (0.075 * math.pow(x, 5.0)))
	else:
		tmp = math.log((x + x))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -1.30000000000000004

   1. Initial program 1.7%

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

      1. +-commutative 1.7%

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

      2. hypot-1-def 3.1%

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

   3. Simplified 3.1%

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

   4. Taylor expanded in x around -inf 100.0%

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

   if -1.30000000000000004 < x < 1.30000000000000004

   1. Initial program 7.6%

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

      1. +-commutative 7.6%

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

      2. hypot-1-def 7.6%

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

   3. Simplified 7.6%

      \[\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}{-0.16666666666666666 \cdot {x}^{3} + \left(0.075 \cdot {x}^{5} + x\right)} \]

   if 1.30000000000000004 < x

   1. Initial program 46.5%

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

      1. +-commutative 46.5%

         \[\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 100.0%

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

      1. count-2 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 3: 99.3% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.26)
   (log (/ -0.5 x))
   (if (<= x 1.25) (+ x (* -0.16666666666666666 (pow x 3.0))) (log (+ x x)))))

C

double code(double x) {
	double tmp;
	if (x <= -1.26) {
		tmp = log((-0.5 / x));
	} else if (x <= 1.25) {
		tmp = x + (-0.16666666666666666 * pow(x, 3.0));
	} else {
		tmp = log((x + x));
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x):
	tmp = 0
	if x <= -1.26:
		tmp = math.log((-0.5 / x))
	elif x <= 1.25:
		tmp = x + (-0.16666666666666666 * math.pow(x, 3.0))
	else:
		tmp = math.log((x + x))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -1.26000000000000001

   1. Initial program 1.7%

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

      1. +-commutative 1.7%

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

      2. hypot-1-def 3.1%

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

   3. Simplified 3.1%

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

   4. Taylor expanded in x around -inf 100.0%

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

   if -1.26000000000000001 < x < 1.25

   1. Initial program 7.6%

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

      1. +-commutative 7.6%

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

      2. hypot-1-def 7.6%

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

   3. Simplified 7.6%

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

   4. Taylor expanded in x around 0 99.8%

      \[\leadsto \color{blue}{-0.16666666666666666 \cdot {x}^{3} + x} \]

   if 1.25 < x

   1. Initial program 46.5%

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

      1. +-commutative 46.5%

         \[\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 100.0%

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

      1. count-2 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 99.9%

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

Alternative 4: 99.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.26:\\ \;\;\;\;\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.26) (log (/ -0.5 x)) (if (<= x 1.25) x (log (+ x x)))))

C

double code(double x) {
	double tmp;
	if (x <= -1.26) {
		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.26d0)) 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.26) {
		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.26:
		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.26)
		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.26)
		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.26], 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.26000000000000001

   1. Initial program 1.7%

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

      1. +-commutative 1.7%

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

      2. hypot-1-def 3.1%

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

   3. Simplified 3.1%

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

   4. Taylor expanded in x around -inf 100.0%

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

   if -1.26000000000000001 < x < 1.25

   1. Initial program 7.6%

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

      1. +-commutative 7.6%

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

      2. hypot-1-def 7.6%

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

   3. Simplified 7.6%

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

   4. Taylor expanded in x around 0 99.5%

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

   if 1.25 < x

   1. Initial program 46.5%

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

      1. +-commutative 46.5%

         \[\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 100.0%

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

      1. count-2 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.26:\\ \;\;\;\;\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.8% 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.5%

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

      1. +-commutative 5.5%

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

      2. hypot-1-def 6.0%

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

   3. Simplified 6.0%

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

   4. Taylor expanded in x around 0 65.9%

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

   if 1.25 < x

   1. Initial program 46.5%

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

      1. +-commutative 46.5%

         \[\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 100.0%

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

      1. count-2 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 76.1%

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

Alternative 6: 53.3% 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 17.7%

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

   1. +-commutative 17.7%

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

   2. hypot-1-def 33.9%

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

3. Simplified 33.9%

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

4. Taylor expanded in x around 0 47.9%

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

5. Final simplification 47.9%

   \[\leadsto x \]

Developer target: 29.2% 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 2023217 
(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)))))