Average Error: 0.0 → 0.0
Time: 1.2s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[\mathsf{fma}\left(200, x, 200 \cdot \left(-y\right)\right)\]
200 \cdot \left(x - y\right)
↓
\mathsf{fma}\left(200, x, 200 \cdot \left(-y\right)\right)
double code(double x, double y) {
	return (200.0 * (x - y));
}
↓
double code(double x, double y) {
	return fma(200.0, x, (200.0 * -y));
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[200 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{200 \cdot x + 200 \cdot \left(-y\right)}\]
  5. Using strategy rm

  6. Applied fma-def0.0

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

  7. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(200, x, 200 \cdot \left(-y\right)\right)\]

Reproduce

herbie shell --seed 2020102 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200 (- x y)))