Average Error: 4.1 → 4.1
Time: 1.5s
Precision: binary64
\[z + \alpha \cdot \left(\left(R + \gamma \cdot t\right) - z\right)\]
↓
\[z + \alpha \cdot \left(\left(R + \gamma \cdot t\right) - z\right)\]
z + \alpha \cdot \left(\left(R + \gamma \cdot t\right) - z\right)
↓
z + \alpha \cdot \left(\left(R + \gamma \cdot t\right) - z\right)
double code(double z, double alpha, double R, double gamma, double t) {
	return ((double) (z + ((double) (alpha * ((double) (((double) (R + ((double) (gamma * t)))) - z))))));
}
↓
double code(double z, double alpha, double R, double gamma, double t) {
	return ((double) (z + ((double) (alpha * ((double) (((double) (R + ((double) (gamma * t)))) - z))))));
}

Error

Bits error versus z

Bits error versus alpha

Bits error versus R

Bits error versus gamma

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 4.1

    \[z + \alpha \cdot \left(\left(R + \gamma \cdot t\right) - z\right)\]

  2. Final simplification4.1

    \[\leadsto z + \alpha \cdot \left(\left(R + \gamma \cdot t\right) - z\right)\]

Reproduce

herbie shell --seed 2020153 
(FPCore (z alpha R gamma t)
  :name "(+ z (* alpha (- (+ R (* gamma t)) z)))"
  :precision binary64
  (+ z (* alpha (- (+ R (* gamma t)) z))))