Rust f64::acosh

?

Percentage Accurate: 51.3% → 99.5%
Time: 1.9s
Precision: binary64
Cost: 6848

?

\[x \geq 1\]
\[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
↓
\[\log \left(x \cdot 2 - \frac{0.5}{x}\right) \]
(FPCore (x) :precision binary64 (log (+ x (sqrt (- (* x x) 1.0)))))
↓
(FPCore (x) :precision binary64 (log (- (* x 2.0) (/ 0.5 x))))
double code(double x) {
	return log((x + sqrt(((x * x) - 1.0))));
}
↓
double code(double x) {
	return log(((x * 2.0) - (0.5 / x)));
}

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

public static double code(double x) {
	return Math.log((x + Math.sqrt(((x * x) - 1.0))));
}
↓
public static double code(double x) {
	return Math.log(((x * 2.0) - (0.5 / x)));
}

def code(x):
	return math.log((x + math.sqrt(((x * x) - 1.0))))
↓
def code(x):
	return math.log(((x * 2.0) - (0.5 / x)))

function code(x)
	return log(Float64(x + sqrt(Float64(Float64(x * x) - 1.0))))
end
↓
function code(x)
	return log(Float64(Float64(x * 2.0) - Float64(0.5 / x)))
end

function tmp = code(x)
	tmp = log((x + sqrt(((x * x) - 1.0))));
end
↓
function tmp = code(x)
	tmp = log(((x * 2.0) - (0.5 / x)));
end

code[x_] := N[Log[N[(x + N[Sqrt[N[(N[(x * x), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
↓
code[x_] := N[Log[N[(N[(x * 2.0), $MachinePrecision] - N[(0.5 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

\log \left(x + \sqrt{x \cdot x - 1}\right)
↓
\log \left(x \cdot 2 - \frac{0.5}{x}\right)

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Herbie found 3 alternatives:

AlternativeAccuracySpeedup

Accuracy vs Speed

The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original51.3%
Target99.9%
Herbie99.5%
\[\log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right) \]

Derivation?

  1. Initial program 49.3%

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

  2. Taylor expanded in x around inf 99.7%

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

  3. Simplified99.7%

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

  4. Final simplification99.7%

    \[\leadsto \log \left(x \cdot 2 - \frac{0.5}{x}\right) \]

Alternatives

Alternative 1
Accuracy99.5%
Cost6848
\[\log \left(x + \left(x - \frac{0.5}{x}\right)\right) \]
Alternative 2
Accuracy99.0%
Cost6592
\[\log \left(x + x\right) \]

Reproduce?

herbie shell --seed 2023161 
(FPCore (x)
  :name "Rust f64::acosh"
  :precision binary64
  :pre (>= x 1.0)

  :herbie-target
  (log (+ x (* (sqrt (- x 1.0)) (sqrt (+ x 1.0)))))

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