math.cube on complex, imaginary part

Percentage Accurate: 82.6% → 98.8%

Time: 7.2s

Alternatives: 7

Speedup: 1.3×

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

Specification

Math

\[\begin{array}{l} \\ \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x_46_re, x_46_im):
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 82.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x_46_re, x_46_im):
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ \begin{array}{l} t_0 := \left(x.re \cdot x.im\_m + x.im\_m \cdot x.re\right) \cdot x.re\\ t_1 := \left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.im\_m + t\_0\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-276}:\\ \;\;\;\;{\left(-x.im\_m\right)}^{3}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\left(x.im\_m \cdot x.re\right) \cdot x.re + t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(-x.im\_m\right) \cdot \left(\left(\frac{\frac{x.im\_m}{x.re}}{x.re} \cdot x.im\_m - 3\right) \cdot \left(x.re \cdot x.re\right)\right)\\ \end{array} \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (let* ((t_0 (* (+ (* x.re x.im_m) (* x.im_m x.re)) x.re))
        (t_1 (+ (* (- (* x.re x.re) (* x.im_m x.im_m)) x.im_m) t_0)))
   (*
    x.im_s
    (if (<= t_1 -5e-276)
      (pow (- x.im_m) 3.0)
      (if (<= t_1 INFINITY)
        (+ (* (* x.im_m x.re) x.re) t_0)
        (*
         (- x.im_m)
         (* (- (* (/ (/ x.im_m x.re) x.re) x.im_m) 3.0) (* x.re x.re))))))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = ((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re;
	double t_1 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + t_0;
	double tmp;
	if (t_1 <= -5e-276) {
		tmp = pow(-x_46_im_m, 3.0);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = ((x_46_im_m * x_46_re) * x_46_re) + t_0;
	} else {
		tmp = -x_46_im_m * (((((x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * (x_46_re * x_46_re));
	}
	return x_46_im_s * tmp;
}

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = ((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re;
	double t_1 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + t_0;
	double tmp;
	if (t_1 <= -5e-276) {
		tmp = Math.pow(-x_46_im_m, 3.0);
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = ((x_46_im_m * x_46_re) * x_46_re) + t_0;
	} else {
		tmp = -x_46_im_m * (((((x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * (x_46_re * x_46_re));
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	t_0 = ((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re
	t_1 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + t_0
	tmp = 0
	if t_1 <= -5e-276:
		tmp = math.pow(-x_46_im_m, 3.0)
	elif t_1 <= math.inf:
		tmp = ((x_46_im_m * x_46_re) * x_46_re) + t_0
	else:
		tmp = -x_46_im_m * (((((x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * (x_46_re * x_46_re))
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = Float64(Float64(Float64(x_46_re * x_46_im_m) + Float64(x_46_im_m * x_46_re)) * x_46_re)
	t_1 = Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_im_m) + t_0)
	tmp = 0.0
	if (t_1 <= -5e-276)
		tmp = Float64(-x_46_im_m) ^ 3.0;
	elseif (t_1 <= Inf)
		tmp = Float64(Float64(Float64(x_46_im_m * x_46_re) * x_46_re) + t_0);
	else
		tmp = Float64(Float64(-x_46_im_m) * Float64(Float64(Float64(Float64(Float64(x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * Float64(x_46_re * x_46_re)));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = ((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re;
	t_1 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + t_0;
	tmp = 0.0;
	if (t_1 <= -5e-276)
		tmp = -x_46_im_m ^ 3.0;
	elseif (t_1 <= Inf)
		tmp = ((x_46_im_m * x_46_re) * x_46_re) + t_0;
	else
		tmp = -x_46_im_m * (((((x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * (x_46_re * x_46_re));
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := Block[{t$95$0 = N[(N[(N[(x$46$re * x$46$im$95$m), $MachinePrecision] + N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x$46$re * x$46$re), $MachinePrecision] - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision] + t$95$0), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[t$95$1, -5e-276], N[Power[(-x$46$im$95$m), 3.0], $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision] + t$95$0), $MachinePrecision], N[((-x$46$im$95$m) * N[(N[(N[(N[(N[(x$46$im$95$m / x$46$re), $MachinePrecision] / x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision] - 3.0), $MachinePrecision] * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < -4.99999999999999967e-276

   1. Initial program 93.9%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left({x.im}^{3}\right)} \]

      2. cube-neg-rev N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      3. lower-pow.f64 N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      4. lower-neg.f64 45.2

         \[\leadsto {\color{blue}{\left(-x.im\right)}}^{3} \]

   5. Applied rewrites 45.2%

      \[\leadsto \color{blue}{{\left(-x.im\right)}^{3}} \]

   if -4.99999999999999967e-276 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < +inf.0

   1. Initial program 91.8%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around inf

      \[\leadsto \color{blue}{x.im \cdot {x.re}^{2}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 64.3

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

   5. Applied rewrites 64.3%

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

   if +inf.0 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re))

   1. Initial program 0.0%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} + {x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*r* N/A

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

      4. count-2-rev N/A

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

      5. distribute-lft-in N/A

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

      6. count-2-rev N/A

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

      7. distribute-lft-in N/A

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

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)} \]

      9. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left({x.im}^{3}\right)\right)} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      10. cube-mult N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x.im \cdot \left(x.im \cdot x.im\right)}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      11. unpow2 N/A

          \[\leadsto \left(\mathsf{neg}\left(x.im \cdot \color{blue}{{x.im}^{2}}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      12. distribute-lft-neg-in N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot {x.im}^{2}} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      13. distribute-lft-out-- N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      15. lower-neg.f64 N/A

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

      16. distribute-lft1-in N/A

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

   5. Applied rewrites 73.9%

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

   6. Taylor expanded in x.re around inf

      \[\leadsto \left(-x.im\right) \cdot \left({x.re}^{2} \cdot \color{blue}{\left(\frac{{x.im}^{2}}{{x.re}^{2}} - 3\right)}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \left(-x.im\right) \cdot \left(\left(\frac{\frac{x.im}{x.re}}{x.re} \cdot x.im - 3\right) \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 97.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 7.2 \cdot 10^{-93}:\\ \;\;\;\;\left(x.im\_m \cdot x.re\right) \cdot \left(3 \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(3 \cdot \frac{x.re}{x.im\_m}, \frac{x.re}{x.im\_m}, -1\right) \cdot {x.im\_m}^{3}\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 7.2e-93)
    (* (* x.im_m x.re) (* 3.0 x.re))
    (* (fma (* 3.0 (/ x.re x.im_m)) (/ x.re x.im_m) -1.0) (pow x.im_m 3.0)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 7.2e-93) {
		tmp = (x_46_im_m * x_46_re) * (3.0 * x_46_re);
	} else {
		tmp = fma((3.0 * (x_46_re / x_46_im_m)), (x_46_re / x_46_im_m), -1.0) * pow(x_46_im_m, 3.0);
	}
	return x_46_im_s * tmp;
}

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 7.2e-93)
		tmp = Float64(Float64(x_46_im_m * x_46_re) * Float64(3.0 * x_46_re));
	else
		tmp = Float64(fma(Float64(3.0 * Float64(x_46_re / x_46_im_m)), Float64(x_46_re / x_46_im_m), -1.0) * (x_46_im_m ^ 3.0));
	end
	return Float64(x_46_im_s * tmp)
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 7.2e-93], N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * N[(3.0 * x$46$re), $MachinePrecision]), $MachinePrecision], N[(N[(N[(3.0 * N[(x$46$re / x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$46$re / x$46$im$95$m), $MachinePrecision] + -1.0), $MachinePrecision] * N[Power[x$46$im$95$m, 3.0], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 7.2000000000000003e-93

   1. Initial program 84.2%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around inf

      \[\leadsto \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt1-in N/A

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

      7. metadata-eval N/A

         \[\leadsto \left(x.re \cdot \left(\color{blue}{3} \cdot x.im\right)\right) \cdot x.re \]

      8. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(x.re \cdot 3\right) \cdot x.im\right)} \cdot x.re \]

      9. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

      10. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right)} \cdot x.re \]

      11. lower-*.f64 67.8

          \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

   5. Applied rewrites 67.8%

      \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right) \cdot x.re} \]
   6. Step-by-step derivation

   7. Applied rewrites 67.9%

      \[\leadsto \left(x.im \cdot x.re\right) \cdot \color{blue}{\left(3 \cdot x.re\right)} \]

   if 7.2000000000000003e-93 < x.im

   1. Initial program 84.6%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.im around inf

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

   5. Applied rewrites 96.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3 \cdot \frac{x.re}{x.im}, \frac{x.re}{x.im}, -1\right) \cdot {x.im}^{3}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 99.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ \begin{array}{l} t_0 := \left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.im\_m + \left(x.re \cdot x.im\_m + x.im\_m \cdot x.re\right) \cdot x.re\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq 5 \cdot 10^{-282}:\\ \;\;\;\;\left(-x.im\_m\right) \cdot \mathsf{fma}\left(x.im\_m, x.im\_m, -3 \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{elif}\;t\_0 \leq \infty:\\ \;\;\;\;3 \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-x.im\_m\right) \cdot \left(\left(\frac{\frac{x.im\_m}{x.re}}{x.re} \cdot x.im\_m - 3\right) \cdot \left(x.re \cdot x.re\right)\right)\\ \end{array} \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (let* ((t_0
         (+
          (* (- (* x.re x.re) (* x.im_m x.im_m)) x.im_m)
          (* (+ (* x.re x.im_m) (* x.im_m x.re)) x.re))))
   (*
    x.im_s
    (if (<= t_0 5e-282)
      (* (- x.im_m) (fma x.im_m x.im_m (* -3.0 (* x.re x.re))))
      (if (<= t_0 INFINITY)
        (* 3.0 (* (* x.im_m x.re) x.re))
        (*
         (- x.im_m)
         (* (- (* (/ (/ x.im_m x.re) x.re) x.im_m) 3.0) (* x.re x.re))))))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re);
	double tmp;
	if (t_0 <= 5e-282) {
		tmp = -x_46_im_m * fma(x_46_im_m, x_46_im_m, (-3.0 * (x_46_re * x_46_re)));
	} else if (t_0 <= ((double) INFINITY)) {
		tmp = 3.0 * ((x_46_im_m * x_46_re) * x_46_re);
	} else {
		tmp = -x_46_im_m * (((((x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * (x_46_re * x_46_re));
	}
	return x_46_im_s * tmp;
}

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_im_m) + Float64(Float64(Float64(x_46_re * x_46_im_m) + Float64(x_46_im_m * x_46_re)) * x_46_re))
	tmp = 0.0
	if (t_0 <= 5e-282)
		tmp = Float64(Float64(-x_46_im_m) * fma(x_46_im_m, x_46_im_m, Float64(-3.0 * Float64(x_46_re * x_46_re))));
	elseif (t_0 <= Inf)
		tmp = Float64(3.0 * Float64(Float64(x_46_im_m * x_46_re) * x_46_re));
	else
		tmp = Float64(Float64(-x_46_im_m) * Float64(Float64(Float64(Float64(Float64(x_46_im_m / x_46_re) / x_46_re) * x_46_im_m) - 3.0) * Float64(x_46_re * x_46_re)));
	end
	return Float64(x_46_im_s * tmp)
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := Block[{t$95$0 = N[(N[(N[(N[(x$46$re * x$46$re), $MachinePrecision] - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision] + N[(N[(N[(x$46$re * x$46$im$95$m), $MachinePrecision] + N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[t$95$0, 5e-282], N[((-x$46$im$95$m) * N[(x$46$im$95$m * x$46$im$95$m + N[(-3.0 * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(3.0 * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision]), $MachinePrecision], N[((-x$46$im$95$m) * N[(N[(N[(N[(N[(x$46$im$95$m / x$46$re), $MachinePrecision] / x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision] - 3.0), $MachinePrecision] * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < 5.0000000000000001e-282

   1. Initial program 95.6%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} + {x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*r* N/A

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

      4. count-2-rev N/A

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

      5. distribute-lft-in N/A

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

      6. count-2-rev N/A

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

      7. distribute-lft-in N/A

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

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)} \]

      9. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left({x.im}^{3}\right)\right)} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      10. cube-mult N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x.im \cdot \left(x.im \cdot x.im\right)}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      11. unpow2 N/A

          \[\leadsto \left(\mathsf{neg}\left(x.im \cdot \color{blue}{{x.im}^{2}}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      12. distribute-lft-neg-in N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot {x.im}^{2}} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      13. distribute-lft-out-- N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      15. lower-neg.f64 N/A

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

      16. distribute-lft1-in N/A

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

   5. Applied rewrites 94.9%

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

   if 5.0000000000000001e-282 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < +inf.0

   1. Initial program 88.7%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around inf

      \[\leadsto \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt1-in N/A

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

      7. metadata-eval N/A

         \[\leadsto \left(x.re \cdot \left(\color{blue}{3} \cdot x.im\right)\right) \cdot x.re \]

      8. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(x.re \cdot 3\right) \cdot x.im\right)} \cdot x.re \]

      9. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

      10. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right)} \cdot x.re \]

      11. lower-*.f64 50.7

          \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

   5. Applied rewrites 50.7%

      \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right) \cdot x.re} \]
   6. Step-by-step derivation

   7. Applied rewrites 50.7%

      \[\leadsto 3 \cdot \color{blue}{\left(\left(x.im \cdot x.re\right) \cdot x.re\right)} \]

   if +inf.0 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re))

   1. Initial program 0.0%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} + {x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*r* N/A

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

      4. count-2-rev N/A

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

      5. distribute-lft-in N/A

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

      6. count-2-rev N/A

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

      7. distribute-lft-in N/A

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

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)} \]

      9. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left({x.im}^{3}\right)\right)} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      10. cube-mult N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x.im \cdot \left(x.im \cdot x.im\right)}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      11. unpow2 N/A

          \[\leadsto \left(\mathsf{neg}\left(x.im \cdot \color{blue}{{x.im}^{2}}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      12. distribute-lft-neg-in N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot {x.im}^{2}} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      13. distribute-lft-out-- N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      15. lower-neg.f64 N/A

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

      16. distribute-lft1-in N/A

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

   5. Applied rewrites 73.9%

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

   6. Taylor expanded in x.re around inf

      \[\leadsto \left(-x.im\right) \cdot \left({x.re}^{2} \cdot \color{blue}{\left(\frac{{x.im}^{2}}{{x.re}^{2}} - 3\right)}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \left(-x.im\right) \cdot \left(\left(\frac{\frac{x.im}{x.re}}{x.re} \cdot x.im - 3\right) \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 95.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ \begin{array}{l} t_0 := \left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.im\_m + \left(x.re \cdot x.im\_m + x.im\_m \cdot x.re\right) \cdot x.re\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5 \cdot 10^{-276} \lor \neg \left(t\_0 \leq \infty\right):\\ \;\;\;\;\left(\left(-x.im\_m\right) \cdot x.im\_m\right) \cdot x.im\_m\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot x.re\right)\\ \end{array} \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (let* ((t_0
         (+
          (* (- (* x.re x.re) (* x.im_m x.im_m)) x.im_m)
          (* (+ (* x.re x.im_m) (* x.im_m x.re)) x.re))))
   (*
    x.im_s
    (if (or (<= t_0 -5e-276) (not (<= t_0 INFINITY)))
      (* (* (- x.im_m) x.im_m) x.im_m)
      (* 3.0 (* (* x.im_m x.re) x.re))))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re);
	double tmp;
	if ((t_0 <= -5e-276) || !(t_0 <= ((double) INFINITY))) {
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	} else {
		tmp = 3.0 * ((x_46_im_m * x_46_re) * x_46_re);
	}
	return x_46_im_s * tmp;
}

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re);
	double tmp;
	if ((t_0 <= -5e-276) || !(t_0 <= Double.POSITIVE_INFINITY)) {
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	} else {
		tmp = 3.0 * ((x_46_im_m * x_46_re) * x_46_re);
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	t_0 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re)
	tmp = 0
	if (t_0 <= -5e-276) or not (t_0 <= math.inf):
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m
	else:
		tmp = 3.0 * ((x_46_im_m * x_46_re) * x_46_re)
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_im_m) + Float64(Float64(Float64(x_46_re * x_46_im_m) + Float64(x_46_im_m * x_46_re)) * x_46_re))
	tmp = 0.0
	if ((t_0 <= -5e-276) || !(t_0 <= Inf))
		tmp = Float64(Float64(Float64(-x_46_im_m) * x_46_im_m) * x_46_im_m);
	else
		tmp = Float64(3.0 * Float64(Float64(x_46_im_m * x_46_re) * x_46_re));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_im_m) + (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_re);
	tmp = 0.0;
	if ((t_0 <= -5e-276) || ~((t_0 <= Inf)))
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	else
		tmp = 3.0 * ((x_46_im_m * x_46_re) * x_46_re);
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := Block[{t$95$0 = N[(N[(N[(N[(x$46$re * x$46$re), $MachinePrecision] - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision] + N[(N[(N[(x$46$re * x$46$im$95$m), $MachinePrecision] + N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[Or[LessEqual[t$95$0, -5e-276], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]], N[(N[((-x$46$im$95$m) * x$46$im$95$m), $MachinePrecision] * x$46$im$95$m), $MachinePrecision], N[(3.0 * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < -4.99999999999999967e-276 or +inf.0 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re))

   1. Initial program 75.6%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left({x.im}^{3}\right)} \]

      2. cube-neg-rev N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      3. lower-pow.f64 N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      4. lower-neg.f64 50.8

         \[\leadsto {\color{blue}{\left(-x.im\right)}}^{3} \]

   5. Applied rewrites 50.8%

      \[\leadsto \color{blue}{{\left(-x.im\right)}^{3}} \]
   6. Step-by-step derivation

   7. Applied rewrites 50.7%

      \[\leadsto \left(\left(-x.im\right) \cdot x.im\right) \cdot \color{blue}{x.im} \]

   if -4.99999999999999967e-276 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < +inf.0

   1. Initial program 91.8%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around inf

      \[\leadsto \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt1-in N/A

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

      7. metadata-eval N/A

         \[\leadsto \left(x.re \cdot \left(\color{blue}{3} \cdot x.im\right)\right) \cdot x.re \]

      8. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(x.re \cdot 3\right) \cdot x.im\right)} \cdot x.re \]

      9. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

      10. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right)} \cdot x.re \]

      11. lower-*.f64 64.2

          \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

   5. Applied rewrites 64.2%

      \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right) \cdot x.re} \]
   6. Step-by-step derivation

   7. Applied rewrites 64.3%

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

4. Final simplification 58.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \leq -5 \cdot 10^{-276} \lor \neg \left(\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \leq \infty\right):\\ \;\;\;\;\left(\left(-x.im\right) \cdot x.im\right) \cdot x.im\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(\left(x.im \cdot x.re\right) \cdot x.re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 93.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.re \leq 8 \cdot 10^{+151}:\\ \;\;\;\;\left(-x.im\_m\right) \cdot \mathsf{fma}\left(x.im\_m, x.im\_m, -3 \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot x.re\right)\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.re 8e+151)
    (* (- x.im_m) (fma x.im_m x.im_m (* -3.0 (* x.re x.re))))
    (* 3.0 (* (* x.im_m x.re) x.re)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_re <= 8e+151) {
		tmp = -x_46_im_m * fma(x_46_im_m, x_46_im_m, (-3.0 * (x_46_re * x_46_re)));
	} else {
		tmp = 3.0 * ((x_46_im_m * x_46_re) * x_46_re);
	}
	return x_46_im_s * tmp;
}

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_re <= 8e+151)
		tmp = Float64(Float64(-x_46_im_m) * fma(x_46_im_m, x_46_im_m, Float64(-3.0 * Float64(x_46_re * x_46_re))));
	else
		tmp = Float64(3.0 * Float64(Float64(x_46_im_m * x_46_re) * x_46_re));
	end
	return Float64(x_46_im_s * tmp)
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$re, 8e+151], N[((-x$46$im$95$m) * N[(x$46$im$95$m * x$46$im$95$m + N[(-3.0 * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(3.0 * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.re < 8.00000000000000014e151

   1. Initial program 87.0%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} + {x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*r* N/A

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

      4. count-2-rev N/A

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

      5. distribute-lft-in N/A

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

      6. count-2-rev N/A

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

      7. distribute-lft-in N/A

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

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{-1 \cdot {x.im}^{3} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)} \]

      9. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left({x.im}^{3}\right)\right)} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      10. cube-mult N/A

          \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x.im \cdot \left(x.im \cdot x.im\right)}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      11. unpow2 N/A

          \[\leadsto \left(\mathsf{neg}\left(x.im \cdot \color{blue}{{x.im}^{2}}\right)\right) - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      12. distribute-lft-neg-in N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot {x.im}^{2}} - \left(\mathsf{neg}\left(x.im\right)\right) \cdot \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right) \]

      13. distribute-lft-out-- N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x.im\right)\right) \cdot \left({x.im}^{2} - \left(2 \cdot {x.re}^{2} + {x.re}^{2}\right)\right)} \]

      15. lower-neg.f64 N/A

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

      16. distribute-lft1-in N/A

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

   5. Applied rewrites 93.8%

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

   if 8.00000000000000014e151 < x.re

   1. Initial program 68.7%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around inf

      \[\leadsto \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt1-in N/A

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

      7. metadata-eval N/A

         \[\leadsto \left(x.re \cdot \left(\color{blue}{3} \cdot x.im\right)\right) \cdot x.re \]

      8. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(x.re \cdot 3\right) \cdot x.im\right)} \cdot x.re \]

      9. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

      10. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right)} \cdot x.re \]

      11. lower-*.f64 89.0

          \[\leadsto \left(\color{blue}{\left(3 \cdot x.re\right)} \cdot x.im\right) \cdot x.re \]

   5. Applied rewrites 89.0%

      \[\leadsto \color{blue}{\left(\left(3 \cdot x.re\right) \cdot x.im\right) \cdot x.re} \]
   6. Step-by-step derivation

   7. Applied rewrites 89.1%

      \[\leadsto 3 \cdot \color{blue}{\left(\left(x.im \cdot x.re\right) \cdot x.re\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 60.9% accurate, 2.1× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.re \leq 9 \cdot 10^{+196}:\\ \;\;\;\;\left(\left(-x.im\_m\right) \cdot x.im\_m\right) \cdot x.im\_m\\ \mathbf{else}:\\ \;\;\;\;\left(x.im\_m \cdot x.im\_m\right) \cdot x.im\_m\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.re 9e+196)
    (* (* (- x.im_m) x.im_m) x.im_m)
    (* (* x.im_m x.im_m) x.im_m))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_re <= 9e+196) {
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	} else {
		tmp = (x_46_im_m * x_46_im_m) * x_46_im_m;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46re <= 9d+196) then
        tmp = (-x_46im_m * x_46im_m) * x_46im_m
    else
        tmp = (x_46im_m * x_46im_m) * x_46im_m
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_re <= 9e+196) {
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	} else {
		tmp = (x_46_im_m * x_46_im_m) * x_46_im_m;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_re <= 9e+196:
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m
	else:
		tmp = (x_46_im_m * x_46_im_m) * x_46_im_m
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_re <= 9e+196)
		tmp = Float64(Float64(Float64(-x_46_im_m) * x_46_im_m) * x_46_im_m);
	else
		tmp = Float64(Float64(x_46_im_m * x_46_im_m) * x_46_im_m);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_re <= 9e+196)
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	else
		tmp = (x_46_im_m * x_46_im_m) * x_46_im_m;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$re, 9e+196], N[(N[((-x$46$im$95$m) * x$46$im$95$m), $MachinePrecision] * x$46$im$95$m), $MachinePrecision], N[(N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.re < 8.99999999999999956e196

   1. Initial program 84.9%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left({x.im}^{3}\right)} \]

      2. cube-neg-rev N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      3. lower-pow.f64 N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      4. lower-neg.f64 62.1

         \[\leadsto {\color{blue}{\left(-x.im\right)}}^{3} \]

   5. Applied rewrites 62.1%

      \[\leadsto \color{blue}{{\left(-x.im\right)}^{3}} \]
   6. Step-by-step derivation

   7. Applied rewrites 62.1%

      \[\leadsto \left(\left(-x.im\right) \cdot x.im\right) \cdot \color{blue}{x.im} \]

   if 8.99999999999999956e196 < x.re

   1. Initial program 78.7%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0

      \[\leadsto \color{blue}{-1 \cdot {x.im}^{3}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left({x.im}^{3}\right)} \]

      2. cube-neg-rev N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      3. lower-pow.f64 N/A

         \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

      4. lower-neg.f64 5.0

         \[\leadsto {\color{blue}{\left(-x.im\right)}}^{3} \]

   5. Applied rewrites 5.0%

      \[\leadsto \color{blue}{{\left(-x.im\right)}^{3}} \]
   6. Step-by-step derivation

   7. Applied rewrites 25.0%

      \[\leadsto \left(x.im \cdot x.im\right) \cdot \color{blue}{x.im} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 21.0% accurate, 3.6× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \left(\left(x.im\_m \cdot x.im\_m\right) \cdot x.im\_m\right) \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (* x.im_s (* (* x.im_m x.im_m) x.im_m)))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * ((x_46_im_m * x_46_im_m) * x_46_im_m);
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    code = x_46im_s * ((x_46im_m * x_46im_m) * x_46im_m)
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * ((x_46_im_m * x_46_im_m) * x_46_im_m);
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	return x_46_im_s * ((x_46_im_m * x_46_im_m) * x_46_im_m)

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	return Float64(x_46_im_s * Float64(Float64(x_46_im_m * x_46_im_m) * x_46_im_m))
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = x_46_im_s * ((x_46_im_m * x_46_im_m) * x_46_im_m);
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * N[(N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.3%

   \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
2. Add Preprocessing

3. Taylor expanded in x.re around 0

   \[\leadsto \color{blue}{-1 \cdot {x.im}^{3}} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left({x.im}^{3}\right)} \]

   2. cube-neg-rev N/A

      \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

   3. lower-pow.f64 N/A

      \[\leadsto \color{blue}{{\left(\mathsf{neg}\left(x.im\right)\right)}^{3}} \]

   4. lower-neg.f64 57.0

      \[\leadsto {\color{blue}{\left(-x.im\right)}}^{3} \]

5. Applied rewrites 57.0%

   \[\leadsto \color{blue}{{\left(-x.im\right)}^{3}} \]
6. Step-by-step derivation

7. Applied rewrites 20.5%

   \[\leadsto \left(x.im \cdot x.im\right) \cdot \color{blue}{x.im} \]
8. Add Preprocessing

Developer Target 1: 91.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \left(x.re \cdot x.im\right) \cdot \left(2 \cdot x.re\right) + \left(x.im \cdot \left(x.re - x.im\right)\right) \cdot \left(x.re + x.im\right) \end{array} \]

FPCore

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

C

double code(double x_46_re, double x_46_im) {
	return ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im));
}

Fortran

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    code = ((x_46re * x_46im) * (2.0d0 * x_46re)) + ((x_46im * (x_46re - x_46im)) * (x_46re + x_46im))
end function

Java

public static double code(double x_46_re, double x_46_im) {
	return ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im));
}

Python

def code(x_46_re, x_46_im):
	return ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im))

Julia

function code(x_46_re, x_46_im)
	return Float64(Float64(Float64(x_46_re * x_46_im) * Float64(2.0 * x_46_re)) + Float64(Float64(x_46_im * Float64(x_46_re - x_46_im)) * Float64(x_46_re + x_46_im)))
end

MATLAB

function tmp = code(x_46_re, x_46_im)
	tmp = ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im));
end

Wolfram

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

Reproduce

herbie shell --seed 2024340 
(FPCore (x.re x.im)
  :name "math.cube on complex, imaginary part"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (* (* x.re x.im) (* 2 x.re)) (* (* x.im (- x.re x.im)) (+ x.re x.im))))

  (+ (* (- (* x.re x.re) (* x.im x.im)) x.im) (* (+ (* x.re x.im) (* x.im x.re)) x.re)))