Average Error: 0.0 → 0.0
Time: 1.7s
Precision: binary64
\[re \cdot re - im \cdot im\]
↓
\[\left(im + re\right) \cdot \left(re - im\right)\]
re \cdot re - im \cdot im
↓
\left(im + re\right) \cdot \left(re - im\right)
(FPCore (re im) :precision binary64 (- (* re re) (* im im)))
↓
(FPCore (re im) :precision binary64 (* (+ im re) (- re im)))
double code(double re, double im) {
	return (re * re) - (im * im);
}
↓
double code(double re, double im) {
	return (im + re) * (re - im);
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[re \cdot re - im \cdot im\]
  2. Using strategy rm

  3. Applied difference-of-squares_binary640.0

    \[\leadsto \color{blue}{\left(re + im\right) \cdot \left(re - im\right)}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{\left(im + re\right)} \cdot \left(re - im\right)\]

  5. Final simplification0.0

    \[\leadsto \left(im + re\right) \cdot \left(re - im\right)\]

Alternatives

Reproduce

herbie shell --seed 2021118 
(FPCore (re im)
  :name "math.square on complex, real part"
  :precision binary64
  (- (* re re) (* im im)))