Average Error: 0.1 → 0.0
Time: 7.9s
Precision: binary64
\[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]
↓
\[\mathsf{fma}\left(x, y, \mathsf{fma}\left(z, \frac{t}{16}, \mathsf{fma}\left(a \cdot b, -0.25, c\right)\right)\right) \]
\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c
↓
\mathsf{fma}\left(x, y, \mathsf{fma}\left(z, \frac{t}{16}, \mathsf{fma}\left(a \cdot b, -0.25, c\right)\right)\right)

(FPCore (x y z t a b c)
 :precision binary64
 (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))
↓
(FPCore (x y z t a b c)
 :precision binary64
 (fma x y (fma z (/ t 16.0) (fma (* a b) -0.25 c))))
double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}
↓
double code(double x, double y, double z, double t, double a, double b, double c) {
	return fma(x, y, fma(z, (t / 16.0), fma((a * b), -0.25, c)));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Bits error versus c

Derivation

  1. Initial program 0.1

    \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, \mathsf{fma}\left(z, \frac{t}{16}, \mathsf{fma}\left(a \cdot b, -0.25, c\right)\right)\right)} \]

  3. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(x, y, \mathsf{fma}\left(z, \frac{t}{16}, \mathsf{fma}\left(a \cdot b, -0.25, c\right)\right)\right) \]

Reproduce

herbie shell --seed 2021280 
(FPCore (x y z t a b c)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, C"
  :precision binary64
  (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))