Average Error: 0.0 → 0.0
Time: 884.0ms
Precision: binary64
\[\mathsf{fma}\left(a, a, b \cdot b\right)\]
↓
\[\mathsf{fma}\left(a, a, b \cdot b\right)\]
\mathsf{fma}\left(a, a, b \cdot b\right)
↓
\mathsf{fma}\left(a, a, b \cdot b\right)
double code(double a, double b) {
	return ((double) fma(a, a, ((double) (b * b))));
}
↓
double code(double a, double b) {
	return ((double) fma(a, a, ((double) (b * b))));
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\mathsf{fma}\left(a, a, b \cdot b\right)\]

  2. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(a, a, b \cdot b\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (a b)
  :name "(fma a a (* b b))"
  :precision binary64
  (fma a a (* b b)))