sqrtexp (problem 3.4.4)

Percentage Accurate: 4.7% → 100.0%

Time: 23.1s

Alternatives: 3

Speedup: 3.1×

• could not determine a ground truth

  1. x = -6.345523484422262e+49

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: 4.7% 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 + e^{x}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 4.1%

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

   1. *-commutative 4.1%

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

   2. exp-lft-sqr 4.5%

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

   3. difference-of-sqr-1 5.1%

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

   4. associate-/l* 5.5%

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

   5. *-inverses 100.0%

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

   6. /-rgt-identity 100.0%

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

   7. +-commutative 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 98.0% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return sqrt(Float64(x + 2.0))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 4.1%

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

   1. *-commutative 4.1%

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

   2. exp-lft-sqr 4.5%

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

   3. difference-of-sqr-1 5.1%

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

   4. associate-/l* 5.5%

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

   5. *-inverses 100.0%

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

   6. /-rgt-identity 100.0%

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

   7. +-commutative 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around 0 97.9%

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

5. Final simplification 97.9%

   \[\leadsto \sqrt{x + 2} \]

Alternative 3: 97.1% 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 4.1%

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

   1. *-commutative 4.1%

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

   2. exp-lft-sqr 4.5%

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

   3. difference-of-sqr-1 5.1%

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

   4. associate-/l* 5.5%

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

   5. *-inverses 100.0%

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

   6. /-rgt-identity 100.0%

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

   7. +-commutative 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around 0 97.2%

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

5. Final simplification 97.2%

   \[\leadsto \sqrt{2} \]

Reproduce

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