| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 576 |
\[x \cdot x + x \cdot \left(x \cdot x\right)
\]

(FPCore (x) :precision binary64 (+ (* x (* x x)) (* x x)))
(FPCore (x) :precision binary64 (fma x x (* x (* x x))))
double code(double x) {
return (x * (x * x)) + (x * x);
}
double code(double x) {
return fma(x, x, (x * (x * x)));
}
function code(x) return Float64(Float64(x * Float64(x * x)) + Float64(x * x)) end
function code(x) return fma(x, x, Float64(x * Float64(x * x))) end
code[x_] := N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]
code[x_] := N[(x * x + N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
x \cdot \left(x \cdot x\right) + x \cdot x
\mathsf{fma}\left(x, x, x \cdot \left(x \cdot x\right)\right)
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
| Original | 100.0% |
|---|---|
| Target | 100.0% |
| Herbie | 100.0% |
Initial program 100.0%
Taylor expanded in x around 0 100.0%
Simplified100.0%
[Start]100.0 | \[ {x}^{2} + {x}^{3}
\] |
|---|---|
unpow2 [=>]100.0 | \[ \color{blue}{x \cdot x} + {x}^{3}
\] |
fma-udef [<=]100.0 | \[ \color{blue}{\mathsf{fma}\left(x, x, {x}^{3}\right)}
\] |
Applied egg-rr100.0%
[Start]100.0 | \[ \mathsf{fma}\left(x, x, {x}^{3}\right)
\] |
|---|---|
unpow3 [=>]100.0 | \[ \mathsf{fma}\left(x, x, \color{blue}{\left(x \cdot x\right) \cdot x}\right)
\] |
Final simplification100.0%
| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 576 |
| Alternative 2 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 448 |
| Alternative 3 | |
|---|---|
| Accuracy | 97.8% |
| Cost | 192 |
herbie shell --seed 2023160
(FPCore (x)
:name "Expression 3, p15"
:precision binary64
:pre (and (<= 0.0 x) (<= x 2.0))
:herbie-target
(* (* (+ 1.0 x) x) x)
(+ (* x (* x x)) (* x x)))