Average Error: 0.0 → 0.0
Time: 896.0ms
Precision: binary64
\[A + \alpha \cdot \left(B - A\right)\]
↓
\[A + \alpha \cdot \left(B - A\right)\]
A + \alpha \cdot \left(B - A\right)
↓
A + \alpha \cdot \left(B - A\right)
double code(double A, double alpha, double B) {
	return ((double) (A + ((double) (alpha * ((double) (B - A))))));
}
↓
double code(double A, double alpha, double B) {
	return ((double) (A + ((double) (alpha * ((double) (B - A))))));
}

Error

Bits error versus A

Bits error versus alpha

Bits error versus B

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[A + \alpha \cdot \left(B - A\right)\]

  2. Final simplification0.0

    \[\leadsto A + \alpha \cdot \left(B - A\right)\]

Reproduce

herbie shell --seed 2020153 
(FPCore (A alpha B)
  :name "(+ A (* alpha (- B A)))"
  :precision binary64
  (+ A (* alpha (- B A))))