| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 6592 |
\[\mathsf{fma}\left(y, -0.375, x\right)
\]

(FPCore (x y) :precision binary64 (- x (* (/ 3.0 8.0) y)))
(FPCore (x y) :precision binary64 (fma y -0.375 x))
double code(double x, double y) {
return x - ((3.0 / 8.0) * y);
}
double code(double x, double y) {
return fma(y, -0.375, x);
}
function code(x, y) return Float64(x - Float64(Float64(3.0 / 8.0) * y)) end
function code(x, y) return fma(y, -0.375, x) end
code[x_, y_] := N[(x - N[(N[(3.0 / 8.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]
code[x_, y_] := N[(y * -0.375 + x), $MachinePrecision]
x - \frac{3}{8} \cdot y
\mathsf{fma}\left(y, -0.375, x\right)
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
Initial program 99.8%
Simplified100.0%
[Start]99.8% | \[ x - \frac{3}{8} \cdot y
\] |
|---|---|
sub-neg [=>]99.8% | \[ \color{blue}{x + \left(-\frac{3}{8} \cdot y\right)}
\] |
+-commutative [=>]99.8% | \[ \color{blue}{\left(-\frac{3}{8} \cdot y\right) + x}
\] |
*-commutative [=>]99.8% | \[ \left(-\color{blue}{y \cdot \frac{3}{8}}\right) + x
\] |
distribute-rgt-neg-in [=>]99.8% | \[ \color{blue}{y \cdot \left(-\frac{3}{8}\right)} + x
\] |
fma-def [=>]100.0% | \[ \color{blue}{\mathsf{fma}\left(y, -\frac{3}{8}, x\right)}
\] |
metadata-eval [=>]100.0% | \[ \mathsf{fma}\left(y, -\color{blue}{0.375}, x\right)
\] |
metadata-eval [=>]100.0% | \[ \mathsf{fma}\left(y, \color{blue}{-0.375}, x\right)
\] |
Final simplification100.0%
| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 6592 |
| Alternative 2 | |
|---|---|
| Accuracy | 71.8% |
| Cost | 456 |
| Alternative 3 | |
|---|---|
| Accuracy | 99.9% |
| Cost | 320 |
| Alternative 4 | |
|---|---|
| Accuracy | 50.6% |
| Cost | 64 |
herbie shell --seed 2023271
(FPCore (x y)
:name "Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, A"
:precision binary64
(- x (* (/ 3.0 8.0) y)))