math.cube on complex, real part

Percentage Accurate: 82.2% → 99.5%

Time: 6.3s

Alternatives: 7

Speedup: 1.0×

• 44.8% 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.re - \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.im \end{array} \]

FPCore

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

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_re) - (((x_46_re * x_46_im) + (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_46re) - (x_46im * x_46im)) * x_46re) - (((x_46re * x_46im) + (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_re) - (x_46_im * x_46_im)) * x_46_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
}

Python

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

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_re) - Float64(Float64(Float64(x_46_re * x_46_im) + Float64(x_46_im * x_46_re)) * x_46_im))
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_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
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$re), $MachinePrecision] - N[(N[(N[(x$46$re * x$46$im), $MachinePrecision] + N[(x$46$im * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$im), $MachinePrecision]), $MachinePrecision]

Initial Program: 82.2% accurate, 1.0× speedup

Math

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

FPCore

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

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_re) - (((x_46_re * x_46_im) + (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_46re) - (x_46im * x_46im)) * x_46re) - (((x_46re * x_46im) + (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_re) - (x_46_im * x_46_im)) * x_46_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
}

Python

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

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_re) - Float64(Float64(Float64(x_46_re * x_46_im) + Float64(x_46_im * x_46_re)) * x_46_im))
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_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
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$re), $MachinePrecision] - N[(N[(N[(x$46$re * x$46$im), $MachinePrecision] + N[(x$46$im * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$im), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} x.im_m = \left|x.im\right| \\ \begin{array}{l} \mathbf{if}\;x.im\_m \leq 5.5 \cdot 10^{+35}:\\ \;\;\;\;\left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.re - \left(x.re \cdot \left(x.im\_m + x.im\_m\right)\right) \cdot x.im\_m\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left({\left(\frac{x.re}{x.im\_m}\right)}^{2} + -3\right) \cdot x.re\right) \cdot x.im\_m\right) \cdot x.im\_m\\ \end{array} \end{array} \]

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m)
 :precision binary64
 (if (<= x.im_m 5.5e+35)
   (-
    (* (- (* x.re x.re) (* x.im_m x.im_m)) x.re)
    (* (* x.re (+ x.im_m x.im_m)) x.im_m))
   (* (* (* (+ (pow (/ x.re x.im_m) 2.0) -3.0) x.re) x.im_m) x.im_m)))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 5.5e+35) {
		tmp = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - ((x_46_re * (x_46_im_m + x_46_im_m)) * x_46_im_m);
	} else {
		tmp = (((pow((x_46_re / x_46_im_m), 2.0) + -3.0) * x_46_re) * x_46_im_m) * x_46_im_m;
	}
	return tmp;
}

Fortran

x.im_m = abs(x_46im)
real(8) function code(x_46re, x_46im_m)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 5.5d+35) then
        tmp = (((x_46re * x_46re) - (x_46im_m * x_46im_m)) * x_46re) - ((x_46re * (x_46im_m + x_46im_m)) * x_46im_m)
    else
        tmp = (((((x_46re / x_46im_m) ** 2.0d0) + (-3.0d0)) * x_46re) * x_46im_m) * x_46im_m
    end if
    code = tmp
end function

Java

x.im_m = Math.abs(x_46_im);
public static double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 5.5e+35) {
		tmp = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - ((x_46_re * (x_46_im_m + x_46_im_m)) * x_46_im_m);
	} else {
		tmp = (((Math.pow((x_46_re / x_46_im_m), 2.0) + -3.0) * x_46_re) * x_46_im_m) * x_46_im_m;
	}
	return tmp;
}

Python

x.im_m = math.fabs(x_46_im)
def code(x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 5.5e+35:
		tmp = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - ((x_46_re * (x_46_im_m + x_46_im_m)) * x_46_im_m)
	else:
		tmp = (((math.pow((x_46_re / x_46_im_m), 2.0) + -3.0) * x_46_re) * x_46_im_m) * x_46_im_m
	return tmp

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 5.5e+35)
		tmp = Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_re) - Float64(Float64(x_46_re * Float64(x_46_im_m + x_46_im_m)) * x_46_im_m));
	else
		tmp = Float64(Float64(Float64(Float64((Float64(x_46_re / x_46_im_m) ^ 2.0) + -3.0) * x_46_re) * x_46_im_m) * x_46_im_m);
	end
	return tmp
end

MATLAB

x.im_m = abs(x_46_im);
function tmp_2 = code(x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 5.5e+35)
		tmp = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - ((x_46_re * (x_46_im_m + x_46_im_m)) * x_46_im_m);
	else
		tmp = (((((x_46_re / x_46_im_m) ^ 2.0) + -3.0) * x_46_re) * x_46_im_m) * x_46_im_m;
	end
	tmp_2 = tmp;
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := If[LessEqual[x$46$im$95$m, 5.5e+35], 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$re), $MachinePrecision] - N[(N[(x$46$re * N[(x$46$im$95$m + x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[Power[N[(x$46$re / x$46$im$95$m), $MachinePrecision], 2.0], $MachinePrecision] + -3.0), $MachinePrecision] * x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x.im < 5.50000000000000001e35

   1. Initial program 87.5%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.re - \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.im \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 87.5

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

   4. Applied rewrites 87.5%

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

   if 5.50000000000000001e35 < x.im

   1. Initial program 62.1%

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

   3. Taylor expanded in x.im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 79.7%

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

   7. Applied rewrites 99.7%

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

Alternative 2: 60.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} x.im_m = \left|x.im\right| \\ \begin{array}{l} \mathbf{if}\;\left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.re - \left(x.re \cdot x.im\_m + x.im\_m \cdot x.re\right) \cdot x.im\_m \leq -2 \cdot 10^{-321}:\\ \;\;\;\;-3 \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot x.im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x.re \cdot x.re\right) \cdot x.re\\ \end{array} \end{array} \]

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m)
 :precision binary64
 (if (<=
      (-
       (* (- (* x.re x.re) (* x.im_m x.im_m)) x.re)
       (* (+ (* x.re x.im_m) (* x.im_m x.re)) x.im_m))
      -2e-321)
   (* -3.0 (* (* x.im_m x.re) x.im_m))
   (* (* x.re x.re) x.re)))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -2e-321) {
		tmp = -3.0 * ((x_46_im_m * x_46_re) * x_46_im_m);
	} else {
		tmp = (x_46_re * x_46_re) * x_46_re;
	}
	return tmp;
}

Fortran

x.im_m = abs(x_46im)
real(8) function code(x_46re, x_46im_m)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (((((x_46re * x_46re) - (x_46im_m * x_46im_m)) * x_46re) - (((x_46re * x_46im_m) + (x_46im_m * x_46re)) * x_46im_m)) <= (-2d-321)) then
        tmp = (-3.0d0) * ((x_46im_m * x_46re) * x_46im_m)
    else
        tmp = (x_46re * x_46re) * x_46re
    end if
    code = tmp
end function

Java

x.im_m = Math.abs(x_46_im);
public static double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -2e-321) {
		tmp = -3.0 * ((x_46_im_m * x_46_re) * x_46_im_m);
	} else {
		tmp = (x_46_re * x_46_re) * x_46_re;
	}
	return tmp;
}

Python

x.im_m = math.fabs(x_46_im)
def code(x_46_re, x_46_im_m):
	tmp = 0
	if ((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -2e-321:
		tmp = -3.0 * ((x_46_im_m * x_46_re) * x_46_im_m)
	else:
		tmp = (x_46_re * x_46_re) * x_46_re
	return tmp

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_re) - Float64(Float64(Float64(x_46_re * x_46_im_m) + Float64(x_46_im_m * x_46_re)) * x_46_im_m)) <= -2e-321)
		tmp = Float64(-3.0 * Float64(Float64(x_46_im_m * x_46_re) * x_46_im_m));
	else
		tmp = Float64(Float64(x_46_re * x_46_re) * x_46_re);
	end
	return tmp
end

MATLAB

x.im_m = abs(x_46_im);
function tmp_2 = code(x_46_re, x_46_im_m)
	tmp = 0.0;
	if (((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -2e-321)
		tmp = -3.0 * ((x_46_im_m * x_46_re) * x_46_im_m);
	else
		tmp = (x_46_re * x_46_re) * x_46_re;
	end
	tmp_2 = tmp;
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := If[LessEqual[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$re), $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$im$95$m), $MachinePrecision]), $MachinePrecision], -2e-321], N[(-3.0 * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$re * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im)) < -2.00097e-321

   1. Initial program 91.6%

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

   3. Taylor expanded in x.re around 0

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

      1. distribute-rgt-out-- N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. unpow2 N/A

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

      8. associate-*l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 50.4

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

   5. Applied rewrites 50.4%

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

   if -2.00097e-321 < (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im))

   1. Initial program 76.3%

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

   3. Taylor expanded in x.re around inf

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

      1. lower-pow.f64 62.2

         \[\leadsto \color{blue}{{x.re}^{3}} \]

   5. Applied rewrites 62.2%

      \[\leadsto \color{blue}{{x.re}^{3}} \]
   6. Step-by-step derivation

   7. Applied rewrites 62.2%

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

Alternative 3: 42.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} x.im_m = \left|x.im\right| \\ \begin{array}{l} \mathbf{if}\;\left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.re - \left(x.re \cdot x.im\_m + x.im\_m \cdot x.re\right) \cdot x.im\_m \leq -5 \cdot 10^{-280}:\\ \;\;\;\;\left(\left(-x.re\right) \cdot x.re\right) \cdot x.re\\ \mathbf{else}:\\ \;\;\;\;\left(x.re \cdot x.re\right) \cdot x.re\\ \end{array} \end{array} \]

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m)
 :precision binary64
 (if (<=
      (-
       (* (- (* x.re x.re) (* x.im_m x.im_m)) x.re)
       (* (+ (* x.re x.im_m) (* x.im_m x.re)) x.im_m))
      -5e-280)
   (* (* (- x.re) x.re) x.re)
   (* (* x.re x.re) x.re)))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -5e-280) {
		tmp = (-x_46_re * x_46_re) * x_46_re;
	} else {
		tmp = (x_46_re * x_46_re) * x_46_re;
	}
	return tmp;
}

Fortran

x.im_m = abs(x_46im)
real(8) function code(x_46re, x_46im_m)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (((((x_46re * x_46re) - (x_46im_m * x_46im_m)) * x_46re) - (((x_46re * x_46im_m) + (x_46im_m * x_46re)) * x_46im_m)) <= (-5d-280)) then
        tmp = (-x_46re * x_46re) * x_46re
    else
        tmp = (x_46re * x_46re) * x_46re
    end if
    code = tmp
end function

Java

x.im_m = Math.abs(x_46_im);
public static double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -5e-280) {
		tmp = (-x_46_re * x_46_re) * x_46_re;
	} else {
		tmp = (x_46_re * x_46_re) * x_46_re;
	}
	return tmp;
}

Python

x.im_m = math.fabs(x_46_im)
def code(x_46_re, x_46_im_m):
	tmp = 0
	if ((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -5e-280:
		tmp = (-x_46_re * x_46_re) * x_46_re
	else:
		tmp = (x_46_re * x_46_re) * x_46_re
	return tmp

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_re) - Float64(Float64(Float64(x_46_re * x_46_im_m) + Float64(x_46_im_m * x_46_re)) * x_46_im_m)) <= -5e-280)
		tmp = Float64(Float64(Float64(-x_46_re) * x_46_re) * x_46_re);
	else
		tmp = Float64(Float64(x_46_re * x_46_re) * x_46_re);
	end
	return tmp
end

MATLAB

x.im_m = abs(x_46_im);
function tmp_2 = code(x_46_re, x_46_im_m)
	tmp = 0.0;
	if (((((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - (((x_46_re * x_46_im_m) + (x_46_im_m * x_46_re)) * x_46_im_m)) <= -5e-280)
		tmp = (-x_46_re * x_46_re) * x_46_re;
	else
		tmp = (x_46_re * x_46_re) * x_46_re;
	end
	tmp_2 = tmp;
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := If[LessEqual[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$re), $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$im$95$m), $MachinePrecision]), $MachinePrecision], -5e-280], N[(N[((-x$46$re) * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision], N[(N[(x$46$re * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im)) < -5.00000000000000028e-280

   1. Initial program 91.4%

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

   3. Taylor expanded in x.re around inf

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

      1. lower-pow.f64 50.5

         \[\leadsto \color{blue}{{x.re}^{3}} \]

   5. Applied rewrites 50.5%

      \[\leadsto \color{blue}{{x.re}^{3}} \]
   6. Step-by-step derivation

   7. Applied rewrites 8.1%

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

   if -5.00000000000000028e-280 < (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im))

   1. Initial program 76.7%

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

   3. Taylor expanded in x.re around inf

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

      1. lower-pow.f64 61.9

         \[\leadsto \color{blue}{{x.re}^{3}} \]

   5. Applied rewrites 61.9%

      \[\leadsto \color{blue}{{x.re}^{3}} \]
   6. Step-by-step derivation

   7. Applied rewrites 61.9%

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

4. Final simplification 40.9%

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

Alternative 4: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} x.im_m = \left|x.im\right| \\ \begin{array}{l} \mathbf{if}\;x.im\_m \leq 7 \cdot 10^{+37}:\\ \;\;\;\;\left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) \cdot x.re - \left(x.re \cdot \left(x.im\_m + x.im\_m\right)\right) \cdot x.im\_m\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\frac{x.re}{x.im\_m}, x.re, -3 \cdot x.im\_m\right) \cdot x.re\right) \cdot x.im\_m\\ \end{array} \end{array} \]

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m)
 :precision binary64
 (if (<= x.im_m 7e+37)
   (-
    (* (- (* x.re x.re) (* x.im_m x.im_m)) x.re)
    (* (* x.re (+ x.im_m x.im_m)) x.im_m))
   (* (* (fma (/ x.re x.im_m) x.re (* -3.0 x.im_m)) x.re) x.im_m)))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 7e+37) {
		tmp = (((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m)) * x_46_re) - ((x_46_re * (x_46_im_m + x_46_im_m)) * x_46_im_m);
	} else {
		tmp = (fma((x_46_re / x_46_im_m), x_46_re, (-3.0 * x_46_im_m)) * x_46_re) * x_46_im_m;
	}
	return tmp;
}

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 7e+37)
		tmp = Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m)) * x_46_re) - Float64(Float64(x_46_re * Float64(x_46_im_m + x_46_im_m)) * x_46_im_m));
	else
		tmp = Float64(Float64(fma(Float64(x_46_re / x_46_im_m), x_46_re, Float64(-3.0 * x_46_im_m)) * x_46_re) * x_46_im_m);
	end
	return tmp
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := If[LessEqual[x$46$im$95$m, 7e+37], 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$re), $MachinePrecision] - N[(N[(x$46$re * N[(x$46$im$95$m + x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x$46$re / x$46$im$95$m), $MachinePrecision] * x$46$re + N[(-3.0 * x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x.im < 7e37

   1. Initial program 87.5%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.re - \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.im \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 87.5

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

   4. Applied rewrites 87.5%

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

   if 7e37 < x.im

   1. Initial program 62.1%

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

   3. Taylor expanded in x.im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 79.7%

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

   7. Applied rewrites 99.7%

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

   8. Taylor expanded in x.re around 0

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

   10. Applied rewrites 97.7%

       \[\leadsto \left(\mathsf{fma}\left(-3, x.im, \frac{x.re \cdot x.re}{x.im}\right) \cdot x.re\right) \cdot x.im \]
   11. Step-by-step derivation

   12. Applied rewrites 99.6%

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

Alternative 5: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} x.im_m = \left|x.im\right| \\ \begin{array}{l} \mathbf{if}\;x.im\_m \leq 6 \cdot 10^{+38}:\\ \;\;\;\;\mathsf{fma}\left(x.re, x.re, \left(x.im\_m \cdot x.im\_m\right) \cdot -3\right) \cdot x.re\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\frac{x.re}{x.im\_m}, x.re, -3 \cdot x.im\_m\right) \cdot x.re\right) \cdot x.im\_m\\ \end{array} \end{array} \]

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m)
 :precision binary64
 (if (<= x.im_m 6e+38)
   (* (fma x.re x.re (* (* x.im_m x.im_m) -3.0)) x.re)
   (* (* (fma (/ x.re x.im_m) x.re (* -3.0 x.im_m)) x.re) x.im_m)))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 6e+38) {
		tmp = fma(x_46_re, x_46_re, ((x_46_im_m * x_46_im_m) * -3.0)) * x_46_re;
	} else {
		tmp = (fma((x_46_re / x_46_im_m), x_46_re, (-3.0 * x_46_im_m)) * x_46_re) * x_46_im_m;
	}
	return tmp;
}

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 6e+38)
		tmp = Float64(fma(x_46_re, x_46_re, Float64(Float64(x_46_im_m * x_46_im_m) * -3.0)) * x_46_re);
	else
		tmp = Float64(Float64(fma(Float64(x_46_re / x_46_im_m), x_46_re, Float64(-3.0 * x_46_im_m)) * x_46_re) * x_46_im_m);
	end
	return tmp
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := If[LessEqual[x$46$im$95$m, 6e+38], N[(N[(x$46$re * x$46$re + N[(N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision] * -3.0), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision], N[(N[(N[(N[(x$46$re / x$46$im$95$m), $MachinePrecision] * x$46$re + N[(-3.0 * x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x.im < 6.0000000000000002e38

   1. Initial program 87.5%

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

   3. Taylor expanded in x.re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. associate-+r+ N/A

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

      6. +-commutative N/A

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

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

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

      8. distribute-rgt-out-- N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. metadata-eval N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 90.4

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

   5. Applied rewrites 90.4%

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

   7. Applied rewrites 91.8%

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

   if 6.0000000000000002e38 < x.im

   1. Initial program 62.1%

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

   3. Taylor expanded in x.im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 79.7%

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

   7. Applied rewrites 99.7%

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

   8. Taylor expanded in x.re around 0

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

   10. Applied rewrites 97.7%

       \[\leadsto \left(\mathsf{fma}\left(-3, x.im, \frac{x.re \cdot x.re}{x.im}\right) \cdot x.re\right) \cdot x.im \]
   11. Step-by-step derivation

   12. Applied rewrites 99.6%

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

Alternative 6: 96.7% accurate, 1.0× speedup

Math

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

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m)
 :precision binary64
 (if (<= x.im_m 9e-21)
   (* (fma x.re x.re (* (* x.im_m x.im_m) -3.0)) x.re)
   (* (* (fma -3.0 x.im_m (/ (* x.re x.re) x.im_m)) x.re) x.im_m)))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 9e-21) {
		tmp = fma(x_46_re, x_46_re, ((x_46_im_m * x_46_im_m) * -3.0)) * x_46_re;
	} else {
		tmp = (fma(-3.0, x_46_im_m, ((x_46_re * x_46_re) / x_46_im_m)) * x_46_re) * x_46_im_m;
	}
	return tmp;
}

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 9e-21)
		tmp = Float64(fma(x_46_re, x_46_re, Float64(Float64(x_46_im_m * x_46_im_m) * -3.0)) * x_46_re);
	else
		tmp = Float64(Float64(fma(-3.0, x_46_im_m, Float64(Float64(x_46_re * x_46_re) / x_46_im_m)) * x_46_re) * x_46_im_m);
	end
	return tmp
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := If[LessEqual[x$46$im$95$m, 9e-21], N[(N[(x$46$re * x$46$re + N[(N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision] * -3.0), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision], N[(N[(N[(-3.0 * x$46$im$95$m + N[(N[(x$46$re * x$46$re), $MachinePrecision] / x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x.im < 8.99999999999999936e-21

   1. Initial program 87.1%

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

   3. Taylor expanded in x.re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. associate-+r+ N/A

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

      6. +-commutative N/A

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

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

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

      8. distribute-rgt-out-- N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. metadata-eval N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 90.0

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

   5. Applied rewrites 90.0%

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

   7. Applied rewrites 91.6%

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

   if 8.99999999999999936e-21 < x.im

   1. Initial program 66.7%

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

   3. Taylor expanded in x.im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 82.2%

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

   7. Applied rewrites 99.6%

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

   8. Taylor expanded in x.re around 0

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

   10. Applied rewrites 98.0%

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

Alternative 7: 57.5% accurate, 3.6× speedup

Math

\[\begin{array}{l} x.im_m = \left|x.im\right| \\ \left(x.re \cdot x.re\right) \cdot x.re \end{array} \]

FPCore

x.im_m = (fabs.f64 x.im)
(FPCore (x.re x.im_m) :precision binary64 (* (* x.re x.re) x.re))

C

x.im_m = fabs(x_46_im);
double code(double x_46_re, double x_46_im_m) {
	return (x_46_re * x_46_re) * x_46_re;
}

Fortran

x.im_m = abs(x_46im)
real(8) function code(x_46re, x_46im_m)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    code = (x_46re * x_46re) * x_46re
end function

Java

x.im_m = Math.abs(x_46_im);
public static double code(double x_46_re, double x_46_im_m) {
	return (x_46_re * x_46_re) * x_46_re;
}

Python

x.im_m = math.fabs(x_46_im)
def code(x_46_re, x_46_im_m):
	return (x_46_re * x_46_re) * x_46_re

Julia

x.im_m = abs(x_46_im)
function code(x_46_re, x_46_im_m)
	return Float64(Float64(x_46_re * x_46_re) * x_46_re)
end

MATLAB

x.im_m = abs(x_46_im);
function tmp = code(x_46_re, x_46_im_m)
	tmp = (x_46_re * x_46_re) * x_46_re;
end

Wolfram

x.im_m = N[Abs[x$46$im], $MachinePrecision]
code[x$46$re_, x$46$im$95$m_] := N[(N[(x$46$re * x$46$re), $MachinePrecision] * x$46$re), $MachinePrecision]

Derivation

1. Initial program 82.5%

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

3. Taylor expanded in x.re around inf

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

   1. lower-pow.f64 57.4

      \[\leadsto \color{blue}{{x.re}^{3}} \]

5. Applied rewrites 57.4%

   \[\leadsto \color{blue}{{x.re}^{3}} \]
6. Step-by-step derivation

7. Applied rewrites 57.4%

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

Developer Target 1: 87.1% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double x_46_re, double x_46_im) {
	return ((x_46_re * x_46_re) * (x_46_re - x_46_im)) + ((x_46_re * x_46_im) * (x_46_re - (3.0 * 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_46re) * (x_46re - x_46im)) + ((x_46re * x_46im) * (x_46re - (3.0d0 * x_46im)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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