| Alternative 1 | |
|---|---|
| Accuracy | 99.8% |
| Cost | 13120 |
\[0.5 \cdot \mathsf{fma}\left(y, \sqrt{z}, x\right)
\]

(FPCore (x y z) :precision binary64 (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))
(FPCore (x y z) :precision binary64 (* 0.5 (fma y (sqrt z) x)))
double code(double x, double y, double z) {
return (1.0 / 2.0) * (x + (y * sqrt(z)));
}
double code(double x, double y, double z) {
return 0.5 * fma(y, sqrt(z), x);
}
function code(x, y, z) return Float64(Float64(1.0 / 2.0) * Float64(x + Float64(y * sqrt(z)))) end
function code(x, y, z) return Float64(0.5 * fma(y, sqrt(z), x)) end
code[x_, y_, z_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(x + N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
code[x_, y_, z_] := N[(0.5 * N[(y * N[Sqrt[z], $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
0.5 \cdot \mathsf{fma}\left(y, \sqrt{z}, x\right)
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
Initial program 99.8%
Simplified99.9%
[Start]99.8% | \[ \frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
\] |
|---|---|
metadata-eval [=>]99.8% | \[ \color{blue}{0.5} \cdot \left(x + y \cdot \sqrt{z}\right)
\] |
+-commutative [=>]99.8% | \[ 0.5 \cdot \color{blue}{\left(y \cdot \sqrt{z} + x\right)}
\] |
fma-def [=>]99.9% | \[ 0.5 \cdot \color{blue}{\mathsf{fma}\left(y, \sqrt{z}, x\right)}
\] |
Final simplification99.9%
| Alternative 1 | |
|---|---|
| Accuracy | 99.8% |
| Cost | 13120 |
| Alternative 2 | |
|---|---|
| Accuracy | 74.6% |
| Cost | 20041 |
| Alternative 3 | |
|---|---|
| Accuracy | 99.8% |
| Cost | 6848 |
| Alternative 4 | |
|---|---|
| Accuracy | 51.2% |
| Cost | 192 |
herbie shell --seed 2023171
(FPCore (x y z)
:name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
:precision binary64
(* (/ 1.0 2.0) (+ x (* y (sqrt z)))))