sqrtexp (problem 3.4.4)

Percentage Accurate: 36.2% → 100.0%

Time: 6.6s

Alternatives: 3

Speedup: 3.1×

Specification

Math

\[\begin{array}{l} \\ \sqrt{\frac{e^{2 \cdot x} - 1}{e^{x} - 1}} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (sqrt (/ (- (exp (* 2.0 x)) 1.0) (- (exp x) 1.0))))

C

double code(double x) {
	return sqrt(((exp((2.0 * x)) - 1.0) / (exp(x) - 1.0)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt(((exp((2.0d0 * x)) - 1.0d0) / (exp(x) - 1.0d0)))
end function

Java

public static double code(double x) {
	return Math.sqrt(((Math.exp((2.0 * x)) - 1.0) / (Math.exp(x) - 1.0)));
}

Python

def code(x):
	return math.sqrt(((math.exp((2.0 * x)) - 1.0) / (math.exp(x) - 1.0)))

Julia

function code(x)
	return sqrt(Float64(Float64(exp(Float64(2.0 * x)) - 1.0) / Float64(exp(x) - 1.0)))
end

MATLAB

function tmp = code(x)
	tmp = sqrt(((exp((2.0 * x)) - 1.0) / (exp(x) - 1.0)));
end

Wolfram

code[x_] := N[Sqrt[N[(N[(N[Exp[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Initial Program: 36.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{\frac{e^{2 \cdot x} - 1}{e^{x} - 1}} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (sqrt (/ (- (exp (* 2.0 x)) 1.0) (- (exp x) 1.0))))

C

double code(double x) {
	return sqrt(((exp((2.0 * x)) - 1.0) / (exp(x) - 1.0)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt(((exp((2.0d0 * x)) - 1.0d0) / (exp(x) - 1.0d0)))
end function

Java

public static double code(double x) {
	return Math.sqrt(((Math.exp((2.0 * x)) - 1.0) / (Math.exp(x) - 1.0)));
}

Python

def code(x):
	return math.sqrt(((math.exp((2.0 * x)) - 1.0) / (math.exp(x) - 1.0)))

Julia

function code(x)
	return sqrt(Float64(Float64(exp(Float64(2.0 * x)) - 1.0) / Float64(exp(x) - 1.0)))
end

MATLAB

function tmp = code(x)
	tmp = sqrt(((exp((2.0 * x)) - 1.0) / (exp(x) - 1.0)));
end

Wolfram

code[x_] := N[Sqrt[N[(N[(N[Exp[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 100.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \sqrt{-1 + \left(2 + e^{x}\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (sqrt (+ -1.0 (+ 2.0 (exp x)))))

C

double code(double x) {
	return sqrt((-1.0 + (2.0 + exp(x))));
}

Fortran

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

Java

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

Python

def code(x):
	return math.sqrt((-1.0 + (2.0 + math.exp(x))))

Julia

function code(x)
	return sqrt(Float64(-1.0 + Float64(2.0 + exp(x))))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((-1.0 + (2.0 + exp(x))));
end

Wolfram

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

Derivation

1. Initial program 32.1%

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

   1. *-commutative 32.1%

      \[\leadsto \sqrt{\frac{e^{\color{blue}{x \cdot 2}} - 1}{e^{x} - 1}} \]

   2. exp-lft-sqr 32.5%

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

   3. difference-of-sqr-1 32.8%

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

   4. associate-*r/ 32.8%

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

   5. *-inverses 99.6%

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

   6. *-rgt-identity 99.6%

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

   7. +-commutative 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\sqrt{1 + e^{x}}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. expm1-log1p-u 98.6%

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

   2. expm1-undefine 98.6%

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

6. Applied egg-rr 98.6%

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

   1. sub-neg 98.6%

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

   2. metadata-eval 98.6%

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

   3. +-commutative 98.6%

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

   4. log1p-undefine 99.6%

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

   5. rem-exp-log 99.6%

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

   6. associate-+r+ 99.6%

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

   7. metadata-eval 99.6%

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

8. Simplified 99.6%

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

9. Final simplification 99.6%

   \[\leadsto \sqrt{-1 + \left(2 + e^{x}\right)} \]
10. Add Preprocessing

Alternative 2: 100.0% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 32.1%

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

   1. *-commutative 32.1%

      \[\leadsto \sqrt{\frac{e^{\color{blue}{x \cdot 2}} - 1}{e^{x} - 1}} \]

   2. exp-lft-sqr 32.5%

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

   3. difference-of-sqr-1 32.8%

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

   4. associate-*r/ 32.8%

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

   5. *-inverses 99.6%

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

   6. *-rgt-identity 99.6%

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

   7. +-commutative 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\sqrt{1 + e^{x}}} \]
4. Add Preprocessing

5. Final simplification 99.6%

   \[\leadsto \sqrt{e^{x} + 1} \]
6. Add Preprocessing

Alternative 3: 71.2% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return math.sqrt(2.0)

Julia

function code(x)
	return sqrt(2.0)
end

MATLAB

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

Wolfram

code[x_] := N[Sqrt[2.0], $MachinePrecision]

Derivation

1. Initial program 32.1%

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

   1. *-commutative 32.1%

      \[\leadsto \sqrt{\frac{e^{\color{blue}{x \cdot 2}} - 1}{e^{x} - 1}} \]

   2. exp-lft-sqr 32.5%

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

   3. difference-of-sqr-1 32.8%

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

   4. associate-*r/ 32.8%

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

   5. *-inverses 99.6%

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

   6. *-rgt-identity 99.6%

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

   7. +-commutative 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\sqrt{1 + e^{x}}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 74.5%

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

6. Final simplification 74.5%

   \[\leadsto \sqrt{2} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024051 
(FPCore (x)
  :name "sqrtexp (problem 3.4.4)"
  :precision binary64
  (sqrt (/ (- (exp (* 2.0 x)) 1.0) (- (exp x) 1.0))))