Average Error: 0.0 → 0.0
Time: 769.0ms
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[\mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)\]
x + y \cdot \left(z + x\right)
↓
\mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)
double code(double x, double y, double z) {
	return ((double) (x + ((double) (y * ((double) (z + x))))));
}
↓
double code(double x, double y, double z) {
	return ((double) fma(y, z, ((double) fma(y, x, x))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + y \cdot \left(z + x\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, z + x, x\right)}\]

  3. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{z \cdot y + \left(x + x \cdot y\right)}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)}\]

  5. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)\]

Reproduce

herbie shell --seed 2020123 +o rules:numerics
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))