Average Error: 2.1 → 0.1
Time: 6.9s
Precision: binary64
\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]
\[\begin{array}{l} \mathbf{if}\;k \leq 1.0742694774859784 \cdot 10^{+149}:\\ \;\;\;\;\frac{a \cdot {k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{k} \cdot \frac{{k}^{m}}{k}\\ \end{array} \]
(FPCore (a k m)
 :precision binary64
 (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))
(FPCore (a k m)
 :precision binary64
 (if (<= k 1.0742694774859784e+149)
   (/ (* a (pow k m)) (fma k (+ k 10.0) 1.0))
   (* (/ a k) (/ (pow k m) k))))
double code(double a, double k, double m) {
	return (a * pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}
double code(double a, double k, double m) {
	double tmp;
	if (k <= 1.0742694774859784e+149) {
		tmp = (a * pow(k, m)) / fma(k, (k + 10.0), 1.0);
	} else {
		tmp = (a / k) * (pow(k, m) / k);
	}
	return tmp;
}
function code(a, k, m)
	return Float64(Float64(a * (k ^ m)) / Float64(Float64(1.0 + Float64(10.0 * k)) + Float64(k * k)))
end
function code(a, k, m)
	tmp = 0.0
	if (k <= 1.0742694774859784e+149)
		tmp = Float64(Float64(a * (k ^ m)) / fma(k, Float64(k + 10.0), 1.0));
	else
		tmp = Float64(Float64(a / k) * Float64((k ^ m) / k));
	end
	return tmp
end
code[a_, k_, m_] := N[(N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + N[(10.0 * k), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
code[a_, k_, m_] := If[LessEqual[k, 1.0742694774859784e+149], N[(N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(k * N[(k + 10.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(a / k), $MachinePrecision] * N[(N[Power[k, m], $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]]
\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}
\begin{array}{l}
\mathbf{if}\;k \leq 1.0742694774859784 \cdot 10^{+149}:\\
\;\;\;\;\frac{a \cdot {k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}\\

\mathbf{else}:\\
\;\;\;\;\frac{a}{k} \cdot \frac{{k}^{m}}{k}\\


\end{array}

Error

Bits error versus a

Bits error versus k

Bits error versus m

Derivation

  1. Split input into 2 regimes
  2. if k < 1.0742694774859784e149

    1. Initial program 0.1

      \[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]
    2. Simplified0.1

      \[\leadsto \color{blue}{\frac{a \cdot {k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}} \]

    if 1.0742694774859784e149 < k

    1. Initial program 10.5

      \[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]
    2. Simplified10.5

      \[\leadsto \color{blue}{\frac{a \cdot {k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}} \]
    3. Taylor expanded in k around inf 10.5

      \[\leadsto \color{blue}{\frac{a \cdot e^{-1 \cdot \left(\log \left(\frac{1}{k}\right) \cdot m\right)}}{{k}^{2}}} \]
    4. Simplified0.1

      \[\leadsto \color{blue}{\frac{a}{k} \cdot \frac{{k}^{m}}{k}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;k \leq 1.0742694774859784 \cdot 10^{+149}:\\ \;\;\;\;\frac{a \cdot {k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{k} \cdot \frac{{k}^{m}}{k}\\ \end{array} \]

Reproduce

herbie shell --seed 2022153 
(FPCore (a k m)
  :name "Falkner and Boettcher, Appendix A"
  :precision binary64
  (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))