Average Error: 2.1 → 0.2
Time: 36.2s
Precision: 64
Internal Precision: 320
\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}\]
\[\begin{array}{l} \mathbf{if}\;k \le 1.7697243912197116 \cdot 10^{+38}:\\ \;\;\;\;\frac{1}{\sqrt[3]{(k \cdot \left(k + 10\right) + 1)_* \cdot \left((k \cdot \left(k + 10\right) + 1)_* \cdot (k \cdot \left(k + 10\right) + 1)_*\right)}} \cdot \left({k}^{m} \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;(\left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{{k}^{4}}{a}}\right) \cdot 99 + \left((\left(\frac{-10}{k}\right) \cdot \left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{k}{\frac{a}{k}}}\right) + \left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{k}{\frac{a}{k}}}\right))_*\right))_*\\ \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.7697243912197116e+38

    1. Initial program 0.0

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

      \[\leadsto \frac{{k}^{m} \cdot a}{(k \cdot \left(k + 10\right) + 1)_*}\]
    3. Using strategy rm
    4. Applied div-inv0.0

      \[\leadsto \color{blue}{\left({k}^{m} \cdot a\right) \cdot \frac{1}{(k \cdot \left(k + 10\right) + 1)_*}}\]
    5. Using strategy rm
    6. Applied add-cbrt-cube0.0

      \[\leadsto \left({k}^{m} \cdot a\right) \cdot \frac{1}{\color{blue}{\sqrt[3]{\left((k \cdot \left(k + 10\right) + 1)_* \cdot (k \cdot \left(k + 10\right) + 1)_*\right) \cdot (k \cdot \left(k + 10\right) + 1)_*}}}\]

    if 1.7697243912197116e+38 < k

    1. Initial program 6.1

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

      \[\leadsto \frac{{k}^{m} \cdot a}{(k \cdot \left(k + 10\right) + 1)_*}\]
    3. Using strategy rm
    4. Applied div-inv6.1

      \[\leadsto \color{blue}{\left({k}^{m} \cdot a\right) \cdot \frac{1}{(k \cdot \left(k + 10\right) + 1)_*}}\]
    5. Taylor expanded around -inf 63.0

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

      \[\leadsto \color{blue}{(\left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{{k}^{4}}{a}}\right) \cdot 99 + \left((\left(\frac{-10}{k}\right) \cdot \left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{k}{\frac{a}{k}}}\right) + \left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{k}{\frac{a}{k}}}\right))_*\right))_*}\]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.2

    \[\leadsto \begin{array}{l} \mathbf{if}\;k \le 1.7697243912197116 \cdot 10^{+38}:\\ \;\;\;\;\frac{1}{\sqrt[3]{(k \cdot \left(k + 10\right) + 1)_* \cdot \left((k \cdot \left(k + 10\right) + 1)_* \cdot (k \cdot \left(k + 10\right) + 1)_*\right)}} \cdot \left({k}^{m} \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;(\left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{{k}^{4}}{a}}\right) \cdot 99 + \left((\left(\frac{-10}{k}\right) \cdot \left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{k}{\frac{a}{k}}}\right) + \left(\frac{{\left(e^{m}\right)}^{\left(\log k\right)}}{\frac{k}{\frac{a}{k}}}\right))_*\right))_*\\ \end{array}\]

Runtime

Time bar (total: 36.2s)Debug logProfile

herbie shell --seed 2018252 +o rules:numerics
(FPCore (a k m)
  :name "Falkner and Boettcher, Appendix A"
  (/ (* a (pow k m)) (+ (+ 1 (* 10 k)) (* k k))))