Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[2 \cdot \left(x \cdot x\right) - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
2 \cdot \left(x \cdot x\right) - 1
double f(double x) {
        double r2193567 = x;
        double r2193568 = r2193567 * r2193567;
        double r2193569 = 2.0;
        double r2193570 = r2193568 * r2193569;
        double r2193571 = 1.0;
        double r2193572 = r2193570 - r2193571;
        return r2193572;
}
↓
double f(double x) {
        double r2193573 = 2.0;
        double r2193574 = x;
        double r2193575 = r2193574 * r2193574;
        double r2193576 = r2193573 * r2193575;
        double r2193577 = 1.0;
        double r2193578 = r2193576 - r2193577;
        return r2193578;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot x\right) \cdot 2 - 1\]

  2. Final simplification0.0

    \[\leadsto 2 \cdot \left(x \cdot x\right) - 1\]

Reproduce

herbie shell --seed 2019179 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  (- (* (* x x) 2.0) 1.0))