Rust f32::acosh

Percentage Accurate: 53.6% → 98.8%
Time: 21.8s
Alternatives: 5
Speedup: 2.0×

Specification

?
\[x \geq 1\]
\[\begin{array}{l} \\ \cosh^{-1} x \end{array} \]
(FPCore (x) :precision binary32 (acosh x))
float code(float x) {
	return acoshf(x);
}

function code(x)
	return acosh(x)
end

function tmp = code(x)
	tmp = acosh(x);
end

\begin{array}{l}

\\
\cosh^{-1} x
\end{array}

Sampling outcomes in binary32 precision:

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.

Accuracy vs Speed?

Herbie found 5 alternatives:

AlternativeAccuracySpeedup
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.

Initial Program: 53.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \log \left(x + \sqrt{x \cdot x - 1}\right) \end{array} \]
(FPCore (x) :precision binary32 (log (+ x (sqrt (- (* x x) 1.0)))))
float code(float x) {
	return logf((x + sqrtf(((x * x) - 1.0f))));
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log((x + sqrt(((x * x) - 1.0e0))))
end function

function code(x)
	return log(Float32(x + sqrt(Float32(Float32(x * x) - Float32(1.0)))))
end

function tmp = code(x)
	tmp = log((x + sqrt(((x * x) - single(1.0)))));
end

\begin{array}{l}

\\
\log \left(x + \sqrt{x \cdot x - 1}\right)
\end{array}

Alternative 1: 98.8% accurate, 1.7× speedup?

\[\begin{array}{l} \\ \log \left(\left(x + \frac{-0.125 + \frac{-0.0625}{x \cdot x}}{x \cdot \left(x \cdot x\right)}\right) + \left(x + \frac{-0.5}{x}\right)\right) \end{array} \]
(FPCore (x)
 :precision binary32
 (log
  (+ (+ x (/ (+ -0.125 (/ -0.0625 (* x x))) (* x (* x x)))) (+ x (/ -0.5 x)))))
float code(float x) {
	return logf(((x + ((-0.125f + (-0.0625f / (x * x))) / (x * (x * x)))) + (x + (-0.5f / x))));
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log(((x + (((-0.125e0) + ((-0.0625e0) / (x * x))) / (x * (x * x)))) + (x + ((-0.5e0) / x))))
end function

function code(x)
	return log(Float32(Float32(x + Float32(Float32(Float32(-0.125) + Float32(Float32(-0.0625) / Float32(x * x))) / Float32(x * Float32(x * x)))) + Float32(x + Float32(Float32(-0.5) / x))))
end

function tmp = code(x)
	tmp = log(((x + ((single(-0.125) + (single(-0.0625) / (x * x))) / (x * (x * x)))) + (x + (single(-0.5) / x))));
end

\begin{array}{l}

\\
\log \left(\left(x + \frac{-0.125 + \frac{-0.0625}{x \cdot x}}{x \cdot \left(x \cdot x\right)}\right) + \left(x + \frac{-0.5}{x}\right)\right)
\end{array}
Derivation

  1. Initial program 51.4%

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

  3. Taylor expanded in x around inf 0

    \[\leadsto expr\]

  5. Simplified0

    \[\leadsto expr\]

  7. Applied egg-rr0

    \[\leadsto expr\]
  8. Add Preprocessing

Alternative 2: 98.7% accurate, 1.8× speedup?

\[\begin{array}{l} \\ \log \left(x + \left(x + \frac{-0.5 + \frac{-0.125}{x \cdot x}}{x}\right)\right) \end{array} \]
(FPCore (x)
 :precision binary32
 (log (+ x (+ x (/ (+ -0.5 (/ -0.125 (* x x))) x)))))
float code(float x) {
	return logf((x + (x + ((-0.5f + (-0.125f / (x * x))) / x))));
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log((x + (x + (((-0.5e0) + ((-0.125e0) / (x * x))) / x))))
end function

function code(x)
	return log(Float32(x + Float32(x + Float32(Float32(Float32(-0.5) + Float32(Float32(-0.125) / Float32(x * x))) / x))))
end

function tmp = code(x)
	tmp = log((x + (x + ((single(-0.5) + (single(-0.125) / (x * x))) / x))));
end

\begin{array}{l}

\\
\log \left(x + \left(x + \frac{-0.5 + \frac{-0.125}{x \cdot x}}{x}\right)\right)
\end{array}
Derivation

  1. Initial program 51.4%

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

  3. Taylor expanded in x around inf 0

    \[\leadsto expr\]

  5. Simplified0

    \[\leadsto expr\]
  6. Add Preprocessing

Alternative 3: 98.3% accurate, 1.9× speedup?

\[\begin{array}{l} \\ \log \left(x \cdot 2 + \frac{-0.5}{x}\right) \end{array} \]
(FPCore (x) :precision binary32 (log (+ (* x 2.0) (/ -0.5 x))))
float code(float x) {
	return logf(((x * 2.0f) + (-0.5f / x)));
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log(((x * 2.0e0) + ((-0.5e0) / x)))
end function

function code(x)
	return log(Float32(Float32(x * Float32(2.0)) + Float32(Float32(-0.5) / x)))
end

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

\begin{array}{l}

\\
\log \left(x \cdot 2 + \frac{-0.5}{x}\right)
\end{array}
Derivation

  1. Initial program 51.4%

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

  3. Taylor expanded in x around inf 0

    \[\leadsto expr\]

  5. Simplified0

    \[\leadsto expr\]
  6. Add Preprocessing

Alternative 4: 96.9% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \log \left(x + x\right) \end{array} \]
(FPCore (x) :precision binary32 (log (+ x x)))
float code(float x) {
	return logf((x + x));
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log((x + x))
end function

function code(x)
	return log(Float32(x + x))
end

function tmp = code(x)
	tmp = log((x + x));
end

\begin{array}{l}

\\
\log \left(x + x\right)
\end{array}
Derivation

  1. Initial program 51.4%

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

  3. Taylor expanded in x around inf 0

    \[\leadsto expr\]

  5. Simplified0

    \[\leadsto expr\]
  6. Add Preprocessing

Alternative 5: 44.1% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \log x \end{array} \]
(FPCore (x) :precision binary32 (log x))
float code(float x) {
	return logf(x);
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log(x)
end function

function code(x)
	return log(x)
end

function tmp = code(x)
	tmp = log(x);
end

\begin{array}{l}

\\
\log x
\end{array}
Derivation

  1. Initial program 51.4%

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

  3. Taylor expanded in x around inf 0

    \[\leadsto expr\]

  5. Simplified0

    \[\leadsto expr\]

  6. Taylor expanded in x around 0 0

    \[\leadsto expr\]

  8. Simplified0

    \[\leadsto expr\]

  9. Taylor expanded in x around inf 0

    \[\leadsto expr\]

  11. Simplified0

    \[\leadsto expr\]
  12. Add Preprocessing

Developer target: 99.3% accurate, 0.7× speedup?

\[\begin{array}{l} \\ \log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right) \end{array} \]
(FPCore (x)
 :precision binary32
 (log (+ x (* (sqrt (- x 1.0)) (sqrt (+ x 1.0))))))
float code(float x) {
	return logf((x + (sqrtf((x - 1.0f)) * sqrtf((x + 1.0f)))));
}

real(4) function code(x)
    real(4), intent (in) :: x
    code = log((x + (sqrt((x - 1.0e0)) * sqrt((x + 1.0e0)))))
end function

function code(x)
	return log(Float32(x + Float32(sqrt(Float32(x - Float32(1.0))) * sqrt(Float32(x + Float32(1.0))))))
end

function tmp = code(x)
	tmp = log((x + (sqrt((x - single(1.0))) * sqrt((x + single(1.0))))));
end

\begin{array}{l}

\\
\log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right)
\end{array}

Reproduce

?
herbie shell --seed 2024110 
(FPCore (x)
  :name "Rust f32::acosh"
  :precision binary32
  :pre (>= x 1.0)

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

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