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

real(8) function im_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    im_sqr = (re * im) + (im * re)
end function
↓
real(8) function im_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    im_sqr = im * (re + re)
end function

public static double im_sqr(double re, double im) {
	return (re * im) + (im * re);
}
↓
public static double im_sqr(double re, double im) {
	return im * (re + re);
}

def im_sqr(re, im):
	return (re * im) + (im * re)
↓
def im_sqr(re, im):
	return im * (re + re)

function im_sqr(re, im)
	return Float64(Float64(re * im) + Float64(im * re))
end
↓
function im_sqr(re, im)
	return Float64(im * Float64(re + re))
end

function tmp = im_sqr(re, im)
	tmp = (re * im) + (im * re);
end
↓
function tmp = im_sqr(re, im)
	tmp = im * (re + re);
end

im$95$sqr[re_, im_] := N[(N[(re * im), $MachinePrecision] + N[(im * re), $MachinePrecision]), $MachinePrecision]
↓
im$95$sqr[re_, im_] := N[(im * N[(re + re), $MachinePrecision]), $MachinePrecision]

re \cdot im + im \cdot re
↓
im \cdot \left(re + re\right)

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 im + im \cdot re \]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2022150 
(FPCore im_sqr (re im)
  :name "math.square on complex, imaginary part"
  :precision binary64
  (+ (* re im) (* im re)))