Average Error: 2.0 → 0.1
Time: 1.7m
Precision: 64
Internal Precision: 128
\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}\]
↓
\[\begin{array}{l} \mathbf{if}\;k \le 3.56820817425161 \cdot 10^{+22}:\\ \;\;\;\;\left(\left({\left(\sqrt[3]{k}\right)}^{m} \cdot a\right) \cdot {\left(\sqrt[3]{k} \cdot \sqrt[3]{k}\right)}^{m}\right) \cdot \frac{1}{(\left(10 + k\right) \cdot k + 1)_*}\\ \mathbf{else}:\\ \;\;\;\;(\left(\frac{99}{k \cdot k}\right) \cdot \left(\frac{e^{\log k \cdot m} \cdot \frac{a}{k}}{k}\right) + \left(\frac{\frac{e^{\log k \cdot m} \cdot \frac{a}{k}}{k}}{k} \cdot -10\right))_* + \frac{e^{\log k \cdot m} \cdot \frac{a}{k}}{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 < 3.56820817425161e+22

    1. Initial program 0.1

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

    2. Simplified0.0

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

    4. Applied add-cube-cbrt0.0

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

    5. Applied unpow-prod-down0.0

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

    6. Applied associate-*l*0.0

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

    8. Applied div-inv0.0

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

    if 3.56820817425161e+22 < k

    1. Initial program 5.6

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

    2. Simplified5.6

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

    3. Taylor expanded around -inf 62.9

      \[\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}}}\]

    4. Simplified0.1

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

  4. Final simplification0.1

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

Reproduce

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