Average Error: 0.0 → 0.0
Time: 1.6s
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 r2112091 = x;
        double r2112092 = r2112091 * r2112091;
        double r2112093 = 2.0;
        double r2112094 = r2112092 * r2112093;
        double r2112095 = 1.0;
        double r2112096 = r2112094 - r2112095;
        return r2112096;
}
↓
double f(double x) {
        double r2112097 = 2.0;
        double r2112098 = x;
        double r2112099 = r2112098 * r2112098;
        double r2112100 = r2112097 * r2112099;
        double r2112101 = 1.0;
        double r2112102 = r2112100 - r2112101;
        return r2112102;
}

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 2019165 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  (- (* (* x x) 2.0) 1.0))