Average Error: 0.0 → 0.0
Time: 3.7s
Precision: binary64
\[x - \frac{y}{1 + \frac{x \cdot y}{2}}\]
↓
\[x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}\]
x - \frac{y}{1 + \frac{x \cdot y}{2}}
↓
x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}
(FPCore (x y) :precision binary64 (- x (/ y (+ 1.0 (/ (* x y) 2.0)))))
↓
(FPCore (x y) :precision binary64 (- x (/ y (+ 1.0 (/ y (/ 2.0 x))))))
double code(double x, double y) {
	return x - (y / (1.0 + ((x * y) / 2.0)));
}
↓
double code(double x, double y) {
	return x - (y / (1.0 + (y / (2.0 / x))));
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x - \frac{y}{1 + \frac{x \cdot y}{2}}\]
  2. Using strategy rm

  3. Applied div-inv_binary640.1

    \[\leadsto x - \color{blue}{y \cdot \frac{1}{1 + \frac{x \cdot y}{2}}}\]

  4. Simplified0.0

    \[\leadsto x - y \cdot \color{blue}{\frac{1}{1 + \frac{y}{\frac{2}{x}}}}\]
  5. Using strategy rm

  6. Applied un-div-inv_binary640.0

    \[\leadsto x - \color{blue}{\frac{y}{1 + \frac{y}{\frac{2}{x}}}}\]

  7. Final simplification0.0

    \[\leadsto x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}\]

Alternatives

Reproduce

herbie shell --seed 2021110 
(FPCore (x y)
  :name "Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, B"
  :precision binary64
  (- x (/ y (+ 1.0 (/ (* x y) 2.0)))))