Average Error: 26.0 → 26.2
Time: 2.7s
Precision: 64
\[\frac{x.im \cdot y.re - x.re \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im}\]
↓
\[\left(x.im \cdot y.re - x.re \cdot y.im\right) \cdot \frac{1}{y.re \cdot y.re + y.im \cdot y.im}\]
\frac{x.im \cdot y.re - x.re \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im}
↓
\left(x.im \cdot y.re - x.re \cdot y.im\right) \cdot \frac{1}{y.re \cdot y.re + y.im \cdot y.im}
double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return (((x_46_im * y_46_re) - (x_46_re * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im)));
}
↓
double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return (((x_46_im * y_46_re) - (x_46_re * y_46_im)) * (1.0 / ((y_46_re * y_46_re) + (y_46_im * y_46_im))));
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 26.0

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

  3. Applied div-inv26.2

    \[\leadsto \color{blue}{\left(x.im \cdot y.re - x.re \cdot y.im\right) \cdot \frac{1}{y.re \cdot y.re + y.im \cdot y.im}}\]

  4. Final simplification26.2

    \[\leadsto \left(x.im \cdot y.re - x.re \cdot y.im\right) \cdot \frac{1}{y.re \cdot y.re + y.im \cdot y.im}\]

Reproduce

herbie shell --seed 2020071 
(FPCore (x.re x.im y.re y.im)
  :name "_divideComplex, imaginary part"
  :precision binary64
  (/ (- (* x.im y.re) (* x.re y.im)) (+ (* y.re y.re) (* y.im y.im))))