Rust f64::acosh

?

Percentage Accurate: 50.7% → 99.4%
Time: 1.6s
Precision: binary64
Cost: 6848

?

\[x \geq 1\]
\[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
↓
\[\log \left(x + \left(x - \frac{0.5}{x}\right)\right) \]
(FPCore (x) :precision binary64 (log (+ x (sqrt (- (* x x) 1.0)))))
↓
(FPCore (x) :precision binary64 (log (+ x (- x (/ 0.5 x)))))
double code(double x) {
	return log((x + sqrt(((x * x) - 1.0))));
}
↓
double code(double x) {
	return log((x + (x - (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 + (x - (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 + (x - (0.5 / x))));
}

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

function code(x)
	return log(Float64(x + sqrt(Float64(Float64(x * x) - 1.0))))
end
↓
function code(x)
	return log(Float64(x + Float64(x - 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 + (x - (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[(x + N[(x - N[(0.5 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

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

Local Percentage Accuracy?

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.

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original50.7%
Target99.9%
Herbie99.4%
\[\log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right) \]

Derivation?

  1. Initial program 51.2%

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

  2. Taylor expanded in x around inf 100.0%

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

  3. Simplified100.0%

    \[\leadsto \log \left(x + \color{blue}{\left(x - \frac{0.5}{x}\right)}\right) \]
    Step-by-step derivation

    [Start]100.0

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

    associate-*r/ [=>]100.0

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

    metadata-eval [=>]100.0

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

  4. Final simplification100.0%

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

Alternatives

Alternative 1
Accuracy98.9%
Cost6592
\[\log \left(x + x\right) \]

Error

Reproduce?

herbie shell --seed 2023160 
(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)))))