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

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

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

  2. Simplified0.1

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

  3. Final simplification0.1

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

Reproduce

herbie shell --seed 2020113 +o rules:numerics
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))