_multiplyComplex, imaginary part

Percentage Accurate: 99.3% → 99.5%

Time: 2.7s

Alternatives: 5

Speedup: 1.0×

• 24.0% 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.5% accurate, 0.1× 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.2%

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

   1. +-commutative 99.2%

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

   2. *-commutative 99.2%

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

   3. fma-def 99.6%

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

4. Applied egg-rr 99.6%

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

5. Final simplification 99.6%

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

Alternative 2: 99.8% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (fma 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) {
	return fma(x_46_re, y_46_im, (y_46_re * x_46_im));
}

Julia

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

   1. fma-def 99.6%

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

3. Simplified 99.6%

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

5. Final simplification 99.6%

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

Alternative 3: 74.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x.re \cdot y.im \leq -1.02 \cdot 10^{-22} \lor \neg \left(x.re \cdot y.im \leq 4 \cdot 10^{-57}\right) \land \left(x.re \cdot y.im \leq 1.4 \cdot 10^{+47} \lor \neg \left(x.re \cdot y.im \leq 3.8 \cdot 10^{+75}\right)\right):\\ \;\;\;\;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 (or (<= (* x.re y.im) -1.02e-22)
         (and (not (<= (* x.re y.im) 4e-57))
              (or (<= (* x.re y.im) 1.4e+47)
                  (not (<= (* x.re y.im) 3.8e+75)))))
   (* 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 (((x_46_re * y_46_im) <= -1.02e-22) || (!((x_46_re * y_46_im) <= 4e-57) && (((x_46_re * y_46_im) <= 1.4e+47) || !((x_46_re * y_46_im) <= 3.8e+75)))) {
		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 (((x_46re * y_46im) <= (-1.02d-22)) .or. (.not. ((x_46re * y_46im) <= 4d-57)) .and. ((x_46re * y_46im) <= 1.4d+47) .or. (.not. ((x_46re * y_46im) <= 3.8d+75))) 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 (((x_46_re * y_46_im) <= -1.02e-22) || (!((x_46_re * y_46_im) <= 4e-57) && (((x_46_re * y_46_im) <= 1.4e+47) || !((x_46_re * y_46_im) <= 3.8e+75)))) {
		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 ((x_46_re * y_46_im) <= -1.02e-22) or (not ((x_46_re * y_46_im) <= 4e-57) and (((x_46_re * y_46_im) <= 1.4e+47) or not ((x_46_re * y_46_im) <= 3.8e+75))):
		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(x_46_re * y_46_im) <= -1.02e-22) || (!(Float64(x_46_re * y_46_im) <= 4e-57) && ((Float64(x_46_re * y_46_im) <= 1.4e+47) || !(Float64(x_46_re * y_46_im) <= 3.8e+75))))
		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 (((x_46_re * y_46_im) <= -1.02e-22) || (~(((x_46_re * y_46_im) <= 4e-57)) && (((x_46_re * y_46_im) <= 1.4e+47) || ~(((x_46_re * y_46_im) <= 3.8e+75)))))
		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[Or[LessEqual[N[(x$46$re * y$46$im), $MachinePrecision], -1.02e-22], And[N[Not[LessEqual[N[(x$46$re * y$46$im), $MachinePrecision], 4e-57]], $MachinePrecision], Or[LessEqual[N[(x$46$re * y$46$im), $MachinePrecision], 1.4e+47], N[Not[LessEqual[N[(x$46$re * y$46$im), $MachinePrecision], 3.8e+75]], $MachinePrecision]]]], 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.re y.im) < -1.02000000000000002e-22 or 3.99999999999999982e-57 < (*.f64 x.re y.im) < 1.39999999999999994e47 or 3.8000000000000002e75 < (*.f64 x.re y.im)

   1. Initial program 98.6%

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

   3. Taylor expanded in x.re around inf 81.3%

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

   if -1.02000000000000002e-22 < (*.f64 x.re y.im) < 3.99999999999999982e-57 or 1.39999999999999994e47 < (*.f64 x.re y.im) < 3.8000000000000002e75

   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 0 83.8%

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

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \cdot y.im \leq -1.02 \cdot 10^{-22} \lor \neg \left(x.re \cdot y.im \leq 4 \cdot 10^{-57}\right) \land \left(x.re \cdot y.im \leq 1.4 \cdot 10^{+47} \lor \neg \left(x.re \cdot y.im \leq 3.8 \cdot 10^{+75}\right)\right):\\ \;\;\;\;x.re \cdot y.im\\ \mathbf{else}:\\ \;\;\;\;y.re \cdot x.im\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (+ (* 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) {
	return (x_46_re * y_46_im) + (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 = (x_46re * y_46im) + (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 (x_46_re * y_46_im) + (y_46_re * x_46_im);
}

Python

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

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(y_46_re * x_46_im))
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = (x_46_re * y_46_im) + (y_46_re * x_46_im);
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[(y$46$re * x$46$im), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.2%

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

3. Final simplification 99.2%

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

Alternative 5: 51.4% 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.2%

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

3. Taylor expanded in x.re around 0 48.7%

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

4. Final simplification 48.7%

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

Reproduce

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