Average Error: 0.0 → 0.0
Time: 4.0s
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 r1109943 = x;
        double r1109944 = r1109943 * r1109943;
        double r1109945 = 2.0;
        double r1109946 = r1109944 * r1109945;
        double r1109947 = 1.0;
        double r1109948 = r1109946 - r1109947;
        return r1109948;
}
↓
double f(double x) {
        double r1109949 = 2.0;
        double r1109950 = x;
        double r1109951 = r1109950 * r1109950;
        double r1109952 = r1109949 * r1109951;
        double r1109953 = 1.0;
        double r1109954 = r1109952 - r1109953;
        return r1109954;
}

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