_multiplyComplex, imaginary part

Percentage Accurate: 99.3% → 99.7%

Time: 3.3s

Alternatives: 3

Speedup: 1.2×

• 23.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x.re \cdot y.im + x.im \cdot y.re \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (+ (* x.re y.im) (* x.im y.re)))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return (x_46_re * y_46_im) + (x_46_im * y_46_re);
}

Fortran

real(8) function code(x_46re, x_46im, y_46re, y_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    code = (x_46re * y_46im) + (x_46im * y_46re)
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return (x_46_re * y_46_im) + (x_46_im * y_46_re);
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	return (x_46_re * y_46_im) + (x_46_im * y_46_re)

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return Float64(Float64(x_46_re * y_46_im) + Float64(x_46_im * y_46_re))
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = (x_46_re * y_46_im) + (x_46_im * y_46_re);
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(N[(x$46$re * y$46$im), $MachinePrecision] + N[(x$46$im * y$46$re), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x.re \cdot y.im + x.im \cdot y.re \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (+ (* x.re y.im) (* x.im y.re)))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return (x_46_re * y_46_im) + (x_46_im * y_46_re);
}

Fortran

real(8) function code(x_46re, x_46im, y_46re, y_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    code = (x_46re * y_46im) + (x_46im * y_46re)
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return (x_46_re * y_46_im) + (x_46_im * y_46_re);
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	return (x_46_re * y_46_im) + (x_46_im * y_46_re)

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return Float64(Float64(x_46_re * y_46_im) + Float64(x_46_im * y_46_re))
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = (x_46_re * y_46_im) + (x_46_im * y_46_re);
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(N[(x$46$re * y$46$im), $MachinePrecision] + N[(x$46$im * y$46$re), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y.re, x.im, x.re \cdot y.im\right) \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (fma y.re x.im (* x.re y.im)))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return fma(y_46_re, x_46_im, (x_46_re * y_46_im));
}

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return fma(y_46_re, x_46_im, Float64(x_46_re * y_46_im))
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(y$46$re * x$46$im + N[(x$46$re * y$46$im), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[x.re \cdot y.im + x.im \cdot y.re \]
2. Add Preprocessing
3. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{x.im \cdot y.re + x.re \cdot y.im} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{y.re \cdot x.im} + x.re \cdot y.im \]

   3. accelerator-lowering-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(y.re, x.im, x.re \cdot y.im\right)} \]

   4. *-lowering-*.f64 100.0

      \[\leadsto \mathsf{fma}\left(y.re, x.im, \color{blue}{x.re \cdot y.im}\right) \]

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y.re, x.im, x.re \cdot y.im\right)} \]
5. Add Preprocessing

Alternative 2: 76.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.re \cdot x.im \leq -2000000000000:\\ \;\;\;\;y.re \cdot x.im\\ \mathbf{elif}\;y.re \cdot x.im \leq 4.9 \cdot 10^{-116}:\\ \;\;\;\;x.re \cdot y.im\\ \mathbf{else}:\\ \;\;\;\;y.re \cdot x.im\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (<= (* y.re x.im) -2000000000000.0)
   (* y.re x.im)
   (if (<= (* y.re x.im) 4.9e-116) (* x.re y.im) (* y.re x.im))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double tmp;
	if ((y_46_re * x_46_im) <= -2000000000000.0) {
		tmp = y_46_re * x_46_im;
	} else if ((y_46_re * x_46_im) <= 4.9e-116) {
		tmp = x_46_re * y_46_im;
	} else {
		tmp = y_46_re * x_46_im;
	}
	return tmp;
}

Fortran

real(8) function code(x_46re, x_46im, y_46re, y_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    real(8) :: tmp
    if ((y_46re * x_46im) <= (-2000000000000.0d0)) then
        tmp = y_46re * x_46im
    else if ((y_46re * x_46im) <= 4.9d-116) then
        tmp = x_46re * y_46im
    else
        tmp = y_46re * x_46im
    end if
    code = tmp
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double tmp;
	if ((y_46_re * x_46_im) <= -2000000000000.0) {
		tmp = y_46_re * x_46_im;
	} else if ((y_46_re * x_46_im) <= 4.9e-116) {
		tmp = x_46_re * y_46_im;
	} else {
		tmp = y_46_re * x_46_im;
	}
	return tmp;
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	tmp = 0
	if (y_46_re * x_46_im) <= -2000000000000.0:
		tmp = y_46_re * x_46_im
	elif (y_46_re * x_46_im) <= 4.9e-116:
		tmp = x_46_re * y_46_im
	else:
		tmp = y_46_re * x_46_im
	return tmp

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = 0.0
	if (Float64(y_46_re * x_46_im) <= -2000000000000.0)
		tmp = Float64(y_46_re * x_46_im);
	elseif (Float64(y_46_re * x_46_im) <= 4.9e-116)
		tmp = Float64(x_46_re * y_46_im);
	else
		tmp = Float64(y_46_re * x_46_im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = 0.0;
	if ((y_46_re * x_46_im) <= -2000000000000.0)
		tmp = y_46_re * x_46_im;
	elseif ((y_46_re * x_46_im) <= 4.9e-116)
		tmp = x_46_re * y_46_im;
	else
		tmp = y_46_re * x_46_im;
	end
	tmp_2 = tmp;
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[LessEqual[N[(y$46$re * x$46$im), $MachinePrecision], -2000000000000.0], N[(y$46$re * x$46$im), $MachinePrecision], If[LessEqual[N[(y$46$re * x$46$im), $MachinePrecision], 4.9e-116], N[(x$46$re * y$46$im), $MachinePrecision], N[(y$46$re * x$46$im), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x.im y.re) < -2e12 or 4.89999999999999977e-116 < (*.f64 x.im y.re)

   1. Initial program 99.3%

      \[x.re \cdot y.im + x.im \cdot y.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{x.im \cdot y.re} \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 75.6

         \[\leadsto \color{blue}{x.im \cdot y.re} \]

   5. Simplified 75.6%

      \[\leadsto \color{blue}{x.im \cdot y.re} \]

   if -2e12 < (*.f64 x.im y.re) < 4.89999999999999977e-116

   1. Initial program 100.0%

      \[x.re \cdot y.im + x.im \cdot y.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around inf

      \[\leadsto \color{blue}{x.re \cdot y.im} \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 81.1

         \[\leadsto \color{blue}{x.re \cdot y.im} \]

   5. Simplified 81.1%

      \[\leadsto \color{blue}{x.re \cdot y.im} \]
3. Recombined 2 regimes into one program.

4. Final simplification 78.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \cdot x.im \leq -2000000000000:\\ \;\;\;\;y.re \cdot x.im\\ \mathbf{elif}\;y.re \cdot x.im \leq 4.9 \cdot 10^{-116}:\\ \;\;\;\;x.re \cdot y.im\\ \mathbf{else}:\\ \;\;\;\;y.re \cdot x.im\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 52.7% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ y.re \cdot x.im \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im) :precision binary64 (* y.re x.im))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return y_46_re * x_46_im;
}

Fortran

real(8) function code(x_46re, x_46im, y_46re, y_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    code = y_46re * x_46im
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return y_46_re * x_46_im;
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	return y_46_re * x_46_im

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return Float64(y_46_re * x_46_im)
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = y_46_re * x_46_im;
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(y$46$re * x$46$im), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[x.re \cdot y.im + x.im \cdot y.re \]
2. Add Preprocessing

3. Taylor expanded in x.re around 0

   \[\leadsto \color{blue}{x.im \cdot y.re} \]
4. Step-by-step derivation

   1. *-lowering-*.f64 52.2

      \[\leadsto \color{blue}{x.im \cdot y.re} \]

5. Simplified 52.2%

   \[\leadsto \color{blue}{x.im \cdot y.re} \]

6. Final simplification 52.2%

   \[\leadsto y.re \cdot x.im \]
7. Add Preprocessing

Reproduce

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