Average Error: 2.0 → 0.2
Time: 12.5s
Precision: binary64
Cost: 22024
\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]
↓
\[\begin{array}{l} t_0 := a \cdot {k}^{m}\\ t_1 := \frac{t_0}{\left(1 + k \cdot 10\right) + k \cdot k}\\ \mathbf{if}\;t_1 \leq -4 \cdot 10^{-320}:\\ \;\;\;\;a \cdot \frac{{k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}\\ \mathbf{elif}\;t_1 \leq 0:\\ \;\;\;\;\frac{1}{k \cdot \frac{k}{t_0}}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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
 (let* ((t_0 (* a (pow k m))) (t_1 (/ t_0 (+ (+ 1.0 (* k 10.0)) (* k k)))))
   (if (<= t_1 -4e-320)
     (* a (/ (pow k m) (fma k (+ k 10.0) 1.0)))
     (if (<= t_1 0.0) (/ 1.0 (* k (/ k t_0))) t_1))))
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 t_0 = a * pow(k, m);
	double t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	double tmp;
	if (t_1 <= -4e-320) {
		tmp = a * (pow(k, m) / fma(k, (k + 10.0), 1.0));
	} else if (t_1 <= 0.0) {
		tmp = 1.0 / (k * (k / t_0));
	} else {
		tmp = t_1;
	}
	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)
	t_0 = Float64(a * (k ^ m))
	t_1 = Float64(t_0 / Float64(Float64(1.0 + Float64(k * 10.0)) + Float64(k * k)))
	tmp = 0.0
	if (t_1 <= -4e-320)
		tmp = Float64(a * Float64((k ^ m) / fma(k, Float64(k + 10.0), 1.0)));
	elseif (t_1 <= 0.0)
		tmp = Float64(1.0 / Float64(k * Float64(k / t_0)));
	else
		tmp = t_1;
	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_] := Block[{t$95$0 = N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 / N[(N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-320], N[(a * N[(N[Power[k, m], $MachinePrecision] / N[(k * N[(k + 10.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(1.0 / N[(k * N[(k / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}
↓
\begin{array}{l}
t_0 := a \cdot {k}^{m}\\
t_1 := \frac{t_0}{\left(1 + k \cdot 10\right) + k \cdot k}\\
\mathbf{if}\;t_1 \leq -4 \cdot 10^{-320}:\\
\;\;\;\;a \cdot \frac{{k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}\\

\mathbf{elif}\;t_1 \leq 0:\\
\;\;\;\;\frac{1}{k \cdot \frac{k}{t_0}}\\

\mathbf{else}:\\
\;\;\;\;t_1\\


\end{array}

Error

Derivation

  1. Split input into 3 regimes

  2. if (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))) < -3.99996e-320

    1. Initial program 0.2

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

    2. Simplified0.1

      \[\leadsto \color{blue}{a \cdot \frac{{k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}} \]
      Proof
      (*.f64 a (/.f64 (pow.f64 k m) (fma.f64 k (+.f64 k 10) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (fma.f64 k (Rewrite<= +-commutative_binary64 (+.f64 10 k)) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= fma-def_binary64 (+.f64 (*.f64 k (+.f64 10 k)) 1)))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (+.f64 (Rewrite<= distribute-rgt-out_binary64 (+.f64 (*.f64 10 k) (*.f64 k k))) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= +-commutative_binary64 (+.f64 1 (+.f64 (*.f64 10 k) (*.f64 k k)))))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= associate-+l+_binary64 (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))))): 0 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k)))): 5 points increase in error, 6 points decrease in error

    if -3.99996e-320 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))) < 0.0

    1. Initial program 2.9

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

    2. Simplified2.9

      \[\leadsto \color{blue}{a \cdot \frac{{k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}} \]
      Proof
      (*.f64 a (/.f64 (pow.f64 k m) (fma.f64 k (+.f64 k 10) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (fma.f64 k (Rewrite<= +-commutative_binary64 (+.f64 10 k)) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= fma-def_binary64 (+.f64 (*.f64 k (+.f64 10 k)) 1)))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (+.f64 (Rewrite<= distribute-rgt-out_binary64 (+.f64 (*.f64 10 k) (*.f64 k k))) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= +-commutative_binary64 (+.f64 1 (+.f64 (*.f64 10 k) (*.f64 k k)))))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= associate-+l+_binary64 (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))))): 0 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k)))): 5 points increase in error, 6 points decrease in error

    3. Applied egg-rr2.9

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

    4. Taylor expanded in k around inf 32.5

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

    5. Simplified0.2

      \[\leadsto \frac{1}{\color{blue}{\frac{k}{{k}^{m} \cdot a} \cdot k}} \]
      Proof
      (*.f64 (/.f64 k (*.f64 (pow.f64 k m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (Rewrite<= rem-exp-log_binary64 (exp.f64 (log.f64 k))) m) a)) k): 0 points increase in error, 1 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (exp.f64 (Rewrite<= remove-double-neg_binary64 (neg.f64 (neg.f64 (log.f64 k))))) m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (exp.f64 (neg.f64 (Rewrite<= log-rec_binary64 (log.f64 (/.f64 1 k))))) m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (exp.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (log.f64 (/.f64 1 k))))) m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (Rewrite<= exp-prod_binary64 (exp.f64 (*.f64 (*.f64 -1 (log.f64 (/.f64 1 k))) m))) a)) k): 0 points increase in error, 1 points decrease in error
      (*.f64 (/.f64 k (*.f64 (exp.f64 (Rewrite<= associate-*r*_binary64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (Rewrite=> *-commutative_binary64 (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))))) k): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-/r/_binary64 (/.f64 k (/.f64 (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))) k))): 12 points increase in error, 12 points decrease in error
      (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 k k) (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))))): 18 points increase in error, 13 points decrease in error
      (/.f64 (Rewrite<= unpow2_binary64 (pow.f64 k 2)) (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m))))): 0 points increase in error, 0 points decrease in error
      (/.f64 (pow.f64 k 2) (Rewrite<= *-commutative_binary64 (*.f64 (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m))) a))): 0 points increase in error, 0 points decrease in error

    if 0.0 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k)))

    1. Initial program 0.3

      \[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]
  3. Recombined 3 regimes into one program.

  4. Final simplification0.2

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

Alternatives

Alternative 1
Error0.8
Cost7044
\[\begin{array}{l} \mathbf{if}\;k \leq 1:\\ \;\;\;\;a \cdot {k}^{m}\\ \mathbf{else}:\\ \;\;\;\;{k}^{m} \cdot \frac{\frac{a}{k}}{k}\\ \end{array} \]
Alternative 2
Error15.6
Cost1096
\[\begin{array}{l} \mathbf{if}\;m \leq -1.75 \cdot 10^{+19}:\\ \;\;\;\;\left(1 + \frac{a}{k \cdot k}\right) + -1\\ \mathbf{elif}\;m \leq 1.85 \cdot 10^{+34}:\\ \;\;\;\;\frac{1}{\frac{1}{a} + \left(k + 10\right) \cdot \frac{k}{a}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{a}{k} \cdot 0.1\right) + -1\\ \end{array} \]
Alternative 3
Error23.2
Cost712
\[\begin{array}{l} \mathbf{if}\;k \leq -0.075:\\ \;\;\;\;\frac{a}{k \cdot \left(k + 10\right)}\\ \mathbf{elif}\;k \leq 3.8 \cdot 10^{-6}:\\ \;\;\;\;\frac{a}{1 + k \cdot 10}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]
Alternative 4
Error46.4
Cost64
\[a \]

Error

Reproduce

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