Falkner and Boettcher, Appendix A

?

Percentage Accurate: 100.0% → 100.0%
Time: 27.5s
Precision: binary64
Cost: 13440

?

\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]
↓
\[{k}^{m} \cdot \frac{a}{\mathsf{fma}\left(k, k + 10, 1\right)} \]
(FPCore (a k m)
 :precision binary64
 (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))
↓
(FPCore (a k m) :precision binary64 (* (pow k m) (/ a (fma k (+ k 10.0) 1.0))))
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) {
	return pow(k, m) * (a / fma(k, (k + 10.0), 1.0));
}

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)
	return Float64((k ^ m) * Float64(a / fma(k, Float64(k + 10.0), 1.0)))
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_] := N[(N[Power[k, m], $MachinePrecision] * N[(a / N[(k * N[(k + 10.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}
↓
{k}^{m} \cdot \frac{a}{\mathsf{fma}\left(k, k + 10, 1\right)}

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.

Herbie found 11 alternatives:

AlternativeAccuracySpeedup

Accuracy vs Speed

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.

Bogosity?

Bogosity

Derivation?

  1. Initial program 100.0%

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

  2. Simplified100.0%

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

    [Start]100.0%

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

    *-commutative [=>]100.0%

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

    associate-*r/ [<=]100.0%

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

    associate-+l+ [=>]100.0%

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

    +-commutative [=>]100.0%

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

    distribute-rgt-out [=>]100.0%

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

    fma-def [=>]100.0%

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

    +-commutative [=>]100.0%

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

  3. Final simplification100.0%

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

Alternatives

Alternative 1
Accuracy100.0%
Cost13440
\[{k}^{m} \cdot \frac{a}{\mathsf{fma}\left(k, k + 10, 1\right)} \]
Alternative 2
Accuracy100.0%
Cost7296
\[\frac{{k}^{m} \cdot a}{\left(1 + k \cdot 10\right) + k \cdot k} \]
Alternative 3
Accuracy99.1%
Cost7172
\[\begin{array}{l} \mathbf{if}\;k \leq 0.076:\\ \;\;\;\;{k}^{m} \cdot \left(a + -10 \cdot \left(k \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;{k}^{m} \cdot \frac{a}{k \cdot \left(k + 10\right)}\\ \end{array} \]
Alternative 4
Accuracy97.7%
Cost6656
\[{k}^{m} \cdot a \]
Alternative 5
Accuracy62.1%
Cost840
\[\begin{array}{l} \mathbf{if}\;m \leq -0.155:\\ \;\;\;\;a \cdot \frac{1}{k \cdot k}\\ \mathbf{elif}\;m \leq 0.49:\\ \;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]
Alternative 6
Accuracy60.5%
Cost712
\[\begin{array}{l} \mathbf{if}\;m \leq -0.225:\\ \;\;\;\;a \cdot \frac{1}{k \cdot k}\\ \mathbf{elif}\;m \leq 0.47:\\ \;\;\;\;\frac{a}{1 + k \cdot 10}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]
Alternative 7
Accuracy44.3%
Cost584
\[\begin{array}{l} \mathbf{if}\;m \leq -0.155:\\ \;\;\;\;a \cdot \frac{0.1}{k}\\ \mathbf{elif}\;m \leq 0.43:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]
Alternative 8
Accuracy59.7%
Cost584
\[\begin{array}{l} \mathbf{if}\;m \leq -0.235:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;m \leq 0.3:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]
Alternative 9
Accuracy60.1%
Cost584
\[\begin{array}{l} \mathbf{if}\;m \leq -0.29:\\ \;\;\;\;a \cdot \frac{1}{k \cdot k}\\ \mathbf{elif}\;m \leq 0.47:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]
Alternative 10
Accuracy41.1%
Cost452
\[\begin{array}{l} \mathbf{if}\;m \leq 0.27:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]
Alternative 11
Accuracy34.1%
Cost64
\[a \]

Reproduce?

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