Average Error: 5.7 → 5.7
Time: 1.7s
Precision: binary64
\[\left(beta2 \cdot {x}^{2} + beta1 \cdot x2\right) + beta0\]
↓
\[\left(beta2 \cdot {x}^{2} + beta1 \cdot x2\right) + beta0\]
\left(beta2 \cdot {x}^{2} + beta1 \cdot x2\right) + beta0
↓
\left(beta2 \cdot {x}^{2} + beta1 \cdot x2\right) + beta0
double code(double beta2, double x, double beta1, double x2, double beta0) {
	return ((double) (((double) (((double) (beta2 * ((double) pow(x, 2.0)))) + ((double) (beta1 * x2)))) + beta0));
}
↓
double code(double beta2, double x, double beta1, double x2, double beta0) {
	return ((double) (((double) (((double) (beta2 * ((double) pow(x, 2.0)))) + ((double) (beta1 * x2)))) + beta0));
}

Error

Bits error versus beta2

Bits error versus x

Bits error versus beta1

Bits error versus x2

Bits error versus beta0

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 5.7

    \[\left(beta2 \cdot {x}^{2} + beta1 \cdot x2\right) + beta0\]

  2. Final simplification5.7

    \[\leadsto \left(beta2 \cdot {x}^{2} + beta1 \cdot x2\right) + beta0\]

Reproduce

herbie shell --seed 2020153 
(FPCore (beta2 x beta1 x2 beta0)
  :name "(+ (+ (* beta2 (pow x 2)) (* beta1 x2)) beta0)"
  :precision binary64
  (+ (+ (* beta2 (pow x 2.0)) (* beta1 x2)) beta0))