math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 11.9s

Alternatives: 21

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

C

double code(double re, double im) {
	return exp(re) * sin(im);
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

Python

def code(re, im):
	return math.exp(re) * math.sin(im)

Julia

function code(re, im)
	return Float64(exp(re) * sin(im))
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

C

double code(double re, double im) {
	return exp(re) * sin(im);
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

Python

def code(re, im):
	return math.exp(re) * math.sin(im)

Julia

function code(re, im)
	return Float64(exp(re) * sin(im))
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sin im \cdot e^{re} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (sin im) (exp re)))

C

double code(double re, double im) {
	return sin(im) * exp(re);
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = sin(im) * exp(re)
end function

Java

public static double code(double re, double im) {
	return Math.sin(im) * Math.exp(re);
}

Python

def code(re, im):
	return math.sin(im) * math.exp(re)

Julia

function code(re, im)
	return Float64(sin(im) * exp(re))
end

MATLAB

function tmp = code(re, im)
	tmp = sin(im) * exp(re);
end

Wolfram

code[re_, im_] := N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \sin im \cdot e^{re} \]
4. Add Preprocessing

Alternative 2: 93.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := im \cdot e^{re}\\ t_1 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, 1\right) \cdot e^{re}\right) \cdot im\\ \mathbf{elif}\;t\_1 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* im (exp re))) (t_1 (* (sin im) (exp re))))
   (if (<= t_1 (- INFINITY))
     (*
      (*
       (fma
        (fma
         (fma -0.0001984126984126984 (* im im) 0.008333333333333333)
         (* im im)
         -0.16666666666666666)
        (* im im)
        1.0)
       (exp re))
      im)
     (if (<= t_1 -0.01)
       (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (sin im))
       (if (<= t_1 0.0)
         t_0
         (if (<= t_1 1.0) (* (fma (fma 0.5 re 1.0) re 1.0) (sin im)) t_0))))))

C

double code(double re, double im) {
	double t_0 = im * exp(re);
	double t_1 = sin(im) * exp(re);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (fma(fma(fma(-0.0001984126984126984, (im * im), 0.008333333333333333), (im * im), -0.16666666666666666), (im * im), 1.0) * exp(re)) * im;
	} else if (t_1 <= -0.01) {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im);
	} else if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1.0) {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * sin(im);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(im * exp(re))
	t_1 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(fma(fma(fma(-0.0001984126984126984, Float64(im * im), 0.008333333333333333), Float64(im * im), -0.16666666666666666), Float64(im * im), 1.0) * exp(re)) * im);
	elseif (t_1 <= -0.01)
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im));
	elseif (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1.0)
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * sin(im));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(im * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(N[(N[(-0.0001984126984126984 * N[(im * im), $MachinePrecision] + 0.008333333333333333), $MachinePrecision] * N[(im * im), $MachinePrecision] + -0.16666666666666666), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision] * im), $MachinePrecision], If[LessEqual[t$95$1, -0.01], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], t$95$0]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

      \[\leadsto \color{blue}{im \cdot \left(e^{re} + {im}^{2} \cdot \left(\frac{-1}{6} \cdot e^{re} + {im}^{2} \cdot \left(\frac{-1}{5040} \cdot \left({im}^{2} \cdot e^{re}\right) + \frac{1}{120} \cdot e^{re}\right)\right)\right)} \]

   5. Applied rewrites 69.4%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, 1\right) \cdot e^{re}\right) \cdot im} \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(re \cdot \left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) \cdot re} + 1\right) \cdot \sin im \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right), re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right) + 1}, re, 1\right) \cdot \sin im \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot re\right) \cdot re} + 1, re, 1\right) \cdot \sin im \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot re, re, 1\right)}, re, 1\right) \cdot \sin im \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot re + \frac{1}{2}}, re, 1\right), re, 1\right) \cdot \sin im \]

      8. lower-fma.f64 100.0

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, re, 0.5\right)}, re, 1\right), re, 1\right) \cdot \sin im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right)} \cdot \sin im \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 94.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 94.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 99.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]
3. Recombined 4 regimes into one program.

4. Final simplification 93.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, 1\right) \cdot e^{re}\right) \cdot im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;im \cdot e^{re}\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := im \cdot e^{re}\\ t_1 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im\right) \cdot \left(1 + re\right)\\ \mathbf{elif}\;t\_1 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* im (exp re))) (t_1 (* (sin im) (exp re))))
   (if (<= t_1 (- INFINITY))
     (*
      (fma
       (pow im 3.0)
       (fma
        (fma -0.0001984126984126984 (* im im) 0.008333333333333333)
        (* im im)
        -0.16666666666666666)
       im)
      (+ 1.0 re))
     (if (<= t_1 -0.01)
       (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (sin im))
       (if (<= t_1 0.0)
         t_0
         (if (<= t_1 1.0) (* (fma (fma 0.5 re 1.0) re 1.0) (sin im)) t_0))))))

C

double code(double re, double im) {
	double t_0 = im * exp(re);
	double t_1 = sin(im) * exp(re);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = fma(pow(im, 3.0), fma(fma(-0.0001984126984126984, (im * im), 0.008333333333333333), (im * im), -0.16666666666666666), im) * (1.0 + re);
	} else if (t_1 <= -0.01) {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im);
	} else if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1.0) {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * sin(im);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(im * exp(re))
	t_1 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(fma((im ^ 3.0), fma(fma(-0.0001984126984126984, Float64(im * im), 0.008333333333333333), Float64(im * im), -0.16666666666666666), im) * Float64(1.0 + re));
	elseif (t_1 <= -0.01)
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im));
	elseif (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1.0)
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * sin(im));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(im * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[Power[im, 3.0], $MachinePrecision] * N[(N[(-0.0001984126984126984 * N[(im * im), $MachinePrecision] + 0.008333333333333333), $MachinePrecision] * N[(im * im), $MachinePrecision] + -0.16666666666666666), $MachinePrecision] + im), $MachinePrecision] * N[(1.0 + re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.01], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], t$95$0]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 4.2

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

   5. Applied rewrites 4.2%

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

   6. Taylor expanded in im around 0

      \[\leadsto \left(1 + re\right) \cdot \color{blue}{\left(im \cdot \left(1 + {im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}\right)\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \left(1 + re\right) \cdot \left(im \cdot \color{blue}{\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}\right) + 1\right)}\right) \]

      2. distribute-lft-in N/A

         \[\leadsto \left(1 + re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}\right)\right) + im \cdot 1\right)} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 + re\right) \cdot \left(\color{blue}{\left(im \cdot {im}^{2}\right) \cdot \left({im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}\right)} + im \cdot 1\right) \]

      4. *-rgt-identity N/A

         \[\leadsto \left(1 + re\right) \cdot \left(\left(im \cdot {im}^{2}\right) \cdot \left({im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}\right) + \color{blue}{im}\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \left(1 + re\right) \cdot \color{blue}{\mathsf{fma}\left(im \cdot {im}^{2}, {im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}, im\right)} \]

      6. unpow2 N/A

         \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left(im \cdot \color{blue}{\left(im \cdot im\right)}, {im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}, im\right) \]

      7. cube-unmult N/A

         \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, {im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}, im\right) \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, {im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) - \frac{1}{6}, im\right) \]

      9. sub-neg N/A

         \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \color{blue}{{im}^{2} \cdot \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) + \left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}, im\right) \]

      10. *-commutative N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \color{blue}{\left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) \cdot {im}^{2}} + \left(\mathsf{neg}\left(\frac{1}{6}\right)\right), im\right) \]

      11. metadata-eval N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}\right) \cdot {im}^{2} + \color{blue}{\frac{-1}{6}}, im\right) \]

      12. lower-fma.f64 N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \color{blue}{\mathsf{fma}\left(\frac{1}{120} + \frac{-1}{5040} \cdot {im}^{2}, {im}^{2}, \frac{-1}{6}\right)}, im\right) \]

      13. +-commutative N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\color{blue}{\frac{-1}{5040} \cdot {im}^{2} + \frac{1}{120}}, {im}^{2}, \frac{-1}{6}\right), im\right) \]

      14. lower-fma.f64 N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{-1}{5040}, {im}^{2}, \frac{1}{120}\right)}, {im}^{2}, \frac{-1}{6}\right), im\right) \]

      15. unpow2 N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{5040}, \color{blue}{im \cdot im}, \frac{1}{120}\right), {im}^{2}, \frac{-1}{6}\right), im\right) \]

      16. lower-*.f64 N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{5040}, \color{blue}{im \cdot im}, \frac{1}{120}\right), {im}^{2}, \frac{-1}{6}\right), im\right) \]

      17. unpow2 N/A

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{5040}, im \cdot im, \frac{1}{120}\right), \color{blue}{im \cdot im}, \frac{-1}{6}\right), im\right) \]

      18. lower-*.f64 29.2

          \[\leadsto \left(1 + re\right) \cdot \mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), \color{blue}{im \cdot im}, -0.16666666666666666\right), im\right) \]

   8. Applied rewrites 29.2%

      \[\leadsto \left(1 + re\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im\right)} \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(re \cdot \left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) \cdot re} + 1\right) \cdot \sin im \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right), re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right) + 1}, re, 1\right) \cdot \sin im \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot re\right) \cdot re} + 1, re, 1\right) \cdot \sin im \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot re, re, 1\right)}, re, 1\right) \cdot \sin im \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot re + \frac{1}{2}}, re, 1\right), re, 1\right) \cdot \sin im \]

      8. lower-fma.f64 100.0

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, re, 0.5\right)}, re, 1\right), re, 1\right) \cdot \sin im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right)} \cdot \sin im \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 94.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 94.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 99.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]
3. Recombined 4 regimes into one program.

4. Final simplification 87.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left({im}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im\right) \cdot \left(1 + re\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;im \cdot e^{re}\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 89.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ t_1 := im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;t\_0 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))) (t_1 (* im (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) (* -0.16666666666666666 im) im) (* (* re re) 0.5))
     (if (<= t_0 -0.01)
       (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (sin im))
       (if (<= t_0 0.0)
         t_1
         (if (<= t_0 1.0) (* (fma (fma 0.5 re 1.0) re 1.0) (sin im)) t_1))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double t_1 = im * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * ((re * re) * 0.5);
	} else if (t_0 <= -0.01) {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im);
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 1.0) {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * sin(im);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	t_1 = Float64(im * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * Float64(Float64(re * re) * 0.5));
	elseif (t_0 <= -0.01)
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im));
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 1.0)
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * sin(im));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(im * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.01], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 57.7

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 57.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 53.6

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 53.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 53.6%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 53.6%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \color{blue}{0.5}\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(re \cdot \left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) \cdot re} + 1\right) \cdot \sin im \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right), re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right) + 1}, re, 1\right) \cdot \sin im \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot re\right) \cdot re} + 1, re, 1\right) \cdot \sin im \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot re, re, 1\right)}, re, 1\right) \cdot \sin im \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot re + \frac{1}{2}}, re, 1\right), re, 1\right) \cdot \sin im \]

      8. lower-fma.f64 100.0

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, re, 0.5\right)}, re, 1\right), re, 1\right) \cdot \sin im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right)} \cdot \sin im \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 94.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 94.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 99.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]
3. Recombined 4 regimes into one program.

4. Final simplification 91.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;im \cdot e^{re}\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 89.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ t_1 := \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ t_2 := im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;t\_0 \leq -0.01:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re)))
        (t_1 (* (fma (fma 0.5 re 1.0) re 1.0) (sin im)))
        (t_2 (* im (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) (* -0.16666666666666666 im) im) (* (* re re) 0.5))
     (if (<= t_0 -0.01) t_1 (if (<= t_0 0.0) t_2 (if (<= t_0 1.0) t_1 t_2))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double t_1 = fma(fma(0.5, re, 1.0), re, 1.0) * sin(im);
	double t_2 = im * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * ((re * re) * 0.5);
	} else if (t_0 <= -0.01) {
		tmp = t_1;
	} else if (t_0 <= 0.0) {
		tmp = t_2;
	} else if (t_0 <= 1.0) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	t_1 = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * sin(im))
	t_2 = Float64(im * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * Float64(Float64(re * re) * 0.5));
	elseif (t_0 <= -0.01)
		tmp = t_1;
	elseif (t_0 <= 0.0)
		tmp = t_2;
	elseif (t_0 <= 1.0)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(im * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.01], t$95$1, If[LessEqual[t$95$0, 0.0], t$95$2, If[LessEqual[t$95$0, 1.0], t$95$1, t$95$2]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 57.7

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 57.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 53.6

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 53.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 53.6%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 53.6%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \color{blue}{0.5}\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002 or 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 99.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 94.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 94.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]
3. Recombined 3 regimes into one program.

4. Final simplification 91.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;im \cdot e^{re}\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 89.5% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ t_1 := \left(1 + re\right) \cdot \sin im\\ t_2 := im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;t\_0 \leq -0.01:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 10^{-169}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re)))
        (t_1 (* (+ 1.0 re) (sin im)))
        (t_2 (* im (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) (* -0.16666666666666666 im) im) (* (* re re) 0.5))
     (if (<= t_0 -0.01)
       t_1
       (if (<= t_0 1e-169) t_2 (if (<= t_0 1.0) t_1 t_2))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double t_1 = (1.0 + re) * sin(im);
	double t_2 = im * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * ((re * re) * 0.5);
	} else if (t_0 <= -0.01) {
		tmp = t_1;
	} else if (t_0 <= 1e-169) {
		tmp = t_2;
	} else if (t_0 <= 1.0) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	t_1 = Float64(Float64(1.0 + re) * sin(im))
	t_2 = Float64(im * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * Float64(Float64(re * re) * 0.5));
	elseif (t_0 <= -0.01)
		tmp = t_1;
	elseif (t_0 <= 1e-169)
		tmp = t_2;
	elseif (t_0 <= 1.0)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + re), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(im * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.01], t$95$1, If[LessEqual[t$95$0, 1e-169], t$95$2, If[LessEqual[t$95$0, 1.0], t$95$1, t$95$2]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 57.7

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 57.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 53.6

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 53.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 53.6%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 53.6%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \color{blue}{0.5}\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002 or 1.00000000000000002e-169 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1.00000000000000002e-169 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 95.1

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 95.1%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\left(1 + re\right) \cdot \sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 10^{-169}:\\ \;\;\;\;im \cdot e^{re}\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\left(1 + re\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 89.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ t_1 := im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;t\_0 \leq -0.01:\\ \;\;\;\;\sin im\\ \mathbf{elif}\;t\_0 \leq 10^{-169}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))) (t_1 (* im (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) (* -0.16666666666666666 im) im) (* (* re re) 0.5))
     (if (<= t_0 -0.01)
       (sin im)
       (if (<= t_0 1e-169) t_1 (if (<= t_0 1.0) (sin im) t_1))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double t_1 = im * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * ((re * re) * 0.5);
	} else if (t_0 <= -0.01) {
		tmp = sin(im);
	} else if (t_0 <= 1e-169) {
		tmp = t_1;
	} else if (t_0 <= 1.0) {
		tmp = sin(im);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	t_1 = Float64(im * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * Float64(Float64(re * re) * 0.5));
	elseif (t_0 <= -0.01)
		tmp = sin(im);
	elseif (t_0 <= 1e-169)
		tmp = t_1;
	elseif (t_0 <= 1.0)
		tmp = sin(im);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(im * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.01], N[Sin[im], $MachinePrecision], If[LessEqual[t$95$0, 1e-169], t$95$1, If[LessEqual[t$95$0, 1.0], N[Sin[im], $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 57.7

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 57.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 53.6

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 53.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 53.6%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 53.6%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \color{blue}{0.5}\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002 or 1.00000000000000002e-169 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\sin im} \]
   4. Step-by-step derivation

      1. lower-sin.f64 97.9

         \[\leadsto \color{blue}{\sin im} \]

   5. Applied rewrites 97.9%

      \[\leadsto \color{blue}{\sin im} \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1.00000000000000002e-169 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 95.1

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 95.1%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 10^{-169}:\\ \;\;\;\;im \cdot e^{re}\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 58.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;t\_0 \leq -0.01:\\ \;\;\;\;\sin im\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) (* -0.16666666666666666 im) im) (* (* re re) 0.5))
     (if (<= t_0 -0.01)
       (sin im)
       (if (<= t_0 0.0)
         (* (/ im (* re re)) (* re re))
         (if (<= t_0 1.0)
           (sin im)
           (* (* (fma (fma 0.16666666666666666 re 0.5) re 1.0) re) im)))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * ((re * re) * 0.5);
	} else if (t_0 <= -0.01) {
		tmp = sin(im);
	} else if (t_0 <= 0.0) {
		tmp = (im / (re * re)) * (re * re);
	} else if (t_0 <= 1.0) {
		tmp = sin(im);
	} else {
		tmp = (fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * Float64(Float64(re * re) * 0.5));
	elseif (t_0 <= -0.01)
		tmp = sin(im);
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(im / Float64(re * re)) * Float64(re * re));
	elseif (t_0 <= 1.0)
		tmp = sin(im);
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.01], N[Sin[im], $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(im / N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[Sin[im], $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 57.7

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 57.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 53.6

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 53.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 53.6%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 53.6%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \color{blue}{0.5}\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002 or 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\sin im} \]
   4. Step-by-step derivation

      1. lower-sin.f64 97.8

         \[\leadsto \color{blue}{\sin im} \]

   5. Applied rewrites 97.8%

      \[\leadsto \color{blue}{\sin im} \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 100.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 30.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 15.5%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 29.3%

       \[\leadsto \frac{im}{re \cdot re} \cdot \left(re \cdot re\right) \]

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]
   12. Step-by-step derivation

   13. Applied rewrites 54.4%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im \]
3. Recombined 4 regimes into one program.

4. Final simplification 64.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\sin im\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 35.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))))
   (if (<= t_0 -0.01)
     (*
      (fma (* im im) (* -0.16666666666666666 im) im)
      (fma (fma 0.5 re 1.0) re 1.0))
     (if (<= t_0 0.0)
       (* (/ im (* re re)) (* re re))
       (if (<= t_0 1.0)
         (fma (* (fma 0.5 re 1.0) im) re im)
         (* (* (fma (fma 0.16666666666666666 re 0.5) re 1.0) re) im))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * fma(fma(0.5, re, 1.0), re, 1.0);
	} else if (t_0 <= 0.0) {
		tmp = (im / (re * re)) * (re * re);
	} else if (t_0 <= 1.0) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * fma(fma(0.5, re, 1.0), re, 1.0));
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(im / Float64(re * re)) * Float64(re * re));
	elseif (t_0 <= 1.0)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.01], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(im / N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 75.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 75.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 31.4

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 31.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 31.4%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 100.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 30.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 15.5%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 29.3%

       \[\leadsto \frac{im}{re \cdot re} \cdot \left(re \cdot re\right) \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 42.3

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 42.3%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]
   12. Step-by-step derivation

   13. Applied rewrites 54.4%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im \]
3. Recombined 4 regimes into one program.

4. Final simplification 36.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 35.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(0.5 \cdot re, re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))))
   (if (<= t_0 -0.01)
     (* (fma (* 0.5 re) re 1.0) (fma (* im im) (* -0.16666666666666666 im) im))
     (if (<= t_0 0.0)
       (* (/ im (* re re)) (* re re))
       (if (<= t_0 1.0)
         (fma (* (fma 0.5 re 1.0) im) re im)
         (* (* (fma (fma 0.16666666666666666 re 0.5) re 1.0) re) im))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = fma((0.5 * re), re, 1.0) * fma((im * im), (-0.16666666666666666 * im), im);
	} else if (t_0 <= 0.0) {
		tmp = (im / (re * re)) * (re * re);
	} else if (t_0 <= 1.0) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = Float64(fma(Float64(0.5 * re), re, 1.0) * fma(Float64(im * im), Float64(-0.16666666666666666 * im), im));
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(im / Float64(re * re)) * Float64(re * re));
	elseif (t_0 <= 1.0)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.01], N[(N[(N[(0.5 * re), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(im / N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 75.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 75.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 31.4

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 31.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 31.4%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

       \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot re, re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot \frac{-1}{6}, im\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 31.4%

       \[\leadsto \mathsf{fma}\left(0.5 \cdot re, re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 100.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 30.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 15.5%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 29.3%

       \[\leadsto \frac{im}{re \cdot re} \cdot \left(re \cdot re\right) \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 42.3

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 42.3%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]
   12. Step-by-step derivation

   13. Applied rewrites 54.4%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im \]
3. Recombined 4 regimes into one program.

4. Final simplification 36.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(0.5 \cdot re, re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 35.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))))
   (if (<= t_0 -0.01)
     (* (fma (* im im) (* -0.16666666666666666 im) im) (* (* re re) 0.5))
     (if (<= t_0 0.0)
       (* (/ im (* re re)) (* re re))
       (if (<= t_0 1.0)
         (fma (* (fma 0.5 re 1.0) im) re im)
         (* (* (fma (fma 0.16666666666666666 re 0.5) re 1.0) re) im))))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * ((re * re) * 0.5);
	} else if (t_0 <= 0.0) {
		tmp = (im / (re * re)) * (re * re);
	} else if (t_0 <= 1.0) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * Float64(Float64(re * re) * 0.5));
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(im / Float64(re * re)) * Float64(re * re));
	elseif (t_0 <= 1.0)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.01], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(im / N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 75.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 75.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 31.4

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 31.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 31.4%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 31.3%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \color{blue}{0.5}\right) \cdot \mathsf{fma}\left(im \cdot im, im \cdot -0.16666666666666666, im\right) \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 100.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 30.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 15.5%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 29.3%

       \[\leadsto \frac{im}{re \cdot re} \cdot \left(re \cdot re\right) \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 42.3

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 42.3%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]
   12. Step-by-step derivation

   13. Applied rewrites 54.4%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im \]
3. Recombined 4 regimes into one program.

4. Final simplification 36.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 34.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin im \cdot e^{re}\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\frac{\mathsf{fma}\left(0.027777777777777776, re \cdot re, -0.25\right)}{\mathsf{fma}\left(0.16666666666666666, re, -0.5\right)} \cdot im, re, im\right), re, im\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (sin im) (exp re))))
   (if (<= t_0 -0.01)
     (*
      (fma (* im im) (* -0.16666666666666666 im) im)
      (fma (fma 0.5 re 1.0) re 1.0))
     (if (<= t_0 0.0)
       (* (/ im (* re re)) (* re re))
       (fma
        (fma
         (*
          (/
           (fma 0.027777777777777776 (* re re) -0.25)
           (fma 0.16666666666666666 re -0.5))
          im)
         re
         im)
        re
        im)))))

C

double code(double re, double im) {
	double t_0 = sin(im) * exp(re);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = fma((im * im), (-0.16666666666666666 * im), im) * fma(fma(0.5, re, 1.0), re, 1.0);
	} else if (t_0 <= 0.0) {
		tmp = (im / (re * re)) * (re * re);
	} else {
		tmp = fma(fma(((fma(0.027777777777777776, (re * re), -0.25) / fma(0.16666666666666666, re, -0.5)) * im), re, im), re, im);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(sin(im) * exp(re))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = Float64(fma(Float64(im * im), Float64(-0.16666666666666666 * im), im) * fma(fma(0.5, re, 1.0), re, 1.0));
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(im / Float64(re * re)) * Float64(re * re));
	else
		tmp = fma(fma(Float64(Float64(fma(0.027777777777777776, Float64(re * re), -0.25) / fma(0.16666666666666666, re, -0.5)) * im), re, im), re, im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.01], N[(N[(N[(im * im), $MachinePrecision] * N[(-0.16666666666666666 * im), $MachinePrecision] + im), $MachinePrecision] * N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(im / N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(0.027777777777777776 * N[(re * re), $MachinePrecision] + -0.25), $MachinePrecision] / N[(0.16666666666666666 * re + -0.5), $MachinePrecision]), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision] * re + im), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(1 + \frac{1}{2} \cdot re, re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot re + 1}, re, 1\right) \cdot \sin im \]

      5. lower-fma.f64 75.8

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, re, 1\right)}, re, 1\right) \cdot \sin im \]

   5. Applied rewrites 75.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \sin im \]

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, re, 1\right), re, 1\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 31.4

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(\color{blue}{{im}^{3}}, -0.16666666666666666, im\right) \]

   8. Applied rewrites 31.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \color{blue}{\mathsf{fma}\left({im}^{3}, -0.16666666666666666, im\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 31.4%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{im \cdot -0.16666666666666666}, im\right) \]

   if -0.0100000000000000002 < (*.f64 (exp.f64 re) (sin.f64 im)) < 0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 100.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 30.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 15.5%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 29.3%

       \[\leadsto \frac{im}{re \cdot re} \cdot \left(re \cdot re\right) \]

   if 0.0 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 51.5

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 51.5%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.8%

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

   10. Applied rewrites 43.7%

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

4. Final simplification 36.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, -0.16666666666666666 \cdot im, im\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)\\ \mathbf{elif}\;\sin im \cdot e^{re} \leq 0:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\frac{\mathsf{fma}\left(0.027777777777777776, re \cdot re, -0.25\right)}{\mathsf{fma}\left(0.16666666666666666, re, -0.5\right)} \cdot im, re, im\right), re, im\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 36.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (sin im) (exp re)) 1.0)
   (fma (* (fma 0.5 re 1.0) im) re im)
   (* (* (fma (fma 0.16666666666666666 re 0.5) re 1.0) re) im)))

C

double code(double re, double im) {
	double tmp;
	if ((sin(im) * exp(re)) <= 1.0) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(sin(im) * exp(re)) <= 1.0)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision], 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 63.5

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 63.5%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 32.8%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]
   12. Step-by-step derivation

   13. Applied rewrites 54.4%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im \]
3. Recombined 2 regimes into one program.

4. Final simplification 35.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 36.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 0.92:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot re\right) \cdot im\right) \cdot re\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (sin im) (exp re)) 0.92)
   (fma (* (fma 0.5 re 1.0) im) re im)
   (* (* (* (fma 0.16666666666666666 re 0.5) re) im) re)))

C

double code(double re, double im) {
	double tmp;
	if ((sin(im) * exp(re)) <= 0.92) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = ((fma(0.16666666666666666, re, 0.5) * re) * im) * re;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(sin(im) * exp(re)) <= 0.92)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(Float64(fma(0.16666666666666666, re, 0.5) * re) * im) * re);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision], 0.92], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision] * re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < 0.92000000000000004

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 67.1

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 67.1%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 34.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 0.92000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 54.5

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 54.5%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 31.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 34.1%

       \[\leadsto \left(\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot re\right) \cdot im\right) \cdot re \]
3. Recombined 2 regimes into one program.

4. Final simplification 34.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 0.92:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot re\right) \cdot im\right) \cdot re\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 36.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 0.92:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot im\right) \cdot \left(re \cdot re\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (sin im) (exp re)) 0.92)
   (fma (* (fma 0.5 re 1.0) im) re im)
   (* (* (fma 0.16666666666666666 re 0.5) im) (* re re))))

C

double code(double re, double im) {
	double tmp;
	if ((sin(im) * exp(re)) <= 0.92) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (fma(0.16666666666666666, re, 0.5) * im) * (re * re);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(sin(im) * exp(re)) <= 0.92)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(fma(0.16666666666666666, re, 0.5) * im) * Float64(re * re));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision], 0.92], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * im), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < 0.92000000000000004

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 67.1

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 67.1%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 34.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 0.92000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 54.5

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 54.5%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 31.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 33.2%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around inf

       \[\leadsto \left(re \cdot \left(\frac{1}{6} \cdot im + \frac{1}{2} \cdot \frac{im}{re}\right)\right) \cdot \left(re \cdot re\right) \]
   13. Step-by-step derivation

   14. Applied rewrites 34.0%

       \[\leadsto \left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right)\right) \cdot \left(re \cdot re\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 34.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 0.92:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot im\right) \cdot \left(re \cdot re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 36.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(re \cdot re\right) \cdot im\right) \cdot 0.16666666666666666\right) \cdot re\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (sin im) (exp re)) 1.0)
   (fma (* (fma 0.5 re 1.0) im) re im)
   (* (* (* (* re re) im) 0.16666666666666666) re)))

C

double code(double re, double im) {
	double tmp;
	if ((sin(im) * exp(re)) <= 1.0) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (((re * re) * im) * 0.16666666666666666) * re;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(sin(im) * exp(re)) <= 1.0)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(Float64(Float64(re * re) * im) * 0.16666666666666666) * re);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision], 1.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(re * re), $MachinePrecision] * im), $MachinePrecision] * 0.16666666666666666), $MachinePrecision] * re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 63.5

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 63.5%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 32.8%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]

   12. Taylor expanded in re around inf

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

   14. Applied rewrites 47.7%

       \[\leadsto \left(\left(\left(re \cdot re\right) \cdot im\right) \cdot 0.16666666666666666\right) \cdot re \]
3. Recombined 2 regimes into one program.

4. Final simplification 34.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(re \cdot re\right) \cdot im\right) \cdot 0.16666666666666666\right) \cdot re\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 32.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im\right) \cdot re\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (sin im) (exp re)) 1.0)
   (fma im re im)
   (* (* (fma 0.5 re 1.0) im) re)))

C

double code(double re, double im) {
	double tmp;
	if ((sin(im) * exp(re)) <= 1.0) {
		tmp = fma(im, re, im);
	} else {
		tmp = (fma(0.5, re, 1.0) * im) * re;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(sin(im) * exp(re)) <= 1.0)
		tmp = fma(im, re, im);
	else
		tmp = Float64(Float64(fma(0.5, re, 1.0) * im) * re);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Sin[im], $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision], 1.0], N[(im * re + im), $MachinePrecision], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 63.5

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 63.5%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

      \[\leadsto im + \color{blue}{im \cdot re} \]
   7. Step-by-step derivation

   8. Applied rewrites 30.2%

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

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 78.6

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 47.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]

   12. Taylor expanded in re around 0

       \[\leadsto \left(im + \frac{1}{2} \cdot \left(im \cdot re\right)\right) \cdot re \]
   13. Step-by-step derivation

   14. Applied rewrites 27.8%

       \[\leadsto \left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im\right) \cdot re \]
3. Recombined 2 regimes into one program.

4. Final simplification 29.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sin im \cdot e^{re} \leq 1:\\ \;\;\;\;\mathsf{fma}\left(im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im\right) \cdot re\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 42.6% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2:\\ \;\;\;\;\frac{im}{re \cdot re} \cdot \left(re \cdot re\right)\\ \mathbf{elif}\;re \leq 6 \cdot 10^{+18}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot re\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.0)
   (* (/ im (* re re)) (* re re))
   (if (<= re 6e+18)
     (fma (* (fma 0.5 re 1.0) im) re im)
     (* (* (fma (fma 0.16666666666666666 re 0.5) re 1.0) re) im))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.0) {
		tmp = (im / (re * re)) * (re * re);
	} else if (re <= 6e+18) {
		tmp = fma((fma(0.5, re, 1.0) * im), re, im);
	} else {
		tmp = (fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.0)
		tmp = Float64(Float64(im / Float64(re * re)) * Float64(re * re));
	elseif (re <= 6e+18)
		tmp = fma(Float64(fma(0.5, re, 1.0) * im), re, im);
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, re, 0.5), re, 1.0) * re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.0], N[(N[(im / N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 6e+18], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * im), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -2

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 100.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 2.0%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around -inf

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

   11. Applied rewrites 2.0%

       \[\leadsto \mathsf{fma}\left(0.16666666666666666 \cdot im, re, \mathsf{fma}\left(0.5, im, \frac{\frac{im}{re} + im}{re}\right)\right) \cdot \left(re \cdot \color{blue}{re}\right) \]

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 21.0%

       \[\leadsto \frac{im}{re \cdot re} \cdot \left(re \cdot re\right) \]

   if -2 < re < 6e18

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 44.7

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 44.7%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.0%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]

   if 6e18 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{re} \cdot im} \]

      3. lower-exp.f64 77.0

         \[\leadsto \color{blue}{e^{re}} \cdot im \]

   5. Applied rewrites 77.0%

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 50.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot \mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, im\right), \color{blue}{re}, im\right) \]

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 56.7%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right) \cdot im\right) \cdot re \]
   12. Step-by-step derivation

   13. Applied rewrites 62.8%

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

Alternative 19: 34.3% accurate, 11.4× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, re, im\right) \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (fma (* (fma 0.5 re 1.0) im) re im))

C

double code(double re, double im) {
	return fma((fma(0.5, re, 1.0) * im), re, im);
}

Julia

function code(re, im)
	return fma(Float64(fma(0.5, re, 1.0) * im), re, im)
end

Wolfram

code[re_, im_] := N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * im), $MachinePrecision] * re + im), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   3. lower-exp.f64 65.1

      \[\leadsto \color{blue}{e^{re}} \cdot im \]

5. Applied rewrites 65.1%

   \[\leadsto \color{blue}{e^{re} \cdot im} \]

6. Taylor expanded in re around 0

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

8. Applied rewrites 32.2%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot im, \color{blue}{re}, im\right) \]
9. Add Preprocessing

Alternative 20: 29.9% accurate, 29.4× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (fma im re im))

C

double code(double re, double im) {
	return fma(im, re, im);
}

Julia

function code(re, im)
	return fma(im, re, im)
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   3. lower-exp.f64 65.1

      \[\leadsto \color{blue}{e^{re}} \cdot im \]

5. Applied rewrites 65.1%

   \[\leadsto \color{blue}{e^{re} \cdot im} \]

6. Taylor expanded in re around 0

   \[\leadsto im + \color{blue}{im \cdot re} \]
7. Step-by-step derivation

8. Applied rewrites 28.0%

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

Alternative 21: 7.1% accurate, 34.3× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (* im re))

C

double code(double re, double im) {
	return im * re;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = im * re
end function

Java

public static double code(double re, double im) {
	return im * re;
}

Python

def code(re, im):
	return im * re

Julia

function code(re, im)
	return Float64(im * re)
end

MATLAB

function tmp = code(re, im)
	tmp = im * re;
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{e^{re} \cdot im} \]

   3. lower-exp.f64 65.1

      \[\leadsto \color{blue}{e^{re}} \cdot im \]

5. Applied rewrites 65.1%

   \[\leadsto \color{blue}{e^{re} \cdot im} \]

6. Taylor expanded in re around 0

   \[\leadsto im + \color{blue}{im \cdot re} \]
7. Step-by-step derivation

8. Applied rewrites 28.0%

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

9. Taylor expanded in re around inf

   \[\leadsto im \cdot re \]
10. Step-by-step derivation

11. Applied rewrites 7.2%

    \[\leadsto im \cdot re \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2024296 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))