Average Error: 0.0 → 0.0
Time: 2.4s
Precision: 64
\[\left(x \cdot x\right) \cdot 2.0 - 1.0\]
↓
\[2.0 \cdot \left(x \cdot x\right) - 1.0\]
\left(x \cdot x\right) \cdot 2.0 - 1.0
↓
2.0 \cdot \left(x \cdot x\right) - 1.0
double f(double x) {
        double r2986632 = x;
        double r2986633 = r2986632 * r2986632;
        double r2986634 = 2.0;
        double r2986635 = r2986633 * r2986634;
        double r2986636 = 1.0;
        double r2986637 = r2986635 - r2986636;
        return r2986637;
}
↓
double f(double x) {
        double r2986638 = 2.0;
        double r2986639 = x;
        double r2986640 = r2986639 * r2986639;
        double r2986641 = r2986638 * r2986640;
        double r2986642 = 1.0;
        double r2986643 = r2986641 - r2986642;
        return r2986643;
}

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.0 - 1.0\]

  2. Final simplification0.0

    \[\leadsto 2.0 \cdot \left(x \cdot x\right) - 1.0\]

Reproduce

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