| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 6720 |
\[\mathsf{fma}\left(x, y, z \cdot t\right)
\]
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
(FPCore (x y z t) :precision binary64 (fma z t (* y x)))
double code(double x, double y, double z, double t) {
return (x * y) + (z * t);
}
double code(double x, double y, double z, double t) {
return fma(z, t, (y * x));
}
function code(x, y, z, t) return Float64(Float64(x * y) + Float64(z * t)) end
function code(x, y, z, t) return fma(z, t, Float64(y * x)) end
code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]
code[x_, y_, z_, t_] := N[(z * t + N[(y * x), $MachinePrecision]), $MachinePrecision]
x \cdot y + z \cdot t
\mathsf{fma}\left(z, t, y \cdot x\right)
Initial program 100.0%
Simplified100.0%
[Start]100.0 | \[ x \cdot y + z \cdot t
\] |
|---|---|
fma-def [=>]100.0 | \[ \color{blue}{\mathsf{fma}\left(x, y, z \cdot t\right)}
\] |
Taylor expanded in x around 0 100.0%
Simplified100.0%
[Start]100.0 | \[ y \cdot x + t \cdot z
\] |
|---|---|
+-commutative [=>]100.0 | \[ \color{blue}{t \cdot z + y \cdot x}
\] |
*-commutative [<=]100.0 | \[ t \cdot z + \color{blue}{x \cdot y}
\] |
*-commutative [=>]100.0 | \[ \color{blue}{z \cdot t} + x \cdot y
\] |
fma-def [=>]100.0 | \[ \color{blue}{\mathsf{fma}\left(z, t, x \cdot y\right)}
\] |
*-commutative [=>]100.0 | \[ \mathsf{fma}\left(z, t, \color{blue}{y \cdot x}\right)
\] |
Final simplification100.0%
| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 6720 |
| Alternative 2 | |
|---|---|
| Accuracy | 65.3% |
| Cost | 456 |
| Alternative 3 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 448 |
| Alternative 4 | |
|---|---|
| Accuracy | 51.8% |
| Cost | 192 |
herbie shell --seed 2023129
(FPCore (x y z t)
:name "Linear.V2:$cdot from linear-1.19.1.3, A"
:precision binary64
(+ (* x y) (* z t)))