math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 15.1s

Alternatives: 17

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 2: 98.4% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))) (t_1 (* (+ 1.0 re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) -0.5 1.0) (fma (fma 0.5 re 1.0) re 1.0))
     (if (<= t_0 -0.02)
       t_1
       (if (<= t_0 0.0) (exp re) (if (<= t_0 0.999999999) t_1 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * exp(re);
	double t_1 = (1.0 + re) * cos(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), -0.5, 1.0) * fma(fma(0.5, re, 1.0), re, 1.0);
	} else if (t_0 <= -0.02) {
		tmp = t_1;
	} else if (t_0 <= 0.0) {
		tmp = exp(re);
	} else if (t_0 <= 0.999999999) {
		tmp = t_1;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * exp(re))
	t_1 = Float64(Float64(1.0 + re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), -0.5, 1.0) * fma(fma(0.5, re, 1.0), re, 1.0));
	elseif (t_0 <= -0.02)
		tmp = t_1;
	elseif (t_0 <= 0.0)
		tmp = exp(re);
	elseif (t_0 <= 0.999999999)
		tmp = t_1;
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in re around 0

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

      1. distribute-lft-in N/A

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

      2. rgt-mult-inverse N/A

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

      3. associate-*l* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. metadata-eval N/A

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

      7. lft-mult-inverse N/A

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

      8. associate-*l* N/A

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

      9. associate-*r* N/A

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

      10. unpow2 N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

      13. unpow2 N/A

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

      14. cube-mult N/A

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

      15. distribute-lft-in N/A

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

      16. +-commutative N/A

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

      17. *-commutative N/A

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

   8. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999999999000000028

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 96.8

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

   5. Applied rewrites 96.8%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.999999999000000028 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 99.2%

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

Alternative 3: 98.0% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) -0.5 1.0) (fma (fma 0.5 re 1.0) re 1.0))
     (if (<= t_0 -0.02)
       (cos im)
       (if (<= t_0 0.0)
         (exp re)
         (if (<= t_0 0.999999999) (cos im) (exp re)))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), -0.5, 1.0) * fma(fma(0.5, re, 1.0), re, 1.0);
	} else if (t_0 <= -0.02) {
		tmp = cos(im);
	} else if (t_0 <= 0.0) {
		tmp = exp(re);
	} else if (t_0 <= 0.999999999) {
		tmp = cos(im);
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), -0.5, 1.0) * fma(fma(0.5, re, 1.0), re, 1.0));
	elseif (t_0 <= -0.02)
		tmp = cos(im);
	elseif (t_0 <= 0.0)
		tmp = exp(re);
	elseif (t_0 <= 0.999999999)
		tmp = cos(im);
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in re around 0

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

      1. distribute-lft-in N/A

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

      2. rgt-mult-inverse N/A

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

      3. associate-*l* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. metadata-eval N/A

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

      7. lft-mult-inverse N/A

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

      8. associate-*l* N/A

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

      9. associate-*r* N/A

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

      10. unpow2 N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

      13. unpow2 N/A

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

      14. cube-mult N/A

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

      15. distribute-lft-in N/A

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

      16. +-commutative N/A

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

      17. *-commutative N/A

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

   8. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999999999000000028

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.999999999000000028 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 99.1%

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

Alternative 4: 78.1% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))))
   (if (<= t_0 (- INFINITY))
     (* (fma (* im im) -0.5 1.0) (fma (fma 0.5 re 1.0) re 1.0))
     (if (<= t_0 -0.02)
       (cos im)
       (if (<= t_0 0.0)
         (* (* 0.041666666666666664 im) (* (* im im) im))
         (if (<= t_0 0.998)
           (cos im)
           (*
            (fma (fma 0.041666666666666664 (* im im) -0.5) (* im im) 1.0)
            (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0))))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * exp(re);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma((im * im), -0.5, 1.0) * fma(fma(0.5, re, 1.0), re, 1.0);
	} else if (t_0 <= -0.02) {
		tmp = cos(im);
	} else if (t_0 <= 0.0) {
		tmp = (0.041666666666666664 * im) * ((im * im) * im);
	} else if (t_0 <= 0.998) {
		tmp = cos(im);
	} else {
		tmp = fma(fma(0.041666666666666664, (im * im), -0.5), (im * im), 1.0) * fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * exp(re))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(Float64(im * im), -0.5, 1.0) * fma(fma(0.5, re, 1.0), re, 1.0));
	elseif (t_0 <= -0.02)
		tmp = cos(im);
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(0.041666666666666664 * im) * Float64(Float64(im * im) * im));
	elseif (t_0 <= 0.998)
		tmp = cos(im);
	else
		tmp = Float64(fma(fma(0.041666666666666664, Float64(im * im), -0.5), Float64(im * im), 1.0) * fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in re around 0

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

      1. distribute-lft-in N/A

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

      2. rgt-mult-inverse N/A

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

      3. associate-*l* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. metadata-eval N/A

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

      7. lft-mult-inverse N/A

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

      8. associate-*l* N/A

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

      9. associate-*r* N/A

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

      10. unpow2 N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

      13. unpow2 N/A

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

      14. cube-mult N/A

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

      15. distribute-lft-in N/A

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

      16. +-commutative N/A

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

      17. *-commutative N/A

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

   8. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.998

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 96.6

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

   5. Applied rewrites 96.6%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.5%

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

   9. Taylor expanded in im around inf

      \[\leadsto \frac{1}{24} \cdot {im}^{\color{blue}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 42.2%

       \[\leadsto \left(\left(im \cdot im\right) \cdot im\right) \cdot \left(0.041666666666666664 \cdot \color{blue}{im}\right) \]

   if 0.998 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

      8. lower-fma.f64 90.2

         \[\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 \cos im \]

   5. Applied rewrites 90.2%

      \[\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 \cos im \]

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 92.5

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

   8. Applied rewrites 92.5%

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

4. Final simplification 83.2%

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

Alternative 5: 55.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))))
   (if (<= t_0 -0.02)
     (* (fma (* im im) -0.5 1.0) (fma (fma 0.5 re 1.0) re 1.0))
     (if (<= t_0 0.0)
       (* (* 0.041666666666666664 im) (* (* im im) im))
       (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004

   1. Initial program 99.9%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 25.9

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

   5. Applied rewrites 25.9%

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

   6. Taylor expanded in re around 0

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

      1. distribute-lft-in N/A

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

      2. rgt-mult-inverse N/A

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

      3. associate-*l* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. metadata-eval N/A

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

      7. lft-mult-inverse N/A

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

      8. associate-*l* N/A

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

      9. associate-*r* N/A

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

      10. unpow2 N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

      13. unpow2 N/A

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

      14. cube-mult N/A

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

      15. distribute-lft-in N/A

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

      16. +-commutative N/A

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

      17. *-commutative N/A

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

   8. Applied rewrites 25.9%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.5%

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

   9. Taylor expanded in im around inf

      \[\leadsto \frac{1}{24} \cdot {im}^{\color{blue}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 42.2%

       \[\leadsto \left(\left(im \cdot im\right) \cdot im\right) \cdot \left(0.041666666666666664 \cdot \color{blue}{im}\right) \]

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 75.9%

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

4. Final simplification 60.2%

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

Alternative 6: 54.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))))
   (if (<= t_0 -0.02)
     (* (+ 1.0 re) (fma (* im im) -0.5 1.0))
     (if (<= t_0 0.0)
       (* (* 0.041666666666666664 im) (* (* im im) im))
       (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)))))

C

double code(double re, double im) {
	double t_0 = cos(im) * exp(re);
	double tmp;
	if (t_0 <= -0.02) {
		tmp = (1.0 + re) * fma((im * im), -0.5, 1.0);
	} else if (t_0 <= 0.0) {
		tmp = (0.041666666666666664 * im) * ((im * im) * im);
	} else {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * exp(re))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(Float64(1.0 + re) * fma(Float64(im * im), -0.5, 1.0));
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(0.041666666666666664 * im) * Float64(Float64(im * im) * im));
	else
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004

   1. Initial program 99.9%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 25.9

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

   5. Applied rewrites 25.9%

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

   6. Taylor expanded in re around 0

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

      1. lower-+.f64 21.6

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

   8. Applied rewrites 21.6%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.5%

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

   9. Taylor expanded in im around inf

      \[\leadsto \frac{1}{24} \cdot {im}^{\color{blue}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 42.2%

       \[\leadsto \left(\left(im \cdot im\right) \cdot im\right) \cdot \left(0.041666666666666664 \cdot \color{blue}{im}\right) \]

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 75.9%

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

4. Final simplification 59.5%

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

Alternative 7: 41.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))))
   (if (<= t_0 0.0)
     (fma (* im im) -0.5 1.0)
     (if (<= t_0 2.0) (+ 1.0 re) (* (fma 0.5 re 1.0) re)))))

C

double code(double re, double im) {
	double t_0 = cos(im) * exp(re);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = fma((im * im), -0.5, 1.0);
	} else if (t_0 <= 2.0) {
		tmp = 1.0 + re;
	} else {
		tmp = fma(0.5, re, 1.0) * re;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * exp(re))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = fma(Float64(im * im), -0.5, 1.0);
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 + re);
	else
		tmp = Float64(fma(0.5, re, 1.0) * re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 35.3

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

   5. Applied rewrites 35.3%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {im}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.2%

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

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 79.1

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

   5. Applied rewrites 79.1%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 78.3%

      \[\leadsto 1 + \color{blue}{re} \]

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 52.6%

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

4. Final simplification 47.3%

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

Alternative 8: 41.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (exp re))))
   (if (<= t_0 0.0)
     (fma (* im im) -0.5 1.0)
     (if (<= t_0 2.0) (+ 1.0 re) (* (* re re) 0.5)))))

C

double code(double re, double im) {
	double t_0 = cos(im) * exp(re);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = fma((im * im), -0.5, 1.0);
	} else if (t_0 <= 2.0) {
		tmp = 1.0 + re;
	} else {
		tmp = (re * re) * 0.5;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * exp(re))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = fma(Float64(im * im), -0.5, 1.0);
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 + re);
	else
		tmp = Float64(Float64(re * re) * 0.5);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 35.3

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

   5. Applied rewrites 35.3%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {im}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.2%

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

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 79.1

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

   5. Applied rewrites 79.1%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 78.3%

      \[\leadsto 1 + \color{blue}{re} \]

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in re around inf

      \[\leadsto \frac{1}{2} \cdot {re}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 52.6%

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

4. Final simplification 47.3%

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

Alternative 9: 45.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (cos im) (exp re)) -0.1)
   (* (+ 1.0 re) (fma (* im im) -0.5 1.0))
   (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.10000000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 26.9

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

   5. Applied rewrites 26.9%

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

   6. Taylor expanded in re around 0

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

      1. lower-+.f64 22.5

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

   8. Applied rewrites 22.5%

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

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 87.4

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

   5. Applied rewrites 87.4%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 56.6%

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

4. Final simplification 51.0%

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

Alternative 10: 44.0% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 35.3

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

   5. Applied rewrites 35.3%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {im}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 75.9%

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

4. Final simplification 49.6%

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

Alternative 11: 41.2% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 35.3

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

   5. Applied rewrites 35.3%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {im}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 72.3%

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

4. Final simplification 47.4%

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

Alternative 12: 37.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos im \cdot e^{re} \leq 2:\\ \;\;\;\;1 + re\\ \mathbf{else}:\\ \;\;\;\;\left(re \cdot re\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (cos im) (exp re)) 2.0) (+ 1.0 re) (* (* re re) 0.5)))

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((cos(im) * exp(re)) <= 2.0d0) then
        tmp = 1.0d0 + re
    else
        tmp = (re * re) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if ((Math.cos(im) * Math.exp(re)) <= 2.0) {
		tmp = 1.0 + re;
	} else {
		tmp = (re * re) * 0.5;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (math.cos(im) * math.exp(re)) <= 2.0:
		tmp = 1.0 + re
	else:
		tmp = (re * re) * 0.5
	return tmp

Julia

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

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((cos(im) * exp(re)) <= 2.0)
		tmp = 1.0 + re;
	else
		tmp = (re * re) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 68.6

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

   5. Applied rewrites 68.6%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 44.0%

      \[\leadsto 1 + \color{blue}{re} \]

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in re around inf

      \[\leadsto \frac{1}{2} \cdot {re}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 52.6%

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

4. Final simplification 45.3%

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

Alternative 13: 97.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -0.007:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.014:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \cos im\\ \mathbf{elif}\;re \leq 10^{+103}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot re\right) \cdot re\right) \cdot \cos im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -0.007)
   (exp re)
   (if (<= re 0.014)
     (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (cos im))
     (if (<= re 1e+103)
       (exp re)
       (* (* (* (fma 0.16666666666666666 re 0.5) re) re) (cos im))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -0.007) {
		tmp = exp(re);
	} else if (re <= 0.014) {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * cos(im);
	} else if (re <= 1e+103) {
		tmp = exp(re);
	} else {
		tmp = ((fma(0.16666666666666666, re, 0.5) * re) * re) * cos(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -0.007)
		tmp = exp(re);
	elseif (re <= 0.014)
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * cos(im));
	elseif (re <= 1e+103)
		tmp = exp(re);
	else
		tmp = Float64(Float64(Float64(fma(0.16666666666666666, re, 0.5) * re) * re) * cos(im));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -0.007], N[Exp[re], $MachinePrecision], If[LessEqual[re, 0.014], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1e+103], N[Exp[re], $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re), $MachinePrecision] * re), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if re < -0.00700000000000000015 or 0.0140000000000000003 < re < 1e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if -0.00700000000000000015 < re < 0.0140000000000000003

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

   if 1e103 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

   6. Taylor expanded in re around inf

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

   8. Applied rewrites 100.0%

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

Alternative 14: 97.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -0.0068:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.004:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \cos im\\ \mathbf{elif}\;re \leq 10^{+103}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right) \cdot re\right) \cdot re\right) \cdot \cos im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -0.0068)
   (exp re)
   (if (<= re 0.004)
     (* (fma (fma 0.5 re 1.0) re 1.0) (cos im))
     (if (<= re 1e+103)
       (exp re)
       (* (* (* (fma 0.16666666666666666 re 0.5) re) re) (cos im))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -0.0068) {
		tmp = exp(re);
	} else if (re <= 0.004) {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * cos(im);
	} else if (re <= 1e+103) {
		tmp = exp(re);
	} else {
		tmp = ((fma(0.16666666666666666, re, 0.5) * re) * re) * cos(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -0.0068)
		tmp = exp(re);
	elseif (re <= 0.004)
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * cos(im));
	elseif (re <= 1e+103)
		tmp = exp(re);
	else
		tmp = Float64(Float64(Float64(fma(0.16666666666666666, re, 0.5) * re) * re) * cos(im));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -0.0068], N[Exp[re], $MachinePrecision], If[LessEqual[re, 0.004], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1e+103], N[Exp[re], $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re), $MachinePrecision] * re), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if re < -0.00679999999999999962 or 0.0040000000000000001 < re < 1e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if -0.00679999999999999962 < re < 0.0040000000000000001

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.9

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

   5. Applied rewrites 99.9%

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

   if 1e103 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

   6. Taylor expanded in re around inf

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

   8. Applied rewrites 100.0%

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

Alternative 15: 96.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \cos im\\ \mathbf{if}\;re \leq -0.0068:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.004:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;re \leq 2 \cdot 10^{+153}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (fma (fma 0.5 re 1.0) re 1.0) (cos im))))
   (if (<= re -0.0068)
     (exp re)
     (if (<= re 0.004) t_0 (if (<= re 2e+153) (exp re) t_0)))))

C

double code(double re, double im) {
	double t_0 = fma(fma(0.5, re, 1.0), re, 1.0) * cos(im);
	double tmp;
	if (re <= -0.0068) {
		tmp = exp(re);
	} else if (re <= 0.004) {
		tmp = t_0;
	} else if (re <= 2e+153) {
		tmp = exp(re);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * cos(im))
	tmp = 0.0
	if (re <= -0.0068)
		tmp = exp(re);
	elseif (re <= 0.004)
		tmp = t_0;
	elseif (re <= 2e+153)
		tmp = exp(re);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -0.0068], N[Exp[re], $MachinePrecision], If[LessEqual[re, 0.004], t$95$0, If[LessEqual[re, 2e+153], N[Exp[re], $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if re < -0.00679999999999999962 or 0.0040000000000000001 < re < 2e153

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 96.1

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

   5. Applied rewrites 96.1%

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

   if -0.00679999999999999962 < re < 0.0040000000000000001 or 2e153 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.9

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

   5. Applied rewrites 99.9%

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

Alternative 16: 28.5% accurate, 51.5× speedup

Math

\[\begin{array}{l} \\ 1 + re \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (+ 1.0 re))

C

double code(double re, double im) {
	return 1.0 + re;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 1.0d0 + re
end function

Java

public static double code(double re, double im) {
	return 1.0 + re;
}

Python

def code(re, im):
	return 1.0 + re

Julia

function code(re, im)
	return Float64(1.0 + re)
end

MATLAB

function tmp = code(re, im)
	tmp = 1.0 + re;
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. lower-exp.f64 73.2

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

5. Applied rewrites 73.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 38.2%

   \[\leadsto 1 + \color{blue}{re} \]
9. Add Preprocessing

Alternative 17: 28.1% accurate, 206.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 1.0)

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 1.0d0
end function

Java

public static double code(double re, double im) {
	return 1.0;
}

Python

def code(re, im):
	return 1.0

Julia

function code(re, im)
	return 1.0
end

MATLAB

function tmp = code(re, im)
	tmp = 1.0;
end

Wolfram

code[re_, im_] := 1.0

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. lower-exp.f64 73.2

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

5. Applied rewrites 73.2%

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

6. Taylor expanded in re around 0

   \[\leadsto 1 \]
7. Step-by-step derivation

8. Applied rewrites 37.8%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024240 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))