sqrtexp (problem 3.4.4)

Average Error: 41.1 → 0.0

Time: 4.5s

Precision: binary64

Cost: 19328

Math

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

↓

\[\mathsf{hypot}\left(1, \sqrt{e^{x}}\right) \]

FPCore

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

↓

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

C

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

↓

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

Java

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

↓

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

Python

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

↓

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

Julia

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

↓

function code(x)
	return hypot(1.0, sqrt(exp(x)))
end

MATLAB

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

↓

function tmp = code(x)
	tmp = hypot(1.0, sqrt(exp(x)));
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]

↓

code[x_] := N[Sqrt[1.0 ^ 2 + N[Sqrt[N[Exp[x], $MachinePrecision]], $MachinePrecision] ^ 2], $MachinePrecision]

Derivation

1. Initial program 41.1

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

2. Simplified 0.0

   \[\leadsto \color{blue}{\sqrt{1 + e^{x}}} \]
   Proof
   (sqrt.f64 (+.f64 1 (exp.f64 x))): 0 points increase in error, 0 points decrease in error
   (sqrt.f64 (Rewrite<= +-commutative_binary64 (+.f64 (exp.f64 x) 1))): 0 points increase in error, 0 points decrease in error
   (sqrt.f64 (Rewrite<= /-rgt-identity_binary64 (/.f64 (+.f64 (exp.f64 x) 1) 1))): 0 points increase in error, 0 points decrease in error
   (sqrt.f64 (/.f64 (+.f64 (exp.f64 x) 1) (Rewrite<= *-inverses_binary64 (/.f64 (-.f64 (exp.f64 x) 1) (-.f64 (exp.f64 x) 1))))): 161 points increase in error, 0 points decrease in error
   (sqrt.f64 (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (+.f64 (exp.f64 x) 1) (-.f64 (exp.f64 x) 1)) (-.f64 (exp.f64 x) 1)))): 0 points increase in error, 0 points decrease in error
   (sqrt.f64 (/.f64 (Rewrite<= difference-of-sqr-1_binary64 (-.f64 (*.f64 (exp.f64 x) (exp.f64 x)) 1)) (-.f64 (exp.f64 x) 1))): 13 points increase in error, 0 points decrease in error
   (sqrt.f64 (/.f64 (-.f64 (Rewrite<= exp-lft-sqr_binary64 (exp.f64 (*.f64 x 2))) 1) (-.f64 (exp.f64 x) 1))): 7 points increase in error, 0 points decrease in error
   (sqrt.f64 (/.f64 (-.f64 (exp.f64 (Rewrite<= *-commutative_binary64 (*.f64 2 x))) 1) (-.f64 (exp.f64 x) 1))): 0 points increase in error, 0 points decrease in error

3. Applied egg-rr 0.0

   \[\leadsto \color{blue}{\mathsf{hypot}\left(1, \sqrt{e^{x}}\right)} \]

4. Final simplification 0.0

   \[\leadsto \mathsf{hypot}\left(1, \sqrt{e^{x}}\right) \]

Alternatives

Alternative 1
Error	0.0
Cost	12992

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

Alternative 2
Error	17.8
Cost	6464

\[\sqrt{2} \]

Alternative 3
Error	54.9
Cost	320

\[1 + x \cdot 0.5 \]

Alternative 4
Error	62.1
Cost	192

\[x \cdot 0.5 \]

Alternative 5
Error	61.2
Cost	192

\[x \cdot -0.5 \]

Reproduce

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