math.cube on complex, imaginary part

Percentage Accurate: 82.7% → 99.8%

Time: 6.5s

Alternatives: 6

Speedup: 1.3×

• 44.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_46re, x_46im)
use fmin_fmax_functions
    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.7% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_46re, x_46im)
use fmin_fmax_functions
    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: 99.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.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 2 \cdot 10^{+304}:\\ \;\;\;\;\mathsf{fma}\left(\left(x.re + x.im\_m\right) \cdot \left(x.re - x.im\_m\right), x.im\_m, \left(2 \cdot \left(x.re \cdot x.re\right)\right) \cdot x.im\_m\right)\\ \mathbf{elif}\;t\_0 \leq \infty:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im\_m \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\frac{x.im\_m}{x.re}, x.im\_m, -3 \cdot x.re\right) \cdot x.re\right) \cdot \left(-x.im\_m\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 2e+304)
      (fma
       (* (+ x.re x.im_m) (- x.re x.im_m))
       x.im_m
       (* (* 2.0 (* x.re x.re)) x.im_m))
      (if (<= t_0 INFINITY)
        (* (* 3.0 x.re) (* x.im_m x.re))
        (* (* (fma (/ x.im_m x.re) x.im_m (* -3.0 x.re)) x.re) (- 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 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 <= 2e+304) {
		tmp = fma(((x_46_re + x_46_im_m) * (x_46_re - x_46_im_m)), x_46_im_m, ((2.0 * (x_46_re * x_46_re)) * x_46_im_m));
	} else if (t_0 <= ((double) INFINITY)) {
		tmp = (3.0 * x_46_re) * (x_46_im_m * x_46_re);
	} else {
		tmp = (fma((x_46_im_m / x_46_re), x_46_im_m, (-3.0 * x_46_re)) * x_46_re) * -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)
	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 <= 2e+304)
		tmp = fma(Float64(Float64(x_46_re + x_46_im_m) * Float64(x_46_re - x_46_im_m)), x_46_im_m, Float64(Float64(2.0 * Float64(x_46_re * x_46_re)) * x_46_im_m));
	elseif (t_0 <= Inf)
		tmp = Float64(Float64(3.0 * x_46_re) * Float64(x_46_im_m * x_46_re));
	else
		tmp = Float64(Float64(fma(Float64(x_46_im_m / x_46_re), x_46_im_m, Float64(-3.0 * x_46_re)) * x_46_re) * Float64(-x_46_im_m));
	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, 2e+304], N[(N[(N[(x$46$re + x$46$im$95$m), $MachinePrecision] * N[(x$46$re - x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m + N[(N[(2.0 * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[(3.0 * x$46$re), $MachinePrecision] * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x$46$im$95$m / x$46$re), $MachinePrecision] * x$46$im$95$m + N[(-3.0 * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$re), $MachinePrecision] * (-x$46$im$95$m)), $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)) < 1.9999999999999999e304

   1. Initial program 97.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 \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 97.7

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. difference-of-squares N/A

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

      8. lower-*.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower--.f64 97.7

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

   7. Applied rewrites 97.7%

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

   if 1.9999999999999999e304 < (+.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 86.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 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.4

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

   5. Applied rewrites 50.4%

      \[\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.4%

      \[\leadsto \left(3 \cdot x.re\right) \cdot \color{blue}{\left(x.im \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 \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right) + -1 \cdot {x.im}^{3}} \]

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. distribute-lft-in N/A

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

      7. unpow3 N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. distribute-lft-in N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

   5. Applied rewrites 73.3%

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

   6. Taylor expanded in x.re around inf

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in x.im around 0

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

   11. Applied rewrites 100.0%

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

4. Final simplification 90.2%

   \[\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 2 \cdot 10^{+304}:\\ \;\;\;\;\mathsf{fma}\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right), x.im, \left(2 \cdot \left(x.re \cdot x.re\right)\right) \cdot x.im\right)\\ \mathbf{elif}\;\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:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\frac{x.im}{x.re}, x.im, -3 \cdot x.re\right) \cdot x.re\right) \cdot \left(-x.im\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.9% 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 9.2 \cdot 10^{-101}:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im\_m \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 9.2e-101)
    (* (* 3.0 x.re) (* x.im_m 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 <= 9.2e-101) {
		tmp = (3.0 * x_46_re) * (x_46_im_m * 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 <= 9.2e-101)
		tmp = Float64(Float64(3.0 * x_46_re) * Float64(x_46_im_m * 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, 9.2e-101], N[(N[(3.0 * x$46$re), $MachinePrecision] * N[(x$46$im$95$m * 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 < 9.1999999999999998e-101

   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 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.1

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

   5. Applied rewrites 64.1%

      \[\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.1%

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

   if 9.1999999999999998e-101 < x.im

   1. Initial program 83.4%

      \[\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)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 98.8%

      \[\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: 95.9% 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 -1 \cdot 10^{-293} \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}:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im\_m \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 -1e-293) (not (<= t_0 INFINITY)))
      (* (* (- x.im_m) x.im_m) x.im_m)
      (* (* 3.0 x.re) (* x.im_m 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 <= -1e-293) || !(t_0 <= ((double) INFINITY))) {
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	} else {
		tmp = (3.0 * x_46_re) * (x_46_im_m * 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 <= -1e-293) || !(t_0 <= Double.POSITIVE_INFINITY)) {
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	} else {
		tmp = (3.0 * x_46_re) * (x_46_im_m * 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 <= -1e-293) 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_re) * (x_46_im_m * 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 <= -1e-293) || !(t_0 <= Inf))
		tmp = Float64(Float64(Float64(-x_46_im_m) * x_46_im_m) * x_46_im_m);
	else
		tmp = Float64(Float64(3.0 * x_46_re) * Float64(x_46_im_m * 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 <= -1e-293) || ~((t_0 <= Inf)))
		tmp = (-x_46_im_m * x_46_im_m) * x_46_im_m;
	else
		tmp = (3.0 * x_46_re) * (x_46_im_m * 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, -1e-293], 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[(N[(3.0 * x$46$re), $MachinePrecision] * N[(x$46$im$95$m * 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)) < -1.0000000000000001e-293 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 73.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 57.6

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

   5. Applied rewrites 57.6%

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

   7. Applied rewrites 57.5%

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

   if -1.0000000000000001e-293 < (+.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 95.4%

      \[\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 63.1

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

   5. Applied rewrites 63.1%

      \[\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 63.1%

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

4. Final simplification 60.3%

   \[\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 -1 \cdot 10^{-293} \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}:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im \cdot x.re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.8% accurate, 0.7× 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 9.2 \cdot 10^{-101}:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im\_m \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(3 \cdot \frac{x.re}{x.im\_m}, \frac{x.re}{x.im\_m}, -1\right) \cdot \left(x.im\_m \cdot x.im\_m\right)\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.im_m 9.2e-101)
    (* (* 3.0 x.re) (* x.im_m x.re))
    (*
     (* (fma (* 3.0 (/ x.re x.im_m)) (/ x.re x.im_m) -1.0) (* 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_im_m <= 9.2e-101) {
		tmp = (3.0 * x_46_re) * (x_46_im_m * x_46_re);
	} else {
		tmp = (fma((3.0 * (x_46_re / x_46_im_m)), (x_46_re / x_46_im_m), -1.0) * (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_im_m <= 9.2e-101)
		tmp = Float64(Float64(3.0 * x_46_re) * Float64(x_46_im_m * x_46_re));
	else
		tmp = Float64(Float64(fma(Float64(3.0 * Float64(x_46_re / x_46_im_m)), Float64(x_46_re / x_46_im_m), -1.0) * Float64(x_46_im_m * x_46_im_m)) * x_46_im_m);
	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, 9.2e-101], N[(N[(3.0 * x$46$re), $MachinePrecision] * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision], N[(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[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision] * x$46$im$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 9.1999999999999998e-101

   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 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.1

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

   5. Applied rewrites 64.1%

      \[\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.1%

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

   if 9.1999999999999998e-101 < x.im

   1. Initial program 83.4%

      \[\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 \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right) + -1 \cdot {x.im}^{3}} \]

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. distribute-lft-in N/A

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

      7. unpow3 N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. distribute-lft-in N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

   5. Applied rewrites 91.5%

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

   6. Taylor expanded in x.im around inf

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

   8. Applied rewrites 98.6%

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

Alternative 5: 95.7% 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.im\_m \leq 6.5 \cdot 10^{-101}:\\ \;\;\;\;\left(3 \cdot x.re\right) \cdot \left(x.im\_m \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-\mathsf{fma}\left(-3 \cdot x.re, x.re, x.im\_m \cdot x.im\_m\right)\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.im_m 6.5e-101)
    (* (* 3.0 x.re) (* x.im_m x.re))
    (* (- (fma (* -3.0 x.re) x.re (* 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_im_m <= 6.5e-101) {
		tmp = (3.0 * x_46_re) * (x_46_im_m * x_46_re);
	} else {
		tmp = -fma((-3.0 * x_46_re), x_46_re, (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_im_m <= 6.5e-101)
		tmp = Float64(Float64(3.0 * x_46_re) * Float64(x_46_im_m * x_46_re));
	else
		tmp = Float64(Float64(-fma(Float64(-3.0 * x_46_re), x_46_re, Float64(x_46_im_m * x_46_im_m))) * x_46_im_m);
	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, 6.5e-101], N[(N[(3.0 * x$46$re), $MachinePrecision] * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision], N[((-N[(N[(-3.0 * x$46$re), $MachinePrecision] * x$46$re + N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision]) * x$46$im$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 6.4999999999999996e-101

   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 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.1

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

   5. Applied rewrites 64.1%

      \[\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.1%

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

   if 6.4999999999999996e-101 < x.im

   1. Initial program 83.4%

      \[\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 \color{blue}{{x.re}^{2} \cdot \left(x.im + 2 \cdot x.im\right) + -1 \cdot {x.im}^{3}} \]

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. distribute-lft-in N/A

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

      7. unpow3 N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. distribute-lft-in N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

   5. Applied rewrites 91.5%

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

Alternative 6: 57.9% accurate, 3.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 \left(\left(\left(-x.im\_m\right) \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 =     private
x.im\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_46im_s, x_46re, x_46im_m)
use fmin_fmax_functions
    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(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.4%

   \[\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 58.8

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

5. Applied rewrites 58.8%

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

7. Applied rewrites 58.7%

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

8. Final simplification 58.7%

   \[\leadsto \left(\left(-x.im\right) \cdot x.im\right) \cdot x.im \]
9. Add Preprocessing

Developer Target 1: 91.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_46re, x_46im)
use fmin_fmax_functions
    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 2024357 
(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)))